The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Sampling-Based Path Planning on Configuration-Space Costmaps
Open accessAbstract
This paper addresses path planning to consider a cost function defined over the configuration space. The proposed planner computes low-cost paths that follow valleys and saddle points of the configuration-space costmap. It combines the exploratory strength of the Rapidly exploring Random Tree (RRT) algorithm with transition tests used in stochastic optimization methods to accept or to reject new potential states. The planner is analyzed and shown to compute low-cost solutions with respect to a path-quality criterion based on the notion of mechanical work. A large set of experimental results is provided to demonstrate the effectiveness of the method. Current limitations and possible extensions are also discussed.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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 · cited 2×
“Note also that the probabilistic conformational roadmap [18] developed to explore molecularenergy landscapes in computational biology applications integrates a similar transition test in the Probabilistic RoadMap (PRM) framework [19].”
BackgroundMethodLaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
LaValle, S. M. (2006) · Cited by 4,177
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
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
Parallel tempering: Theory, applications, and new perspectives
Earl, D. J., & Deem, M. W. (2005) · Physical Chemistry Chemical Physics · doi:10.1039/b509983h · Cited by 1,313
Optimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
Parallel Tempering: Theory, Applications, and New PerspectivesPreprint
Earl, D. J., & Deem, M. W. (2008) · Cited by 1,037
Optimal and efficient path planning for partially-known environments
Stentz, A. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351061 · Cited by 929
Approaches for heuristically biasing RRT growth
Urmson, C., & Simmons, R. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1248805 · Cited by 334
Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain
Yershova, A., Jaillet, L., Simeon, T., & LaValle, S. M. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570709 · Cited by 258
Self-citationA Monte-Carlo algorithm for path planning with many degrees of freedom
Barraquand, J., & Latombe, J.-C. (2002) · Proceedings., IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1990.126256 · Cited by 247
Ferguson, D., & Stentz, A. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282100 · Cited by 234
Creating High-quality Paths for Motion Planning
Geraerts, R., & Overmars, M. H. (2007) · The International Journal of Robotics Research · doi:10.1177/0278364907079280 · Cited by 220
Task constrained motion planning in robot joint space
Stilman, M. (2007) · 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2007.4399305 · Cited by 181
Transition-based RRT for path planning in continuous cost spaces
Jaillet, L., Cortés, J., & Siméon, T. (2008) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2008.4650993 · Cited by 148
Self-citationMultilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems
Sekhavat, S., Svestka, P., Laumond, J., & Overmars, M. H. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700803 · Cited by 141
Adaptive tuning of the sampling domain for dynamic-domain RRTs
Jaillet, L., Yershova, A., LaValle, S. M., & Siméon, T. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2005.1545607 · Cited by 121
Self-citationMove3D: A generic platform for path planning
Siméon, T., Laumond, J., & Lamiraux, F. (2002) · IEEE International Symposium on Assembly and Task Planning (ISATP) · doi:10.1109/isatp.2001.928961 · Cited by 97
Self-citationRandomized statistical path planning
Diankov, R., & Kuffner, J. (2007) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2007.4399557 · Cited by 68
Scaling behavior of stochastic minimization algorithms in a perfect funnel landscape
Hamacher, K., & Wenzel, W. (1999) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.59.938 · Cited by 42
Randomised Rough-Terrain Robot Motion Planning
Ettlin, A., & Bleuler, H. (2006) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2006.282390 · Cited by 36
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
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Path planning and obstacle avoidance for AUV: A review
Cheng, C., Sha, Q., He, B., & Li, G. (2021) · Ocean Engineering · doi:10.1016/j.oceaneng.2021.109355 · Cited by 378
Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions
Noreen, I., Khan, A., & Habib, Z. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071114 · Cited by 326
Terrain traversability analysis methods for unmanned ground vehicles: A survey
Papadakis, P. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.01.006 · Cited by 298
Metadata
- Authors
- Jaillet, L., Cortés, J., & Siméon, T.
- Venue
- IEEE Transactions on Robotics
- Published
- 2010-08
- Volume
- 26
- Issue
- 4
- Pages
- 635-646
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2034801091
- Cited by
- 367
- References
- 26
- FWCI
- 22.85
- Type
- journal article
- Language
- en
- Open access
- green
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.