Translating Colored Petri Nets to Lifted Numeric Planning Tasks: Lifted Planning Tasks to Colored Petri Nets
Authors
Term
4. term
Education
Publication year
2024
Submitted on
2024-06-07
Pages
57
Abstract
We present a novel method for translating general colored Petri nets to lifted numerical planning tasks, along with arguments for its correctness. Additionally, the paper also presents an improvement to a previous translation of classical lifted planning to a CPN. Both translations are implemented, have their output validated, and are run against other tools. The first translation is run with the numeric planner ENHSP and is compared to the Petri net verification tool TAPAAL. The second translation is run in TAPAAL and compared to a translation made from a grounded planning task and the powerful Fast Downward configuration, lama-first. The first translation is generally outperformed by TAPAAL, but more importantly, it correctly categorizes reachability queries within the limitation of the theorem as satisfiable or unsolvable, with a proposed solution for removing the limitation. The second translation is an improvement to the former, but is still substantially slower than the Fast Downward configuration and the grounded translation. However, its outputs are correct and it can now translate a much larger subset of lifted planning tasks.
Keywords
Documents