Search Results for author:
Found 6 papers, 0 papers with code
Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks
Moreover, we leverage a graph neural network as a heuristic for tree search guidance.
Time-based Dynamic Controllability of Disjunctive Temporal Networks with Uncertainty: A Tree Search Approach with Graph Neural Network Guidance
Scheduling in the presence of uncertainty is an area of interest in artificial intelligence due to the large number of applications.
Advancing the Scientific Frontier with Increasingly Autonomous Systems
A close partnership between people and partially autonomous machines has enabled decades of space exploration.
Planning for Compilation of a Quantum Algorithm for Graph Coloring
Previous work demonstrated that temporal planning is an attractive approach for part of this compilationtask, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to the MaxCut problem on a quantum processor architecture.
Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
Our hybrid methods use solutions found by temporal planning to warm start CP, leveraging the ability of the former to find satisficing solutions to problems with a high degree of task optionality, an area that CP typically struggles with.
Compiling quantum circuits to realistic hardware architectures using temporal planners
We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware.
