We present a novel analysis of AO-RRT: a tree-based planner for motion planning with kinodynamic constraints, originally described by Hauser and Zhou (AO-X, 2016). AO-RRT explores the state-cost space and has been shown to efficiently obtain high-quality solutions in practice without relying on the availability of a computationally-intensive two-point boundary-value solver. Our main contribution is an optimality proof for the single-tree version of the algorithm---a variant that was not analyzed before. Our proof only requires a mild and easily-verifiable set of assumptions on the problem and system: Lipschitz-continuity of the cost function and the dynamics. In particular, we prove that for any system satisfying these assumptions, any trajectory having a piecewise-constant control function and positive clearance from the obstacles can be approximated arbitrarily well by a trajectory found by AO-RRT. We also discuss practical aspects of AO-RRT and present experimental comparisons of variants of the algorithm.
Multi-layer Motion Planning with Kinodynamic and Spatio-Temporal Constraints
The Thørväld Group(索尔瓦尔德集团);Inria Paris-Rocquencourt(巴黎-罗quent court 国家科学研究中心);Rajiv Gandhi University Doimukh(拉贾·甘地大学多伊穆克);Tsinghua University(清华大学);Palmer Research Laboratories(帕勒姆研究实验室);The Kumquat Consortium(昆克特联盟)
Generalizing Informed Sampling for Asymptotically Optimal Sampling-based Kinodynamic Planning via Markov Chain Monte Carlo
Robotics Institute, Carnegie Mellon University(卡内基梅隆大学机器人研究所);Paul G. Allen School of Computer Science & Engineering, University of Washington(华盛顿大学保罗·G·艾伦计算机科学与工程学院)
Relevant Region Sampling Strategy with Adaptive Heuristic for Asymptotically Optimal Path Planning
The Chinese University of Hong Kong(香港中文大学);Southern University of Science and Technology(南方科技大学);Shenzhen Research Institute of the Chinese University of Hong Kong(香港中文大学深圳研究院)