FATES: Finding a time dEpendent shortest path

Hae Don Chon, Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

We model a moving object as a sizable physical entity e-quipped with GPS, wireless communication capability, and a computer. Based on a grid model, we develop a distributed system, FATES, to manage data for moving objects in a two-dimensional space. The system is used to provide time-dependent shortest paths for moving objects. The performance study shows that FATES yields shorter average trip time when there is a more congested route than any other routes in the domain space.

Original languageEnglish
Pages (from-to)165-180
Number of pages16
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2574
Publication statusPublished - 1 Dec 2003
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this