Evolutionary Trajectory Planner for Multiple UAVs in Realistic Scenarios

Dept. de Comput. y Autom., Univ. Complutense de Madrid, Madrid, Spain
IEEE Transactions on Robotics (Impact Factor: 2.65). 09/2010; DOI: 10.1109/TRO.2010.2048610
Source: IEEE Xplore

ABSTRACT This paper presents a path planner for multiple unmanned aerial vehicles (UAVs) based on evolutionary algorithms (EAs) for realistic scenarios. The paths returned by the algorithm fulfill and optimize multiple criteria that 1) are calculated based on the properties of real UAVs, terrains, radars, and missiles and 2) are structured in different levels of priority according to the selected mission. The paths of all the UAVs are obtained with the multiple coordinated agents coevolution EA (MCACEA), which is a general framework that uses an EA per agent (i.e., UAV) that share their optimal solutions to coordinate the evolutions of the EAs populations using cooperation objectives. This planner works offline and online by means of recalculating parts of the original path to avoid unexpected risks while the UAV is flying. Its search space and computation time have been reduced using some special operators in the EAs. The successful results of the paths obtained in multiple scenarios, which are statistically analyzed in the paper, and tested against a simulator that incorporates complex models of the UAVs, radars, and missiles, make us believe that this planner could be used for real-flight missions.

  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a problem of finding a reconnaissance route of an unmanned combat vehicle (UCV) in a terrain, which is modeled as a grid. It is assumed that the traverse time to pass through each cell in the grid and risk level associated with each cell are given and that the cells where the reconnaissance points to be visited by the UCV are located and the visiting sequence of such cells are given in advance as in real situation of military operation. We focus on the problem with the objective of minimizing the total travel time of the UCV for a given limit on the sum of risk level values associated with the cells on the path of the UCV. We develop an optimal solution algorithm based on a dynamic programming algorithm for multiple-choice knapsack problems. We also present a heuristic algorithm, which can be used for large-size problems. For evaluation of the performance of the proposed algorithms, computational experiments are performed on a number of problem instances, and results show that the proposed algorithms give optimal or good solutions within an acceptable time for real military operations.
    Computers & Industrial Engineering 02/2015; 80. DOI:10.1016/j.cie.2014.12.016 · 1.69 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposed a cooperative receding horizon optimal control framework, based on differential flatness and B-splines, which was used to solve the real-time cooperative trajectory planning for multi-UCAV performing cooperative air-to-ground target attack missions. The planning problem was formulated as a cooperative receding horizon optimal control problem (CRHC-OCP), and then the differential flatness and B-splines were introduced to lower the dimension of the planning space and parameterize the spatial trajectories. Moreover, for the dynamic and uncertainty of the battlefield environment, the cooperative receding horizon control was introduced. Finally, the proposed approach is demonstrated, and the results show that this approach is feasible and effective.
    07/2013; 333-335:1338-1343. DOI:10.4028/
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a fast human-in-the-loop path planning strategy in cluttered environments based on cloud model is proposed, and it is implemented in a human-machine cooperative Unmanned Aerial Vehicle (UAV) path planning system. Firstly, a dynamic guidance A* (DGA*) search algorithm is proposed to allow human’s participation in machine searching loop. Secondly, online uncertainty reasoning based on cloud model is introduced to allow human’s fuzzy decision about path direction and trending, then human’s perception, expertise, and preferences are incorporated into the DGA* optimality process. Therefore, this effective cooperative decision support can provide a robust solution exploration space, overcoming some shortages of original A* algorithm, such as slow search speed, easily falling into local dead-ends, and so on. Experimental results demonstrate that the proposed method is much more efficient than original A* planner, and generates good solutions that match mission considerations and personal preferences.
    Journal of Intelligent and Robotic Systems 01/2014; DOI:10.1007/s10846-014-0079-9 · 0.81 Impact Factor