On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification: Technical Report.
Gregor BehnkeMarcel SteinmetzPublished in: CoRR (2024)
Keyphrases
- technical report
- computational complexity
- planning problems
- game theory
- special case
- goal oriented
- neural network
- memory requirements
- np complete
- computational cost
- computationally efficient
- verification method
- asynchronous circuits
- low complexity
- storage requirements
- meta level
- np hard
- action selection
- meta reasoning
- stochastic domains
- data sets
- blocks world
- formal verification
- high computational complexity
- planning systems
- formal methods
- face verification
- planning domains
- bit rate
- computational efficiency
- domain independent
- model checking
- heuristic search