I. INTRODUCTION
1
II. PROBLEM STATEMENT online map that allows authority of Flagstaff,
Arizona marks walkable areas to school, at the
Existing digital pedestrian map is able to moment, only for Sechrist Elementary school.
optimize the shortest route based on pedestrian- The portal can be referred to by parents whose
oriented physical attributes but largely ignorant children walk or cycle to school [8].
of route safety. In light of growing safety
concern, routes in future digital map may be
annotated with safety index to extend its
functionality from traditional navigation to a
safety advisory system.
2
pedestrians [17]. Two early intelligent tour and TABLE I. RISKS PROBABILITY FOR PEDESTRIAN INJURY
3
A. Algorithms B. Database Tables.
Djikstra is used to determine the shortest route The data of nodes, paths, key paths and results
since the choice of algorithm did not have are kept in a relational database management
implication on the research objective. Given a system (RDBMS) for persistency and
weighted graph G (that is a set V of vertices, a set extensibility when the data grow in volume.
E of edges, and a real-valued weight function f : Fig. 7 shows the relationship of the tables:
E → R), and one element v of V, a path P from v Path table (Fig. 5) - contains two
to a v' of V is given by a minimal ∑f(p), pєP adjacent nodes, safety annotation and
among all paths connecting v to v' [19]. other display information.
Node table (Fig. 6) - contains display
The Djikstra algorithm is as follows: information and metadata required for
DO
route computation.
Choose a node to be the root. Best_route table - cache containing a
Mark it as relaxed.
Check if there is any adjacent node AND not
string result of shortest route algorithm
relaxed. applied on Path and Node datasets. The
IF yes THEN string contains interconnecting nodeIDs.
Of all the adjacent nodes, choose the
closest.
Update the node’s distance from root
Update the distance of all the nodes
adjacent to the chosen node.
Mark the chosen node as relaxed.
ELSE
Back trace every relaxed node to the root.
Update the Path table.
ENDIF
UNTIL(all nodes are evaluated as root nodes)
4
Figure 9: Web input form
Figure 7: Entity Relationship Diagram (ERD) Eventually, the query returns a string of unique
node ID that forms the connecting paths. To
C. Architecture acquire details of each node, the system refers to
the “Node” table, as in Fig. 6.
The 3-tier web application consists of the
following (see Fig. 8):
Tier 1 - web browser on a desktop or
mobile phone using XHTML and Flash
client.
Tier 2 – Route determination using PHP
scripts running on Apache
Tier 3 - MySQL RDBMS to store path
data and result.
ActionScript
HTTP and PHP Server
GSM/GPRS/3G
MYSQL Server
Data Entry
Interface
Key_path
Table
Administrator
Best_route
Node Table Path Table
table
Database
Database table that Database table
table that Database
stores nodes that stores
stores Details table that
and distances optimal routes
of individual stores sounds
between determined by
node of main paths
nodes the algorithm
5
VI. RESULT AND DISCUSSION
No
VII. CONCLUSION
ACKNOWLEDGEMENT
6
REFERENCES March 2008, SAC '08: Proceedings of the 2008 ACM
symposium on Applied computing.
[1] W. Seager, D. S. Fraser,"Comparing physical, automatic
and manual map rotation for pedestrian navigation", [17] M. Jöst, et. al.,"Multimodal interaction for pedestrians:
April 2007, CHI '07: Proceedings of the SIGCHI an evaluation study", January 2005, IUI '05:
conference on Human factors in computing systems. Proceedings of the 10th international conference on
Intelligent user interfaces.
[2] Yahoo! Maps, 2009. February 10th 2009.
<http://maps.yahoo.com> [18] S. Fickas et. al., "Route-Finding Assistances for
Community Travelers with Cognitive Impairments: A
[3] MapQuest, 2009. February 10th 2009. Comparison of Four Prompt Modes", September 2007,
<http://www.mapquest.com/directions> 9th International Conference on Human Computer
Interaction with Mobile Devices and Services
[4] Microsoft MapPoint, 2009. February 10th 2009.
<http://www.microsoft.com/mappoint > [19] John Morris, “Dijkstra's Algorithm”, Data Structures
and Algorithms, 1998. 19 March,
[5] "Pedestrian Navigation Continues to March Towards 2008.<http://www.cs.auckland.ac.nz/software/AlgAnim/
Mainstream Adoption", LBS Insight, 24-6-2009, 17 dij-op.html>
December 2009. <http://www.lbsinsight.com=?id1360>