.png){kind=icon}
.png){kind=icon}
Return
Velocity-Free Distributed Optimization Algorithms for Second-Order Multiagent Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2024.3371550.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article concerns the distributed optimization problem of dynamical systems using partial state information. Such a problem is motivated by the fact that optimization missions are often subject to dynamical constraints and sensor malfunction. To cooperatively deal with the optimization problem for second-order multiagent systems in the absence of velocity information, we design two velocity-free distributed optimization algorithms over different communication topologies. First, for the case of the continuous communication, a fully velocity-free distributed optimization algorithm is designed by leveraging novel auxiliary dynamics, and each local cost function is just required to be convex. It is shown that all the agents are capable of achieving rendezvous on one of the optimal solutions of interest despite the absence of velocity information. Next, to relieve the communication burden, a modified velocity-free distributed optimization algorithm is designed by introducing an event-based communication mechanism, where all the local cost functions are required to be strongly convex. Particularly, a communication trigger condition is built such that the undesirable Zeno phenomenon is circumvented. Also, an adaptive gain is introduced to make the modified optimization algorithm fully distributed. Simulations are finally given to verify the optimization performance.
Keywords:
Cost function
Multi-agent systems
Heuristic algorithms
Topology
Control systems
Network systems
Convex functions
Distributed optimization
event-based communication
multiagent systems
second-order systems
velocity-free feedback
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K
View more organizations