期刊文献+

可视化析取时态推理器的设计与实现

Design and Implementation of a Visualisable Disjunctive Temporal Problem Solver
在线阅读 下载PDF
导出
摘要 时态推理是人工智能领域的重要研究方向。析取时态问题(disjunctive temporal problem,DTP)是一类表达力极强的定量时态模型,被广泛应用于智能规划和调度领域的时态建模,近年来吸引了研究人员的关注。提出DTP弱蕴含性和弱演化析取时态网络(weakly evolutional disjunctive temporal network,WEDTN)的定义,基于WEDTN设计和实现了可视化DTP求解器TRSE。系统演示发现基于WEDTN的可视化比常见的基于搜索树的可视化更能有利于人们直观理解DTP的求解算法过程、挖掘和发现问题的结构特征对求解过程的影响。 Temporal reasoning is an important research direction of Artificial Intelligence (AI). Disjunc- tive temporal problem (DTP) is an expressive quantitative temporal model which is widely used in auto- mated planning and scheduling and is therefore being well studied. The definition of weak implication and weakly evolutional disjunctive temporal network (WEDTN) is proposed. Based on the WEDTN structure a visual DTP solver TRSE is designed. The demonstration reveals that the visualization based on WEDTN better facilitates the understanding and discovery of DTP solving algorithm and the impact of structural in- formation on that than usual search tree based visualization.
出处 《中山大学学报(自然科学版)》 CAS CSCD 北大核心 2013年第6期38-43,共6页 Acta Scientiarum Naturalium Universitatis Sunyatseni
基金 国家自然科学基金资助项目(61272067 41172028) 广东省教育厅科技创新资助项目(2012KJCX0097) 梅州市科技计划资助项目(梅市科2012(14)号) 广东省自然基金团队研究资助项目(S2012030006242)
关键词 人工智能 时态推理 析取时态问题 约束可满足问题 弱演化析取时态网络 artificial intelligence temporal reasoning disjunctive temporal problem (DTP) constraint satisfaction problem (CSP) weakly evolutional disjunctive temporal network (WEDTN)
  • 相关文献

参考文献17

  • 1GHALLAB M, NAU D, TRAVERSO P. Automated plan- ning: theory and practice [ M ]. San Francisco: Morgan Kaufmann Publishers, 2004.
  • 2STERGIOU K, KOUBARAKIS M. Backtracking algo- rithms for disjunctions of temporal constraints [J]. Artifi- cial Intelligence, 2000, 120( 1 ) : 81 -117.
  • 3LIU Y, FANG Y. Boost the Integration of planning and scheduling: a heuristics approach [ J ]. Procedia Engi- neering, 2012, 29:3348-3352.
  • 4MOFFITT M D, POLLACK M E. Applying local search to disjunctive temporal problems [ C ]// IJCAI, 2005 : 242 - 247.
  • 5BLAINE NELSON T K S K. CircuitTSAT: a solver for large instances of the disjunctive temporal problem [ C ]// The Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Austral- ia, 2008 : 232 - 239.
  • 6LIU Y, JIANG Y, QIAN H. Topology-based variable or- dering strategy for solving disjunctive temporal problems [ C ]//In 15th International Symposium on Temporal Rep- resentation and Reasoning, 2008. TIME '08, 2008:129 - 136.
  • 7SCHWARTZ PETER J, POLLACK MARTHA E. Two approaches to semi-dynamic disjunctive temporal prob- lems[ C ]//ICAPS Workshop on Constraint Programming for Planning and Scheduling, Monterey, California, USA. June 2005.
  • 8MOFFITT M D. On the modelling and optimization of preferences in constraint-based temporal reasoning [ J ]. Artificial Intelligence, 2011, 175 (7/8) : 1390 - 1409.
  • 9BOERKOEL JR J C, DURFEE E H. A distributed ap- proach to summarizing spaces of muhiagent schedules [C]//In Proceedings of the 26th National Conference on Artificial Intelligence ( AAAI - 12 ), Toronto, Canada, 2012 : 1742 - 1748.
  • 10刘越畅,姜云飞,钱红.基于问题结构的启发式策略在析取时态问题求解中的应用[J].计算机研究与发展,2008,45(11):1840-1849. 被引量:4

二级参考文献20

  • 1Stergiou K, Koubarakis M. Backtracking algorithms for disjunctions of temporal constraints [C] //Proc of the 15th National Conf on Artificial Intelligence (AAAI-98). Menlo Park: AAAI Press, 1998:248-253
  • 2Federico B. Reasoning on interval and point-based disjunctive metric constraints in temporal contexts [J]. Journal of Artificial Intelligence Research, 2000, 12:35-86
  • 3Laborie P, Ghallab M. IxTeT: An integrated approach for plan generation and scheduling [C] //Proc of the 4th IEEE- INRIA Syrnp on Emerging Technologies and Factory Automation (ETFA'95). Los Alamitos: IEEE Computer Society, 1995:485-495
  • 4Weld D. An introduction to least commitment planning [J]. AI Magazine, 1994, 15(4): 27-61
  • 5Dechter R, Meiri I, Pearl J. Temporal constraint networks [J]. Artificial Intelligence, 1989, 49(1/3) : 61-95
  • 6Eddie S, Rina D. Processing disjunctions in temporal constraint networks [J]. Artificial Intelligence, 1997, 93 (1/2) : 29-61
  • 7Alessandro A, Claudio C, Enrico G. SAT based procedures for temporal reasoning [C]//Proc of the 5th European Conf on Planning. Berlin:Springer, 1999
  • 8Oddi A, Cesta A. Incremental forward checking for the disjunctive temporal problem[C]//Proc of ECAI 2000. Amsterdam: IOS Press, 2000: 108-112
  • 9Tsamardinos I, Pollack M E. Efficient solution techniques for disjunctive temporal reasoning problems [J]. Artificial Intelligence, 2003, 151(1/2) : 43-89
  • 10Alessandro A, Castellini C, Giunchiglia E, et al. Tsat++ : An open platform for satisfiability modulo theories [G] //Proc of PDPAR 2004, ENTCS, 125 (3). Amsterdam: Elsevier Science Publishers, 2004 : 25-36

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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