Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0983.68181
Do, M.B.; Kambhampati, S.
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP.
(English)
[J] Artif. Intell. 132, No.2, 151-182 (2001). ISSN 0004-3702

Summary: The idea of synthesizing bounded length plans by compiling planning problems into a combinatorial substrate, and solving the resulting encodings has become quite popular in recent years. Most work to-date has however concentrated on compilation to SATisfiability (SAT) theories and Integer Linear Programming (ILP). In this paper we will show that CSP is a better substrate for the compilation approach, compared to both SAT and ILP. We describe GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding and solving it using standard CSP solvers. Our comprehensive empirical evaluation of GP-CSP demonstrates that it is superior to both the Blackbox system, which compiles planning graphs into SAT encodings, and an ILP-based planner in a wide range of planning domains. Our results show that CSP encodings outperform SAT encodings in terms of both space and time requirements in various problems. The space reduction is particularly important as it makes GP-CSP less susceptible to the memory blow-up associated with SAT compilation methods. The paper also discusses various techniques in setting up the CSP encodings, planning specific improvements to CSP solvers, and strategies for variable and value selection heuristics for solving the CSP encodings of different types of planning problems.
MSC 2000:
*68T20 Problem solving

Keywords: planning; CSP compilation; constraint satisfaction; graphplan; encodings; EBL

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster