Heuristics for planning with penalties and rewards formulated in logic and computed through circuits

DOI10.1016/J.ARTINT.2008.03.004MaRDI QIDQ2389669zbMATH OpenOpenAlexFDO

Authors Blai Bonet, Hector Geffner

Publication date 17 July 2009

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10230/36436

zbMATH Keywords

planningknowledge compilationplanning heuristicsplanning with rewards

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Logic in artificial intelligence (68T27)

Recommendations

• An LP-Based Heuristic for Optimal Planning
• Improving delete relaxation heuristics through explicitly represented conjunctions
• Set-structured and cost-sharing heuristics for classical planning
• Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
• Solving delete free planning with relaxed decision diagram based heuristics

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 5547823 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 2000818 (Why is no real title available?)
• scientific article; zbMATH DE number 1467489 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• A heuristic search approach to planning with temporally extended preferences
• Answer set programming and plan generation
• Compiling propositional weighted bases
• Decomposable negation normal form
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Extending and implementing the stable model semantics
• Fast planning through planning graph analysis
• Knowledge Representation, Reasoning and Declarative Problem Solving
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Planning as heuristic search
• Propositional semantics for disjunctive logic programs
• Sokoban: Enhancing general single-agent search methods using domain knowledge
• The FF planning system: Fast plan generation through heuristic search
• The computational complexity of propositional STRIPS planning
• Using regression-match graphs to control search in planning

Cited in

(3)

• Declarative formalization of reasoning strategies: A case study on heuristic nonlinear planning
• Anytime heuristic search for partial satisfaction planning
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners

Describes a project that uses

Uses Software

• NMRDPP
• Graphplan
• Chaff
• Walksat
• ASSAT
• CP-nets

This page was built for publication: Heuristics for planning with penalties and rewards formulated in logic and computed through circuits

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