DocumentCode
2310954
Title
HOPA: A Near Optimization Algorithm for Pathfinding
Author
Wang Jingcun ; Wang Qin ; Chen Bin ; Chen Heping
Author_Institution
Inf. Eng. Sch., Beijing Univ. of Sci. & Technol.
fYear
2006
fDate
22-24 Sept. 2006
Firstpage
1
Lastpage
4
Abstract
Based on the classic Dijkstra algorithm, this paper introduces the decision mechanism of AI into pathfinding, proposes a heuristic optimistic pathfinding algorithm, HOPA, puts forward the conditions of getting the optimum solution from this algorithm and further gives the proof. These two algorithms are tested contrastively, and the results show that the algorithm proposed in this paper may have a good prospect in some fields
Keywords
artificial intelligence; computational complexity; graph theory; heuristic programming; AI decision mechanism; HOPA; heuristic optimistic pathfinding algorithm; Application software; Artificial intelligence; Computer networks; Databases; Geography; Heuristic algorithms; Information systems; Navigation; Testing; Virtual reality;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on
Conference_Location
Wuhan
Print_ISBN
1-4244-0517-3
Type
conf
DOI
10.1109/WiCOM.2006.392
Filename
4149569
Link To Document