Distributed task negotiation in self-reconfigurable robots
Behnam Salemi, Peter Will, Wei‐Min Shen
- Year
- 2004
- Citations
- 11
Abstract
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.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002