Using satisfiability for non-optimal temporal planning

DOI10.1007/978-3-642-33353-8_14MaRDI QIDQ2915070zbMATH OpenOpenAlexFDO

Authors Masood Feyzbakhsh Rankooh, Ali Mahjoob, Gholamreza Ghassem-Sani

Publication date 21 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-33353-8_14

zbMATH Keywords

AI planningsatisfiability checkingsimple temporal networkstemporal planning

Mathematics Subject Classification ID

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

Recommendations

• ITSAT: An Efficient SAT-Based Temporal Planner
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Friends or foes? On planning as satisfiability and abstract CNF encodings
• SAS+ planning as satisfiability

Cites work

• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Fast planning through planning graph analysis
• scientific article; zbMATH DE number 2038893 (Why is no real title available?)
• scientific article; zbMATH DE number 2038905 (Why is no real title available?)
• Logics in Artificial Intelligence
• Managing concurrency in temporal planning using planner-scheduler interaction
• Temporal constraint networks
• The FF planning system: Fast plan generation through heuristic search
• Theory and Applications of Satisfiability Testing

Cited in

(2)

• On the computational complexity of temporal projection, planning, and plan validation
• ITSAT: An Efficient SAT-Based Temporal Planner

Describes a project that uses

Uses Software

• MiniSat
• Walksat
• PDDL
• Graphplan
• VHPOP
• LPG

This page was built for publication: Using satisfiability for non-optimal temporal planning

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