On the Computational Complexity of Temporal Projection, Planning, and Plan Validation.
Bernhard NebelChrister BäckströmPublished in: Artif. Intell. (1994)
Keyphrases
- computational complexity
- plan execution
- plan generation
- planning process
- ai planning
- temporal planning
- planning domains
- automated planning
- plan recognition
- planning tasks
- temporal constraints
- planning problems
- planning systems
- partial order planning
- heuristic search
- classical planning
- domain independent planning
- durative actions
- constraint reasoning
- case based planning
- plan repair
- decision theoretic
- optimal plans
- np complete
- temporal data
- temporal patterns
- planning graph
- spatio temporal
- partial order planner
- unexpected events
- strips planning
- reactive planning
- temporal reasoning
- special case
- np hard
- state space
- plan quality
- spatial and temporal
- world model
- linear temporal logic
- multi agent planning
- blocks world
- decision problems
- rate distortion
- orders of magnitude
- stochastic domains
- motion planning
- production planning
- temporal relations
- computationally efficient
- bit rate
- x ray
- computational cost
- hierarchical task network
- conditional plans
- search algorithm
- high computational complexity