Dynamic exploration of multi-agent systems with periodic timed tasks

DOI10.3233/FI-2020-1948MaRDI QIDQ4988953zbMATH OpenFDO

Authors Johan Arcile, Raymond Devillers, Hanna Klaudel

Publication date 20 May 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.07591

zbMATH Keywords

on-the-fly explorationperiodic behaviourreal-time multi-agent systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42) Multi-agent systems (93A16)

Abstract: We formalise and study multi-agent timed models MAPTs (Multi-Agent with timed Periodic Tasks), where each agent is associated to a regular timed schema upon which all possibles actions of the agent rely. MAPTs allow for an accelerated semantics and a layered structure of the state space, so that it is possible to explore the latter dynamically and use heuristics to greatly reduce the computation time needed to address reachability problems. We apply MAPTs to explore state spaces of autonomous vehicles and compare it with other approaches in terms of expressivity, abstraction level and computation time.

Recommendations

• Monte Carlo tree search for priced timed automata
• Employing costs in multiagent systems with timed migration and timed communication
• Logical formalism for specification of real-time multiagent systems
• On the timed temporal logic planning of coupled multi-agent systems
• scientific article; zbMATH DE number 1954110

Cites work

• Bounded model checking using satisfiability solving
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 177824 (Why is no real title available?)
• scientific article; zbMATH DE number 1956600 (Why is no real title available?)
• scientific article; zbMATH DE number 2064229 (Why is no real title available?)
• scientific article; zbMATH DE number 750184 (Why is no real title available?)
• State space reduction using partial order techniques
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets

Cited in

(1)

• An efficient state space construction for a class of timed automata

Describes a project that uses

Uses Software

• TINA

This page was built for publication: Dynamic exploration of multi-agent systems with periodic timed tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988953)