Predefined-Time Distributed Optimal Allocation of Resources: A Time-Base Generator Scheme

Guo, Zhijun; Chen, Gang

doi:10.1109/tsmc.2020.2997697

Cited by 51 publications

(23 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the second inequality is obtained from (34) in the appendix, and λ 2 (L 2 i ) denotes the smallest non-zero eigenvalue of the matrix L 2 i . Substituting (14) back into (13) yields…”

Section: Proof Of Theoremmentioning

confidence: 99%

“…T HE past decade has witnessed a significant progress on distributed resource allocation (DRA) over multiagent networks (MANs), where interacting individual agents cooperate to make the best decision on allocating the grouplevel resources via information exchange among neighboring agents [1]. The task can be basically modeled as a distributed optimization problem regarding a group-level objective function while subject to the resource constraint described by a coupled equality, and the problem has been extensively studied from various aspects with discrete-time [2]- [8] and continuous-time [9]- [14] DRA algorithms developed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Resource Allocation over Multiple Interacting Coalitions: A Game-Theoretic Approach

Wen¹,

Lv²,

Yang³

et al. 2022

Preprint

View full text Add to dashboard Cite

Despite many distributed resource allocation (DRA) algorithms have been reported in literature, it is still unknown how to allocate the resource optimally over multiple interacting coalitions. One major challenge in solving such a problem is that, the relevance of the decision on resource allocation in a coalition to the benefit of others may lead to conflicts of interest among these coalitions. Under this context, a new type of multi-coalition game is formulated in this paper, termed as resource allocation game, where each coalition contains multiple agents that cooperate to maximize the coalition-level benefit while subject to the resource constraint described by a coupled equality. Inspired by techniques such as variable replacement, gradient tracking and leader-following consensus, two new kinds of DRA algorithms are developed respectively for the scenarios where the individual benefit of each agent explicitly depends on the states of itself and some agents in other coalitions, and on the states of all the game participants. It is shown that the proposed algorithms can converge linearly to the Nash equilibrium (NE) of the multicoalition game while satisfying the resource constraint during the whole NE-seeking process. Finally, the validity of the present allocation algorithms is verified by numerical simulations.

show abstract

“…the second inequality is obtained from (34) in the appendix, and λ 2 (L 2 i ) denotes the smallest non-zero eigenvalue of the matrix L 2 i . Substituting (14) back into (13) yields…”

Section: Proof Of Theoremmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distributed Resource Allocation over Multiple Interacting Coalitions: A Game-Theoretic Approach

Wen¹,

Lv²,

Yang³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In addition to the abovementioned two ways of configuring resources for the intelligent construction of track and field team training venues, there is also a hybrid configuration way that integrates the abovementioned two ways of configuration. erefore, in terms of types, there are three ways to allocate resources for the intelligent construction of track and field training venues: (i) planned allocation, (ii) market allocation, and (iii) planned and market hybrid allocation [9]. In respect of (iii), it combines the benefits of both (i) and (ii).…”

Section: Resource Allocation Problemmentioning

confidence: 99%

Optimized Allocation of Resources for Intelligent Construction of Training Venues for Track and Field Teams

Qin

Wen

2021

Mobile Information Systems

View full text Add to dashboard Cite

Because of the problems of low allocation efficiency and accuracy in the traditional resource allocation model for the intelligent construction of track and field team training venues, this paper proposes a new intelligent construction resource allocation model for track and field team training venues. A distributed data collection method is adopted to select the index data for the intelligent construction of the track and field team training venues to optimize the allocation of resources and the mined resource allocation index through extracting the optimized index characteristics. The goal of the optimization problem is transformed into a single-objective solving problem. The suggested approach is based on the two-level programming concept. The simulation experimental results show higher efficiency and better allocation effect of the proposed scheme compared to other state-of-the-art approaches. Our evaluation and observations suggest that the accuracy of the intelligent construction of track and field team training venues is between 90% and 99% which is higher than two other benchmarked models. Furthermore, the proposed model can quickly reach to an optimal decision.

show abstract

“…Furthermore, the penalty method in Ref. [39] converges to a suboptimal solution while the algorithms designed in this paper converge precisely to the optimal global solution.…”

Section: Introductionmentioning

confidence: 99%

“…[39] converges to a suboptimal solution while the algorithms designed in this paper converge precisely to the optimal global solution. Unlike the distributed algorithms with continuous communication in Ref. [34, 39], in our proposed algorithms, the information broadcast only occurs when the triggering condition is satisfied. Although distributed event‐triggered schemes are also used in Ref.…”

Section: Introductionmentioning

confidence: 99%

Predefined‐time distributed event‐triggered algorithms for resource allocation

Shi

Yang

2022

IET Cyber-Phy Sys Theory & Ap

View full text Add to dashboard Cite

The resource allocation problem in a distributed multi-agent system is considered in this study. First, the authors develop a predefined-time distributed algorithm and analyse its convergence analysis using the Lyapunov stability theory, in which the local constraint is ensured by a differential projection operator. Thus, a predefined time is obtained by a time-varying time-based generator. Second, to reduce the communication consumption between agents, the authors develop a static as well as a dynamic-based event-triggered control scheme, where the information broadcast only occurs at some discrete time instants. Moreover, the three proposed algorithms converge precisely to the global optimal solution. Besides, the Zeno behaviour is excluded in the above static and dynamic eventtriggered mechanisms. Finally, the authors test the proposed algorithms' efficiency based on the provided numerical examples.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Predefined-Time Distributed Optimal Allocation of Resources: A Time-Base Generator Scheme

Cited by 51 publications

References 47 publications

Distributed Resource Allocation over Multiple Interacting Coalitions: A Game-Theoretic Approach

Distributed Resource Allocation over Multiple Interacting Coalitions: A Game-Theoretic Approach

Optimized Allocation of Resources for Intelligent Construction of Training Venues for Track and Field Teams

Predefined‐time distributed event‐triggered algorithms for resource allocation

Contact Info

Product

Resources

About