.png){kind=icon}
返回
Sampling-Based Path Planning on Configuration-Space Costmaps
.png){kind=icon}
OA
AI
DOI：10.1109/TRO.2010.2049527.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Costmap planning
path quality
sampling-based
motion planning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
3.3K
被引数:
2.8W
机构
引用论文
.png){kind=icon}
Fuzzy-controlled Localized Route-repair (FLRR) for On-demand Routing Protocols in Mobile Ad hoc Networks移动自组织网络中按需路由协议的模糊控制本地化路由修复 (FLRR)
OAAI
OAAI分享收藏
查看更多内容