| 摘要: |
| 实时环境下的问题求解是近年来规划问题研究感兴趣的话题.在讨论了传统规划算法的不足之后,引入了在实时环境下求解问题的方法——任意时间算法.任意时间算法可以合理分配时间资源,保证系统最佳的输出性能；同时,任意时间算法可以在任意时刻中断,并输出当时相对最优可行解.遗传算法具有任意时间算法的特性,在介绍了同其他搜索算法的不同之处后,通过实验得出利用随机搜索技术和知识指导相结合的方法,可以较好地处理实时规划问题.最后给出结论,并且简单地讨论了实时规划算法求解问题的策略,同时讨论了今后的发展方向. |
| 关键词: 规划,任意时间算法,遗传算法,算子. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金和国家863高科技项目基金资助。 |
|
| Real-Time Problem Solving |
|
CHEN Zheng,ZHANG Bo
|
| Abstract: |
| Real-time problem solving is an interesting topic in planning in recent years. Besides discussing the deficiency of traditional planning algorithm, the authors imported the anytime algorithm, which can solve the real-time problems in this thesis. Anytime algorithm could allocate time resource reasonably to ensure the best system output performance. Anytime algorithm could be interrupted at any time and output the relatively best probable solution in that time. Genetic algorithm has the properties of the anytime algorithm. After introducing the differences between this and other search algorithms, through the experiments, the authors found that the method, which combines the random search technology and knowledge based method, could solve real-time planning problems relatively better that other methods. At last, the authors gave out the conclusion, discussed the policy of real-time planning problem solving algorithm simply, and discussed the possible developments in the future. |
| Key words: Planning, anytime algorithm, genetic algorithm, operator. |
