Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!satisfied.elf.com!news.mathworks.com!hookup!ames!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, Plan Adaptation...
Message-ID: <1995Jan26.182414.2404@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 57
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Thu, 26 Jan 1995 18:24:14 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

JAIR is pleased to announce the publication of the following article:

Hanks, S. and Weld, D.S. (1995)
  "A Domain-Independent Algorithm for Plan Adaptation", Volume 2, 
   pages 319-360. 
   PostScript:  volume2/hanks95a.ps (500K)

   Abstract: The paradigms of transformational planning, case-based
   planning, and plan debugging all involve a process known as plan
   adaptation --- modifying or repairing an old plan so it solves a new
   problem.  In this paper we provide a domain-independent algorithm for
   plan adaptation, demonstrate that it is sound, complete, and
   systematic, and compare it to other adaptation algorithms in the
   literature.
   
   Our approach is based on a view of planning as searching a graph of
   partial plans.  Generative planning starts at the graph's root and
   moves from node to node using plan-refinement operators.  In planning
   by adaptation, a library plan---an arbitrary node in the plan
   graph---is the starting point for the search, and the plan-adaptation
   algorithm can apply both the same refinement operators available to a
   generative planner and can also retract constraints and steps from the
   plan.  Our algorithm's completeness ensures that the adaptation
   algorithm will eventually search the entire graph and its systematicity 
   ensures that it will do so without redundantly searching any parts of
   the graph.


The PostScript file is available via:
   
 -- comp.ai.jair.papers

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html

 -- Anonymous FTP from either of the two sites below:
      CMU:   p.gp.cs.cmu.edu        directory: /usr/jair/pub/volume2
      Genoa: ftp.mrg.dist.unige.it  directory:  pub/jair/pub/volume2

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND, and the body GET VOLUME2/HANKS95A.PS
    (either upper or lowercase is fine). 
    Note: Your mailer might find this file too large to handle.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, check out our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.


