期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Anytime算法的最优响应时间

The Optimal Response Time of Anytime Algorithm
下载PDF
导出
摘要 Anytime算法能够折衷解的质量和计算时间 ,被广泛地用在实时人工智能系统中 .为保证在截止期到来之际得到的解是可接受的 ,Anytime算法应能够足够快地响应环境的变化 ,输出当前最优解 .文中描述了环境状态变化模型和随机截止期模型 ,探讨了在变化的领域中 Anytime算法的最优响应时间 . Anytime algorithm offers a tradeoff between solution quality and computation time that has been proved useful in real-time artificial intelligence systems. To ensure anytime algorithm indeed produce results of acceptable quality by the deadlines, it is necessary that they must response quickly enough to meet dynamic environment and act on the currently best-so-far solution. This paper describes the mode of the change of environment and stochastic deadline, and addresses the analysis of optimal response time for anytime algorithm in the dynamic domains. The final section of this paper introduces possible research in the future.
作者 郭亚军 陈丽华
机构地区 华中师范大学计算机科学系
出处 《武汉理工大学学报（交通科学与工程版）》 北大核心 2003年第3期381-383,共3页 Journal of Wuhan University of Technology（Transportation Science & Engineering）
关键词 ANYTIME算法 随机截止期 响应时间 anytime algorithm stochastic deadline response time
分类号 TP18 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献8

  • 1郭亚军,叶俊民.复合Anytime算法的性能描述的生成[J].武汉理工大学学报（交通科学与工程版）,2002,26(6):800-803. 被引量：1
  • 2Boddy M, Dean T L. Deliberation scheduling for problem solving in time-constrained environments.Artificial Intelligence, 1994,67(2) : 245-285.
  • 3Zilberstein S, Russell S J. Optimal composition of real-time systems. Artificial Intelligence, 1996,82(1/2):181-213.
  • 4Russell S J, Wefald E H. Principles of metareasoning. Artificial Intelligence, 1991,49(1):361-395.
  • 5Finkelstein L, Markovitch S. Optimal schedules for monitoring anytime algorithms. Artificial Intelligence, 2001,126(2) :63-108.
  • 6Zilberstein S. Using anytime algorithms in intelligent systems. AI Magazine, 1996,17(3):73-83.
  • 7Hansen E A, Zilberstein S. Monitoring and control of anytime algorithms: a dynamic programming approach. Artificial Intelligence, 2001,126(1/2) : 139-157.
  • 8liu S, Kernighan B W. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 1973(21):598-516.

二级参考文献5

  • 1[1]Boddy M,Dean T L. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 1994, 67( 2):245～285
  • 2[2]Zilberstein S, Russell S J. Optimal composition of real-time systems. Artificial Intelligence, 82 (1/2), 1996, 181～213
  • 3[3]Zilberstein S. Using anytime algorithms in intelligent systems. AI Magazine, 1996, 17 (3):73～83
  • 4[4]liu S, Kernighan B W. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 1973(21): 598～516
  • 5[5]Finkelstein L, Markovitch S. Optimal schedules for monitoring anytime algorithms, Artificial Intelligence, 2001,126(2):63～108
武汉理工大学学报（交通科学与工程版）
2003年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部