On the completeness of ensembles of motion planners for decentralized planning
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,...
Main Authors: | Knepper, Ross A., Rus, Daniela L. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90613 https://orcid.org/0000-0001-5473-3566 |
Similar Items
-
A certified-complete bimanual manipulation planner
by: Lertkultanon, Puttichai, et al.
Published: (2019) -
Task and Motion Planning Is PSPACE-Complete
by: Vega-Brown, William R, et al.
Published: (2021) -
Completeness of randomized kinodynamic planners with state-based steering
by: Caron, Stephane, et al.
Published: (2017) -
Exploring constraint removal motion planners
by: Venkatraman, Amruth
Published: (2017) -
Decentralized path planning for coverage tasks using gradient descent adaptive control
by: Soltero, Daniel Eduardo, et al.
Published: (2022)