{"type":"ScholarlyArticle","title":"Going Far, Logically","authors":[{"name":"Fusun Yaman","slug":"fusun-yaman","given":"Fusun","family":"Yaman","affiliation":""},{"name":"Dana S. Nau","slug":"dana-s-nau","given":"Dana S.","family":"Nau","affiliation":""},{"name":"V. S. Subrahmanian","slug":"v-s-subrahmanian","given":"V. S.","family":"Subrahmanian","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/151","pdf":"https://ijcai.org/proceedings/2005/0151.pdf","markdown":"https://ijcai.org/proceedings/2005/151.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/151","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":151,"pages":{"first":615,"last":619},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}