Academic Journal
Factored planning using decomposition trees
| العنوان: | Factored planning using decomposition trees |
|---|---|
| المؤلفون: | Elena Kelareva, Olivier Buffet, Jinbo Huang, Sylvie Thiébaux |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://www.ijcai.org/papers07/Papers/IJCAI07-313.pdf. |
| بيانات النشر: | Morgan Kaufmann |
| سنة النشر: | 2007 |
| المجموعة: | CiteSeerX |
| الوصف: | Improving AI planning algorithms relies on the ability to exploit the structure of the problem at hand. A promising direction is that of factored planning, where the domain is partitioned into subdomains with as little interaction as possible. Recent work in this field has led to an detailed theoretical analysis of such approaches and to a couple of high-level planning algorithms, but with no practical implementations or with limited experimentations. This paper presents dTreePlan, anew generic factored planning algorithm which uses a decomposition tree to efficiently partition the domain. We discuss some of its aspects, progressively describing a specific implementation before presenting experimental results. This prototype algorithm is a promising contribution—with major possible improvements—and helps enrich the picture of factored planning approaches. 1 |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.7391; http://www.ijcai.org/papers07/Papers/IJCAI07-313.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.7391 http://www.ijcai.org/papers07/Papers/IJCAI07-313.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.49EDA257 |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |