Combining topological and size information for spatial reasoning

Information about the size of spatial regions is often easily accessible and, when combined with other types of spatial information, it can be practically very useful. In this paper we introduce four classes of qualitative and metric size constraints, and we study their integration with the Region C...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Artificial intelligence Ročník 137; číslo 1; s. 1 - 42
Hlavní autori: Gerevini, Alfonso, Renz, Jochen
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.05.2002
Predmet:
Artificial intelligence
Computational complexity
Constraint satisfaction
Constraint-based reasoning
Region Connection Calculus
Spatial reasoning
Constraint satisfaction
Constraint-based reasoning
Spatial reasoning
Computational complexity
Region Connection Calculus
ISSN:0004-3702, 1872-7921
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Information about the size of spatial regions is often easily accessible and, when combined with other types of spatial information, it can be practically very useful. In this paper we introduce four classes of qualitative and metric size constraints, and we study their integration with the Region Connection Calculus RCC-8, a well-known approach to qualitative spatial reasoning with topological relations. We propose a new path-consistency algorithm for combining RCC-8 relations and qualitative size relations. The algorithm is complete for deciding satisfiability of an input set of topological constraints over one of the three maximal tractable subclasses of RCC-8 containing all the basic relations. Moreover, its time complexity is cubic and is the same as the complexity of the best-known method for deciding satisfiability when only these topological relations are considered. We also provide results on finding a consistent scenario in cubic time for these combined classes. Regarding metric size constraints, we first study their combination with RCC-8 and we show that deciding satisfiability for the combined sets of constraints is NP-hard, even when only the RCC-8 basic relations are used. Then we introduce RCC-7, a subalgebra of RCC-8 that can be used for applications where spatial regions cannot partially overlap. We show that reasoning with the seven RCC-7 basic relations and the universal relation is intractable, but that reasoning with the RCC-7 basic relations combined with metric size information is tractable. Finally, we give a polynomial algorithm for the latter case and a backtracking algorithm for the general case.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0004-3702
1872-7921
DOI:10.1016/S0004-3702(02)00193-5