Computational Complexity of Planning Based on Partial Information about the System's Present and Past States.
Chitta BaralLe-Chi TuanRaul TrejoVladik KreinovichPublished in: Computational Logic (2000)
Keyphrases
- partial information
- sensing actions
- computational complexity
- incomplete information
- planning domains
- planning problems
- special case
- ai planning
- heuristic search
- high computational complexity
- domain independent
- partial observability
- motion planning
- computationally efficient
- np hard
- initial state
- reinforcement learning
- np complete
- decision support
- computational cost
- planning systems
- search algorithm
- domain specific
- search space
- planning process
- cooperative