A Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds
Lists
Only you see this
Abstract
Field D* algorithm is widely used in mobile robot navigation since it can plan and replan any-angle paths through non-uniform cost grids. However, it still suffers from inefficiency and sub-optimality. In this article, a new linear interpolation-based planning and replanning algorithm, Update-Reducing Field D*, is proposed. It employs different approaches during initial planning and replanning respectively in order to reduce the number of updates of the rhs-values of vertices. Experiments have shown that Update-Reducing Field D* runs faster than Field D* and returns smoother and lower-cost paths.
BibTeX
@inproceedings{zheng2012linear,
author = {Changwen Zheng and Jiawei Cai and Huafei Yin},
title = {{A Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds}},
booktitle = {Advances},
year = {2012},
doi = {10.4236/alamt.2012.22003},
}Loading related content...