Probabilistic Mission Planning and Analysis for Multi-agent Systems

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mission planning is one of the crucial problems in the design of autonomous Multi-Agent Systems (MAS), requiring the agents to calculate collision-free paths and efficiently schedule their tasks. The complexity of this problem greatly increases when the number of agents grows, as well as timing requirements and stochastic behavior of agents are considered. In this paper, we propose a novel method that integrates statistical model checking and reinforcement learning for mission planning within such context. Additionally, in order to synthesise mission plans that are statistically optimal, we employ hybrid automata to model the continuous movement of agents and moving obstacles, and estimate the possible delay of the agents’ travelling time when facing unpredictable obstacles. We show the result of synthesising mission plans, analyze bottlenecks of the mission plans, and re-plan when pedestrians suddenly appear, by modelling and verifying a real industrial use case in UPPAAL SMC.

Cite

CITATION STYLE

APA

Gu, R., Enoiu, E., Seceleanu, C., & Lundqvist, K. (2020). Probabilistic Mission Planning and Analysis for Multi-agent Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12476 LNCS, pp. 350–367). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61362-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free