David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Complexity Results for HTN Planning - Erol, Hendler, Nau (1995) (10 citations) (Correct)
....ONR grant N0001491 J 1451. Any opinions, ndings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily re ect the views of the National Science Foundation or ONR. noah(Sacerdoti, 1975) nonlin (Tate, 1977) deviser (Vere, 1983) and sipe (Wilkins, 1988)) Until now, there has been very little analytical work on the properties of HTN planners. One of the primary obstacles impeding such work has been the lack of a clear theoretical framework explaining what a HTN planning system is, although two recent papers (Yang, 1990; Kambhampati et al. ....
Wilkins, D. Practical Planning: Extending the Classical AI Planning Paradigm, Morgan-Kaufmann 1988.
Knowledge Analysis on Process Models - Kim, Gil (2001) (Correct)
....produced by plan editing tools. Formal analyses of partial order and hierarchical planning algorithms define some desirable properties of plans, such as justifiability and correctness [Kambhampati, Knoblock, Yang, 1995; Yang, 1990; Tate, 1996] Generative planners such as SIPE, NOAH,andNONLIN [Wilkins, 1988; Sacerdoti, 1977; Tate, 1977] use critics that detect problems in the plans that they generate while planning. Much of the work on planning does not exploit background knowledge and ontologies, which we believe is crucial technology to advance the state of the art in process modeling. We have ....
Wilkins, D. E. 1988. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann.
Efficient BDD-based Search for Planning - Jensen (2001) (Correct)
....is shown in Figure 8 and is divided into four groups according to its use of bdds and the type of target domain. Previous work on deterministic planning, not using bdds, include state space planners (e.g. prodigy [51] plan space planners (e.g. ucpop [58] and hierarchical planners (e.g. SIPE [59]) In prodigy a plan is generated from a single state bidirectional search guided by control rules. Ucpop, on the other hand, carries out a search in the space of possible plans guided by the least commitment principle where orderings between actions only are introduced if the actions are causally ....
....In conjunctive partitioning, A is only introduced once. For this reason it is still worthwhile to investigate if more powerful conjunctive partitionings exist for deterministic planning. 4. 5 Abstraction Abstract and hierarchical search are a classical approaches in deterministic planning [55, 59, 26, 58]. The main idea is to reduce the search complexity by first solving the planning problem in an abstract search space and then refining each abstract search step to a sequential plan. We have been working on defining abstract search spaces for deterministic bdd based planning where each transition ....
D. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufman, 1988.
The 1998 AI Planning Systems Competition - McDermott (2000) (5 citations) (Correct)
....2. An ADL track: Classical planning with an enhanced notation allowing actions with quantified preconditions and context dependent effects[12] 3. Hierarchical planning: A classical domain, but with explicitly given compound actions (canned plans) that the planner must be able to reason about ([5, 14]) 4. Reactive planning: Planning in a complex simulated domain, such as the Phoenix fire fighting simulator [7] 2 PDDL The Planning Domain Definition Language The PDDL language was designed to be a neutral specification of planning problems. Neutral means that it doesn t favor any ....
....to the planner in advance. The anti advice people succeeded in arguing that this one number constituted an enormous hint. Among other things, it tells the planner that a solution exists. In other cases, the disagreement became an impasse. For example, many hierarchical planners (especially SIPE [14]) give deductive rules a procedural interpretation, so that they are used in only one direction. P oe Q is interpreted to mean that Q is caused by P , which then gets generalized to Execute Q whenever P becomes true. This can be a very directed way of getting a planner to do something, and ....
David Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann Publishers, Inc, 1988. 33
Multiagent Planning Architecture - MPA Version 1.8 - Wilkins, Myers, desJardins, al. (2001) Self-citation (Wilkins) (Correct)
....agent of the planning cell. A Schedule ctem message is specific to the ACP planning domain and causes the planner to translate the current plan to CTEM, run CTEM, and translate the results back. The Ping and PCD messages are handled by all agents. The domain independent SIPE 2 planning system [15, 16] and the Advisable Planner [8] have been used as the basis for the planner agents in all our demonstrations. SIPE 2 has a precise notion of a planning level, and plan critics that fit naturally into the above scheme. To serve as an MPA planner agent, SIPE 2 had to be modularized, separating out ....
David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988.
Multiagent Planning Architecture - Wilkins (2001) (27 citations) Self-citation (Wilkins) (Correct)
....agent of the planning cell. A Schedule ctem message is specific to the ACP planning domain and causes the planner to translate the current plan to CTEM, run CTEM, and translate the results back. The Ping and PCD messages are handled by all agents. The domain independent SIPE 2 planning system [14, 15] and the Advisable Planner [8] have been used as the basis for the planner agents in all our demonstrations. SIPE 2 has a precise notion of a planning level, and plan critics that fit naturally into the above scheme. To serve as an MPA planner agent, SIPE 2 had to be modularized, separating out ....
David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988.
Automatically Generating Abstractions for Problem Solving - Knoblock (1991) (56 citations) (Correct)
No context found.
David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA, 1988.
Evaluating the Tradeoffs in - Partial-Order Planning Algorithms (Correct)
No context found.
David Wilkins. Practical planning: extending the classical AI planning paradigm. Morgan Kaufmann, CA, 1988.
Planning with Primary Eects: Experiments and Analysis - Eugene Fink Computer (1995) (Correct)
No context found.
David Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann, CA, 1988.
Characterizing and Automatically Finding Primary Effects in.. - Fink, Yang (1993) (1 citation) (Correct)
No context found.
David Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann, CA, 1988.
Automatically Selecting and Using Primary Effects in Planning.. - Fink, Yang (1994) (Correct)
No context found.
David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA, 1988.
Search Reduction in Planning with Primary Effects - Fink, Yang (1994) (Correct)
No context found.
David Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann, CA, 1988.
Anytime Deliberation For Computer Game Agents - Hawes (2003) (Correct)
No context found.
Wilkins, D. E. (1988). Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann Publishers Inc.
Applications of SHOP and SHOP2 - Dana Nau University (Correct)
No context found.
David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA, 1988.
Enhancing HTN Planning as Satisfiability - Mali (Correct)
No context found.
David Wilkins, Practical planning: Extending the classical AI planning paradigm, Morgan Kaufmann, 1988.
Encoding HTN Planning in Propositional Logic - Mali, Kambhampati (1998) (5 citations) (Correct)
No context found.
David Wilkins, Practical planning: Extending the classical AI planning paradigm, Morgan Kaufmann, 1988.
Hierarchical Task Network Planning as Satisfiability - Mali (2003) (Correct)
No context found.
David Wilkins, Practical planning: Extending the classical AI planning paradigm, Morgan Kaufmann, 1988. 17
Heuristics for HTN Planning as Satisfiability - Mali (Correct)
No context found.
David Wilkins, Practical planning: Extending the classical AI planning paradigm, Morgan Kaufmann, 1988.
Efficient BDD-Based Planning for Non-Deterministic.. - Jensen (2003) (Correct)
No context found.
D. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufman, 1988.
A Scalable, Reusable Spoken Conversational - Tutor Scot Karl (Correct)
No context found.
Wilkins, D. (1988). Practical Planning: Extending the Classical AI Planning Paradigm. San Mateo, CA: Morgan Kaufmann.
Using Temporal Logics to Express Search Control Knowledge.. - Bacchus, Kabanza (1999) (61 citations) (Correct)
No context found.
David Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, California, 1988. 78
An Artificial Intelligence Planner for Satellite Operations - Md Moreno Borrajo (Correct)
No context found.
Wilkins D.E. Practical Planning Extending the classical AI planning paradigm. Morgan-Kaufmann. 1988.
A Neural Network decision module for the Adaptive Strategic.. - Kalyviotis, Hu (2002) (Correct)
No context found.
D. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann Publishers, California, 1988.
On Planning to Plan: Metaplanning Concepts in the.. - Bhargava, Kimbrough.. (1997) (Correct)
No context found.
WILKINS,D.E.Practical Planning: Extending the Classical AI Planning Paradigm.The Morgan Kaufmann Series in Representation and Reasoning. Morgan Kaufmann Publishers, Inc., 2929 Campus Drive, San Mateo, CA 94403, 1988. ISBN: 0-934613-94-X.
TCLP: a temporal causal link planner with disjunctive .. - Wozniak, Taillibert, .. (Correct)
No context found.
D.E. Wilkins. "Practical Planning: Extending the classical AI planning paradigm", Eds Morgan Kaufmann, 1988
First 50 documents Next 50
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