By Topic

An Efficient Global Optimization Approach to Multi Robot Path Exploration Problem Using Hybrid Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Senthilkumar, K.S. ; Sch. of Comput. & Syst. Sci., Jawaharlal Nehru Univ., New Delhi ; Bharadwaj, K.K.

This paper presents a novel scheme for global path exploration to multi robots environment using hybrid implementation of evolutionary heuristic. This scheme is used to find an optimal path for each mobile robot to move in a static environment expressed by a weighted graph with nodes and links. The interesting part of this scheme is that the chromosome structure is designed to cluster the landmarks (nodes) in the environment. The rendezvous point for robots to meet at last is selected by using making centroid technique. We used a fixed length chromosome. Each robot has a starting point and a rendezvous point under the assumption that the robot passes each point in the cluster only once. Experimental results are presented to illustrate the performance of the proposed scheme. The scheme was tested on a set of different problems with encouraging results.

Published in:

Information and Automation for Sustainability, 2008. ICIAFS 2008. 4th International Conference on

Date of Conference:

12-14 Dec. 2008