A weighted CSP approach to cost-optimal planning

DOI10.3233/AIC-2010-0473zbMath1233.68205OpenAlexW1719051695MaRDI QIDQ3102050

Marie de Roquemaurel, Martin C. Cooper, Pierre Régnier

Publication date: 1 December 2011

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-2010-0473

zbMATH Keywords

optimal planningplanning graphsoft constraintssoft arc consistency

Mathematics Subject Classification ID

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

Related Items (4)

Super-reparametrizations of weighted CSPs: properties and optimization perspective ⋮ Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction ⋮ Variable and value elimination in binary constraint satisfaction via forbidden patterns

Uses Software

• Walksat
• CPlan

This page was built for publication: A weighted CSP approach to cost-optimal planning