On plan adaptation through planning graph analysis

DOI10.1007/3-540-46238-4_31MaRDI QIDQ2729757zbMATH OpenFDO

Authors Alfonso E. Gerevini, Ivan Serina

Publication date 23 October 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46238-4_31

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 5906473
• Fast planning through planning graph analysis
• scientific article; zbMATH DE number 49438
• scientific article; zbMATH DE number 1448981
• Modification strategies for SAT-based plan adaptation

Cited in

(12)

• Using regression-match graphs to control search in planning
• Anytime search in dynamic graphs
• Graph planning with expected finite horizon
• Planning from second principles
• Action failure recovery via model-based diagnosis and conformant planning
• scientific article; zbMATH DE number 5906473 (Why is no real title available?)
• scientific article; zbMATH DE number 4174367 (Why is no real title available?)
• Modification strategies for SAT-based plan adaptation
• On the complexity of plan adaptation by derivational analogy in a universal classical planning framework
• Methods and Applications of Artificial Intelligence
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Kernel functions for case-based planning

Describes a project that uses

Uses Software

• Walksat

This page was built for publication: On plan adaptation through planning graph analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729757)