2017
DOI: 10.1016/j.jprocont.2017.05.014
|View full text |Cite
|
Sign up to set email alerts
|

Parsimonious cooperative distributed MPC algorithms for offset-free tracking

Abstract: We propose in this paper novel cooperative distributed MPC algorithms for tracking of piecewise constant setpoints in linear discrete-time systems. The available literature for cooperative tracking requires that each local controller uses the centralized state dynamics while optimizing over its local input sequence. Furthermore, each local controller must consider a centralized target model. The proposed algorithms instead use a suitably augmented local system, which in general has lower dimension compared to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…In addition to this, decentralized/distributed solutions are known to be more scalable than centralized solutions, especially when the overall number of subsystems becomes large. Even if this limitation does not hold, it is often the case that organizational reasons impose the use of smaller local controllers, which are easier to maintain and operate . Moreover, a distributed solution is also prone to possible faults or deliberated attacks since in that case they guarantee a controlled behavior of at least a part of the network.…”
Section: Introductionmentioning
confidence: 99%
“…In addition to this, decentralized/distributed solutions are known to be more scalable than centralized solutions, especially when the overall number of subsystems becomes large. Even if this limitation does not hold, it is often the case that organizational reasons impose the use of smaller local controllers, which are easier to maintain and operate . Moreover, a distributed solution is also prone to possible faults or deliberated attacks since in that case they guarantee a controlled behavior of at least a part of the network.…”
Section: Introductionmentioning
confidence: 99%
“…Proposition III. 4 The stability constraints (3d)-(3g) hold if (8) holds for all i ∈ {1, ..., M} and there exist block-diagonal matrices T i ∈ S n N i such that…”
Section: Proposition Iii3 Let H Lmentioning
confidence: 99%
“…In the case of operating point switching, Ferramosca et al proposed a centralized MPC for tracking, which gives a method to overcome the infeasible problem caused by the final state unreachable. Then, a cooperative DMPC version without model mismatch consequently was provided in the work of Razznaelli and Pannocchia, which requires each subsystem to exchange information with all other subsystems. Groß and Stursberg proposed an event‐trigger–based DMPC strategy to reduce the communication loads, where, if the variation of the exchanged neighboring subsystem's trajectory is large enough to violate the stability of current subsystem or the time without communication is too long, an event is triggered.…”
Section: Introductionmentioning
confidence: 99%