2020
DOI: 10.1049/iet-cta.2019.0030
|View full text |Cite
|
Sign up to set email alerts
|

Distributed stochastic MPC for linear systems with probabilistic constraints and quantisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…19 There are lots of applications in which MPC is combined with multi-agent systems because of its particular features. Using MPC in the formation of multi-agent systems, 20 avoiding collisions of agents, 21 handling constraints, 22 dead-times, and easier working with multi-variable problems have made MPC popular in the applications related to multi-agent systems. In this article, MPC is used to be combined with W-MSR method to steer the agents to a predefined point in the presence of constraints.…”
Section: Introductionmentioning
confidence: 99%
“…19 There are lots of applications in which MPC is combined with multi-agent systems because of its particular features. Using MPC in the formation of multi-agent systems, 20 avoiding collisions of agents, 21 handling constraints, 22 dead-times, and easier working with multi-variable problems have made MPC popular in the applications related to multi-agent systems. In this article, MPC is used to be combined with W-MSR method to steer the agents to a predefined point in the presence of constraints.…”
Section: Introductionmentioning
confidence: 99%
“…To do this, we model the multi-vehicle interactive system using a Distributed SMPC (DSMPC) framework [14][15][16]. In this framework, each vehicle interacts with its surrounding vehicles by observing their current states and predicting their future behaviors and avoiding potential collisions.…”
Section: Introductionmentioning
confidence: 99%
“…In this way, the SMPC results in less conservatism in constraints satisfaction and achieves better control performance, as the worst-case scenarios unlikely occur. Generally, SMPC methods can be classified into two main categories [8]: the analytic approximation methods [9][10][11] and the scenario-based methods [12][13][14]. The former ones reformulate the probabilistic constraints in a deterministic form by means of constraint tightening, whereas the latter ones generate a sufficient number of randomly sampled realisations to satisfy the chance constraints.…”
Section: Introductionmentioning
confidence: 99%