Going far, logically

Authors:
Fusun Yaman;Dana Nau;V. S. Subrahmanian
Affiliations:
Department of Computer Science, University of Maryland Institute for Advanced Computer Studies, Institute for Systems Research, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland Institute for Advanced Computer Studies, Institute for Systems Research, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland Institute for Advanced Computer Studies, Institute for Systems Research, University of Maryland, College Park, MD
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 2

Introduction to Solid Modeling

Introduction to Solid Modeling
Default reasoning about spatial occupancy

Artificial Intelligence
Spatio-Temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases

Geoinformatica
A spatio-temporal logic for the specification and refinement of mobile systems

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering

Probabilistic go theories

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
An AGM-style belief revision mechanism for probabilistic spatio-temporal logics

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are numerous applications where we need to ensure that multiple moving objects are sufficiently far apart. Furthermore, in many moving object domains, there is positional indeterminacy--we are not 100% sure exactly when a given moving object will be at a given location. [Yaman et al., 2004] provided a logic of motion but did not provide algorithms to ensure that moving objects are kept sufficiently far apart. In this paper, we extend their logic to include a "far" predicate. We develop the CheckFar algorithm that checks if any given two objects will always be sufficiently far apart at during a time interval. We have run a set of experiments showing that our CheckFar algorithm scales very well.