| Robert Wilensky. A model for planning in complex situations. Cognition and Brain Theory, IV(4), Fall 1981. |
....decomposition can be turned into a PM. Some of the ones we have been considering are abstraction hierarchies [70] 71] 72] case based planning [28] 29] 37] constraint based planners [80] 81] plan reuse [20] mixedinitiative planning [65] agent planning [2] 59] 67] and others [6] 23] [84]. The one we describe here is a distributed planning PM called the Horde Planner (HP) The HP tries to collect together a complete set of resources that can solve a problem (or a set of problems) before any resources are applied. The HP uses the information in the WKB in a planning process that ....
Robert Wilensky, "A Model for Planning in Complex Situations", Cognition and Brain Theory, Volume IV, No. 4 (1981); reprinted in pp. 263-274 in
....how a simplified version of Goodman s algorithm that only relaxes a single constraint can be incorporated into the planning paradigm) The second step is to refashion the referring expression so that it identifies the candidate chosen in the first step. This is done by using plan repair techniques [19, 45, 46]. Our technique is to identify a part of the plan that includes the constraint in error, to construct a replacement for it, and then to substitute the replacement into the old plan. This substitution undoes any decisions that were in the removed part that affect other parts of the old derivation. ....
Wilensky, Robert. "A model for planning in complex situations." Cognition and Brain Theory, 4, 1981.
....version of Goodman s algorithm that only relaxes a single constraint can be incorporated into the planning paradigm) The second step is to refashion the referring expression so that it identifies the candidate chosen in the first step. This is done by using plan repair techniques (Hayes, 1975, Wilensky, 1981, Wilkens, 1985) in which we remove the part of the plan that is in error and replan with a more appropriate action inserted in its place. As this technique has been encoded into our refashioning plans, it can be Hirst et al.: Repairing converational misunderstandings 10 used for both ....
Wilensky, Robert (1981). "A model for planning in complex situations." Cognition and Brain Theory, 4, ???--???.
....version of Goodman s algorithm that relaxes only a single constraint can be incorporated into the planning paradigm) The second step is to refashion the referring expression so that it identifies the candidate chosen in the first step. This is done by using plan repair techniques (Hayes, 1975; Wilensky, 1981; Wilkens, 1985) Our technique is to remove the subplan rooted at the action in error and replan with another action schema inserted in its place. This technique has been encoded into our refashioning plans, and so can be used for both constructing repairs and inferring how another agent has ....
Wilensky, Robert. 1981. A model for planning in complex situations. Cognition and Brain Theory, 4.
No context found.
Robert Wilensky. A model for planning in complex situations. Cognition and Brain Theory, IV(4), Fall 1981.
No context found.
Wilensky, R. 1981. A model for planning in complex situations. Cognition and Brain Theory IV(4).
No context found.
Robert Wilensky. A model for planning in complex situations. Cognition and Brain Theory, IV(4), Fall 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC