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

DOI10.1007/S10472-011-9240-3zbMath1252.68269OpenAlexW1969037246MaRDI QIDQ421464

Alessandro Saetti, Alfonso E. Gerevini, Ivan Serina

Publication date: 23 May 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-011-9240-3

zbMATH Keywords

automated planningdomain-independent planningefficient planningheuristic search for planningplanning with derived predicates

Mathematics Subject Classification ID

Artificial intelligence (68T99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

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

Uses Software

• STAN
• PDDL
• Graphplan
• UCPOP
• LPG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning in domains with derived predicates through rule-action graphs and local search
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Fast planning through planning graph analysis
• Planning as propositional CSP: From Walksat to local search techniques for action graphs
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• In defense of PDDL axioms
• Planning as heuristic search

This page was built for publication: Planning in domains with derived predicates through rule-action graphs and local search