Distributed coverage of nonconvex environments

DOI10.1007/978-0-387-68845-9_12MaRDI QIDQ3004412zbMATH OpenOpenAlexFDO

Authors Anurag Ganguli, J. Cortés, Francesco Bullo

Publication date 1 June 2011

Published in Networked Sensing Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-68845-9_12

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed systems (68M14)

Recommendations

• Multi-agent deployment for visibility coverage in polygonal environments with holes
• Approximation algorithms for distributed multi-robot coverage in non-convex environments
• Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints
• A framework for multi-robot node coverage in sensor networks
• Complete distributed coverage of rectilinear environments

Cited in

(9)

• A geometric assignment problem for robotic networks
• Computing Convex Coverage Sets for Faster Multi-objective Coordination
• Complete distributed coverage of rectilinear environments
• Multi-agent deployment for visibility coverage in polygonal environments with holes
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
• A framework for multi-robot node coverage in sensor networks
• Approximation algorithms for distributed multi-robot coverage in non-convex environments
• Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints

This page was built for publication: Distributed coverage of nonconvex environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004412)