Prescribed-time distributed optimization problem with constraints
In recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed op...
Saved in:
| Published in: | ISA transactions Vol. 148; pp. 255 - 263 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
Elsevier Ltd
01.05.2024
|
| Subjects: | |
| ISSN: | 0019-0578, 1879-2022, 1879-2022 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed optimization algorithm with constraints is designed on the basis of gradient projection algorithm and consensus algorithm. Secondly, the constrained distributed optimization problem is transformed into the unconstrained distributed optimization problem, and according to the gradient descent algorithm and consensus algorithm, we also propose the prescribed-time distributed optimization algorithm without constraints. By designing the appropriate objective functions, we prove the multi-agent system can converge to the optimal solution within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. Finally, three simulation examples are provided to verify the validity of the designed algorithms.
•For distributed optimization problem with convex constraints, we design an effective prescribed-time distributed algorithm which can guarantee the multi-agent system converge to the optimal solution.•The designed algorithm in this paper can achieve convergence within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters.•In this paper, we not only consider the condition that the agents’ states are constrained, but also ensure that the multi-agent system can reach the optimal solution within any prescribed-time, which is more practical. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 0019-0578 1879-2022 1879-2022 |
| DOI: | 10.1016/j.isatra.2024.03.024 |