Verifiable strategy synthesis for multiple autonomous agents: a scalable approach

Path planning and task scheduling are two challenging problems in the design of multiple autonomous agents. Both problems can be solved by the use of exhaustive search techniques such as model checking and algorithmic game theory. However, model checking suffers from the infamous state-space explosi...

Full description

Saved in:

Bibliographic Details
Published in:	International journal on software tools for technology transfer Vol. 24; no. 3; pp. 395 - 414
Main Authors:	Gu, Rong, Jensen, Peter G., Poulsen, Danny B., Seceleanu, Cristina, Enoiu, Eduard, Lundqvist, Kristina
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2022 Springer Nature B.V
Subjects:	Algorithms Computer Science Explosions Game theory Learning Path planning Planning Scheduling Simulation Software Engineering Software Engineering/Programming and Operating Systems Synthesis Task scheduling Theory of Computation Model checking Autonomous agents Synthesis Reinforcement learning
ISSN:	1433-2779, 1433-2787, 1433-2787
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!