Motion Planning Completeness is a theoretical property of motion planning algorithms that belongs to the class of algorithmic completeness criteria, specifically defined by the guarantee that a solution will be found if one exists, or that non-existence will be conclusively determined, within a finite or well-characterized computational effort.
27
Publications
1.1K
Citations
61
Authors
28
Institutions
Publications per year
2017–2026
9
Parents
Publications
27
John Canny, Bruce R. Donald · 1987 · 76 citations · Full text
Automatic planning of fine motions: Correctness and completeness
Matthew T. Mason · 2005 · 72 citations
1–5 of 27
Authors
61
- HG
3
h-index
- MM
2
h-index
- JC
2
h-index
- BR
2
h-index
- LE
2
h-index
1–5 of 61
Institutions
28
Institució Catalana de Recerca i Estudis Avançats
Barcelona, Spain
2 h-index
2 publications
40 citations
Universitat Pompeu Fabra
Barcelona, Spain
2 h-index
5 publications
106 citations
Rice University
Houston, United States
2 h-index
5 publications
585 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
270 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
84 citations
Urbana University
Urbana, United States
1 h-index
2 publications
34 citations
Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)
Cologne, Germany
1 h-index
2 publications
58 citations
Loughborough University
Loughborough, United Kingdom
1 h-index
1 publications
29 citations
1–8 of 28
Venues
- The International Journal of Robotics Research
IJRR · 2 publications · 135 citations
2
h-index
- arXiv (Cornell University)
Repository · 2 publications · 31 citations
2
h-index
- Proceedings of the International Conference on Automated Planning and Scheduling
2 publications · 40 citations
2
h-index
- Artificial Intelligence
1 publications · 207 citations
1
h-index
- Autonomous Robots
1 publications · 39 citations
1
h-index
1–5