Filling arbitrary connected areas by silent robots with minimum visibility range
From MaRDI portal
Publication:6074986
DOI10.1007/978-3-030-14094-6_13zbMATH Open1522.68602MaRDI QIDQ6074986FDOQ6074986
Authors: Attila Hideg, Tamás Lukovszki, Bertalan Forstner 
Publication date: 20 October 2023
Published in: Algorithms for Sensor Systems (Search for Journal in Brave)
Recommendations
- Uniform Dispersal of Robots with Minimum Visibility Range
- Asynchronous filling by myopic luminous robots
- Uniform dispersal of asynchronous finite-state mobile robots in presence of holes
- Collaborative dispersion by silent robots
- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Cited In (7)
- Collaborative dispersion by silent robots
- Static and expanding grid coverage with ant robots: complexity results
- Asynchronous filling by myopic luminous robots
- Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
- Uniform dispersal of asynchronous finite-state mobile robots in presence of holes
- Uniform Dispersal of Robots with Minimum Visibility Range
This page was built for publication: Filling arbitrary connected areas by silent robots with minimum visibility range
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074986)
