Blum, A. and Furst, M. (1997). Fast planning through graph analysis. Arti cial Intelligence, 90:281 - 300. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
An Investigation into the Computational Complexity of Planning in .. - Haslum (1998) (Correct)
Heuristic Planning with Time and Resources - Haslum, Geffner (2001) (10 citations) (Correct)
Heuristic Planning with Time and Resources - Haslum, Geffner (2001) (10 citations) (Correct)
An On-Line Planner for MARIE - Terpstra, Visser, Hertzberger (2001) (Correct)
Partial-Order Planning with Concurrent Interacting Actions - Boutilier (2001) (7 citations) (Correct)
Decision Theoretic Planning: Structural Assumptions and.. - Boutilier, Dean, Hanks (1999) (150 citations) (Correct)
Extending TALplanner with Concurrency and Resources - Kvarnström, Doherty, Haslum (2000) (6 citations) (Correct)
Structured Reachability Analysis for Markov Decision.. - Boutilier, Brafman, Geib (1998) (10 citations) (Correct)
Integrating a Temporal Planner With a Path Planner for a.. - Brigitte Lamare (Correct)
Structured Reachability Analysis for Markov Decision.. - Boutilier, Brafman, Geib (1998) (10 citations) (Correct)
Anytime Deliberation For Computer Game Agents - Hawes (2003) (Correct)
PAO* for Planning with Hidden State - Dave Ferguson Anthony (2004) (Correct)
Multi-Agent Planning with Planning Graph - Bui, Jamroga (2003) (Correct)
Decision-Theoretic Planning: Structural Assumptions and.. - Boutilier, Dean, Hanks (1999) (150 citations) (Correct)
Decision-Theoretic Planning: Structural Assumptions and.. - Boutilier, Dean, al. (1999) (150 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC