This paper proposes a multi-robot path planning and optimal deployment strategy for a team of micro air vehicles with limited energy reserves and finite recharge times. We focus on deployments which seek to balance individual and cooperative vehicle task requirements with overall travel and energy costs and charging station availability toward enabling extended duration operation. We formulate the deployment approach as a matching problem that builds upon a deterministic navigation graph of both edge and vertex weighted. By relating the charging stations to the weighting policy of graph vertices, a set of navigation paths transiting nearby charging stations can be obtained for those low energy aerial vehicles. Simulation results validate the proposed deployment approach and analyze performance variability due to changes in available energy resources and team size.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Energy-aware aerial vehicle deployment via bipartite graph matching


    Contributors:


    Publication date :

    2014-05-01


    Size :

    1865662 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Approximate graph edit distance computation by means of bipartite graph matching

    Riesen, K. / Bunke, H. | British Library Online Contents | 2009


    Energy-Aware 3D Aerial Small-Cell Deployment over Next Generation Cellular Networks

    Chou, Shih-Fan / Yu, Ya-Ju / Pang, Ai-Chun et al. | IEEE | 2018


    Unweighted Bipartite Matching For Robust Vehicle Counting

    Ho, Khanh / Le, Huy Bao / Van Nguyen, Khoa et al. | IEEE | 2021


    UNMANNED AERIAL VEHICLE DEPLOYMENT SYSTEM

    MARR MICHAEL JOHN / GRANT ANDREW STANLEY / KUEK BENJAMIN YONG LIANG et al. | European Patent Office | 2017

    Free access

    Unmanned aerial vehicle deployment system

    MARR MICHAEL JOHN / GRANT ANDREW STANLEY / LIANG KUEK BENJAMIN YONG et al. | European Patent Office | 2019

    Free access