The problem of scheduling cooperating vehicles is a generalization of the classical vehicle routing problem where certain tasks are linked by precedence constraints and vehicles have varying constrained resources. We describe a type of roll-out algorithm that finds an approximate solution to the problem in real-time and demonstrate the results of the computational experiments.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Routing Cooperating Vehicles to Perform Precedence-Linked Tasks


    Contributors:
    A. Vakhutinsky (author) / C. Wu (author)

    Publication date :

    2005


    Size :

    19 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Multiple Tasks Assignment for Cooperating Homogeneous Unmanned Aerial Vehicles

    Li, Li / Zhai, Xiangping Bryce / Chen, Bing et al. | Springer Verlag | 2019


    Efficient Routing for Precedence-Constrained Package Delivery for Heterogeneous Vehicles

    Bai, Xiaoshan / Cao, Ming / Yan, Weisheng et al. | BASE | 2020

    Free access

    Cooperating Unmanned Vehicles

    Chalmers, Robert / Scheidt, David / Neighoff, Todd et al. | AIAA | 2004



    UEMM-Air: Make Unmanned Aerial Vehicles Perform More Multi-modal Tasks

    Yao, Liang / Liu, Fan / Xu, Shengxiang et al. | ArXiv | 2024

    Free access