On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification.
Gregor BehnkeMarcel SteinmetzPublished in: ICAPS (2024)
Keyphrases
- computational complexity
- np complete
- model checking
- meta level
- heuristic search
- blocks world
- formal verification
- domain independent
- computationally efficient
- decision support
- special case
- low complexity
- face verification
- ai planning
- mixed initiative
- high computational complexity
- plan generation
- game theory
- planning problems
- plan recognition
- goal oriented
- nash equilibria
- planning process
- video sequences