Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm

Nowadays, the usage of autonomous mobile robots that fulfill various activities in enormous number of applications without human’s interference in a dynamic environment are thriving. A dynamic environment is the robot’s environment which is comprised of some static obstacles as well as several movab...

Full description

Bibliographic Details
Main Authors: Seyedhadi Hosseininejad, Chitra Dadkhah
Format: Article
Language:English
Published: SAGE Publishing 2019-04-01
Series:International Journal of Advanced Robotic Systems
Online Access:https://doi.org/10.1177/1729881419839575
_version_ 1818415552103710720
author Seyedhadi Hosseininejad
Chitra Dadkhah
author_facet Seyedhadi Hosseininejad
Chitra Dadkhah
author_sort Seyedhadi Hosseininejad
collection DOAJ
description Nowadays, the usage of autonomous mobile robots that fulfill various activities in enormous number of applications without human’s interference in a dynamic environment are thriving. A dynamic environment is the robot’s environment which is comprised of some static obstacles as well as several movable obstacles that their quantity and location change randomly through the time. Efficient path planning is one the significant necessities of these kind of robots to do their tasks effectively. Mobile robot path planning in a dynamic environment is finding a shortest possible path from an arbitrary starting point toward a desired goal point which needs to be safe (obstacle avoidance) and smooth as well as possible. To achieve this target, simultaneously satisfying a collection of certain constraints including the shortest, smooth, and collision free path is required. Therefore, this issue can be considered as an optimization problem, consequently solved via optimization algorithms. In this article, a new method based on cuckoo optimization algorithm is proposed for solving the mobile robot path planning problem in a dynamic environment. Furthermore, to diminish the computational complexity, the feature vector is also optimized (i.e. reduced in dimension) via a new proposed technique. The simulation results show the performance of proposed algorithm in finding a short, safe, smooth, and collision free path in different environment conditions.
first_indexed 2024-12-14T11:36:48Z
format Article
id doaj.art-182a090c51964e54ad33bf95df29fb88
institution Directory Open Access Journal
issn 1729-8814
language English
last_indexed 2024-12-14T11:36:48Z
publishDate 2019-04-01
publisher SAGE Publishing
record_format Article
series International Journal of Advanced Robotic Systems
spelling doaj.art-182a090c51964e54ad33bf95df29fb882022-12-21T23:02:59ZengSAGE PublishingInternational Journal of Advanced Robotic Systems1729-88142019-04-011610.1177/1729881419839575Mobile robot path planning in dynamic environment based on cuckoo optimization algorithmSeyedhadi HosseininejadChitra DadkhahNowadays, the usage of autonomous mobile robots that fulfill various activities in enormous number of applications without human’s interference in a dynamic environment are thriving. A dynamic environment is the robot’s environment which is comprised of some static obstacles as well as several movable obstacles that their quantity and location change randomly through the time. Efficient path planning is one the significant necessities of these kind of robots to do their tasks effectively. Mobile robot path planning in a dynamic environment is finding a shortest possible path from an arbitrary starting point toward a desired goal point which needs to be safe (obstacle avoidance) and smooth as well as possible. To achieve this target, simultaneously satisfying a collection of certain constraints including the shortest, smooth, and collision free path is required. Therefore, this issue can be considered as an optimization problem, consequently solved via optimization algorithms. In this article, a new method based on cuckoo optimization algorithm is proposed for solving the mobile robot path planning problem in a dynamic environment. Furthermore, to diminish the computational complexity, the feature vector is also optimized (i.e. reduced in dimension) via a new proposed technique. The simulation results show the performance of proposed algorithm in finding a short, safe, smooth, and collision free path in different environment conditions.https://doi.org/10.1177/1729881419839575
spellingShingle Seyedhadi Hosseininejad
Chitra Dadkhah
Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
International Journal of Advanced Robotic Systems
title Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
title_full Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
title_fullStr Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
title_full_unstemmed Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
title_short Mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
title_sort mobile robot path planning in dynamic environment based on cuckoo optimization algorithm
url https://doi.org/10.1177/1729881419839575
work_keys_str_mv AT seyedhadihosseininejad mobilerobotpathplanningindynamicenvironmentbasedoncuckoooptimizationalgorithm
AT chitradadkhah mobilerobotpathplanningindynamicenvironmentbasedoncuckoooptimizationalgorithm