2017
DOI: 10.1002/oca.2368
|View full text |Cite
|
Sign up to set email alerts
|

Vulnerabilities in Lagrange‐based distributed model predictive control

Abstract: Summary In this paper, we present an analysis of the vulnerability of a distributed model predictive control scheme. A distributed system can be easily attacked by a malicious agent that modifies the reliable information exchange. We consider different types of so‐called insider attacks. In particular, we analyze a controller that is part of the control architecture that sends false information to others to manipulate costs for its own advantage. We propose a mechanism to protect or, at least, relieve the cons… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 46 publications
0
18
0
Order By: Relevance
“…Note that the step of the dual-ascent method for computing the decision variables is carried out in step 4 and the step of the dual-ascent method for updating the Lagrange multipliers is carried out in step 6. Based on Lemma 1, since (10b) forms a compact polyhedral set and (10a) is strictly convex, the solutions coming from Algorithm 1, which are denoted by u ⋆ i, |k , for all i ∈  and ∈ {k, … , k + h p − 1}, converge to the optimal solution of Problem (10). Note that, in order to implement the algorithm (performing steps 3 and 5), it has been assumed that there exists a bidirectional communication between two neighboring agents, ie, for all i and j, where (i, ) ∈ .…”
Section: Distributed Optimization Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…Note that the step of the dual-ascent method for computing the decision variables is carried out in step 4 and the step of the dual-ascent method for updating the Lagrange multipliers is carried out in step 6. Based on Lemma 1, since (10b) forms a compact polyhedral set and (10a) is strictly convex, the solutions coming from Algorithm 1, which are denoted by u ⋆ i, |k , for all i ∈  and ∈ {k, … , k + h p − 1}, converge to the optimal solution of Problem (10). Note that, in order to implement the algorithm (performing steps 3 and 5), it has been assumed that there exists a bidirectional communication between two neighboring agents, ie, for all i and j, where (i, ) ∈ .…”
Section: Distributed Optimization Methodsmentioning
confidence: 99%
“…Noncompliance of some agents in a network that applies a distributed approach has been discussed in some papers. 10,11 For instance, a secure dual-decomposition-based DMPC, in which each agent should monitor two neighbors that provide extreme control input values and disregard these extreme values, has been proposed. 10 Furthermore, a cyber-attack problem of a consensus-based distributed control scheme for distributed energy storage systems has also been addressed, 11 where the approach involves a fuzzy-logic-based detection and a consensus-based leader-follower distributed control scheme.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, the methodology that we propose in this paper is different than that proposed in [7], in a way that it is more specific for the aforementioned problem and particularly for power systems. Moreover, unlike [7], our approach can deal with more than one adversarial agent in a network. This paper is structured as follows.…”
Section: Introductionmentioning
confidence: 99%