Optimized A-Star Algorithm in Hexagon-Based Environment using Parallel Bidirectional Search
| Main Authors: | SAIAN, PRATYAKSA OCSA NUGRAHA, Suyoto , ., Pranowo, . |
|---|---|
| Format: | Proceeding PeerReviewed Book |
| Subjects: | |
| Online Access: |
http://e-journal.uajy.ac.id/13680/1/C5_02_ICITEE%202016.pdf http://e-journal.uajy.ac.id/13680/2/Peer_Review_C5_02_ICITEE%202016.pdf http://e-journal.uajy.ac.id/13680/3/Cek_Turnitin_C5_02_ICITEE%202016.pdf http://e-journal.uajy.ac.id/13680/ |
Daftar Isi:
- Shortest path algorithm is one of classic IT problems and already used in many aspects. One of well-known shortest path algorithm is A-Star algorithm. Usually A-Star will be implemented to a Non-Playable Character (NPC) in some games. This paper wants to tell how to optimize A-Star algorithm in a hexagon-based environment using Parallel Bidirectional Search (PBS). The result of this paper is PBS A-Star can be accelerating classics A-Star algorithm by 68.8% faster in hexagon-based environment.