IEEE Transactions on Robotics · 2012 · 141 citations · 14 references
EngineeringAutonomous SystemsComputer ScienceDistributed SystemsMulti-robot SystemsRoboticsCommunication TopologiesCoverage ControlDistributed CoordinationMulti-robot CoordinationSearch RoboticsSwarm CoordinationConnectivity MaintenanceDistributed Robotic SwarmsInapproximabilityMulti-robot SearchTopology Control
We examine the scenario in which a mobile network of robots must search, survey, or cover an environment and communication is restricted by relative location. While many algorithms choose to maintain a connected network at all times while performing such tasks, we relax this requirement and examine the use of periodic connectivity, where the network must regain connectivity at a fixed interval. We propose an online algorithm that scales linearly in the number of robots and allows for arbitrary periodic connectivity constraints. To complement the proposed algorithm, we provide theoretical inapproximability results for connectivity-constrained planning. Finally, we validate our approach in the coordinated search domain in simulation and in real-world experiments.
14
Decentralized estimation and control of graph connectivity for mobile sensor networks
Panpan Yang, Randy A. Freeman, Geoff J. Gordon et al. · Automatica · 2009 · 422 citations · Full text
Near-optimal sensor placements
Andreas Krause, Carlos Guestrin, Anupam Gupta et al. · 2006 · 406 citations