Planning as heuristic search

Artificial Intelligence

Volumn 129, Issue 1-2, 2001, Pages 5-33

  Bonet, Blai ^a   Geffner, Héctor ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

Domain independent heuristics; Forward backward search; Graphplan; Heuristic search; Non optimal planning; Planning; Strips

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; STRATEGIC PLANNING;

DECLARATIVE LANGUAGES; HILL-CLIMBING SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0035369022     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00108-4     Document Type: Article

References (46)

1. Conditional effects in Graphplan
2. Fast planning through planning graph analysis
3. Planning as heuristic search: New results
4. Using temporal logics to express search control knowledge for planning
5. A robust fast action selection mechanism for planning
6. An algorithm for solving the job shop problem
7. Pattern databases
8. STRIPS: A new approach to the application of theorem proving to problem solving
9. Functional Strips: A more general language for planning and problem solving
10. Inferring state constraints for domain-independent planning
11. Limited discrepancy search
12. Admissible heuristics for optimal planning
13. A space-time tradeoff for memory-based heuristics
14. A heuristic for domain independent planning, and its use in an enforced hill-climbing algorithm
15. Constraint satisfaction using constraint logic programming
16. Domain-dependent single-agent search enhancements
17. Distance based goal ordering heuristics for Graphplan
18. Extending planning graphs to an ADL subset
19. Depth-first iterative-deepening: An optimal admissible tree search
20. Real-time heuristic search
21. Linear-space best-first search
22. Finding optimal solutions to Rubik's Cube using pattern databases
23. Pushing the envelope: Planning, propositional logic, and stochastic search
24. Unifying SAT-based and Graph-based planning
25. Finding optimal solutions to the Twenty-Four Puzzle
26. The efficient implementation of the plan-graph in STAN
27. Utilizing automatically inferred invariants in graph construction and search
28. Planning with sharable resources constraints
29. A heuristic estimator for means-ends analysis in planning
30. Using regression-match graphs to control search in planning
31. The 1998 AI planning systems competition
32. Extracting effective and admissible heuristics from the planning graph
33. GPS: A program that simulates human thought
34. ADL: Exploring the middle ground between Strips and the situation calculus
35. Machine discovery of effective admissible heuristics
36. A planning algorithm not based on directional search
37. GRT: A domain independent heuristic for Strips Worlds based on greedy regression tables
38. Fast recursive formulations for BFS that allow controlled used of memory
39. CPlan: A constraint programming approach to planning
40. An introduction to least commitment planning