By Topic

Pathfinding of 2D & 3D game real-time strategy with depth direction A∗ algorithm for multi-layer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Khantanapoka, K. ; Dept. of Comput. Sci., Burapha Univ., Chonburi, Thailand ; Chinnasarn, K.

The pathfinding analysis has importance for various working such as logistics, transportation, operation management, system analysis and design, project management, network and production line. Especially, game programming technology has effect to economic and dominates culture, increasingly. The shortest path analysis is artificial intelligent which developed capability about think cause and effect, learning and thinking like human. Heuristic technique is method for solving a problem which gets result or not. It may return unexpected value which depends on each problem. 3D game realtime strategy uses shortest path analysis control path for movement of character, wheeled vehicle, animals, and fantasy buildings. It uses path for movement ever time, both in sea, terra and sky (three layers). The position of 3D object use refers 2D coordinate. Generally, the most of 3D game strategy both on LAN and online will play on terrain more than inside building or the room. This research proposes two essences. It proposes comparison rapidity, intelligence and efficiency about seven path finding algorithms which is principle algorithm are familiar. These algorithms used in game computer extensively as follows [1] depth first search [2] iterative deepening [3] breadth first search [4] Dijkstra's algorithm [5] best first search [6] A-star algorithm (A*) [7] iterative deepening A*. Besides, this research proposes depth direction A* algorithm method which new method which use linear graph theory cooperate with A* algorithm calculate increase efficiency of avoid barrier object on maps and search for shortest path of multi-layer. It movement are natural characteristic more other method. The cost node grows less than A* algorithm in clear area and plan about expand node before processed. It guarantee about expand node less than A* algorithm node certainly. It takes time movement and avoid barrier object less than uses other algorithm. This work able decrease expand node 22.12-70.67% de- pend on property of area between pathway by define 3D rendering rate are stable.

Published in:

Natural Language Processing, 2009. SNLP '09. Eighth International Symposium on

Date of Conference:

20-22 Oct. 2009