Distributed k-WTA Network for Multi-Manipulator Competition With Experimental Verifications
Shengkai Sun , Yutong Li , Jianfeng Lv
CAAI Transactions on Intelligence Technology ›› 2026, Vol. 11 ›› Issue (5) : 1600 -1612.
In this article, a new distributed k-winner-take-all (Dk-WTA) network is designed and used to construct a dynamic allocation scheme for competitive coordination tasks of multiple manipulators as embodied agents. The scheme is constructed based on the following two aspects. On one hand, with reference to a perspective that the Laplacian matrix is introduced into a k-WTA network, a quadratic programming (QP) problem used for the competitive coordination of multiple manipulators is designed. Then, inspired by a noise-suppressing neural dynamics (NSND) method, a Dk-WTA network is established by solving this QP problem. On the other hand, combined with the forward kinematics, a Dk-WTA dynamic allocation scheme is constructed. In addition, theoretical analyses on the constructed scheme are conducted regarding convergence and robustness. Finally, for verification of the feasibility of the proposed D k-WTA network, simulations and experiments based on multiple manipulators for trajectory-tracking tasks are conducted. Notably, the proposed scheme has the potential to be extended to other embodied multi-agent systems.
k-winner-take-all (k-WTA) network / laplacian matrix / multiple-manipulator coordination / noise-suppressing neural dynamics (NSND)
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
/
| 〈 |
|
〉 |