Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version

2026-03-12 · Andrea Micheli, Enrico Scala, Alessandro Valentini arxiv

Since the introduction of the PDDL+ modeling language, it was known that temporal planning with durative actions (as in PDDL 2.1) could be compiled into PDDL+. However, no practical compilation was presented in the literature ever since. We present a practical compilation from temporal planning with durative actions into PDDL+, fully capturing the semantics and only assuming the non-self-overlapping of actions. Our compilation is polynomial, retains the plan length up to a constant factor and is experimentally shown to be of practical relevance for hard temporal numeric problems.

📄 PDF Abstract BibTeX arXiv:2603.12188

Code (0)

등록된 구현이 없습니다.

Compiling quantum circuits to realistic hardware architectures using temporal planners

2017-05-24 · Davide Venturelli, Minh Do, Eleanor Rieffel, Jeremy Frank

To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with only limited means to mitigate decoheren…

Efficient Temporal Piecewise-Linear Numeric Planning with Lazy Consistency Checking

2021-05-21 · Josef Bajada, Maria Fox, Derek Long

Temporal planning often involves numeric effects that are directly proportional to their action's duration. These include continuous effects, where a numeric variable is subjected to a rate of change while the action is …

Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation

2018-03-19 · Kyle E. C. Booth, Minh Do, J. Christopher Beck, Eleanor Rieffel 외

Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning i…

Topological Quantum Compiling with Reinforcement Learning

2020-04-09 · Yuan-Hang Zhang, Pei-Lin Zheng, Yi Zhang, Dong-Ling Deng

Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorith…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Planning for Compilation of a Quantum Algorithm for Graph Coloring

2020-02-23 · Minh Do, Zhihui Wang, Bryan O'Gorman, Davide Venturelli 외

The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach …