By Topic

Distributed task negotiation in self-reconfigurable robots

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

3 Author(s)
B. Salemi ; Comput. Sci. Dept., USC Inf. Sci. Inst., Marina del Rey, CA, USA ; P. Will ; W. -M. Shen

A self-reconfigurable robot can be viewed as a network of many autonomous modules. Driven by their local information, the modules can initiate tasks that may conflict with each other at the global level. How the modules negotiate and select a coherent task among many competing tasks is thus a critical problem for the control of self-reconfigurable robots. This paper presents a distributed algorithm called DISTINCT to solve this challenging problem and show that it can be successfully applied to the CONRO self-reconfigurable robots. A discussion how to apply DISTINCT to other types of distributed systems such as sensor network, swarm robots, or multi-agent systems is also given.

Published in:

Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings. 2003 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference:

27-31 Oct. 2003