Maximum entropy searching

Maximum entropy searching

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 fr...

Full description

Bibliographic Details
Main Authors: Rui Jiang, Hui Zhou, Han Wang, Shuzhi Sam Ge
Format: Article
Language:English
Published: Wiley 2018-12-01
Series:CAAI Transactions on Intelligence Technology
Subjects:
mobile robots
path planning
search problems
sampling methods
iterative methods
entropy
trees (mathematics)
ME-RRT
2D/3D scenarios
rapidly-exploring random tree planner
time complexity
trees
goal-biased approach
path integral approximation
random path sampling
searching direction
random tree generation
causal entropy maximisation
biasing direction
autonomous mobile robots path
Online Access:https://digital-library.theiet.org/content/journals/10.1049/trit.2018.1058

Internet

https://digital-library.theiet.org/content/journals/10.1049/trit.2018.1058

Similar Items