2021
DOI: 10.48550/arxiv.2107.04056
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Optimal Output Consensus of Second-Order Uncertain Nonlinear Systems on Weight-Unbalanced Directed Networks

Jin Zhang,
Lu Liu,
Haibo Ji

Abstract: This paper investigates the distributed optimal output consensus problem of second-order uncertain nonlinear multi-agent systems over weight-unbalanced directed networks. Under the standard assumption that local cost functions are strongly convex with globally Lipschitz gradients, a novel distributed dynamic state feedback controller is developed such that the outputs of all the agents reach the optimal solution to minimize the global cost function which is the sum of all the local cost functions. The controll… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(9 citation statements)
references
References 33 publications
0
9
0
Order By: Relevance
“…Then the proposed optimal coordinator is embedded into the feedback loop to convert the DOOC problem to a reference-tracking problem, which will be addressed in the next subsection. Specifically, inspired by [15], [20], the optimal coordinator for each agent i is designed as follows,…”
Section: A Distributed Optimal Coordinator Designmentioning
confidence: 99%
See 4 more Smart Citations
“…Then the proposed optimal coordinator is embedded into the feedback loop to convert the DOOC problem to a reference-tracking problem, which will be addressed in the next subsection. Specifically, inspired by [15], [20], the optimal coordinator for each agent i is designed as follows,…”
Section: A Distributed Optimal Coordinator Designmentioning
confidence: 99%
“…where α1 and α2 are two positive constants, y r i ∈ R represents the generated reference signal for agent i, ζi ∈ R and ξi ∈ R N are auxiliary variables, with ξ k i being the k-th component of ξi and initial value ξi(0) satisfying ξ i i (0) = 1, otherwise ξ k i (0) = 0 for all k = i. With these choices, it is shown in [15] that ξ i i (t) > 0 for all t ≥ 0, which means that the algorithm ( 4) is well defined.…”
Section: A Distributed Optimal Coordinator Designmentioning
confidence: 99%
See 3 more Smart Citations