计算机科学 ›› 2013, Vol. 40 ›› Issue (11): 291-294.

• 人工智能 • 上一篇    下一篇

分层法求强循环规划解

汪泉,文中华,伍选,唐杰   

  1. 湘潭大学信息工程学院 湘潭411105;湘潭大学信息工程学院 湘潭411105;湘潭大学信息工程学院 湘潭411105;湘潭大学信息工程学院 湘潭411105
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金项目(61070232,61272295)资助

Hierarchical Algorithm Solve Strong Cycle Planning

WANG Quan,WEN Zhong-hua,WU Xuan and TANG Jie   

  • Online:2018-11-16 Published:2018-11-16

摘要: 设计了一种求解强循环规划问题的状态分层算法。从目标状态开始,首先进行强规划分层,然后对剩余状态进行弱规划分层,并记录相应信息,最后用该信息作启发因子,在弱规划分层结果中搜索强循环规划分层。分层结束后利用分层时记录的信息可以直接得到强循环规划解。所设计的算法在求解状态动作较多的强循环规划问题时有较高的效率;且当强规划解存在时,求解效率更高,并能保证得到质量更优的强循环规划解——强规划解。实验表明,所设计的算法能够以较少的重复搜索得到强循环规划解,求解效率比反向搜索高。

关键词: 强循环规划,状态分层,不确定规划,智能规划

Abstract: A hierarchical algorithm was designed to solve strong cycle planning.Hierarchical algorithm is start with the target state,first,uses strong planning hierarchies,second,uses the weak planning hierarchies with the remaining states,and records the appropriate information,finally uses that information as a heuristic factor to search a strong cycle planning hierarchy in the result of weak planning hierarchies.After hierarchical states,information recorded can be used to get strong cycle planning solution directly.When larger state action pair exists,designed algorithm has high efficiency.When strong planning solution exists,it can owe better efficient,and can ensure a better strong cycle planning solution—strong planning solution obtained.Experiments show that designed algorithm can get strong cycle planning solution by fewer repeat searches,is better than the backward search by high efficiency.

Key words: Strong cycle planning,Hierarchical states,Nondeterministic planning,Intelligent planning

[1] Ghallab M,Nau D,Traverso P.Automated Planning Theory and Practice[M].Morgan Kaufmann Publishers,2004
[2] Cimatti A,Roved M,Traverso P.Strong planning in nondeter-ministic domains via model checking[C]∥Proceedings of the 4th International Conference on AI Planning Systems.1998:36-43
[3] Cimatti A,Roveri M.Conformant planning via symbolic model checking[J].Journal of Artificial Intelligence Research,2000,13:305-338
[4] Bertoli P,Cimatti A,Roveri M,et al.Planning in nondeterministic domains under partial observability via symbolic model checking[C]∥Proceedings of the 17th Int’l Joint Conf.on Artificial Intelligence(IJCAI 2001).Morgan Kaufmann Publishers,2001:473-478
[5] Pistore M,Traverso P.Planning as model checking for extended goals in nondeterministic domains[C]∥Proceedings of the 17th International Joint Conference on Artificial Intelligence(IJCAI’2001).2001:479-484
[6] Cimatti A,Pistore M,Roveri M,et al.Weak,strong,and strong cyclic planning via symbolic model checking[J].Artificial Intelligence,2003,47(1/2):35-84
[7] Daniele M,Traverso P,Vardi M Y.Strong cyclic planning revisited[C]∥Proceedings of the 5th European Conf.on Planning(ECP’99).London:Springer-Verlag,1999:35-48
[8] Bertoli P,Cimatti A,Roveri M,et al.Strong planning under partial observability[J].Artificial Intelligence,2006,170:337-384
[9] Rintanen J.Backward plan construction under partial observ-ability[C]∥Proceedings of the 6th Int’l Conf.on Artificial Intelligence Planning Systems(AIPS’2002).AAAI Press,2002:173-182
[10] Cimatti A,Roveri M.Conformant planning via model checking and heuristic search[J].Artificial Intelligence,2004,159(1/2):127-206
[11] Kuter U,Nau D,Reisner E,et al.Using classical planner tosolve nondeterministic[C]∥Proceedings of the 18th International Conference on Automated Planning and Scheduling(ICAPS’2008).AAAI Press,2008:190-197
[12] Fu Ji-cheng,Ng V,Bastani F B,et al.Simple and Fast Strong Planning For Fully-Observable Nondeterministic Planning Problems[C]∥Proceedings of the 22th Int’l Joint Conf.on Artificial Intelligence(IJCAI 2011).Morgan Kaufmann Publishers,2011:473-478
[13] 文中华,黄巍,刘任任,等.模型检测规划中的状态分层方法[J].软件学报,2009,20(4):858-869

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!