arrow
返回

Sampling-based optimal kinodynamic planning with motion primitives

delete2019-01-14
delete44
delete
OA
AI
B
Başak Sakçak *
L
Luca Bascetta
G
Gianni Ferretti
M
Maria Prandini
DOI:10.1007/s10514-019-09830-xdelete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper proposes a novel sampling-based motion planner, which integrates in Rapidly exploring Random Tree star (RRT*) a database of pre-computed motion primitives to alleviate its computational load and allow for motion planning in a dynamic or partially known environment. The database is built by considering a set of initial and final state pairs in some grid space, and determining for each pair an optimal trajectory that is compatible with the system dynamics and constraints, while minimizing a cost. Nodes are progressively added to the tree of feasible trajectories in the RRT* algorithm by extracting at random a sample in the gridded state space and selecting the best obstacle-freemotion primitive in the database that joins it to an existing node. The tree is rewired if some nodes can be reached from the new sampled state through an obstacle-free motion primitive with lower cost. The computationally more intensive part of motion planning is thus moved to the preliminary offline phase of the database construction at the price of some performance degradation due to gridding. Grid resolution can be tuned so as to compromise between (sub)optimality and size of the database. The planner is shown to be asymptotically optimal as the grid resolution goes to zero and the number of sampled states grows to infinity.
Keyword:
Optimal sampling-based planning
Kinodynamic planning
Motion primitives
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Autonomous Robots 封面图
Autonomous Robots
IF:
4.3
论文数:
1.7K
被引数:
5.0K

机构

P
Polytechnic University of Milan
学者数:
2.0W
论文数: 1.8W
被引数: 24
引用论文

引用论文

Anytime search in dynamic graphs动态图中的随时搜索
err2008-09-01
err187
errOAAI
errLikhachev, Maxim; Ferguson, Dave; Gordon, Geoff; Stentz, Anthony; Thrun, Sebastian
err分享
err收藏
学者 查看更多内容