Study on Algorithm A* Based on Dynamic Representation of Binary Tree for Environment and Robotic Path Planning

Tang Ping,Yang Yimin

Strategic Study of CAE ›› 2002, Vol. 4 ›› Issue (9) : 50 -53.

PDF (2477KB)
Strategic Study of CAE ›› 2002, Vol. 4 ›› Issue (9) : 50 -53.
Academic Papers

Study on Algorithm A* Based on Dynamic Representation of Binary Tree for Environment and Robotic Path Planning

Author information +
History +
PDF (2477KB)

Abstract

This paper deals with a way of representing dynamic environment based on binary-tree. A new algorithm A* , which plans the path of soccer robots in complicated environments is presented. With the soccer game's environments represented by dynamic binary-tree, optimal results were obtained in a simulation of the soccer game.

Keywords

dynamic binary-tree / algorithm A* / path planning

Cite this article

Download citation ▾
Tang Ping,Yang Yimin. Study on Algorithm A* Based on Dynamic Representation of Binary Tree for Environment and Robotic Path Planning. Strategic Study of CAE, 2002, 4(9): 50-53 DOI:

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (2477KB)

257

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/