Factored cost-optimal planning using message passing algorithms

DOI10.3233/FI-2015-1239MaRDI QIDQ2805473zbMATH OpenOpenAlexFDO

Authors Loïg Jezequel, Eric Fabre

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1239

zbMATH Keywords

concurrencyweighted automatafactored planningnetworks of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Management decision making, including multiple objectives (90B50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A weighted CSP approach to cost-optimal planning
• New islands of tractability of cost-optimal planning
• Domain-independent cost-optimal planning in ASP
• scientific article; zbMATH DE number 1931659
• Constraint based planning with composable substate graphs

This page was built for publication: Factored cost-optimal planning using message passing algorithms

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