分层法求强循环规划解  

Hierarchical Algorithm Solve Strong Cycle Planning

作　　者：汪泉[1] 文中华[1] 伍选 唐杰[1] 

机构地区：[1]湘潭大学信息工程学院,湘潭411105

出　　处：《计算机科学》2013年第11期291-294,共4页Computer Science

基　　金：国家自然科学基金项目(61070232;61272295)资助

摘　　要：设计了一种求解强循环规划问题的状态分层算法。从目标状态开始,首先进行强规划分层,然后对剩余状态进行弱规划分层,并记录相应信息,最后用该信息作启发因子,在弱规划分层结果中搜索强循环规划分层。分层结束后利用分层时记录的信息可以直接得到强循环规划解。所设计的算法在求解状态动作较多的强循环规划问题时有较高的效率;且当强规划解存在时,求解效率更高,并能保证得到质量更优的强循环规划解———强规划解。实验表明,所设计的算法能够以较少的重复搜索得到强循环规划解,求解效率比反向搜索高。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 efficien- cy. When strong planning solution exists, it can owe better efficient, and can ensure a better strong cycle planning solu- tio^strong planning solution obtained. Experiments show that designed algorithm can get strong cycle planning solu- tion by fewer repeat searches, is better than the backward search by high efficiency.

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

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]