Multi-UAV Cooperative Path Planning with Monitoring Privacy Preservation

被引:5
作者
Chen, Yang [1 ,2 ]
Shu, Yifei [1 ]
Hu, Mian [1 ]
Zhao, Xingang [2 ]
机构
[1] Wuhan Univ Sci & Technol, Engn Res Ctr Met Automat & Measurement Technol, Minist Educ, Wuhan 430081, Peoples R China
[2] Chinese Acad Sci, Shenyang Inst Automat, State Key Lab Robot, Shenyang 110016, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2022年 / 12卷 / 23期
关键词
persistent monitoring; privacy protection; path planning; monitoring frequency; overdue time; SURVEILLANCE; OPTIMIZATION; LATENCY;
D O I
10.3390/app122312111
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
UAVs have shown great potential application in persistent monitoring, but still have problems such as difficulty in ensuring monitoring frequency and easy leakage of monitoring path information. Therefore, under the premise of covering all monitoring targets by UAVs, it is necessary to improve the monitoring frequency of the target and the privacy protection of the monitoring intention as much as possible. In response to the above problems, this research proposes monitoring overdue time to evaluate the monitoring frequency and monitoring period entropy in order to evaluate the ability to ensure monitoring privacy protection. It then establishes a multi-UAV cooperative persistent monitoring path planning model. In addition, the multi-group ant colony optimization algorithm, called overdue-aware multiple ant colony optimization (OMACO), is improved based on the monitoring overdue time. Finally, an optimal flight path for multi-UAV monitoring with high monitoring frequency and strong privacy preservation of monitoring intention is obtained. The simulation results show that the method proposed in this paper can effectively improve the monitoring frequency of each monitoring node and the privacy preservation of the UAV monitoring path and has great significance for enhancing security monitoring and preventing intrusion.
引用
收藏
页数:16
相关论文
共 26 条
[1]  
Agmon N, 2011, J ARTIF INTELL RES, V42, P887
[2]   Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations [J].
Alamdari, Soroush ;
Fata, Elaheh ;
Smith, Stephen L. .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2014, 33 (01) :138-154
[3]   Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder [J].
Basilico, Nicola ;
Gatti, Nicola ;
Amigoni, Francesco .
ARTIFICIAL INTELLIGENCE, 2012, 184 :78-123
[4]   An Optimal Control Approach to the Multi-Agent Persistent Monitoring Problem [J].
Cassandras, Christos. G. ;
Lin, Xuchao ;
Ding, Xuchu .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (04) :947-961
[5]   Markov Chains With Maximum Return Time Entropy for Robotic Surveillance [J].
Duan, Xiaoming ;
George, Mishel ;
Bullo, Francesco .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (01) :72-86
[6]   Multi-robot area patrol under frequency constraints [J].
Elmaliach, Yehuda ;
Agmon, Noa ;
Kaminka, Gal A. .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2009, 57 (3-4) :293-320
[7]   Markov Chains With Maximum Entropy for Robotic Surveillance [J].
George, Mishel ;
Jafarpour, Saber ;
Bullo, Francesco .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (04) :1566-1580
[8]  
Girard AR, 2004, IEEE DECIS CONTR P, P620, DOI 10.1109/cdc.2004.1428713
[9]  
Haifeng Xu, 2017, Decision and Game Theory for Security. 8th International Conference, GameSec 2017. Proceedings: LNCS 10575, P458, DOI 10.1007/978-3-319-68711-7_24
[10]   The Generalized Persistent Monitoring Problem [J].
Hari, S. K. K. ;
Rathinam, S. ;
Darbha, S. ;
Kalyanam, K. ;
Manyam, S. G. ;
Casbeer, D. .
2019 AMERICAN CONTROL CONFERENCE (ACC), 2019, :2783-2788