Distributed algorithms for barrier coverage using relocatable sensors

DOI10.1007/s00446-016-0267-xzbMath1405.68434OpenAlexW2325827507MaRDI QIDQ518925

Jaroslav Opatrny, Evangelos Kranakis, Mohsen Eftekhari, Lata Narayanan, Danny Krizanc, Oscar Morales-Ponce, Sunil M. Shende

Publication date: 4 April 2017

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-016-0267-x

zbMATH Keywords

distributed algorithmsautonomous mobile robotsoptimal algorithmsbarrier coveragewireless relocatable sensors

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (4)

On synchronization and orientation in distributed barrier coverage with relocatable sensors ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Temporal vertex cover with a sliding time window ⋮ Weak coverage of a rectangular barrier

Cites Work

• Unnamed Item
• Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
• Gathering few fat mobile robots in the plane
• Optimal movement of mobile sensors for barrier coverage of a planar region
• Distributed Computing by Mobile Robots: Gathering
• Local Algorithms for Autonomous Robot Systems
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

This page was built for publication: Distributed algorithms for barrier coverage using relocatable sensors