Efficient flexible planning via dynamic flexible constraint satisfaction

Engineering Applications of Artificial Intelligence

Volumn 14, Issue 3, 2001, Pages 301-327

  Miguel, Ian ^a   Shen, Qiang ^a   Jarvis, Peter ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONSTRAINT THEORY; DATA STRUCTURES; HIERARCHICAL SYSTEMS; PROBLEM SOLVING;

CONSTRAINT SATISFACTION PROBLEM; GRAPHPLAN FRAMEWORK;

ARTIFICIAL INTELLIGENCE;

EID: 0035369506     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0952-1976(01)00014-8     Document Type: Article

References (46)

1. Integrating planning, execution and monitoring
2. DPPlan: An algorithm for fast solutions extraction from a planning graph
3. Using inference to reduce arc consistency computation
4. Fast planning through planning graph analysis
5. Probabilistic planning in the graphplan framework
6. Static and completion analysis for knowledge acquisition, validation, and maintenance of planning knowledge bases
7. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
8. Belief maintenance in dynamic constraint networks
9. Probabilistic planning with information gathering and contingent execution
10. Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty
11. TRIPS: An intelligent integrated problem-solving assistant
12. Strips: A new approach to the application of theorem proving to problem solving
13. Dynamic backtracking
14. Conditional linear planning
15. Epsilon-safe planning
16. Increasing tree search efficiency for constraint satisfaction problems
17. Flexible blackbox
18. Planning graph as (dynamic) CSP: Exploiting EBL, DDB and other CSP techniques in graphplan
19. Unifying SAT-based and graph-based planning
20. State-space planning by integer optimization
21. AI planning systems in the real world
22. Extending planning graphs to an ADL subset
23. An algorithm for probabilistic planning
24. Branch-and-bound methods: A survey
25. Efficient implementation of the plan graph in STAN
26. Consistency in networks of relations
27. Flexible graphplan
28. Hard, flexible and dynamic constraint satisfaction
29. Dynamic flexible constraint satisfaction
30. Dynamic constraint satisfaction problems
31. Arc and path consistency revisited
32. Structure and properties of leximin FCSP and its influence on optimisation problems
33. Generating qualitatively different plans through metatheoretic biases
34. ADL: Exploring the middle ground between strips and the situation calculus
35. Conditional non-linear planning
36. Planning for contingencies: A decision based approach
37. Valued constraint satisfaction problems: Hard and easy problems
38. Conformant graphplan
39. Total-order multi-agent task-network planning for contract bridge
40. Generation of multiple qualitatively different plans
41. Solution reuse in dynamic constraint satisfaction problems
42. Applying integer programming to ai planning
43. Recent advances in AI planning
44. A multiagent planning architecture