.png){kind=icon}
返回
Maximum entropy searching
.png){kind=icon}
OA
AI
DOI：10.1049/trit.2018.1058.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study presents a new perspective for autonomous mobile robots path searching by proposing a biasing direction towards causal entropy maximisation during random tree generation. Maximum entropy-biased rapidly-exploring random tree (ME-RRT) is proposed where the searching direction is computed from random path sampling and path integral approximation, and the direction is incorporated into the existing rapidly-exploring random tree (RRT) planner. Properties of ME-RRT including degenerating conditions and additional time complexity are also discussed. The performance of the proposed approach is studied, and the results are compared with conventional RRT/RRT* and goal-biased approach in 2D/3D scenarios. Simulations show that trees are generated efficiently with fewer iteration numbers, and the success rate within limited iterations has been greatly improved in complex environments.
Keyword:
PATH
RRT
PLANNER
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
663
被引数:
2.4K
机构
引用论文
.png){kind=icon}
The relative importance of Colletotrichum musae as a crown‐rot pathogen on Windward Island bananas
PREAI
分享收藏
Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms使用基于采样的算法在复杂成本空间中进行最佳路径规划OAAI
OAAI分享收藏
查看更多内容