Collision avoidance for persistent monitoring in multi-robot systems with intersecting trajectories
Name
Rus_Collision Avoidance.pdf
Size
1.07 MB
Format
Adobe PDF
Checksum (MD5)
03ab7139c3126fd7ccc287a72ba777bb
Author(s) • •
Soltero, Daniel Eduardo
Smith, Stephen L.
Rus, Daniela L.
Date Issued
December 2011
Journal
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
Abstract
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.
MIT Department
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 Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/IROS.2011.6048842