Temporal Constraint Networks Chapter12培训课件.ppt

Temporal Constraint Networks Chapter12培训课件.ppt

  1. 1、本文档共51页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Minimal Network Light Room Switch {o, m} {b, m, mi, a} {o, s, d} Light Room Switch {o, m} {b, m} {o, s} Constraint Tightening A unique network equivalent to original network All constraints are subsets of original constraints Provides a more explicit representation Useful in answering many types of queries IA: Path Consistency Intersection Composition (a table like 12.5 page 342) QPC-1 (page 342) Tighten every pair of constraints using Until minimal network or inconsistency detected IA: Path Consistency Composition table (page 12.5) QPC-1, in some cases, guaranteed to generate minimal network (exact) But, minimal network is not guaranteed Global consistent Backtrack free Solution: combine, at each node, backtracking scheme with path-consistency look-ahead engine Backtracking scheme with path-consistency look-ahead engine Dual graph representation Use constraints as variables Use common variables as edges Light Room Switch {o, m} {b, m} {o, s, d} {o, m} {o, s, d} {b, m, mi, a} Light Room Switch A minimal network Backtracking Path-consistency look-ahead Point Algebra [Vilain Kautz 1986] Each variable represents a time point Domain are real numbers Constraint express relative positions of 2 points Three basic relations: PQ, P=Q, PQ Constraints are PA elements {, , =} Cheaper than IA: reasoning tasks are polynomial O(n3) Point Algebra: Example Story: Fred put the paper down and drank the last of his coffee IA: Paper { s, d, f, = } Coffee PA: Paper=[x, y], Coffee=[z, t] Constraints: xy, zt, xt, x=z, y=t, yz Coffee Coffee Coffee Coffee paper paper paper paper PA: Path Consistency Algorithm is basically the same as IA Composition table (Table 12.2 page 343) ? means universal constraint Path-consistent ? minimal ? decomposable (globally consistent) Convex PA (CPA) network Only have {, =, =, =, } Exclude ? PA: Consistency Inference Theorem 12.1.10 Path-consistency decides the consistency in O(n3) Consistency and solu

您可能关注的文档

文档评论(0)

liuxiaoyu99 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档