Solving sequential planning problems via constraint satisfaction

DOI10.3233/FI-2010-242MaRDI QIDQ3568269zbMATH OpenFDO

Authors Roman Bartak, Daniel Toropila

Publication date 17 June 2010

Full work available at URL https://doi.org/10.3233/FI-2010-242

zbMATH Keywords

constraint modelsliftingplanningredundant constraintssearch strategysymmetry breaking

Mathematics Subject Classification ID

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

Recommendations

• Constraint based planning with composable substate graphs
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Planning as satisfiability: heuristics
• Planning as satisfiability: parallel plans and algorithms for plan search

Cited in

(9)

• A feedback transformation of the planning problems
• AI planning in a constraint programming framework
• Iterative Plan Construction for the Workflow Satisfiability Problem
• Encoding domain transitions for constraint-based planning
• Constraint based planning with composable substate graphs
• Cost-constrained planning for concurrency satisfaction
• Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic
• scientific article; zbMATH DE number 1759718 (Why is no real title available?)
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

Describes a project that uses

Uses Software

• CPlan

This page was built for publication: Solving sequential planning problems via constraint satisfaction

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