On the completeness of ensembles of motion planners for decentralized planning
Author(s)
Knepper, Ross A.; Rus, Daniela L.
DownloadRus_On the completeness.pdf (647.8Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2013-05Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. School of EngineeringJournal
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
ISBN
978-1-4673-5643-5
978-1-4673-5641-1
ISSN
1050-4729