Tracking Multiple Ground Targets in Urban Environments Using Cooperating Unmanned Aerial Vehicles

Author(s):  
Vitaly Shaferman ◽  
Tal Shima

A distributed approach is proposed for planning a cooperative tracking task for a team of heterogeneous unmanned aerial vehicles (UAVs) tracking multiple predictable ground targets in a known urban environment. The solution methodology involves finding visibility regions, from which the UAV can maintain line-of-sight to each target during the scenario, and restricted regions, in which a UAV cannot fly, due to the presence of buildings or other airspace limitations. These regions are then used to pose a combined task assignment and motion planning optimization problem, in which each UAV's cost function is associated with its location relative to the visibility and restricted regions, and the tracking performance of the other UAVs in the team. A distributed co-evolution genetic algorithm (CEGA) is derived for solving the optimization problem. The proposed solution is scalable, robust, and computationally parsimonious. The algorithm is centralized, implementing a distributed computation approach; thus, global information is used and the computational workload is divided between the team members. This enables the execution of the algorithm in relatively large teams of UAVs servicing a large number of targets. The viability of the algorithm is demonstrated in a Monte Carlo study, using a high fidelity simulation test-bed incorporating a visual database of an actual city.

Author(s):  
Vitaly Shaferman ◽  
Tal Shima

A distributed approach is proposed for planning a cooperative tracking task for a team of unmanned aerial vehicles (UAVs). In the scenario of interest UAVs are required to autonomously track, using their onboard sensors, a moving target in a known urban environment. The solution methodology involves finding visibility regions, from which a UAV can maintain a line of sight to the target during the scenario; and restricted regions, in which a UAV can not fly, due to the presence of buildings or other airspace limitations. A co-evolution genetic algorithm is derived for searching, in realtime, monotonically improving solutions. In the proposed distributed search method every UAV iteratively manipulates its own population of chromosomes, each encoding its control inputs in the calculated horizon. Team performance is attained by assigning fitness to each solution in the population based on the cooperative performance when using it together with preceding iteration tracking information obtained from teammates. Important attributes of the proposed solution approach are its scalability and robustness; and consequently it can be applied to large sized problems and adapt to the loss of UAV team members. The distributed nature of the algorithm also reduces the computation and communication loads. The performance of the algorithm is studied using a high fidelity simulation test-bed incorporating a visual database of the city of Tel-Aviv, Israel.


2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110103
Author(s):  
Halit Ergezer ◽  
Kemal Leblebicioğlu

In this article, an online path planning algorithm for multiple unmanned aerial vehicles (UAVs) has been proposed. The aim is to gather information from target areas (desired regions) while avoiding forbidden regions in a fixed time window starting from the present time. Vehicles should not violate forbidden zones during a mission. Additionally, the significance and reliability of the information collected about a target are assumed to decrease with time. The proposed solution finds each vehicle’s path by solving an optimization problem over a planning horizon while obeying specific rules. The basic structure in our solution is the centralized task assignment problem, and it produces near-optimal solutions. The solution can handle moving, pop-up targets, and UAV loss. It is a complicated optimization problem, and its solution is to be produced in a very short time. To simplify the optimization problem and obtain the solution in nearly real time, we have developed some rules. Among these rules, there is one that involves the kinematic constraints in the construction of paths. There is another which tackles the real-time decision-making problem using heuristics imitating human-like intelligence. Simulations are realized in MATLAB environment. The planning algorithm has been tested on various scenarios, and the results are presented.


Electronics ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 443 ◽  
Author(s):  
Zhe Zhao ◽  
Jian Yang ◽  
Yifeng Niu ◽  
Yu Zhang ◽  
Lincheng Shen

In this paper, the cooperative multi-task online mission planning for multiple Unmanned Aerial Vehicles (UAVs) is studied. Firstly, the dynamics of unmanned aerial vehicles and the mission planning problem are studied. Secondly, a hierarchical mechanism is proposed to deal with the complex multi-UAV multi-task mission planning problem. In the first stage, the flight paths of UAVs are generated by the Dubins curve and B-spline mixed method, which are defined as “CBC)” curves, where “C” stands for circular arc and “B” stands for B-spline segment. In the second stage, the task assignment problem is solved as multi-base multi-traveling salesman problem, in which the “CBC” flight paths are used to estimate the trajectory costs. In the third stage, the flight trajectories of UAVs are generated by using Gaussian pseudospectral method (GPM). Thirdly, to improve the computational efficiency, the continuous and differential initial trajectories are generated based on the “CBC” flight paths. Finally, numerical simulations are presented to demonstrate the proposed approach, the designed initial solution search algorithm is compared with existing methods. These results indicate that the proposed hierarchical mission planning method can produce satisfactory mission planning results efficiently.


Sign in / Sign up

Export Citation Format

Share Document