Going Far, Logically

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

Going Far, Logically

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

Download BibTeX Cite

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.

Fusun Yaman, Dana S. Nau, and V. S. Subrahmanian. 2005. Going Far, Logically. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 615–619. https://ijcai.org/proceedings/2005/151

@inproceedings{ijcai2005p151,
  title     = {Going Far, Logically},
  author    = {Yaman, Fusun and Nau, Dana S. and Subrahmanian, V. S.},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {615--619},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/151},
}

TY  - CPAPER
TI  - Going Far, Logically
AU  - Yaman, Fusun
AU  - Nau, Dana S.
AU  - Subrahmanian, V. S.
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 615
EP  - 619
UR  - https://ijcai.org/proceedings/2005/151
ER  -