Abstract
This paper deals with a cooperative search in a distributed robotic system. In the process of the cooperative search in the distributed robotic system, we must consider that the local information and local knowledge are the same as the limitation of sensing range and communication range. Cooperative search is one of the important issues of distributed decision making in distributed artificial intelligence. In this paper, we present a distributed genetic algorithm with a supplement operation as a method of cooperative search. The distributed genetic algorithm is modified genetic algorithm in the distributed robotic system. The distributed search is carried out by the communication among autonomous robots. As an example of the cooperative search, we present a path planning for part collection in a cellular robotic system (CEBOT), which is one of the distributed robotic systems consisting of a large number of autonomous robotic units called cells.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
