计算机科学
协议(科学)
集合(抽象数据类型)
仿射变换
数学优化
弹性(材料科学)
次线性函数
约束(计算机辅助设计)
跟踪(教育)
Byzantine容错
分布式计算
数学
弹道
最优控制
趋同(经济学)
作者
Lingfei Su,Yongzhao Hua,Xiwang Dong,Jinhu Lü,Danwei Wang
标识
DOI:10.1109/tcns.2025.3649097
摘要
Discrete-time affine formation optimal tracking problems for multi-agent systems with time-varying objective functions and coupled constraints under Byzantine attacks are investigated. The goal of each honest agent at each time step is to track the optimal trajectory by minimizing the sum of all honest agents' local objective functions from the initial time to the present, while adhering to coupled inequality constraints, affine formation constraints and set constraints. A distributed primal-dual protocol is constructed first to address the challenges posed by time variations and coupled constraints on formation trajectories. Further, the proposed protocol is combined with an aggregation rule to ensure resilience against Byzantine attacks. Sufficient conditions are established to guarantee sublinear growth rates of dynamic regrets for both proposed protocols. Numerical simulations reinforce the theoretical analysis.
科研通智能强力驱动
Strongly Powered by AbleSci AI