The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Kinodynamic motion planning
Open accessAbstract
Kinodynamicplanmng attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints.In the general problem, ggven a robot system, we must find a minimal-time trajectory that goes from a start position and veloclty to a goal position and velocity while avoiding obstacles by a safety margur and respecting constraints cm velocity and acceleration.We consider the simplified case of a point mass under Newtoman mechanics.together with velocity and acceleration bounds.The point must be flown from a start to a goal, amidst polyhedral obstacles in 2D or 3D.Although exact sohztions to this problem are not known, we provide the first provably good approximation algorlthm, and show that it runs 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
Cites
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Time-Optimal Control of Robotic Manipulators Along Specified Paths
Bobrow, J. E., Dubowsky, S., & Gibson, J. S. (1985) · The International Journal of Robotics Research · doi:10.1177/027836498500400301 · Cited by 1,315
Robot Motion: Planning and Control
Brady, M., Hollerbach, J. M., Johnson, T., Mason, M. T., & Lozano‐Pérez, T. (1983) · Medical Entomology and Zoology · Cited by 615
New lower bound techniques for robot motion planning problems
Canny, J., & Reif, J. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.42 · Cited by 538
Self-citationCollision Detection for Moving Polyhedra
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767773 · Cited by 334
Self-citationAn algorithm for shortest-path motion in three dimensions
Papadimitriou, C. H. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90029-8 · Cited by 192
Planning of Minimum- Time Trajectories for Robot Arms
Sahar, G., & Hollerbach, J. M. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500305 · Cited by 192
On the complexity of kinodynamic planning
Canny, J., Donald, B., Reif, J., & Xavier, P. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21947 · Cited by 184
Self-citationMotion planning with inertial constraints
Ó'Dúnlaing, C. (1987) · Algorithmica · doi:10.1007/bf01840370 · Cited by 95
Fortune, S., & Wilfong, G. (1988) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/62212.62256 · Cited by 94
Cited by
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Optimal trajectory generation for dynamic street scenarios in a Frenét Frame
Werling, M., Ziegler, J., Kammel, S., & Thrun, S. (2010) · 2010 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2010.5509799 · Cited by 801
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Goerzen, C., Kong, Z., & Mettler, B. (2010) · Journal of Intelligent and Robotic Systems · doi:10.1007/s10846-009-9383-1 · Cited by 779
Randomized Kinodynamic Motion Planning with Moving Obstacles
Hsu, D., Kindel, R., Latombe, J.-C., & Rock, S. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556421 · Cited by 771
Randomized kinodynamic planning
LaValle, S. M., & Kuffner, J. J. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.770022 · Cited by 673
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., Branicky, M. S., & Lindemann, S. R. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045481 · Cited by 436
Geometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139620 · Cited by 416
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
Webb, D. J., & van den Berg, J. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631299 · Cited by 409
Footstep Planning for the Honda ASIMO Humanoid
Chestnutt, J., Lau, M., Cheung, G., Kuffner, J., Hodgins, J., & Kanade, T. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570188 · Cited by 389
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., & Branicky, M. S. (2004) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-45058-0_5 · Cited by 338
Guidelines in nonholonomic motion planning for mobile robots
Laumond, J. P., Sekhavat, S., & Lamiraux, F. (2006) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0036070 · Cited by 330
The role of roles: Physical cooperation between humans and robots
Mörtl, A., Lawitzky, M., Kucukyilmaz, A., Sezgin, M., Basdogan, C., & Hirche, S. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912455366 · Cited by 284
Asymptotically optimal sampling-based kinodynamic planning
Li, Y., Littlefield, Z., & Bekris, K. E. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915614386 · Cited by 262
Metadata
- Authors
- Donald, B., Xavier, P., Canny, J., & Reif, J.
- Venue
- Journal of the ACM
- Published
- 1993-11
- Volume
- 40
- Issue
- 5
- Pages
- 1048-1066
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2048820947
- Cited by
- 458
- References
- 14
- FWCI
- 2.98
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.