Approximate planning

DOI10.1016/0004-3702(94)00077-EMaRDI QIDQ1855231zbMATH OpenOpenAlexFDO

Authors M. L. Ginsberg

Publication date 4 February 2003

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(94)00077-e

Mathematics Subject Classification ID

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

Recommendations

• Fast planning through planning graph analysis
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Computational complexity of planning and approximate planning in the presence of incompleteness
• On the complexity of case-based planning
• Logic Programming and Nonmonotonic Reasoning

Cites work

• scientific article; zbMATH DE number 140390 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• Bilattices and Modal Operators
• Negative subgoals with free variables
• Planning for conjunctive goals
• Reasoning about action. I: A possible worlds approach
• Theory and algorithms for plan merging

Cited in

(3)

• The logical foundations of goal-regression planning in autonomous agents
• Modality and interrupts
• Theory and algorithms for plan merging

Describes a project that uses

Uses Software

• UCPOP

This page was built for publication: Approximate planning

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