View Document Preview and Link Document Date: 2004-04-15 15:35:21 Open Document File Size: 124,16 KB Share Result on Facebook
City San Diego / / Company CNF / ARPA/Rome Laboratory / 3M / / Currency pence / / / Event Reorganization / / Facility Arizona State University / University of Alberta / Beek’s CSP library / CSP library / Engineering Arizona State University / / IndustryTerm search process / heuristic search / Compilation-based planning systems / backward search algorithm / backward search / explanation-guided search / backward search phase / valid solution / directional search / nondirectional search / shorter solutions / search techniques / partial consistency enforcement algorithms / directional backward search / Temporal constraint networks / backward search process / non-directional search / level search / search branch / stochastic search / search phase / / OperatingSystem Unix / LINUX / / Organization Subbarao Kambhampati Department of Computer Science / National Science Foundation / University of Alberta / Arizona State University / In Artificial Intelligence / / Person Peter van Beek / Nat / Morgan Kaufmann / van Beek / / / Position investigator / model the planning / CSP-based resource scheduler / doing arcconsistency enforcement vs. forward / implemented planner / / Product M72 / C-0247 / / ProvinceOrState Alberta / Manitoba / California / / PublishedMedium Journal of Artificial Intelligence Research / / Technology RAM / SpaceBounded Larning Algorithms / Linux / Unix / partial consistency enforcement algorithms / Graphplan algorithm / Graphplan algorithm Graphplan algorithm / artificial intelligence / CSP algorithms / planning algorithm / backward search algorithm / / URL http / SocialTag 
Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ[removed]Email: fbinhminh,[removed]