The DOI matches its Crossref record.
On the complexity of kinodynamic planning
Abstract
The following problem, is considered: given a robot system find a minimal-time trajectory from a start position and velocity to a goal position and velocity, while avoiding obstacles and respecting dynamic constraints on velocity and acceleration. The simplified case of a point mass under Newtonian mechanics together with velocity and acceleration bounds is considered. The point must be flown from a start to a goal, amid 2-D or 3-D polyhedral obstacles. While exact solutions to this problem are not known, the first provably good approximation algorithm is given and shown to run in polynomial time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Motion Planning in Dynamic Environments Using Velocity Obstacles
Fiorini, P., & Shiller, Z. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700706 · Cited by 2,008
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Donald, B., Xavier, P., Canny, J., & Reif, J. (1993) · Journal of the ACM · doi:10.1145/174147.174150 · Cited by 458
Self-citationOptimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
Howard, T. M., & Kelly, A. (2007) · The International Journal of Robotics Research · doi:10.1177/0278364906075328 · Cited by 370
Metadata
- Authors
- Canny, J., Donald, B., Reif, J., & Xavier, P.
- Venue
- [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 1988
- Pages
- 306-316
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2111734814
- Cited by
- 184
- References
- 0
- FWCI
- 19.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the complexity of kinodynamic planning. https://app.cochat.ai/papers/10.1109/sfcs.1988.21947
- The paper
- Canny, J., Donald, B., Reif, J., & Xavier, P. (1988). On the complexity of kinodynamic planning. [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21947
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.