Planning is a critical function of multi-agent autonomous systems, which includes path finding and task scheduling. Exhaustive search-based methods such as model checking and algorithmic game theory can solve simple instances of multi-agent planning. However, these methods suffer from state-space explosion when the number of agents is large. Learning-based methods can alleviate this problem, but lack a guarantee of correctness of the results. In this paper, we introduce MoCReL, a new version of our previously proposed method that combines model checking with reinforcement learning in solving the planning problem. The approach takes advantage of reinforcement learning to synthesize path plans and task schedules for large numbers of autonomous agents, and of model checking to verify the correctness of the synthesized strategies. Further, MoCReL can compress large strategies into smaller ones that have down to 0.05% of the original sizes, while preserving their correctness, which we show in this paper. MoCReL is integrated into a new version of UPPAAL STRATEGO that supports calling external libraries when running learning and verification of timed games models.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Correctness-guaranteed strategy synthesis and compression for multi-agent autonomous systems


    Beteiligte:
    Gu, Rong (Autor:in) / Jensen, Peter G. (Autor:in) / Seceleanu, Cristina (Autor:in) / Enoiu, Eduard (Autor:in) / Lundqvist, Kristina (Autor:in)

    Erscheinungsdatum :

    2022-12-01


    Anmerkungen:

    Gu , R , Jensen , P G , Seceleanu , C , Enoiu , E & Lundqvist , K 2022 , ' Correctness-guaranteed strategy synthesis and compression for multi-agent autonomous systems ' , Science of Computer Programming , vol. 224 , 102894 . https://doi.org/10.1016/j.scico.2022.102894



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    006 / 629



    A Coverage Strategy with Guaranteed Collision Avoidance in Multi-Agent Systems using Navigation Functions

    Sharifi, Farid / Mahboubi, Hamid / Aghdam, Amir G. et al. | AIAA | 2013


    A Coverage Strategy with Guaranteed Collision Avoidance in Multi-Agent Systems using Navigation Functions (AIAA 2013-5109)

    Sharifi, F. / Mahboubi, H. / Aghdam, A.G. et al. | British Library Conference Proceedings | 2013


    Multi-agent autonomous system

    Fink, Wolfgang / Dohm, James / Tarbell, Mark A. | NTRS | 2010


    Efficient UAV Placement Strategy for Guaranteed QoS Demand

    Panda, Kirtan Gopal / Das, Shrayan / Sen, Debarati | IEEE | 2020


    A guaranteed collision‐free trajectory planning method for autonomous parking

    Zhiming Zhang / Shan Lu / Lei Xie et al. | DOAJ | 2021

    Freier Zugriff