The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
Open accessAbstract
In this paper, we present an algorithm for generating complex dynamically feasible maneuvers for autonomous vehicles traveling at high speeds over large distances. Our approach is based on performing anytime incremental search on a multi-resolution, dynamically feasible lattice state space. The resulting planner provides real-time performance and guarantees on and control of the suboptimality of its solution. We provide theoretical properties and experimental results from an implementation on an autonomous passenger vehicle that competed in, and won, the Urban Challenge competition.
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894 · cited 1×
“These include potential field-based techniques, where obstacles exert repulsive forces on the vehicle while the goal exerts an attractive force [1], and the curvature velocity [2] and dynamic window [3] approaches, where planning is performed in control space to generate dynamically-feasible actions.”
BackgroundThe dynamic window approach to collision avoidance
Fox, D., Burgard, W., & Thrun, S. (1997) · IEEE Robotics & Automation Magazine · doi:10.1109/100.580977 · Cited by 3,771
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“A* search is perhaps one of the most popular methods for doing this ( Nilsson 1980 ).”
MethodMultiple Sequence Alignment Using ClustalW and ClustalX
Thompson, J. D., Gibson, T. J., & Higgins, D. G. (2003) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi0203s00 · Cited by 2,971
Stanley: The robot that won the DARPA Grand Challenge
Thrun, S., Montemerlo, M., Dahlkamp, H., Stavens, D., Aron, A., Diebel, J., Fong, P., Gale, J., Halpenny, M., Hoffmann, G., et al. (2006) · Journal of Field Robotics · doi:10.1002/rob.20147 · Cited by 2,237 · cited 1×
“Subsequent approaches have focused on improving this local planning by using more sophisticated local action sets that better follow the global value function [8, 9], and by generating sequences of actions to perform more complex local maneuvers [10, 11, 12].”
BackgroundAutonomous driving in urban environments: Boss and the Urban Challenge
Urmson, C., Anhalt, J., Bagnell, D., Baker, C., Bittner, R., Clark, M. N., Dolan, J., Duggins, D., Galatali, T., Geyer, C., et al. (2008) · Journal of Field Robotics · doi:10.1002/rob.20255 · Cited by 1,555
Self-citationHeuristics: Intelligent search strategies for computer problem solving.
(1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90100-1 · Cited by 1,430
Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2017)
Amendola, G., Ricca, F., & Truszczyński, M. (2017) · International Joint Conference on Artificial Intelligence · Cited by 1,179
Rapidly-Exploring Random Trees: Progress and Prospects
(2001) · Algorithmic and Computational Robotics · doi:10.1201/9781439864135-43 · Cited by 1,146
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
A Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Katrakazas, C., Quddus, M., Chen, W.-H., & Deka, L. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.09.011 · Cited by 800
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
Opportunities and challenges with autonomous micro aerial vehicles
Kumar, V., & Michael, N. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912455954 · Cited by 472
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
Optimization-Based Collision Avoidance
Zhang, X., Liniger, A., & Borrelli, F. (2021) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2949540 · Cited by 444
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
Huang, Y., Ding, H., Zhang, Y., Wang, H., Cao, D., Xu, N., & Hu, C. (2020) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2019.2898599 · Cited by 409
Motion planning for autonomous driving with a conformal spatiotemporal lattice
McNaughton, M., Urmson, C., Dolan, J. M., & Lee, J.-W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980223 · Cited by 363
Safe driving envelopes for path tracking in autonomous vehicles
Brown, M., Funke, J., Erlien, S., & Gerdes, J. C. (2017) · Control Engineering Practice · doi:10.1016/j.conengprac.2016.04.013 · Cited by 353
SIPP: Safe interval path planning for dynamic environments
Phillips, M., & Likhachev, M. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980306 · Cited by 350
Self-citationSurvey of Robot 3D Path Planning Algorithms
Yang, L., Qi, J., Song, D., Xiao, J., Han, J., & Xia, Y. (2016) · Journal of Control Science and Engineering · doi:10.1155/2016/7426913 · Cited by 328
In the Passenger Seat: Investigating Ride Comfort Measures in Autonomous Cars
Elbanhawi, M., Simic, M., & Jazar, R. (2015) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2015.2405571 · Cited by 326
Real-Time Trajectory Planning for Autonomous Urban Driving: Framework, Algorithms, and Verifications
Li, X., Sun, Z., Cao, D., He, Z., & Zhu, Q. (2016) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2015.2493980 · Cited by 325
Optimal trajectories for time-critical street scenarios using discretized terminal manifolds
Werling, M., Kammel, S., Ziegler, J., & Gröll, L. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911423042 · Cited by 268
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
Mapping Two Decades of Autonomous Vehicle Research: A Systematic Scientometric Analysis
Faisal, A., Yigitcanlar, T., Kamruzzaman, M., & Paz, A. (2021) · Journal of Urban Technology · doi:10.1080/10630732.2020.1780868 · Cited by 85
Owczarzak, Ł., & Żak, J. (2015) · Transportation Research Procedia · doi:10.1016/j.trpro.2015.09.001 · Cited by 45
Metadata
- Authors
- Likhachev, M., & Ferguson, D.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2009-06-26
- Volume
- 28
- Issue
- 8
- Pages
- 933-945
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2113029345
- Cited by
- 512
- References
- 33
- FWCI
- 25.65
- 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.