| Author | Gamini, D. D. A. |
| Call Number | AIT Thesis no.CS-02-02 |
| Subject(s) | Planning
|
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. CS-02-02 |
| Abstract | Over the years, forward chaining planners have fallen out of favor among the AI planning
community, and partial order planners have shown to posses a number of advantages. The
experimental results showed that forward chaining planners, by utilizing additional
information in the domain, could scale up to very larger problems in many domains. The use
of efficient domain information could make intractable planning problems tractable; in
particular, SHOP (Simple Hierarchical Ordered Planner) could be able to reconfigure 500
blocks in about 26 minutes. SHOP outperformed TLPlan in most of the domains under study.
The primary reasons for the differences in the performance of two planners are; (1) TLPlan's
planning algorithm is basically a state- space search, whereas SHOP uses HTN-style problem
reduction, and it has been established that the problem reduction can be much more efficient
than state-space search, and (2) Even though TLPlan's modal-logic representation capabilities
are quite sophisticated, their use has been limited for writing pruning heuristics rather than
actual planning algorithms |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. CS-02-02 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Phan Minh Dung; |
| Examination Committee(s) | Vilas Wuwongse ;Haddawy, Peter; |
| Scholarship Donor(s) | Government of Sri Lanka; |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 2002 |