Journal of Korea Game Society (한국게임학회 논문지)

Korea Game Society (한국게임학회)
권호 표지
DOI QR코드

DOI QR Code

A Weighted based Pre-Perform A* Algorithm for Efficient Heuristics Computation Processing

효율적인 휴리스틱 계산 처리를 위한 가중치 기반의 선수행 A* 알고리즘

  • Received : 2013.09.05
  • Accepted : 2013.12.09
  • Published : 2013.12.20
Download PDF
⟨ Previous Next ⟩

Abstract

Path finder is one of the very important algorithm of artificial intelligence and is a process generally used in many game fields. Path finder requires many calculation, so it exerts enormous influences on performances. To solve this, many researches on the ways to reduce the amount of calculate operations have been made, and the typical example is A* algorithm but it has unnecessary computing process, reducing efficiency. In this paper, to reduce the amount of calculate operations such as node search with costly arithmetic operations, we proposes the weight based pre-processing A* algorithm. The simulation was materialized to measure the efficiency of the weight based pre-process A* algorithm, and the results of the experiments showed that the weight based method was approximately 1~2 times more efficient than the general methods.

경로 탐색은 인공지능의 매우 중요한 요소 중의 하나이며, 여러 분야에서 두루 쓰이는 과정이다. 경로 탐색은 매우 많은 연산이 필요하기 때문에 성능에 매우 중대한 영향을 미친다. 이를 해결하기 위해서 연산량을 줄이는 방식의 연구가 많이 진행되었고, 대표적으로 A* 알고리즘이 있으나 불필요한 연산이 있어 효율성이 떨어진다. 본 논문에서는 A* 알고리즘 중 연산 비용이 높은 노드 탐색 수 등 연산량을 줄이기 위해서 가중치 기반의 선수행 A* 알고리즘을 새롭게 제안한다. 제안한 알고리즘의 효율성을 측정하기 위해 시뮬레이션을 구현하였으며, 실험 결과 가중치를 이용하는 방법이 일반적인 방법보다 약 1~2배 높은 효율을 보였다.

Keywords

References

  1. Gyu-Chul Oh, Jong-Hun Park, Uk-Youl Huh, "Global Path Planning using improved A* Algorithm", CICS '11, 2011.
  2. Masoud Nostrati, Ronak Karimi, Hojat Allah Hasanvand, "Investigation of the ＊(Star) Search Algorithms Characteristics, Methods and Approaches", World Applied Programming, Vol.2, No.4, 251-256, 2012. 4.
  3. Hemant M. Joshi, Joshua A. McAdams, "Search Algorithms in Intelligent Agents", Scientific Paper on various search algorithms, 2006. 3.
  4. Se-Il Lee, "Dynamic Programming Algorithm Path-finding for Applying Game", The Korean Society Of Computer And Information, Vol.10, No.4, 2005. 9.
  5. Jin-Ho Ahn, Min-Ji Park, Sungho Kang, Byungin Moon, "Shortest Path Search Method using A* Algorithm with Priority Queue", Korean Institute Of Information Technology, Vol.8, No.8, 1-7, 2010. 8.
  6. Kim Pallister, "Game Programming Gems 5", Infomation Publishing Group, 469-476, 2006.
  7. Anthony Stentz, "Optimal and Efficient Path Planning for Partially-Known Environments", In Proceedings IEEE International Conference on Robotics and Automation, 1994, 5.
  8. Scott Jacobs, "Game Programming Gems 7", Infomation Publishing Group, 351-358, 2010.
  9. Bjornsson, Yngvi, Enzenberger, Markus, Holte, Robert, Schaeffer, Jonathan. "Fringe Search: Beating A* at Pathfinding on Game Maps", IEEE Symposium on Computational Itelligence and Games, pp. 125-132, 2005.
  10. Adi Botea, Martin Muller, Jonathan Schaeffer, "Near Optimal Hierarchical Path-Finding", Journal of game development, 2004.
  11. Cazenave Tristan, "Overestimating the Admissible Heuristic of a for Multiple Sequence Alignment", Computational Intelligence and Bioinformatics and Computational Biology, 2007. CIBCB '07. IEEE Symposium on, 159-164, 2007. 4.
  12. Mark Deloura, "Game Programming Gems", Infomation Publishing Group, 340-351, 2001.
  13. Taegkeun Whangbo, "Efficient Bidirectional Search Algorithm for Optimal Route", Journal of Korea Multimedia Society v.5, n.6, 2002. 12.
  14. Taewon Kim, Kyungeun Cho, Kyhyun Um, "A Hierarchical Graph Structure and Operations for Real-time A* Path finding and Dynamic Graph Problem", Journal of Korea Game Society, Vol.4, No.3, 2004. 9.
  15. Sung Hyun Cho, "A Pathfinding Algorithm Using Path Infomation", Journal of Korea Game Society, Vol.13, No.1, 31-40, 2013. 3.
  16. Min-Ji Park, "A Study on the High-Speed Path Search Method using A* Algorithm", Master Thesis of Hoseo University, 2011.
  17. Seung-Ho Ok, Jin-Ho Ahn, Sungho Kang, Byungin Moon, "A Combined Heuristic Algorithm for Preference-based Shortest Path Search", IEEK, Vol.47, No.8, 74-84, 2010. 8.