On Ordering Spatio-Temporal Sequences to meet Transition Constraints

Time and space are fundamental concepts of study in Artificial Intelligence and, in particular, Knowledge Representation. In this paper, we investigate the task of ordering a temporal sequence of qualitative spatial configurations to meet certain transition constraints. This ordering is constrained by the use of conceptual neighbourhood graphs defined on qualitative spatial constraint languages. In particular, we show that the problem of ordering a sequence of qualitative spatial configurations to meet such transition constraints is NP-complete for the the well known languages of RCC-8, Interval Algebra, and Rectangle Algebra. Our results lie within the area of Graph Traversal and allow for many practical and diverse applications, such as identifying optimal routes in mobile robot navigation, modelling changes of topology in biological processes, and computing sequences of segmentation steps used in image processing algorithms.

[1]  Anthony G. Cohn,et al.  A Spatial Logic based on Regions and Connection , 1992, KR.

[2]  Peter van Beek,et al.  Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..

[3]  Till Mossakowski,et al.  Algebraic Properties of Qualitative Spatio-temporal Calculi , 2013, COSIT.

[4]  Max J. Egenhofer,et al.  The Family of Conceptual Neighborhood Graphs for Region-Region Relations , 2010, GIScience.

[5]  Maribel Yasmina Santos,et al.  Conceptual neighborhood graphs for topological spatial relations , 2009 .

[6]  Shyamanta M. Hazarika,et al.  Qualitative Spatio-Temporal Representation and Reasoning: Trends and Future Directions , 2012 .

[7]  Bernhard Nebel,et al.  Transition Constraints: A Study on the Computational Complexity of Qualitative Change , 2013, IJCAI.

[8]  Anthony G. Cohn,et al.  Qualitative Simulation Based on a Logical Formalism of Space and Time , 1992, AAAI.

[9]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[10]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[11]  Gérard Ligozat,et al.  Weak Composition for Qualitative Spatial and Temporal Reasoning , 2005, CP.

[12]  Travé-Massuyès.  Conceptual Neighborhood and its role in temporal and spatial reasoning , 1991 .

[13]  Bernhard Nebel,et al.  Efficient Methods for Qualitative Spatial Reasoning , 2001, J. Artif. Intell. Res..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .