Abstract This work presents an unmanned aerial vehicle (UAV) planning algorithm for local defense of a system from enemy UAVs that come to attack or reconnoiter the system. Planning with non-cooperative moving targets often leads to difficulties in utilizing the widely-used path planning algorithms, since their intention and path plans are not known. Furthermore, because a destination of our UAVs path plan can be changed over time, a fast path planning algorithm which can deal with various obstacles is needed. To handle these problems, two key methods are adopted in this work: First, an informative planning is used for predicting each path of enemy UAVs. Second, the iterative linear quadratic regulator algorithm (iLQR) is utilized to derive feasible paths in a mission environment. Utilizing the two methods, the system predicts paths of invading UAVs and allocates friend UAVs to dominate enemies. Finally, each path for an allocated task is computed via iLQR.
UAV Path Planning for Local Defense Systems
2019-06-16
13 pages
Article/Chapter (Book)
Electronic Resource
English
Defense penetration path planning for UCAV based on threat netting
Online Contents | 2014
|The Role of Local Civil Defense in Disaster Planning
NTIS | 1975
|Optimal path library for local path planning of an autonomous vehicle
European Patent Office | 2023
|NTIS | 1996
|OPTIMAL PATH LIBRARY FOR LOCAL PATH PLANNING OF AN AUTONOMOUS VEHICLE
European Patent Office | 2023
|