Abstract
Existing computational methods for the $k$ -winners-take-all ( $k$ WTA) operations often suffer from limitations in eliminating lagging errors, high computational complexity, and weak robustness. To deal with these challenges, we propose an integral-enhanced adaptive gradient neural network (IAGNN) for $k$ WTA. We demonstrate that the IAGNN integrates an adaptive coefficient to eliminate lagging errors while retaining an $O(n^{2})$ computational complexity. We proved the Lyapunov stability and robustness of the IAGNN. We provide a numerical simulation, and the results demonstrate the stability and robustness of the IAGNN. Furthermore, we implement the IAGNN in a multirobot tracking system for competitive allocation coordination, and the results demonstrate the operational feasibility and noise resistance of the IAGNN.
Funding Information
  • National Natural Science Foundation of China (62595800)
  • National Natural Science Foundation of China (625B2074)
  • National Key Research and Development Program of China (2021ZD0201300)
  • Innovation Group Project of the National Natural Science Foundation of China (61821003)
  • National Natural Science Foundation of China (B18024)

This publication has 50 references indexed in Scilit: