Predefined-Time Formation Control for Multiagent Systems-Based on Distributed Optimization

This article presents a solution to the leaderless formation control problem for first-order multiagent systems, which minimizes a global function composed of a sum of local strongly convex functions for each agent under weighted undirected graphs within a predefined time. The proposed distributed o...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2023-12, Vol.PP (12), p.1-0
Main Authors: Villeros, Pablo De, Sanchez-Torres, Juan Diego, Defoort, Michael, Djemai, Mohamed, Loukianov, Alexander
Format: Article
Language:English
Subjects:
Algorithms
Asymptotic stability
Control systems
Cost function
Distributed optimization
Engineering Sciences
fixed-time stability
Formation control
Multiagent systems
Numerical stability
Optimization
Power system stability
predefined-time stability
Robot sensing systems
Task analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article presents a solution to the leaderless formation control problem for first-order multiagent systems, which minimizes a global function composed of a sum of local strongly convex functions for each agent under weighted undirected graphs within a predefined time. The proposed distributed optimization process consists of two steps: 1) the controller initially leads each agent to the minimizer of its local function and 2) then guides all agents toward achieving leaderless formation and reaching the global function's minimizer. The proposed scheme requires fewer adjustable parameters than most existing methods in the literature without the need for auxiliary variables or time-variable gains. Additionally, one can consider highly nonlinear multivalued strongly convex cost functions, while the agents do not share the gradients and Hessians. Extensive simulations and comparisons with state-of-the-art algorithms demonstrate the effectiveness of our approach.
ISSN:2168-2267
2168-2275
DOI:10.1109/TCYB.2023.3264541