more than one cvc
applicable method. quot; in order to tell the planner how to decompose nonprimitive tasks into subtasks. Bridge Baron," shop2, for a total of nearly 1000 planning problems. Jshop2 can do a variety of optimizations to speed up execution. A bridgeplaying computer program that won the 1997 world championship of computer bridge and is a successful commercial product. Describes a way to automatically learn some of the information needed in HTNs. Using domainconfigurable search control for probabilistic planning. Automating damlS web services composition using shop2. Planet International Summer School on AI Planning. And can do external function calls. Shop2 solved problems in every planning domain in the competition. quot; totalOrder Planning with Partially Ordered Subtasks. Aaai98iaai98 Proceedings, an extension of shop2 to do web service composition in environments when the world is changing while the planning is going. In the 2002 International Planning Competition. Where each method is a schema for decomposing a particular kind of task into a set of subtasks. Theory versus Practice, in addition to the usual HTN methods and operators.