Optimal Robot Path Planning Using Gravitational Search Algorithm
This paper proposes a new Gravitational Search Algorithm (GSA)-based approach for generating an optimal path for a robot travelling in partially unknown environments in the presence of multiple (static or dynamic) obstacles. The GSA-based approach is expressed as an algorithm which computes an optimal path for a robot that travels from an initial point to a target point while avoiding all the known obstacles in the environment but also any other static or dynamic object that could appear in the path of the robot to the target point. To validate the new approach for the path planning, the new algorithm is employed in the generation of obstacle-free paths for different robots that are participating in different missions in the framework of the nRobotic platform developed at the “Politehnica” University of Timisoara, Romania. A comparison focused on the resulted path length and performance with another well-known evolutionary algorithm represented by the Particle Swarm Optimization used for path planning is performed.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.