首页> 外文会议>International Conference on Artificial Intelligence and Pattern Recognition >A Navigation-based Algorithm for Matching Scenario Patterns
【24h】

A Navigation-based Algorithm for Matching Scenario Patterns

机译:一种基于导航的匹配方案模式的算法

获取原文

摘要

This paper presents a unified scheme for formalizing scenario patterns, which are defined as vectors of states with the corresponding temporal constraints, whereas states are represented as collections of Boolean-valued propositions whose truth-values are dependent on the time. A temporal network, called scenario graph, is introduced to graphically represent scenario patterns formalized in terms of the unified scheme. A navigation-based algorithm is proposed, and the simulation experiments demonstrate that the method can be used to match scenario graphs.
机译:本文提出了一种统一的方案,用于正式化方案模式,该方案被定义为具有相应时间限制的状态的向量,而状态表示为布尔值的命题的集合,其真实值依赖于时间。介绍了一个被称为场景图形的时间网络以图形方式表示在统一方案方面正式化的场景模式。提出了一种基于导航的算法,并且模拟实验表明该方法可用于匹配场景图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号