home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #16 / NN_1992_16.iso / spool / comp / ai / 2932 < prev    next >
Encoding:
Text File  |  1992-07-30  |  920 b   |  30 lines
  1. Newsgroups: comp.ai
  2. Path: sparky!uunet!sun-barr!sh.wide!wnoc-tyo-news!etl.go.jp!etlss2!nakashim
  3. From: nakashim@etl.go.jp (Hideyuki Nakashima)
  4. Subject: class of planners
  5. Message-ID: <NAKASHIM.92Jul31155258@uranus.etl.go.jp>
  6. Sender: news@etl.go.jp (News System)
  7. Nntp-Posting-Host: uranus
  8. Organization: Electrotechnical Laboratory
  9. Date: Fri, 31 Jul 1992 06:52:58 GMT
  10. Lines: 18
  11.  
  12.  
  13. I am interested in classification of problems for general planners
  14. (like STRIPS, WARPLAN, NOAR, TWEAK).  Any information or pointers to
  15. literature are welcome.
  16.  
  17. There seem to be classes like
  18.  
  19. linear        subgoals can be solved one by one
  20. nonlinear    subgoals are interconnected
  21. nonmonotonic    subgoals once achieved must be destroyed later
  22.  
  23. For example, "tower of Hanoi" problem is nonmonotonic.  I am not sure
  24. if there exists any GENERAL planner which can solve the problem.
  25.  
  26. --
  27. $@EE;R5;=QAm9g8&5f=j(J $@6(D4%"!<%-%F%/%A%c7W2h<<(J
  28. $@CfEg=(G7(J
  29.  
  30.