most citedOptimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search

14 citations · 20 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2022

Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks

Kevin Osanlou, Jeremy Frank, Andrei Bursuc +4

Planning under uncertainty is an area of interest in artificial intelligence. We present a novel approach based on tree search and graph machine learning for the scheduling problem…

cs.AI2021★ 6 cited

Learning-based Preference Prediction for Constrained Multi-Criteria Path-Planning

Kevin Osanlou, Christophe Guettier, Andrei Bursuc +2

Learning-based methods are increasingly popular for search algorithms in single-criterion optimization problems. In contrast, for multiple-criteria optimization there are significa…

cs.AI2021

Time-based Dynamic Controllability of Disjunctive Temporal Networks with Uncertainty: A Tree Search Approach with Graph Neural Network Guidance

Kevin Osanlou, Jeremy Frank, J. Benton +4

Scheduling in the presence of uncertainty is an area of interest in artificial intelligence due to the large number of applications. We study the problem of dynamic controllability…

cs.AI2021

Constrained Shortest Path Search with Graph Convolutional Neural Networks

Kevin Osanlou, Christophe Guettier, Andrei Bursuc +2

Planning for Autonomous Unmanned Ground Vehicles (AUGV) is still a challenge, especially in difficult, off-road, critical situations. Automatic planning can be used to reach missio…

cs.AI2021★ 14 cited

Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search

Kevin Osanlou, Andrei Bursuc, Christophe Guettier +2

Deep learning-based methods are growing prominence for planning purposes. In this paper, we present a hybrid planner that combines a graph machine learning model and an optimal sol…