Automated Hierarchy Discovery for Planning in Partially Observable Domains
Planning in partially observable domains is a notoriously difficult problem. However, in many real-world scenarios, planning can be simplified by decomposing the task into a hierarchy of smaller planning problems which, can then be solved independently of one another. Several approaches, mainly deal...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/2665 |
Search Result 1
