Sylvie Thiébaux

Heuristic Search in Dual Space for Constrained Stochastic Shortest Path Problems

2016 · Proceedings of the International Conference on Automated Planning and Scheduling

We consider the problem of generating optimal stochastic policies for Constrained Stochastic Shortest Path problems, which are a natural model for planning under uncertainty for resource-bounded agents with multiple competing objectives. While unconstrained SSPs enjoy …

Action Schema Networks: Generalised Policies With Deep Learning

2018 · Proceedings of the AAAI Conference on Artificial Intelligence

In this paper, we introduce the Action Schema Network (ASNet): a neural network architecture for learning generalised policies for probabilistic planning problems. By mimicking the relational structure of planning problems, ASNets are able to adopt …

Operator Counting Heuristics for Probabilistic Planning

2018

For the past 25 years, heuristic search has been used to solve domain-independent probabilistic planning problems, but with heuristics that determinise the problem and ignore precious probabilistic information. In this paper, we present a generalization …