Planning with derived predicates through rule-action graphs and local search techniques

Authors:
Alfonso Gerevini;Alessandro Saetti;Ivan Serina;Paolo Toninelli
Affiliations:
Dipartimento di Elettronica per l'Automazione, Università degli Studi di Brescia, Brescia, Italy;Dipartimento di Elettronica per l'Automazione, Università degli Studi di Brescia, Brescia, Italy;Dipartimento di Elettronica per l'Automazione, Università degli Studi di Brescia, Brescia, Italy;Dipartimento di Elettronica per l'Automazione, Università degli Studi di Brescia, Brescia, Italy
Venue:
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Year:
2005

Citing 2
Cited 0

Planning through stochastic local search and temporal action graphs in LPG

Journal of Artificial Intelligence Research
In defense of PDDL axioms

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In classical domain-independent planning, derived predicates are predicates that the domain actions can only indirectly affect. Their truth in a state can be inferred by particular axioms, that enrich the typical operator description of a planning domain. As discussed in [3,6], derived predicates are practically useful to express in a concise and natural way some indirect action effects, such as updates on the transitive closure of a relation. Moreover, compiling them away by introducing artificial actions and facts in the formalization is infeasible because, in the worst case, we have an exponential blow up of either the problem description or the plan length [6]. This suggests that is worth investigating new planning methods supporting derived predicates, rather than using existing methods with “compiled” problems.