2020
DOI: 10.1109/lcsys.2019.2921753
|View full text |Cite
|
Sign up to set email alerts
|

Secure Navigation of Robots in Adversarial Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 10 publications
0
11
0
Order By: Relevance
“…First, at the Evaluate phase, robot 5 is selected as r v by the evaluation criteria (41), which has only one in-neighbor and three out-neighbors, and its corresponding 1 hop convex pattern V p 5 exists. Then, during the Cut phase, r a utilizes the learned ĝ and makes consequent excitations on r v by solving (42), such that r v is gradually pulled out of the interaction range of its in-neighbors, shown as the phase before the break time in Fig. 8(a).…”
Section: B Results and Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…First, at the Evaluate phase, robot 5 is selected as r v by the evaluation criteria (41), which has only one in-neighbor and three out-neighbors, and its corresponding 1 hop convex pattern V p 5 exists. Then, during the Cut phase, r a utilizes the learned ĝ and makes consequent excitations on r v by solving (42), such that r v is gradually pulled out of the interaction range of its in-neighbors, shown as the phase before the break time in Fig. 8(a).…”
Section: B Results and Analysismentioning
confidence: 99%
“…For instance, a noise-generating attack was proposed in [40] to alter gyroscopic sensor data, leading to drone crashes. [41], [42] proposed a spoofing attack to disturb the GPS sensor readings, gradually causing trajectory deviations. These attacks are against a specific transducer by utilizing its sensing mechanism, and are hard to be generalized to other scenarios.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Algorithm 3 is composed of three parts: i) First, before R v comes near to p e , R a needs to wait for the best attack time [Line 17 -21]; ii) Then, after R a begins its initial attack, every iteration of following attacks are based on sampling to explore the motion space of both R a and R v and select a best attack input from a feasible attack set [Line [6][7][8][9][10][11][12][13][14][15][16]; iii) In the end, when R v is close enough from p trap , R a stops and we call the attack is successful. The bottleneck of Algorithm 3 is that the sampling set can be large such that the total computation is time-consuming [Line 8 -14].…”
Section: B Shortest-path Attackmentioning
confidence: 99%
“…Moreover, there are also a few work focusing on physical attacks, where the physical components are considered as attack target to make the attacks stealthy. For instance, the GPS sensor readings can be disturbed by GPS spoofing attack [11]- [13]. Designed acoustic noises can alter gyroscopic sensor data, leading to drone crashes [14].…”
Section: Introductionmentioning
confidence: 99%