Conference Paper

State-space search for improved autonomous UAVs assignment algorithm

Air Vehicles Directorate, Air Force Res. Lab., Wright-Patterson AFB, OH, USA
DOI: 10.1109/CDC.2004.1428908 Conference: Decision and Control, 2004. CDC. 43rd IEEE Conference on, Volume: 3
Source: IEEE Xplore

ABSTRACT This paper describes an algorithm that generates vehicle task assignments for autonomous uninhabited air vehicles in cooperative missions. The algorithm uses a state-space best-first search of a tree that incorporates all of the constraints of the assignment problem. Using this algorithm a feasible solution is generated immediately, that monotonically improves and eventually converges to the optimal solution. Using Monte Carlo simulations the performance of the search algorithm is analyzed and compared to the desirable assignment algorithm attributes. It is shown that the proposed deterministic search method can be implemented for given run times, providing good feasible solutions.

1 Follower
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the problem of extending the flight duration of cooperative missions with multiple gliding fixed-wing UAVs by using the energy that comes from static soaring. We consider exploration missions where UAVs should pass through a set of Point of Interest (PoI) with the presence of thermals in the space. These thermals can be exploited to provide energy in terms of altitude for each gliding UAV. The objective of the mission is to extend the flight duration of each UAV to explore the environment without landing and decreasing the time to perform the mission. An algorithm named Bounded Recursive Heuristic Search (BRHS), based on Depth-First search techniques, is applied to the PoIs and to the UAVs. The main advantage is the real time application because of the low computational load. The paper presents a set of simulations and experiments have carried out in the airfield of La Cartuja (Seville, Spain).
    Robotics and Automation (ICRA), 2013 IEEE International Conference on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.
    Control and Automation (ICCA), 2013 10th IEEE International Conference on; 01/2013


Available from