Engineering and compiling planning domain models to promote validity and efficiency

DOI10.1016/S0004-3702(97)00034-9zbMath0894.68137OpenAlexW4213297930MaRDI QIDQ1389595

T. L. McCluskey, J. M. Porteous

Publication date: 30 June 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(97)00034-9

zbMATH Keywords

planningknowledge compilationdomain modelling

Mathematics Subject Classification ID

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

Related Items (5)

Long-distance mutual exclusion for planning ⋮ On the importance of domain model configuration for automated planning engines ⋮ Engineering and compiling planning domain models to promote validity and efficiency ⋮ Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming ⋮ A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Macro-operators: A weak method for learning
• Planning for conjunctive goals
• Partial-order planning: Evaluating possible efficiency gains
• Automatically generating abstractions for planning
• Engineering and compiling planning domain models to promote validity and efficiency
• Planning in a hierarchy of abstraction spaces
• Complexity, decidability and undecidability results for domain-independent planning
• CoLab: A hybrid knowledge representation and compilation laboratory

This page was built for publication: Engineering and compiling planning domain models to promote validity and efficiency