Verification of Numeric Planning Problems through Domain Dynamic Consistency

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Verification of the development of complex problem models is an open problem in real-world applications of automated planning. To facilitate the verification task, this paper introduces the notion of Domain Dynamic Consistency for planning problems expressed in PDDL. This notion is aimed at signalling suspicious inputs arising at the intersection between the abstract description of the model and its concrete instantiation. Together with the notion we present an approximation based approach that is devoted to automatically solve the problem of deciding when a PDDL numeric planning problem is not Domain Dynamic Consistent. The paper terminates with an example of application of this notion and its related technique within a Urban Traffic Control scenario.
Original languageEnglish
Title of host publicationProceedings of the 21st International Conference of the Italian Association for Artificial Intelligence
PublisherSpringer, Cham
Number of pages13
Publication statusAccepted/In press - 17 Oct 2022
Event21st International conference of the Italian association for Artificial Intelligence - University of Udine, Udine, Italy
Duration: 28 Nov 20222 Dec 2022
Conference number: 21
https://aixia2022.uniud.it/

Conference

Conference21st International conference of the Italian association for Artificial Intelligence
Abbreviated titleAIxIA 2022
Country/TerritoryItaly
CityUdine
Period28/11/222/12/22
Internet address

Fingerprint

Dive into the research topics of 'Verification of Numeric Planning Problems through Domain Dynamic Consistency'. Together they form a unique fingerprint.

Cite this