Planning for LTLf /LDLf Goals in Non-Markovian Fully Observable Nondeterministic Domains.
Ronen I. BrafmanGiuseppe De GiacomoPublished in: IJCAI (2019)
Keyphrases
- nondeterministic domains
- fully observable
- planning problems
- partial observability
- deterministic domains
- reinforcement learning
- planning domains
- partially observable
- htn planning
- symbolic model checking
- markov decision problems
- hidden state
- state space
- belief space
- plan execution
- decision processes
- domain independent
- ai planning
- markov decision process
- markov decision processes
- heuristic search
- partially observable markov decision processes
- classical planning
- belief state
- decentralized control
- dynamical systems
- planning systems
- reward function
- transition probabilities
- model checking
- search strategies
- machine learning
- reinforcement learning algorithms
- temporal logic
- dynamic environments
- stochastic domains