Distribution-Allowed Noise-Resistant Neural Dynamics for Constrained Time-Dependent Quadratic Programming With <i>k</i>WTA Application

Existing computational models for addressing time-dependent quadratic programming (TDQP) problems encounter some challenges, such as generating lagging errors, lack of noise immunity, and inability to be distributed. To handle these challenges, this article proposes a distribution-allowed noise-resistant neural dynamics (DANRND) model to solve TDQP problems with equality and inequality constraints by introducing auxiliary variables rather than by using the nonlinear complementary problem (NCP) function. The proposed model is able to effectively eliminate the hysteresis error and suppress the influence of noises. Specifically, the proposed model is capable of implementation in a distributed manner, which extends its scope of applications. Then, theoretical analyses are provided to prove the global convergence in both noise-free and noisy conditions. Simulative examples and comparison results with existing methods are offered, demonstrating the superiority of the proposed DANRND model. Finally, a distributed cooperative task based on the k-winner-take-all (kWTA) operation is performed on a multirobot platform to further verify the distributed implementation of the proposed DANRND model.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2025-03-18
DOI
https://doi.org/10.1109/tsmc.2025.3547387
Citations
3
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
7.44

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distribution-Allowed Noise-Resistant Neural Dynamics for Constrained Time-Dependent Quadratic Programming With kWTA Application

Dexiu Ma, Xin Ma, Mei Liu
3 citations
IEEE Transactions on Systems Man and Cybernetics Systems
Neural Networks and Applications
7.44
article

Distribution-Allowed Noise-Resistant Neural Dynamics for Constrained Time-Dependent Quadratic Programming With kWTA Application

Dexiu Ma, Xin Ma, Mei Liu
article en
3 citations

Abstract

Existing computational models for addressing time-dependent quadratic programming (TDQP) problems encounter some challenges, such as generating lagging errors, lack of noise immunity, and inability to be distributed. To handle these challenges, this article proposes a distribution-allowed noise-resistant neural dynamics (DANRND) model to solve TDQP problems with equality and inequality constraints by introducing auxiliary variables rather than by using the nonlinear complementary problem (NCP) function. The proposed model is able to effectively eliminate the hysteresis error and suppress the influence of noises. Specifically, the proposed model is capable of implementation in a distributed manner, which extends its scope of applications. Then, theoretical analyses are provided to prove the global convergence in both noise-free and noisy conditions. Simulative examples and comparison results with existing methods are offered, demonstrating the superiority of the proposed DANRND model. Finally, a distributed cooperative task based on the k-winner-take-all (kWTA) operation is performed on a multirobot platform to further verify the distributed implementation of the proposed DANRND model.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 55(5)
Chinese University of Hong Kong (HK), Dingxi City People's Hospital (CN)
National Natural Science Foundation of China, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 4%
Neural Networks and Applications
7.44
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.