Distributed Time-Varying Quadratic Optimal Resource Allocation Subject to Nonidentical Time-Varying Hessians With Application to Multiquadrotor Hose Transportation

This article considers the distributed time-varying optimal resource allocation problem with time-varying quadratic cost functions and a time-varying coupled equality constraint for multiagent systems. The objective is to design a distributed algorithm for agents with single-integrator dynamics to c...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on systems, man, and cybernetics. Systems Ročník 52; číslo 10; s. 6109 - 6119
Hlavní autoři: Wang, Bo, Sun, Shan, Ren, Wei
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2168-2216, 2168-2232
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article considers the distributed time-varying optimal resource allocation problem with time-varying quadratic cost functions and a time-varying coupled equality constraint for multiagent systems. The objective is to design a distributed algorithm for agents with single-integrator dynamics to cooperatively satisfy the coupled equality constraint and minimize the sum of all local cost functions. Here, both the coupled equality constraint and cost functions depend explicitly on time. The cost functions are in quadratic form and may have nonidentical time-varying Hessians. To solve the problem in a distributed manner, an estimator based on the distributed average tracking method is first developed for each agent to estimate certain global information. By leveraging the estimated global information and an adaptive gain scheme, a distributed continuous-time algorithm is proposed, which ensures the agents to find and track the time-varying optimal trajectories with vanishing errors. We illustrate the applicability of the proposed method in the optimal hose transportation problem using multiple quadrotors.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2168-2216
2168-2232
DOI:10.1109/TSMC.2021.3137814