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.57). 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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: An Unmanned Aerial Vehicle (UAV) is an aircraft without onboard human pilot, which motion can be remotely and / or autonomously controlled. Using multiple UAVs, i.e. a fleet, offers various advantages compared to the single UAV scenario, such as longer mission duration, bigger mission area or the load balancing of the mission payload. For collaboration purposes, it is assumed that the UAVs are equipped with ad hoc communication capabilities and thus form a special case of mobile ad hoc networks. However, the coordination of one or more fleets of UAVs, in order to fulfill collaborative missions, raises multiples issues in particular when UAVs are required to act in an autonomous fashion. Thus, we propose a decentralised and localised algorithm to control the mobility of the UAVs. This algorithm is designed to perform surveillance missions with network connectivity constraints, which are required in most practical use cases for security purposes as any UAV should be able to be contacted at any moment in case of an emergency. The connectivity is maintained via a tree-based overlay network, which root is the base station of the mission, and created by predicting the future positions of one-hop neighbours. This algorithm is compared to the state of the art contributions by introducing new quality metrics to quantify different aspect of the area coverage process (speed, exhaustivity and fairness). Numerical results obtained via simulations show that the maintenance of the connectivity has a slight negative impact on the coverage performances while the connectivity performances are significantly better.
    Proceedings of the 11th ACM international symposium on Mobility management and wireless access; 11/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper introduces and studies the application of Constrained Sampling Evolutionary Algorithms in the framework of an UAV based search and rescue scenario. These algorithms have been developed as a way to harness the power of Evolutionary Algorithms (EA) when operating in complex, noisy, multimodal optimization problems and transfer the advantages of their approach to real time real world problems that can be transformed into search and optimization challenges. These types of problems are denoted as Constrained Sampling problems and are characterized by the fact that the physical limitations of reality do not allow for an instantaneous determination of the fitness of the points present in the population that must be evolved. A general approach to address these problems is presented and a particular implementation using Differential Evolution as an example of CS-EA is created and evaluated using teams of UAVs in search and rescue missions. The results are compared to those of a Swarm Intelligence based strategy in the same type of problem as this approach has been widely used within the UAV path planning field in different variants by many authors.
    Neurocomputing 12/2013; · 1.63 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Navigation and guidance of autonomous vehicles is a fundamental problem in robotics, which has attracted intensive research in recent decades. This report is mainly concerned with provable collision avoidance of multiple autonomous vehicles operating in unknown cluttered environments, using reactive decentralized navigation laws, where obstacle information is supplied by some sensor system. Recently, robust and decentralized variants of model predictive control based navigation systems have been applied to vehicle navigation problems. Properties such as provable collision avoidance under disturbance and provable convergence to a target have been shown; however these often require significant computational and communicative capabilities, and don't consider sensor constraints, making real time use somewhat difficult. There also seems to be opportunity to develop a better trade-off between tractability, optimality, and robustness. The main contributions of this work are as follows; firstly, the integration of the robust model predictive control concept with reactive navigation strategies based on local path planning, which is applied to both holonomic and unicycle vehicle models subjected to acceleration bounds and disturbance; secondly, the extension of model predictive control type methods to situations where the information about the obstacle is limited to a discrete ray-based sensor model, for which provably safe, convergent boundary following can be shown; and thirdly the development of novel constraints allowing decentralized coordination of multiple vehicles using a robust model predictive control type approach, where a single communication exchange is used per control update, vehicles are allowed to perform planning simultaneously, and coherency objectives are avoided.