Journal
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
Volume 48, Issue 5, Pages 693-701Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2016.2627579
Keywords
Distributed coordination; dynamic task allocation; gradient methods; k-winners-take-all (k-WTA); redundant robot manipulators; theoretical analysis
Funding
- National Natural Science Foundation of China [61401385]
- Hong Kong Research Grants Council Early Career Scheme [25214015]
- Departmental General Research Fund of Hong Kong Polytechnic University [G.61.37.UA7L]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available