On the completeness of ensembles of motion planners for decentralized planning
Name
Rus_On the completeness.pdf
Size
647.86 KB
Format
Adobe PDF
Checksum (MD5)
dd69d88e467fb6a90a21503b43af76b7
Author(s)
Knepper, Ross A.
Rus, Daniela L.
Date Issued
May 2013
Journal
Proceedings of the 2013 IEEE International Conference on Robotics and Automation
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Knepper, Ross A., and Daniela Rus. “On the Completeness of Ensembles of Motion Planners for Decentralized Planning.” 2013 IEEE International Conference on Robotics and Automation (May 2013).
Version
Author's final manuscript
Abstract
We provide a set of sufficient conditions to establish the completeness of an ensemble of motion planners-that is, a set of loosely-coupled motion planners that produce a unified result. The planners are assumed to divide the total planning problem across some parameter space(s), such as task space, state space, action space, or time. Robotic applications have employed ensembles of planners for decades, although the concept has not been formally unified or analyzed until now. We focus on applications in multi-robot navigation and collision avoidance. We show that individual resolutionor probabilistically-complete planners that meet certain communication criteria constitute a (respectively, resolution- or probabilistically-) complete ensemble of planners. This ensemble of planners, in turn, guarantees that the robots are free of deadlock, livelock, and starvation.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. School of Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ICRA.2013.6631157
