Sparse Methods for Efficient Asymptotically Optimal Kinodynamic Planning

Yanbo Li; Zakary Littlefield; Kostas E. Bekris

doi:10.1007/978-3-319-16595-0_16

ScienceGate Book Chapters

BOOK-CHAPTER

Sparse Methods for Efficient Asymptotically Optimal Kinodynamic Planning

Yanbo Li Zakary Littlefield Kostas E. Bekris

Year: 2015 Springer tracts in advanced robotics Pages: 263-282 Publisher: Springer Nature

DOI: 10.1007/978-3-319-16595-0_16

Get Full-Text PDF Get Analytical Report

Keywords:

Probabilistic logic Completeness (order theory) Asymptotically optimal algorithm Set (abstract data type) Mathematical optimization Variety (cybernetics) Limiting Computer science Function (biology) Mathematics Algorithm Artificial intelligence Engineering

Metrics

Cited By

9.02

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Robotic Path Planning Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Machine Learning and Algorithms

Physical Sciences → Computer Science → Artificial Intelligence

Robotics and Sensor-Based Localization

Physical Sciences → Engineering → Aerospace Engineering

Sparse Methods for Efficient Asymptotically Optimal Kinodynamic Planning

Metrics

Citation History

Topics

Related Documents

Efficient and asymptotically optimal kinodynamic motion planning

Asymptotically Optimal A* for Kinodynamic Planning

Asymptotically optimal sampling-based kinodynamic planning

Efficient and Asymptotically Optimal Kinodynamic Motion Planning via Dominance-Informed Regions

Asymptotically Near-Optimal Methods for Kinodynamic Planning With Initial State Uncertainty