4 papers
Efficient Constraint Generation for Stochastic Shortest Path Problems
Johannes Schmalz, Felipe Trevizan
Stochastic Shortest Path problems (SSPs) are traditionally solved by computing each state's cost-to-go by applying Bellman backups. A Bellman backup updates a state's cost-to-go by…
Algorithms for Deciding the Safety of States in Fully Observable Non-deterministic Problems: Technical Report
Johannes Schmalz, Chaahat Jain
Learned action policies are increasingly popular in sequential decision-making, but suffer from a lack of safety guarantees. Recent work introduced a pipeline for testing the safet…
Solving Constrained Stochastic Shortest Path Problems with Scalarisation
Johannes Schmalz, Felipe Trevizan
Constrained Stochastic Shortest Path Problems (CSSPs) model problems with probabilistic effects, where a primary cost is minimised subject to constraints over secondary costs, e.g.…
Efficient Constraint Generation for Stochastic Shortest Path Problems
Johannes Schmalz, Felipe Trevizan
Current methods for solving Stochastic Shortest Path Problems (SSPs) find states' costs-to-go by applying Bellman backups, where state-of-the-art methods employ heuristics to selec…