微信服务号

微信订阅号

2025-4-4- 11
Home > Archive>Volume 17, Issue 2, 2006 >349-355
PDF HTML XML Export Cite reminder
Goal Ordering Extraction and Abstract Method
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [21]
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    Planning is a class of complex problem. It is a way to improve the efficiency of planning algorithm in extracting and using goal orderings. Because deciding goal orderings is also PSPACE-complete, it is necessary to extract goal orderings efficiently when using goal orderings. The paper presents a method, called GOWN (goal ordering with invariants) and uses state invariants to extract goal orderings. During the process of ordering, abstraction and unification are utilized to control the increase of problem size that improves the efficiency of ordering.

    Reference
    [1]Russell S,Norvig P.Artificial Intelligence:A Modern Approach.Beijing:Posts & Telecommunications Press,
    [2]Weld DS.Recent advances in AI planning.AI Magazine,1999,20(2):93-123.
    [3]Lu RQ.Artificial Intelligence.Beijing:Science Press,2000 (in Chinese).
    [4]Ding DL,Jiang YF.Research on intelligent planning and application.Computer Science,2002,29(3):100-103 (in Chinese with English abstract).
    [5]Wu KH,Jiang YF.Planning with domain constraints based on model-checking.Journal of Software,2004,15(11):1629-1640 (in Chinese with English abstract).http://www.jos.org.cn/1000-9825/15/1629.htm
    [6]Fikes RE,Nilsson NJ.STRIPS:A new approach to the application of theorem proving to problem solving.Artificial Intelligence,1971,2(3-4):189-208.
    [7]Erol K,Nau DS,Subrahmanian VS.On the complexity of domain-independent planning.In:Swartout WR,ed.Proc.of the 10th AAAI National Conf.San Jose:AAAI Press/The MIT Press,1992.381-386.
    [8]KoehlerJ,Hoffmann J.On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm.Journal of Artificial Intelligence Research,2000,12:338-386.
    [9]Hoffmann J.Utilizing problem structure in planning:A local search approach.LNAI2854,Springer-Verlag,2003.
    [10]Chen YX,Hsu CW,Wah BW.SGPlan:Subgoal partitioning and resolution in planning.In:Proc.of the 4th Int'l Planning Competition,Int'l Conf.on Automated Planning and Scheduling.2004.30-32.
    [11]Knoblock CA.Automatically generating abstractions for planning.Artificial Intelligence,1994,68(2):243-302.
    [12]Fink E,Veloso M.Prodigy planning algorithm.Technical Report,CMU-94-123,Carnegie Mellon University,1994.
    [13]Porteous J,Sebastia L,Hoffmann J.On the extraction,ordering,and usage of landmarks in planning.In:Proc.of the 6th European Conf.on Planning (ECP 01).2001.37-48.
    [14]Gerevini A,Schubert L.Inferring state constraints for domain-independent planning.In:Proc.of the 15th National Conf.on AI and the 10th Conf.on Innovative Applications of AI.AAAI Press/The MIT Press,1998.905-912.
    [15]Fox M,Long D.The automatic inference of state invariants in TIM.Journal of Artificial Intelligence,1998,9:367-421.
    [16]Rintanen J.An iterative algorithm for synthesizing invariants.In:Proc.of the 17th National Conf.on AI and the 12th Innovative Application of AI.AAAI Press/The MIT Press,2000.806-811.
    [17]The Int'l Conf.on Automated Planning and Scheduling.http://www.icaps.org/
    [18]Blum A,Langford JC.Fast planning through planning graph analysis.Journal of Artificial Intelligence,1997,90(1-2):281-300.
    [3]陆汝钤.人工智能北京:科学出版社,2000.
    [4]丁德路,姜云飞智能规划及其应用的研究.计算机科学,2002,29(3):100-103.
    [5]吴康恒,姜云飞.基于模型检测的领域约束规划.软件学报,2004,15(11):1629-1640.http://wwwjos.org.cn/1000-9825/15/1629.htm
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

李颖,金芝.目标间顺序关系的提取及其抽象方法.软件学报,2006,17(2):349-355

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 23,2004
  • Revised:February 03,2005
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032824Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063