STAN4: A hybrid planning strategy based on subproblem abstraction

AI Magazine

Volumn 22, Issue 3, 2001, Pages 81-84

  Fox, M ^a   Long, D ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PLANNING; PROBLEM SOLVING; RESOURCE ALLOCATION;

ROUTE PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 0035442649     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (12)

1. Using Temporal Logic to Express Search Control Knowledge for Planning
2. Fast planning through planning graph analysis
3. A robust and fast action selection mechanism for planning
4. Algorithm 97: Shortest path
5. Hybrid SWAN: Identifying and managing combinatorial optimization subproblems in planning
6. The automatic inference of state invariants in TIM
7. Automatic synthesis and use of generic types in planning
8. Extracting route planning: First steps in automatic problem decomposition workshop on analyzing and exploiting domain knowledge for efficient planning
9. The efficient implementation of the plan-graph in STAN