Multi-Robot Navigation in Unknown Environment Using Strawberry Algorithm

Multi-Robot Navigation in Unknown Environment Using Strawberry Algorithm

B. Sai Charan (ABV-IIITM Gwalior, Gwalior, India), Ayush Mittal (ABV-IIITM Gwalior, Gwalior, India) and Ritu Tiwari (Robotics and Intelligent System Design Lab ABV-IIITM Gwalior, Gwalior, India)
Copyright: © 2017 |Pages: 19
DOI: 10.4018/IJRAT.2017010104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Path Planning focuses on the robot motion from the initial position to final position such that it must avoid the hurdles and finally reach the goal in optimal path. But it is not an easy task because many conditions are included for the efficiency of final result like working on different environments, known or unknown target etc. In this paper the authors have proposed an algorithm inspired by the strawberry plants, and is applied in the path planning. The algorithm can efficiently work for different optimization parameters like Path Length, Energy and Number of Turns. The proposed algorithm is compared with RRT, A-star, PSO and the results obtained are satisfactory. The work can be applied in the real life challenges faced during area exploration
Article Preview

Li Lu et al. (2008) (Lu & Gong, 2008), proposed method for path planning in the unknown environment using the particle swarm optimization, this approach transformed to minimization concept. The advanced fitness function is based on the target and also obstacles in the search space or environment. The environment is unknown because of the limited sensor range of the robot. The global best solution calculated by executing PSO iteratively. The robot updates the environment on its each move. The final path is generated using the fitness function, and also simulation is done in the dynamic environment so that final path generated do not collide with obstacles.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 5: 2 Issues (2017): 1 Released, 1 Forthcoming
Volume 4: 2 Issues (2016)
Volume 3: 2 Issues (2015)
Volume 2: 2 Issues (2014)
Volume 1: 2 Issues (2013)
View Complete Journal Contents Listing