The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Dynamically-Stable Motion Planning for Humanoid Robots
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
The coordination of arm movements: an experimentally confirmed mathematical model
Flash, T., & Hogan, N. (1985) · The Journal of Neuroscience · doi:10.1523/jneurosci.05-07-01688.1985 · Cited by 4,395 · cited 1×
“The resulting smoothed path is transformed into an input trajectory using a minimum-jerk model (Flash and Hogan, 1985).”
MethodApproximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Self-citationRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Self-citationRaibert, M. H., & Tello, E. R. (1986) · IEEE Expert · doi:10.1109/mex.1986.4307016 · Cited by 2,725
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Rapidly-Exploring Random Trees: Progress and Prospects
(2001) · Algorithmic and Computational Robotics · doi:10.1201/9781439864135-43 · Cited by 1,146
Robot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
Bohlin, R., & Kavraki, L. E. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844107 · Cited by 856
Efficient Dynamic Computer Simulation of Robotic Mechanisms
Walker, M. W., & Orin, D. E. (1982) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3139699 · Cited by 822
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
Complexity of the mover's problem and generalizations
Reif, J. H. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.10 · Cited by 765
An optimal algorithm for approximate nearest neighbor searching
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1994) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5555/314464.314652 · Cited by 594
Path planning in expansive configuration spaces
Hsu, D., Latombe, J.-C., & Motwani, R. (2002) · Proceedings of International Conference on Robotics and Automation · doi:10.1109/robot.1997.619371 · Cited by 552
The Gaussian sampling strategy for probabilistic roadmap planners
Boor, V., Overmars, M. H., & van der Stappen, A. F. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.772447 · Cited by 541
Randomized preprocessing of configuration for fast path planning
Kavraki, L., & Latombe, J.-C. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.350966 · Cited by 412
V-Clip: fast and robust polyhedral collision detection
Mirtich, B. (1998) · ACM Transactions on Graphics · doi:10.1145/285857.285860 · Cited by 403
Biped Locomotion: Dynamics, Stability, Control and Application
VUKOBRATOVIC, M. K. (1990) · Cited by 398
A randomized roadmap method for path and manipulation planning
Amato, N. M., & Wu, Y. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.503582 · Cited by 369
Robust hybrid control for autonomous vehicle motion planning
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187) · doi:10.1109/cdc.2000.912871 · Cited by 297
Dynamic motion planning of autonomous vehicles
Shiller, Z., & Gwo, Y.-R. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.75906 · Cited by 286
A Random Sampling Scheme for Path Planning
Barraquand, J., Kavraki, L., Latombe, J.-C., Motwani, R., Li, T.-Y., & Raghavan, P. (1997) · The International Journal of Robotics Research · doi:10.1177/027836499701600604 · Cited by 277
Dynamics filter-concept and implementation of online motion generator for human figures
Yamane, K., & Nakamura, Y. (2003) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2003.810579 · Cited by 273
Planning motions with intentions
Koga, Y., Kondo, K., Kuffner, J., & Latombe, J.-C. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192266 · Cited by 269
Self-citationOn computing the global time-optimal motions of robotic manipulators in the presence of obstacles
Shiller, Z., & Dubowsky, S. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.105387 · Cited by 216
A probabilistic roadmap approach for systems with closed kinematic chains
LaValle, S. M., Yakey, J. H., & Kavraki, L. E. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1999.770349 · Cited by 151
Kinodynamic motion planning amidst moving obstacles
Kindel, R., Hsu, D., Latombe, J.-C., & Rock, S. M. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2000.844109 · Cited by 128
Mazer, E., Ahuactzin, J.-M., & Bessìère, P. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.468 · Cited by 127
Raibert, M. H. (2000) · Cited by 126
A random approach to motion planning
Overmars, M. H. (1992) · Cited by 94
Autonomous agents for real-time animation
Latombe, J., & Kuffner, J. (1999) · Cited by 70
Self-citationMotion planning with many degrees of freedom-random reflections at C-space obstacles
Horsch, T., Schwarz, F., & Tolle, H. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351060 · Cited by 66
Parallel robot motion planning
Lozano‐Pérez, T., & O'Donnell, P. A. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131722 · Cited by 64
H-Walk: hierarchical distance computation for moving convex bodies
Guibas, L. J., Hsu, D., & Zhang, L. (1999) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/304893.304979 · Cited by 57
Graphical simulation and high-level control of humanoid robots
Kuffner, J., Kagami, S., Inaba, M., & Inoue, H. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2000.895255 · Cited by 17
Self-citation
Cited by
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Optimal kinodynamic motion planning using incremental sampling-based methods
Karaman, S., & Frazzoli, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717430 · Cited by 416
Metadata
- Authors
- Kuffner, J. J., Kagami, S., Nishiwaki, K., Inaba, M., & Inoue, H.
- Venue
- Autonomous Robots
- Published
- 2002-01
- Volume
- 12
- Issue
- 1
- Pages
- 105-118
- ISSN
- 0929-5593 (ISSN-L)
- 1573-7527
- OpenAlex
- W2114171536
- Cited by
- 265
- References
- 39
- FWCI
- 11.98
- Type
- journal article
- 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
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.