Supervisor synthesis to thwart cyber attack with bounded sensor reading alterations

Su, Rong

doi:10.1016/j.automatica.2018.04.006

Cited by 123 publications

(134 citation statements)

References 30 publications

Supporting

Mentioning

134

Contrasting

Order By: Relevance

“…The obstacle-avoidance algorithm of R v is APF. (a) The preset trap locates in (5,12). Attack iteration time is 169 steps, and the path length after being attacked is 6.56m.…”

Section: Attack Statementioning

confidence: 99%

“…8 shows that the shortest-path attack strategy against non-holonomic robot is applied. Two cases are designed where the trap is preseted as (5,12) and (−10, 15), respectively. The traps locates in area S 1 (defined in Fig.…”

Section: Attack Statementioning

confidence: 99%

“…Attacks against the mobile robots are mainly from cyber space, and they can be roughly divided into three categories: DoS, replay, and deception attacks [3]. In those attacks, communication channels are maliciously jammed/disrupted [4], or the control data and measurements are compromised/altered [5], thus degenerating the mission effectiveness of mobile robots in critical and adversarial scenarios. Many efforts have been devoted to designing corresponding countermeasures.…”

Section: Introductionmentioning

confidence: 99%

“…Attack against holonomic robot with APM. Trap is(5,12) Illustration of the shortest-path attack against non-holonomic robot. The obstacle-avoidance algorithm of R v is DWA.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Learning-based Intelligent Attack against Formation Control with Obstacle-avoidance

Chen

et al. 2019

2019 American Control Conference (ACC)

View full text Add to dashboard Cite

The security issue of mobile robots have attracted considerable attention in recent years. Most existing works focus on detection and countermeasures for some classic attacks from cyberspace. Nevertheless, those work are generally based on some prior assumptions for the attacker (e.g., the system dynamics is known, or internal access is compromised). A few work are delicated to physical attacks, however, there still lacks certain intelligence and advanced control design. In this paper, we propose a physical-based and intelligent attack framework against the obstacle-avoidance of mobile robots. The novelty of our work lies in the following: i) Without any prior information of the system dynamics, the attacker can learn the detection area and goal position of a mobile robot by trial and observation, and the obstacle-avoidance mechanism is learned by support vector regression (SVR) method; ii) Considering different attack requirements, different attack strategies are proposed to implement the attack efficiently; iii) The framework is suitable for holonomic and non-holonomic mobile robots, and the algorithm performance analysis about time complexity and optimality is provided. Furthermore, the condition is obtained to guarantee the success of the attack. Simulations illustrate the effectiveness of the proposed framework.The authors are with the

show abstract

“…The obstacle-avoidance algorithm of R v is APF. (a) The preset trap locates in (5,12). Attack iteration time is 169 steps, and the path length after being attacked is 6.56m.…”

Section: Attack Statementioning

confidence: 99%

Section: Attack Statementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Attack against holonomic robot with APM. Trap is(5,12) Illustration of the shortest-path attack against non-holonomic robot. The obstacle-avoidance algorithm of R v is DWA.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Learning-based Intelligent Attack against Formation Control with Obstacle-avoidance

Chen

et al. 2019

2019 American Control Conference (ACC)

View full text Add to dashboard Cite

show abstract

“…Mainly inspired by some recent works [12], [13], [14], [15], we address the problem of cyber attacks with bounded sensor reading edits for partially-observed discrete event systems. In [12], the authors present a new finite structure called parallel observer, which allows to simultaneously describe the observations of the supervisor and of the attacker.…”

Section: Introductionmentioning

confidence: 99%

Stealthy Attacks for Partially-Observed Discrete Event Systems

Zhang

Seatzu

et al. 2018

2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)

View full text Add to dashboard Cite

The problem of cyber attacks with bounded sensor reading edits for partially-observed discrete event systems is considered. An operator observes a plant through an observation mask that does not allow him to detect the occurrence of certain events (silent events). The observation is corrupted by an attacker who can insert and erase some sensor readings. The operator observes the system evolution in order to validate if a state in a given set of unsafe states is reached. The attacker corrupts the observation with the aim of preventing the operator to verify when an interesting state has been reached. Furthermore, the attacker wants to remain stealthy, namely he wants the operator does not realize that someone is corrupting his observation. An automaton, called attack structure is proposed, which supports the attacker in defining an effective attack. In more detail, first, the unbounded attack structure is obtained by doing the concurrent composition of two state observers, the attacker observer and the operator observer. Then, the n-bounded attack structure, for a given integer value of n, is obtained by doing the concurrent composition of the unbounded attack structure and an n-bounded attack automaton. Finally, the n-bounded attack structure can be made supremal and stealthy by appropriately trimming the previous attack structure. A stealthy attacker can elaborate his strategy looking at the supremal stealthy attack substructure and may result in different degrees of effectiveness: strong, weak or vain. The proposed approach can be dually used to verify if such an attack could be effective for the given system, thus to establish if the system is safe under attack.Recently, some works have considered the issue of network-based malicious attacks and detections [2], [3], [4] in the context of continuous systems. There are some studies on malicious attacks and detections in the framework of discrete event systems [5], [6], [7]. In [8] the focus is on fault diagnosis of discrete event systems under attack. In particular, the problem of opacity enforcement by insertion functions under energy constraints has been investigated in [9]. The problem of supervisory control of discrete event systems under attack has been considered in [10], [11].

show abstract

A Framework for the Analysis of Supervised Discrete Event Systems Under Attack

Zhang

Seatzu

et al. 2022

Lecture Notes in Control and Information Sciences - Proceedings

View full text Add to dashboard Cite

Supervisor synthesis to thwart cyber attack with bounded sensor reading alterations

Cited by 123 publications

References 30 publications

Learning-based Intelligent Attack against Formation Control with Obstacle-avoidance

Learning-based Intelligent Attack against Formation Control with Obstacle-avoidance

Stealthy Attacks for Partially-Observed Discrete Event Systems

A Framework for the Analysis of Supervised Discrete Event Systems Under Attack

Contact Info

Product

Resources

About