By Topic

Cooperative search using genetic algorithm based on local information - Path planning for structure configuration of cellular robot

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
$33 $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)
T. Ueyama ; Nippondenso Co., Ltd., Aichi, Japan ; T. Fukuda

In the process of a cooperative search in a distributed robotic system, the local information and local knowledge, as well as the limitation of sensing range and communication range must be considered. The authors present a distributed genetic algorithm with a supplement operation as a method for cooperative searching. The distributed genetic algorithm is a search algorithm modified for a distributed robotic system. As an example of a cooperative search, path planning for configuring the structure of a cellular robot is considered. The cellular robot or cellular robotic system (CEBOT) is a distributed robotic system which consists of a large number of autonomous robotic units called cells. The process of cooperative path planning using the proposed genetic algorithm with communication between the cells is presented. The influence of the local sensing and local communication is considered

Published in:

Intelligent Robots and Systems '93, IROS '93. Proceedings of the 1993 IEEE/RSJ International Conference on  (Volume:2 )

Date of Conference:

26-30 Jul 1993