Abstract
The problem of dynamic task allocation in a distributed network of redundant robot manipulators for path-tracking with limited communications is investigated in this paper, where k fittest ones in a group of n redundant robot manipulators with n>k are allocated to execute an object tracking task. The problem is essentially challenging in view of the interplay of manipulator kinematics and the dynamic competition for activation among manipulators. To handle such an intricate problem, a distributed coordination control law is developed for the dynamic task allocation among multiple redundant robot manipulators with limited communications and with the aid of a consensus filter. In addition, a theorem and its proof are presented for guaranteeing the convergence and stability of the proposed distributed control law. Finally, an illustrative example is provided and analyzed to substantiate the efficacy of the proposed control law.
| Original language | English |
|---|---|
| Pages (from-to) | 693-701 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Systems, Man, and Cybernetics: Systems |
| Volume | 48 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 1 May 2018 |
Keywords
- Distributed coordination
- dynamic task allocation
- gradient methods
- k-winners-take-all (k-WTA)
- redundant robot manipulators
- theoretical analysis
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering