Optimal Path Planning in Environments with Static Obstacles by Harmony Search Algorithm

8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Path planning represents an important optimization problem that need to be solved in various applications. It is a hard optimization problem thus deterministic algorithms are not usable but it can be tackled by stochastic population based metaheuristics such as swarm intelligence algorithms. In this paper we adopted and adjusted harmony search algorithm for the path planning problem in environment with static obstacles and danger zones. Objective function includes path length and safety degree. The proposed method was tested on standard benchmark examples from literature. Simulation results show that our proposed model produces better and more consistent results in spite of its simplicity.

Cite

CITATION STYLE

APA

Tuba, E., Strumberger, I., Bacanin, N., & Tuba, M. (2020). Optimal Path Planning in Environments with Static Obstacles by Harmony Search Algorithm. In Advances in Intelligent Systems and Computing (Vol. 1063, pp. 186–193). Springer. https://doi.org/10.1007/978-3-030-31967-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free