Filling arbitrary connected areas by silent robots with minimum visibility range

DOI10.1007/978-3-030-14094-6_13MaRDI QIDQ6074986zbMATH OpenFDO

Authors Attila Hideg, Tamás Lukovszki, Bertalan Forstner

Publication date 20 October 2023

Published in Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-14094-6_13

zbMATH Keywords

autonomous robotsdispersionfilling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

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

Cited in

(7)

• Uniform dispersal of asynchronous finite-state mobile robots in presence of holes
• Asynchronous filling by myopic luminous robots
• Uniform Dispersal of Robots with Minimum Visibility Range
• Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
• Collaborative dispersion by silent robots
• Static and expanding grid coverage with ant robots: complexity results
• Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments

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)