Efficient Strategy Synthesis for MDPs with Resource Constraints

no code implementations • 5 May 2021 • František Blahoudek, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu

We consider qualitative strategy synthesis for the formalism called consumption Markov decision processes.

Polynomial-Time Algorithms for Multi-Agent Minimal-Capacity Planning

no code implementations • 4 May 2021 • Murat Cubuktepe, František Blahoudek, Ufuk Topcu

We develop an algorithm that solves this graph problem in time that is \emph{polynomial} in the number of agents, target locations, and size of the consumption Markov decision process.