SAIAN, PRATYAKSA OCSA NUGRAHA and Suyoto , . and Pranowo, . Optimized A-Star Algorithm in Hexagon-Based Environment using Parallel Bidirectional Search. In: The 8th 2016 ICITEE (International Conference on Information Technology and Electrical Engineering) "Empowering Tecnology for Better Future , 5-6 October 2016, Eastparc hotel, Yogyakarta.
Text
C5_02_ICITEE 2016.pdf
File Pdf (2MB)
Text
Peer_Review_C5_02_ICITEE 2016.pdf
File Pdf (522kB)
Text
Cek_Turnitin_C5_02_ICITEE 2016.pdf
File Pdf (2MB)
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | shortest path; A-Star; Parallel Bidirectional Search |
| Subjects: | Teknik Industri > Sistem Kerja |
| Divisions: | Fakultas Teknologi Industri > Teknik Industri |
| Date Deposited: | 01 Feb 2018 09:24 |
| Last Modified: | 13 Feb 2018 13:16 |
| URI: | https://repository.uajy.ac.id/id/eprint/13680 |
Actions (login required)
- View Item
