9 citations · 9 across the 4 of their papers we have counts for
4 papers
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…
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…
Surrogate Search As a Way to Combat Harmful Effects of Ill-behaved Evaluation Functions
William Cushing, J. Benton, Patrick Eyerich +1
Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some "work arounds" have been proposed to ameliorate the prob…
Cost Based Satisficing Search Considered Harmful
William Cushing, J. Benton, Subbarao Kambhampati
Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some "work arounds" have been proposed to ameliorate the prob…