Koceski, Saso and Panov, Stojanche and Koceska, Natasa (2014) A Novel Quad Harmony Search Algorithm for Grid-based Path Finding. International Journal of Advanced Robotic Systems, 11. pp. 144-155. ISSN 1729-8806
Preview |
Text
InTech2014.pdf - Published Version Download (686kB) | Preview |
Abstract
A novel approach to the problem of grid-based
path finding has been introduced. The method is a blockbased
search algorithm, founded on the bases of two
algorithms, namely the quad-tree algorithm, which
offered a great opportunity for decreasing the time
needed to compute the solution, and the harmony search
(HS) algorithm, a meta-heuristic algorithm used to obtain
the optimal solution. This quad HS algorithm uses the
quad-tree decomposition of free space in the grid to mark
the free areas and treat them as a single node, which
greatly improves the execution. The results of the quad
HS algorithm have been compared to other metaheuristic
algorithms, i.e., ant colony, genetic algorithm,
particle swarm optimization and simulated annealing,
and it was proved to obtain the best results in terms of
time and giving the optimal path.
| Item Type: | Article |
|---|---|
| Subjects: | Natural sciences > Computer and information sciences Engineering and Technology > Electrical engineering, electronic engineering, information engineering |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Natasa Koceska |
| Date Deposited: | 04 Feb 2015 10:56 |
| Last Modified: | 04 Feb 2015 10:56 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/12312 |
Actions (login required)
 |
View Item |