Harmony search based algorithm for mobile robot global path planning

Panov, Stojanche and Koceski, Saso (2013) Harmony search based algorithm for mobile robot global path planning. In: 2nd Mediterranean Conference on Embedded Computing (MECO), 15-20 June 2013, Budva, Monte Negro.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/MECO.2013.6601347

Abstract

The global path planning problem is very challenging NP-complete problem in the domain of robotics. An NP-complete problem would be explained as a type of problem that can't be solved in real-time by using naïve deterministic techniques. Many metaheuristic approaches have been developed up to date, to provide an optimal solution to this problem. In this work we present a novel Quad-Harmony Search (QHS) algorithm based on Quad-tree free space decomposition methodology and Harmony Search optimization. The developed algorithm has been evaluated on various grid based environments with different percentage of obstacle coverage. The results have demonstrated that it is superior in terms of time and optimality of the solution compared to other known metaheuristic algorithms and promised to always find the optimal solution.

Item Type: Conference or Workshop Item (Paper)
Subjects: Natural sciences > Computer and information sciences
Divisions: Faculty of Computer Science
Depositing User: Saso Koceski
Date Deposited: 22 Jan 2014 12:56
Last Modified: 22 Jan 2014 12:56
URI: http://eprints.ugd.edu.mk/id/eprint/8761

Actions (login required)

View Item View Item