arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0909.0122cs.AI
收藏

基于拓扑和方向空间信息的推理

Reasoning with Topological and Directional Spatial Information

University of Technology, Sydney(悉尼科技大学);University of Leeds(利兹大学)

Sanjiang Li, Anthony G. Cohn

摘要:

目前定性空间表示和推理的研究主要集中在空间的一个方面。然而,在现实世界的应用中,往往同时涉及多个空间方面。本文研究了结合拓扑和方向信息的推理中出现的问题。我们使用RCC 8代数和矩形代数(RA)分别表示拓扑和方向信息。我们给出的例子表明,bipath-consistency算法BIPATH是不完整的,即使是基本的RCC 8和RA的约束。如果拓扑约束取自RCC 8的一些最大易处理的子类,方向约束取自RA的一个子代数,称为DIR 49,那么我们证明BIPATH能够分离拓扑约束和方向约束。这意味着,给定一组来自RCC 8和RA的上述子类的混合拓扑和方向约束,我们可以将多项式时间内的联合满意度问题转化为RCC 8和RA中的两个独立满意度问题。对于一般的RA约束,我们给出了一种方法来计算解决方案,满足所有的拓扑约束和近似满足每个RA约束到任何指定的精度。

英文摘要:

Current research on qualitative spatial representation and reasoning mainly focuses on one single aspect of space. In real world applications, however, multiple spatial aspects are often involved simultaneously. This paper investigates problems arising in reasoning with combined topological and directional information. We use the RCC8 algebra and the Rectangle Algebra (RA) for expressing topological and directional information respectively. We give examples to show that the bipath-consistency algorithm BIPATH is incomplete for solving even basic RCC8 and RA constraints. If topological constraints are taken from some maximal tractable subclasses of RCC8, and directional constraints are taken from a subalgebra, termed DIR49, of RA, then we show that BIPATH is able to separate topological constraints from directional ones. This means, given a set of hybrid topological and directional constraints from the above subclasses of RCC8 and RA, we can transfer the joint satisfaction problem in polynomial time to two independent satisfaction problems in RCC8 and RA. For general RA constraints, we give a method to compute solutions that satisfy all topological constraints and approximately satisfy each RA constraint to any prescribed precision.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑