Elly Winner, Manuela Veloso  Home/Search
Context
Related
| cmu.edu/anon/2003/CMUCS03101.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/anon/2003/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Intelligent problem solving requires the ability to select actions autonomously from a specific state to reach objectives. Planning algorithms provide approaches to look ahead and select a complete sequence of actions. Given a domain description consisting of preconditions and effects of the actions the planner can take, an initial state, and a goal, a planning program returns a sequence of actions to transform the initial state into a state in which the goal is statisfied. Classical planning... (Update)
Similar documents (at the sentence level): More
26.6%: Acquiring Domain-Specific Planners by Example - Elly Winner Manuela (Correct)
13.1%: Analyzing Plans with Conditional Effects - Winner, Veloso (2002) (Correct)
12.9%: Automatically Acquiring Planning Templates from Example Plans - Winner, Veloso (2002) (Correct)
Active bibliography (related documents): More All
0.6: Towards Synthesis of Reactive & Robust Behavior Chains - Mali (Correct)
0.6: DISTILL: Learning Domain-Specific Planners by Example - Elly Winner Elly (Correct)
0.3: Using Genetic Programming to Learn and Improve Control.. - Aler, Borrajo, Isasi (2002) (Correct)
Similar documents based on text: More All
0.3: Vision-Servoed Localization and Behavior-Based.. - Veloso, Winner.. (2000) (Correct)
0.2: Multi-Fidelity Robotic Behaviors: Acting With Variable State.. - Winner, Veloso (Correct)
0.2: OBDD-based Universal Planning in Multi-Agent, Non-Deterministic.. - Jensen (1999) (Correct)
BibTeX entry: (Update)
@misc{ winner-acquiring,
author = "Elly Winner and Manuela Veloso",
title = "Acquiring Domain-Specific Planners by Example",
url = "citeseer.ist.psu.edu/article/winner03acquiring.html" }
Citations (may not include all citations):891 Strips: a new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
388 Inductive logic programming - Muggleton - 1991
376 Fast planning through planning graph analysis - Blum, Furst - 1997
313 Inductive logic programming: Theory and methods - Muggleton, De Raedt - 1994
288 Planning in a hierarchy of abstraction spaces (context) - Sacerdoti - 1974
225 Learning and executing generalized robot plans (context) - Fikes, Hart et al. - 1972
213 Universal plans for reactive robots in unpredictable environ.. - Schoppers - 1987
186 partial-order planner for adl (context) - Penberthy, Weld et al. - 1992
182 An introduction to least commitment planning - Weld - 1994
117 Generalized plan recognition (context) - Kautz, Allen - 1986
113 Automatically generating abstractions for planning - Knoblock - 1994
99 Planning and Learning by Analogical Reasoning (context) - Veloso - 1994
71 Macro-operators: A weak method for learning (context) - Korf - 1985
67 KIDS: A knowledge-based software development system - Smith - 1991
65 Case-Based Reasoning: experiences (context) - Leake - 1996
58 Acquiring search-control knowledge via static analysis - Etzioni - 1993
57 Learning abstraction hierarchies for problem solving - Knoblock - 1990
51 Automatic OBDD-based generation of universal plans in non-de.. - Cimatti, Roveri et al. - 1998
46 Fundamentals of deductive program synthesis - Manna, Waldinger - 1992
45 Planning and metaplanning (context) - Ste - 1981
45 Chef: A model of case-based planning (context) - Hammond - 1996
44 Strategy learning with multilayer connectionist representati.. - Anderson - 1987
44 Machine Learning (context) - Mitchell - 1997
40 Selectively generalizing plans for problem-solving (context) - Minton - 1985
40 Postponing threats in partial-order planning (context) - Smith, Peot - 1993
36 The concept and implementation of skeletal plans (context) - Friedland, Iwasaki - 1985
35 Strong planning in non-deterministic domains via model check.. - Cimatti, Roveri et al. - 1998
30 Learning planning operators by observation and practice - Wang - 1994
25 Learning explanation-based search control rules for partial .. - Katukam, Kambhampati - 1994
21 Learning action strategies for planning domains - Khardon - 1999
20 Nonlinear planning with parallel resource allocation - Veloso, erez et al. - 1990
16 dynamic-world problems in the classical planning framework (context) - Pednault - 1986
16 OBDD-based universal planning for synchronized agents in non.. - Jensen, Veloso - 2000
16 Acquiring recursive and iterative concepts with explanation-.. - Shavlik - 1990
15 Towards a general framework for composing disjunctive and it.. (context) - Shell, Carbonell - 1989
12 The AIPS-98 planning competition (context) - Long - 2000
11 Programming by examples (context) - Bauer - 1979
11 Knowledge acquisition by generating skeletal plans from real.. - Bergmann - 1992
10 ective Search Control Knowledge: An Explanation-Based Approa.. (context) - Minton - 1988
10 ective Search Control Knowledge: An Explanation-Based Approa.. (context) - Minton - 1988
9 Relational reinforcement learning (context) - so, zeroski et al. - 1998
8 Decision tree function approximation in reinforcement learni.. - Pyeatt, Howe - 1998
7 A model for planning in complex situations (context) - Wilensky - 1981
7 ects in graphplan (context) - Anderson, Smith et al. - 1998
6 Complete determination of parallel actions and temporal opti.. (context) - Regnier, Fade - 1991
6 The lumberjack algorithm for learning linked decision forest.. - Uther, Veloso - 2000
6 Suspending recursion in causal-link planning - Smith, Peot - 1996
5 Learning by experimentation: The operator re nement method (context) - Carbonell, Gil - 1990
4 Relational reinforcement learning - Driessens - 2001
4 Prodigyanalogy Analogical reasoning general problem solving - Prodigy, reasoning et al. - 1994
4 Learning to program by examining and modifying cases (context) - Williams - 1988
4 Inductive Synthesis of Functional Programs (context) - Schmid - 2001
3 Programming by Demonstration: a Machine Learning Approach - Lau - 2001
3 Flexible Reuse and Modi cation in Hierarchical Planning: A V.. (context) - Kambhampati - 1989
2 a group socialization theory of development (context) - Harris, the et al. - 1995
2 Analyzing plans with conditional e ects (context) - Winner, Veloso - 2002
2 Mitsubishi Electric Research Laboratories Cambridge Research.. (context) - Rich, Waters et al. - 1992
2 A validation-structure-based theory of plan modi cation and .. (context) - Kambhampati, Hendler - 1992
2 Automatically acquiring planning templates from example plan.. - Winner, Veloso - 2002
1 Finding least constrained plans and optimal parallel executi.. (context) - ackstr - 1993
1 A uni ed framework for explanation-based generalization of p.. (context) - Kambhampati, Kedar - 1994
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/2003/): More
A Type System for Well-Founded Recursion - Dreyer, Harper, Crary (2003) (Correct)
Approximation Schemes for Flow Time on Multiple Machines - Bansal (2003) (Correct)
Protecting Privacy in Key-Value Search Systems - Xie, O'Hallaron, Reiter (2003) (Correct)
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