Multi-UAV Cooperative Path Planning with Monitoring Privacy Preservation
نویسندگان
چکیده
UAVs have shown great potential application in persistent monitoring, but still problems such as difficulty ensuring monitoring frequency and easy leakage of path information. Therefore, under the premise covering all targets by UAVs, it is necessary to improve target privacy protection intention much possible. In response above problems, this research proposes overdue time evaluate period entropy order ability ensure protection. It then establishes a multi-UAV cooperative planning model. addition, multi-group ant colony optimization algorithm, called overdue-aware multiple (OMACO), improved based on time. Finally, an optimal flight for with high strong preservation obtained. The simulation results show that method proposed paper can effectively each node UAV has significance enhancing security preventing intrusion.
منابع مشابه
CoUAV: a multi-UAV cooperative search path planning simulation environment
Sophisticated multi-unmanned aerial vehicle (UAV) simulation environments developed so far intrinsically paid significant attention on high-fidelity flight control system components to realistically account for low-level decision support. However, the use of these simulators often incurs a large overhead when focusing on cooperative high-level decision tasks, such as planning in mobile sensor n...
متن کاملMulti-Agent UAV Path Planning
This paper introduces a simulation designed to test real-time path planning done by single and multiple agents. The components of the simulation include a road network, several Uninhabited Aerial Vehicles (UAVs) with electro-optic sensors, a target and an Uninhabited Ground Vehicle (UGV). The target and UGV are located on the road network. Random blockages are placed on the road network, possib...
متن کاملCooperative Multi-Robot Path Planning
In risky applications it is advantageous to use multiple robots in order to improve performances. In a research or patrol scenario robots have to move cooperatively in order to avoid collisions and to improve performance. In this paper we describe the implementation of two variations of a cooperative planning algorithm: Cooperative A* and Cooperative Voronoi A*. The task is decoupled into a ser...
متن کاملCooperative Path-Planning for Multi-Vehicle Systems
In this paper, we propose a collision avoidance algorithm for multi-vehicle systems, which is a common problem in many areas, including navigation and robotics. In dynamic environments, vehicles may become involved in potential collisions with each other, particularly when the vehicle density is high and the direction of travel is unrestricted. Cooperatively planning vehicle movement can effect...
متن کاملPerformance Evaluation of Multi-UAV Cooperative Mission Planning Models
The Multi-UAV Cooperative Mission Planning Problem (MCMPP) is a complex problem which can be represented with a lower or higher level of complexity. In this paper we present a MCMPP which is modelled as a Constraint Satisfaction Problem (CSP) with 5 increasing levels of complexity. Each level adds additional variables and constraints to the problem. Using previous models, we solve the problem u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2022
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app122312111