Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems.
Alexander BotrosArmin SadeghiNils WildeJavier Alonso-MoraStephen L. SmithPublished in: CoRR (2022)
Keyphrases
- planning problems
- heuristic search
- domain independent
- state space
- mobile robot
- fully observable
- solving planning problems
- partial observability
- planning systems
- planning domains
- approximation algorithms
- deterministic domains
- ai planning
- approximation ratio
- classical planning
- reinforcement learning
- htn planning
- multi objective
- optimal solution