.png){kind=icon}
.png){kind=icon}
Return
Distributed Fixed-Time Resource Allocation Algorithm for the General Linear Multi-Agent Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2022.3152248.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This brief focuses on the distributed resource allocation problem (RAP) for a general linear heterogeneous multi-agent system (MAS), in which each agent adopts different structure parameters. By means of multi-agent consensus approach and symbolic-function-based fixed-time control theory, an initialization-free distributed resource allocation algorithm is designed. Moreover, the equality constraint is solved based on the proportional-integral (PI) control idea and the output of all agents tracks to the optimal solution within fixed-time. Finally, we reveal the effectiveness and fast convergence performance of our proposed algorithm by a simulation example.
Keywords:
Linear programming
Convergence
Resource management
Optimization
Eigenvalues and eigenfunctions
Distributed algorithms
Circuits and systems
Resource allocation
fixed-time
heterogenous
initialization-free
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W