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

Moving Objects
Shortest path
Computer Communication Networks
Global positioning system
Time-average
Wireless Communication
Distributed Systems
Communication
Grid
Model

ASJC Scopus subject areas

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

Cite this

FATES : Finding a time dEpendent shortest path. / Chon, Hae Don; Agrawal, Divyakant; El Abbadi, Amr.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2574, 01.12.2003, p. 165-180.

Research output: Contribution to journalArticle

@article{51b98c0c1b8b4c749ba917d874873be2,
title = "FATES: Finding a time dEpendent shortest path",
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.",
author = "Chon, {Hae Don} and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2574",
pages = "165--180",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - FATES

T2 - Finding a time dEpendent shortest path

AU - Chon, Hae Don

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2003/12/1

Y1 - 2003/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=35248830086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248830086&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35248830086

VL - 2574

SP - 165

EP - 180

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -