In this paper we present EasyTransport, a tool that offers effective navigation and/or transportation advice to travelers in wide geographic areas. Unlike most existing navigational and transportation advisory systems that utilize predefined paths connecting transition points and produce answers based on static information, EasyTransport uses no precompiled knowledge to generate the respective paths. The tool's underlying algorithm is based on the breadth-first-search (BFS) algorithm and traces dynamically feasible routes on a terrain. Our rationale is to reduce the number of nodes representing the possible points for a transition and thus the complexity of EasyTransport's operation. Since our algorithm functions with increasingly coarse geographic granularities, it can achieve its successful termination fast. We, furthermore, suggest heuristics that effectively manage the potentially enormous data sets in the geographic areas involved EasyTransport, is a highly interactive system that allows for easy querying and features flexible adaptation and presentation of the generated answers, ensures short response times, and offers useful getting-a round-and-how guidelines.
[1]
R L Gordon,et al.
Traffic Control Systems Handbook
,
1996
.
[2]
G. Kramer.
Envisioning a radar-based automatic road transportation system
,
2001
.
[3]
Christian Bettstetter.
TOWARD INTERNET–BASED CAR COMMUNICATIONS: ON SOME SYSTEM ARCHITECTURE AND PROTOCOL ASPECTS
,
2000
.
[4]
Daniel J. Dailey,et al.
MyBus: Helping Bus Riders Make Informed Decisions
,
2001,
IEEE Intell. Syst..
[5]
R. K. Shyamasundar,et al.
Introduction to algorithms
,
1996
.
[6]
W H Kraft.
TRANSPORTATION MANAGEMENT CENTER FUNCTIONS
,
1998
.
[7]
S. Spraggs,et al.
Traffic Engineering
,
2000
.
[8]
Erik Guttman,et al.
Service Location Protocol: Automatic Discovery of IP Network Services
,
1999,
IEEE Internet Comput..