---
title: "Going Far, Logically"
authors:
  - "Fusun Yaman"
  - "Dana S. Nau"
  - "V. S. Subrahmanian"
doi: ""
url: "https://ijcai.org/proceedings/2005/151"
pdf: "https://ijcai.org/proceedings/2005/0151.pdf"
venue: "Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence"
year: 2005
pages: "615-619"
track: ""
keywords:
---

# Going Far, Logically

Fusun Yaman, Dana S. Nau, V. S. Subrahmanian

*Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence*, pages 615-619.

## 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.