Open AccessAn Efficient Path Planning Algorithm for Networked Robots using Modified Optimization Algorithm
Author(s) -
Niharika Singh*,
Manish Prateek,
Piyush Chauhan
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l2554.1081219
Subject(s) - pathfinding , motion planning , algorithm , computer science , shortest path problem , mobile robot , robot , path (computing) , cuckoo search , convergence (economics) , artificial intelligence , mathematical optimization , mathematics , theoretical computer science , particle swarm optimization , graph , economics , programming language , economic growth
Path planning has played a significant role in major numerous decision-making techniques through an automatic system involved in numerous military applications. In the last century, pathfinding and generation were carried out by multiple intelligent approaches. It is very difficult in pathfinding to reduce energy. Besides suggesting the shortest path, it has been found that optimal path planning. This paper introduces an efficient path planning algorithm for networked robots using modified optimization algorithms in combination with the η3 -splines. A new method has employed a cuckoo optimization algorithm to handle the mobile robot path planning problem. At first, η3 - splines are combined so an irregular set of points can be included alongside the kinematic parameters chosen to relate with the development and the control of mobile robots. The proposed algorithm comprises of adaptive random fluctuations (ARFs), which help to deal with the very much manageable neighborhood convergence. This algorithm carries out the process of accurate object identification along with analyzing the influence of different design choice by developing a 3D CNN architecture to determine its performance. Besides offering classification in real-time applications, the proposed algorithm outperforms the performance of state of the art in different benchmarks