Collision avoidance for persistent monitoring in multi-robot systems with intersecting trajectories
Author(s)
Soltero, Daniel Eduardo; Smith, Stephen L.; Rus, Daniela L.
DownloadRus_Collision Avoidance.pdf (1.071Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Persistent robot tasks such as monitoring and cleaning are concerned with controlling mobile robots to act in a changing environment in a way that guarantees that the uncertainty in the system (due to change and to the actions of the robot) remains bounded for all time. Prior work in persistent robot tasks considered only robot systems with collision-free paths that move following speed controllers. In this paper we describe a solution to multi-robot persistent monitoring, where robots have intersecting trajectories. We develop collision and deadlock avoidance algorithms that are based on stopping policies, and quantify the impact of the stopping times on the overall stability of the speed controllers.
Date issued
2011-12Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. School of EngineeringJournal
IEEE/RSJ International Conference on Intelligent Robots and Systems 2011 (IROS)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Soltero, Daniel E., Stephen L. Smith, and Daniela Rus. “Collision Avoidance for Persistent Monitoring in Multi-robot Systems with Intersecting Trajectories.” IEEE/RSJ International Conference on Intelligent Robots and Systems 2011 (IROS). 3645–3652.
Version: Author's final manuscript
ISBN
978-1-61284-454-1
ISSN
2153-0858