Premium
Optimal path planning for mobile robots using oppositional invasive weed optimization
Author(s) -
Panda M.R.,
Das P.K.,
Dutta S.,
Pradhan S.K.
Publication year - 2018
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/coin.12166
Subject(s) - mobile robot , motion planning , path (computing) , computer science , robot , population , obstacle avoidance , mathematical optimization , artificial intelligence , convergence (economics) , shortest path problem , path length , mathematics , theoretical computer science , computer network , graph , demography , sociology , economics , economic growth
A mobile robot is an autonomous agent, capable of planning the path from source to destination in both, a known, or an unknown environment. In this paper, we presented a novel approach to find the optimal trajectory. We have hybridized oppositional‐based learning (OBL) with the evolutionary invasive weed optimization (IWO) technique to generate the optimal path for different robot(s). The navigation algorithm considered in this work is intelligent enough to fulfill the objective of minimizing the path length and the time to reach its specified goal. Oppositional IWO (OIWO) algorithm mimics the colonizing behavior of weed and uses the concept of quasi‐opposite number, the concept of OBL is to find the shortest path between source and destination of mobile robot(s). An objective function has been formulated that takes care of the optimal target‐seeking behavior as well as the obstacle avoidance of the mobile robot. In this technique, OBL considers the current population generated by IWO algorithm and its opposite population simultaneously to get better and faster convergence. The simulation and experimental results prove and validate the effectiveness of developed OIWO path planning algorithm.