This paper develops a method of assignment and path allocation that incorporates a priori collision avoidance and operator workload reduction in assigning multiple tasks to cooperative unmanned aerial vehicles (UAV). The problem is posed as a combinatorial optimization problem. A branch and bound tree search algorithm is implemented for a satisfying solution using a cost function that integrates distance traveled, proximity to other UAVs, and target visitation times. The results demonstrate that the assigned path is near optimal with respect to distance traveled, significantly increases the expected proximity distance to other UAVs, and significantly increases the difference between visitation times of targets. The algorithm runs in less than a tenth of a second allowing on the fly replanning.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Combining Collision Avoidance and Operator Workload Reduction with Cooperative Task Assignment and Path Planning (Preprint)


    Contributors:

    Publication date :

    2006


    Size :

    9 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English





    Optimal UAV Task Assignment and Scheduling (Preprint)

    A. Weinstein / C. Schumacher | NTIS | 2007


    Cooperative path planning and task assignment for unmanned air vehicles

    Innocenti, M. / Pollini, L. / Bracci, A. | Tema Archive | 2010


    Cooperative path planning and task assignment for unmanned air vehicles

    Innocenti, M / Pollini, L / Bracci, A | SAGE Publications | 2010