欺骗攻击
计算机科学
隐蔽的
运动规划
路径(计算)
实时计算
全球定位系统
方案(数学)
斯塔克伯格竞赛
能量(信号处理)
能源消耗
计算机网络
机器人
工程类
人工智能
电信
电气工程
数学
数理经济学
语言学
统计
哲学
数学分析
标识
DOI:10.1109/tii.2023.3240595
摘要
In this article, a resilient path planning scheme is proposed to navigate an unmanned aerial vehicle (UAV) to its planned (nominal) destination with minimum energy consumption in the presence of a strategic attacker. The UAV is equipped with the following two sensors: 1) a GPS sensor, which is vulnerable to spoofing attacks; 2) a well-functioning ultrawideband (UWB) sensor, which is possible to be deceived. It is shown that a covert attacker can significantly deviate the UAV's path without being detected by the UWB sensor by simultaneously corrupting the GPS signals and forging control inputs. The prerequisite for the attack occurrence is first discussed. Based on this prerequisite, an optimal attack scheme is proposed, which maximizes the deviation between the nominal destination and the real one. Correspondingly, an energy-efficient and resilient navigation scheme based on Pontryagin's maximum principle is formulated, which suppresses the above covert attacker effectively. Essentially, this problem can be seen as a Stackelberg game between a resilient path planner (defender) and a covert attacker. The effectiveness of our theoretical results is illustrated via two simulation examples.
科研通智能强力驱动
Strongly Powered by AbleSci AI