no code implementations • 16 Jul 2020 • Leonore Winterer, Ralf Wimmer, Nils Jansen, Bernd Becker
Second, based on the results of the original MILP, we employ a preprocessing of the POMDP to encompass memory-based decisions.
no code implementations • 20 Mar 2019 • Steven Carr, Nils Jansen, Ralf Wimmer, Alexandru C. Serban, Bernd Becker, Ufuk Topcu
The particular problem is to determine strategies that provably adhere to (probabilistic) temporal logic constraints.
no code implementations • 14 Aug 2017 • Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker
We study synthesis problems with constraints in partially observable Markov decision processes (POMDPs), where the objective is to compute a strategy for an agent that is guaranteed to satisfy certain safety and performance specifications.