Consider a set of autonomous vehicles, each one with a preassigned task to start at a given region. Due to energy constraints, and in order to minimize the overall task completion time, these vehicles are deployed from a faster carrier vehicle. This paper develops a dynamic programming (DP) based solution for the problem of finding the optimal deployment location and time for each vehicle, and for a given sequence of deployments, so that the global mission duration is minimal. The problem is specialized for ocean-going vehicles operating under time-varying currents. The solution approach involves solving a sequence of optimal stopping problems that are transformed into a set variational inequalities through the application of the dynamic programming principle (DPP). The optimal trajectory for the carrier and the optimal deployment location and time for each vehicle to be deployed are obtained in feedback-form from the numerical solution of the variational inequalities. The solution is computed with our open source parallel implementation of the fast sweeping method. The approach is illustrated with two numerical examples. ; This paper reports work partially supported by the following projects: "Marine robotics research infrastructure network – EUMR" funded by the EU Horizon 2020 programme under grant agreement No. 731103; "Sistema de Gestão de Operações com base em Veículos Robóticos Inteligentes para a Exploração do Mar Global a partir de Portugal – Oceantech" approved through the Incentive Scheme R&TD Co-promotion Projects and co-funded by the European Regional Development Fund (ERDF), supported by Portugal2020 through Compete2020 (ref POCI-01-0247-FEDER-024508); "European Multidisciplinary Seafloor and Water Column Observatory-Portugal – EMSO-PT’ funded by the ERDF through Compete2020 and by FCT (ref. PINFRA / 22157/2016 – POCI-01-0145-FEDER-022157); and, "Sistema baseado em veículos autónomos para observação oceanográfica de longa duração – ENDURANCE", funded by NORTE2020 under the Portugal2020 Partnership Agreement through ERDF (ref. 17804). ; info:eu-repo/semantics/publishedVersion


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Minimal time delivery of multiple robots


    Beteiligte:

    Erscheinungsdatum :

    2031-12-01



    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629




    Minimal time delivery of multiple robots

    Aguiar, Miguel / Estrela da Silva, Jorge / Borges de Sousa, João | BASE | 2020

    Freier Zugriff

    Minimal energy path planning for wireless robots

    Ooi, Chia Ching / Schindelhauer, Christian | Tema Archiv | 2007


    Qualitative Relational Mapping for Mobile Robots with Minimal Sensing

    McClelland, Mark / Campbell, Mark / Estlin, Tara | AIAA | 2014


    Dynamo: Real-time Experiments with Multiple Mobile Robots

    Barman, R. / Kingdon, S. / Little, J. J. et al. | British Library Conference Proceedings | 1993


    Real-time deadlock-free navigation for multiple mobile robots

    Gakuhari, Harunori | Online Contents | 2008