SHOP: Simple Hierarchical Ordered Planner

dc.contributor.authorNau, Danaen_US
dc.contributor.authorCao, Yueen_US
dc.contributor.authorLotem, Amnonen_US
dc.contributor.authorMunoz-Avia, Hectoren_US
dc.description.abstractSHOP (Simple Hierarchical Ordered Planner) is a domain-independent HTN Planning system with the following characteristics. * SHOP plans for tasks in the same order that they will later be executed. This avoids some of the goal-interaction issues that arise in other HTN planners, thus making the planning algorithm relatively simple. * The planning algorithm is sound and complete over a large class of problems. * Since SHOP knows the complete world-state at each step of the planning process, it can use highly expressive domain representations. For example, it can do planning problems that require complex numeric computations. * In our tests, SHOP solved problems several orders of magnitude faster than Blackbox and TLplan. This occured even though SHOP is written in Lisp and the other planners are written in C. (Also cross-referenced as UMIACS-TR 99-04)en_US
dc.format.extent998539 bytes
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtComputer Science Department Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3981en_US
dc.titleSHOP: Simple Hierarchical Ordered Planneren_US
dc.typeTechnical Reporten_US


Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
975.14 KB
Postscript Files