Predefined-time optimization for distributed resource allocation

Lin, Wen-Ting; Wang, Yan‐Wu; Li, Chaojie; Yu, Xinghuo

doi:10.1016/j.jfranklin.2019.06.024

Cited by 28 publications

(15 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, the contributions of this paper are summarised as follows: A novel differential projection‐based predefined‐time distributed algorithm based on the time‐based generator is designed to solve the distributed resource allocation problem over the undirected network. In contrast to the existing predefined‐time resource allocation algorithms [34], the local constraints are considered in our proposed algorithm. In order to handle the local inequality constraints, unlike the penalty method in Ref.…”

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%

“…Furthermore, compared with Ref. [34], the initial state of our designed algorithm can be randomly selected. Compared with the existing distributed fixed‐time resource allocation algorithm, our proposed algorithms have no chatting problem caused by the signum function. Furthermore, the existence of the signum function makes the fixed‐time algorithms unable to integrate with the ETM.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, compared with Ref. [34], the initial state of our designed algorithm can be randomly selected.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Furthermore, compared with Ref. [34], the initial state of our designed algorithm can be randomly selected.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

show abstract

“…Recently, there has been a great deal of attention in the control community on the analysis of a class of systems, known as fixed‐time stable systems, because they exhibit finite‐time convergence with an upper bound of the settling time (UBST) that is independent of the initial conditions of the system 1-5 . This effort has produced many contributions on algorithms with the fixed‐time convergence property, such as multiagent coordination, 6-9 distributed resource allocation, 10 synchronization of complex networks, 11,12 stabilizing controllers, 1,13-16 state observers, 17 and online differentiation algorithms 18,19 …”

Section: Introductionmentioning

confidence: 99%

On the design of nonautonomous fixed‐time controllers with a predefined upper bound of the settling time

Gómez‐Gutiérrez

2020

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Recently, there has been a great deal of attention in a class of finite-time stable dynamical systems, called fixed-time stable, that exhibit uniform convergence with respect to its initial condition, that is, there exists an upper bound for the settling-time (UBST) function, independent of the initial condition of the system. Of particular interest is the development of stabilizing controllers where the desired UBST can be selected a priori by the user since it allows the design of controllers to satisfy real-time constraints. Unfortunately, existing methodologies for the design of controllers for fixed-time stability exhibit the following drawbacks: on the one hand, in methods based on autonomous systems, either the UBST is unknown or its estimate is very conservative, leading to over-engineered solutions; on the other hand, in methods based on time-varying gains, the gain tends to infinity, which makes these methods unrealizable in practice. To bridge these gaps, we introduce a design methodology to stabilize a perturbed chain of integrators in a fixed-time, with the desired UBST that can be set arbitrarily tight. Our approach consists of redesigning autonomous stabilizing controllers by adding time-varying gains. However, unlike existing methods, we provide sufficient conditions such that the time-varying gain remains bounded, making our approach realizable in practice. K E Y W O R D Sfixed-time control, predefined-time control, predefined-time stabilization, prescribed-time control INTRODUCTIONRecently, there has been a great deal of attention in the control community on the analysis of a class of systems, known as fixed-time stable systems, because they exhibit finite-time convergence with an upper bound of the settling time (UBST) that is independent of the initial conditions of the system. 1-5 This effort has produced many contributions on algorithms with the fixed-time convergence property, such as multiagent coordination, 6-9 distributed resource allocation, 10 synchronization of complex networks, 11,12 stabilizing controllers, 1,13-16 state observers, 17 and online differentiation algorithms. 18,19 The fixed-time stability property is of great interest in the development of algorithms for scenarios where real-time constraints need to be satisfied. In fault detection, isolation, and recovery schemes, 20 failing to recover from the fault on time may lead to an unrecoverable mode. In missile guidance, 21 the impact time control guidance laws require stabilization in a desired time. 22,23 In hybrid dynamical systems, it is frequently required that the observer (respectively, controller) Int J Robust Nonlinear Control. 2020;30:3871-3885.wileyonlinelibrary.com/journal/rnc

show abstract