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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We address the problem of dynamically switching the topology of a formation of a number of undistinguishable agents. Given the current and the final topologies, each with n agents, there are n! possible allocations between the initial and final positions of the agents. Given the agents maximum velocities, there is still a degree of freedom in the trajectories that might be used in order to avoid collisions. We seek an allocation and corresponding agent trajectories minimizing the maximum time required by all agents to reach the final topology, avoiding collisions. Collision avoidance is guaranteed through an appropriate choice of trajectories, which might have consequences in the choice of an optimal permutation. We propose here a dynamic programming approach to optimally solve problems of small dimension. We report computational results for problems involving formations with up to 12 agents.
    11/2010: pages 305-321;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This report addresses the formulation of a general theoretical framework for issues unique to cooperative control. The approach taken is to unify the fundamental principles of control Lyapunov functions, potential field theory, and the so-called optimal return function. These three principles are woven together to achieve an analytically vigorous formulation that addresses the required functionality of cooperative control problems. The development is prepared in the context of a multiple UAV cooperative ground moving target engagement scenario.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The scheduling, for autonomous refueling, of multiple unmanned aerial vehicles (UAVs) is posed as a combinatorial optimization problem. An efficient dynamic programming (DP) algorithm is introduced for finding the optimal initial refueling sequence. The optimal sequence needs to be recalculated when conditions change, such as when UAVs join or leave the queue unexpectedly. We develop a systematic shuffle scheme to reconfigure the UAV sequence using the least amount of shuffle steps. A similarity metric over UAV sequences is introduced to quantify the reconfiguration effort which is treated as an additional cost and is integrated into the DP algorithm. Feasibility and limitations of this novel approach are also discussed
    IEEE Transactions on Robotics 09/2006; · 2.57 Impact Factor


Available from