activity
20112019
most citedDecision-Theoretic Planning with non-Markovian Rewards

70 citations · 249 across the 13 of their papers we have counts for

collaborators
Showing cs.AIShow all

10 papers · 1 filter

cs.AI2019★ 20 cited

ASNets: Deep Learning for Generalised Planning

Sam Toyer, Felipe Trevizan, Sylvie Thiébaux +1

In this paper, we discuss the learning of generalised policies for probabilistic and classical planning problems using Action Schema Networks (ASNets). The ASNet is a neural networ…

cs.AI2019

Reward Potentials for Planning with Learned Neural Network Transition Models

Buser Say, Scott Sanner, Sylvie Thiébaux

Optimal planning with respect to learned neural network (NN) models in continuous action and state spaces using mixed-integer linear programming (MILP) is a challenging task for br…

cs.AI2017★ 27 cited

Action Schema Networks: Generalised Policies with Deep Learning

Sam Toyer, Felipe Trevizan, Sylvie Thiébaux +1

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…

cs.AI2017★ 2 cited

Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains

Miquel Ramirez, Enrico Scala, Patrik Haslum +1

In this paper we look into the problem of planning over hybrid domains, where change can be both discrete and instantaneous, or continuous over time. In addition, it is required th…

cs.AI2013★ 33 cited

Supply Restoration in Power Distribution Systems - A Case Study in Integrating Model-Based Diagnosis and Repair Planning

Sylvie Thiebaux, Marie-Odile Cordier, Olivier Jehl +1

Integrating diagnosis and repair is particularly crucial when gaining sufficient information to discriminate between several candidate diagnoses requires carrying out some repair a…

cs.AI2012★ 14 cited

Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards

Sylvie Thiebaux, Froduald Kabanza, John Slanley

A popular approach to solving a decision process with non-Markovian rewards (NMRDP) is to exploit a compact representation of the reward function to automatically translate the NMR…