More and more travellers use navigation-aid software to find the way while driving. Most of todays systems use static maps with little or no information at all about currently yeilding roads conditions and disturbances in the network. It is desirable for such services in the future to include information about road works, accidents, surface conditions and other types of events that affects what route is currently the best.It is also desirable to notify users about changes in the prerequisites of the chosen route after they have started their trip. This thesis investigates methods to include dynamic traffic information in route calculations and notifying users when the characteristics change for their chosen route…
Contents
1. INTRODUCTION
1.1. BACKGROUND AND PREREQUISITES
1.2. PURPOSE AND TARGET
1.3. LIMITATIONS
2. PROBLEM AND REQUIREMENTS ANALYSIS
2.1. FINDING OPTIMAL ROUTES
2.2. DRAWING MAPS WITH DYNAMIC INFORMATION
2.3. FINDING AND NOTIFYING AFFECTED CLIENTS
2.4. POSITIONING CLIENTS
3. EXISTING TRAFFIC SERVICES
3.1. ON BOARD SYSTEMS
3.2. OFF BOARD SYSTEMS
3.3. OTHER TYPES OF SERVICES
3.4. SUMMARY OF EXISTING SERVICES
4. TRAFFIC SERVICE FUNCTIONALITY
4.1. CALCULATING OPTIMAL ROUTES
4.1.1 USING TNE ROUTING
4.1.2 USING RUTTGER
4.1.3 USAGE OF DYNAMIC INFORMATION WHEN CALCULATING WITH RUTTGER
4.2. PUSH INFORMATION USING HTML
4.3. STORING USER INFORMATION AND ROUTE DATA
4.4. FINDING AFFECTED CLIENTS
4.4.1 DIFFERENT TYPES OF INFORMATION REQUIRE DIFFERENT SELECTION ALGORITHMS
4.4.2 POSITIONING CAN ELIMINATE THOSE WHO HAVE ALREADY PASSED
4.4.3 POSITIONING CONSUMES NETWORK BANDWIDTH
4.4.4 CONTINUOUS POSITIONING
4.4.5 POSITIONING WHEN AN EVENT OCCURS
4.4.6 CAPACITY IN THE SYSTEM
4.4.7 ESTIMATION OF COSTS USING THE SERVICE FOR USERS
4.5. SUMMARY
5. ARCHITECTURE
5.1. SYSTEM OVERVIEW
5.2. USER SESSION INFORMATION FLOW
5.3. REFERENCE SYSTEMS
5.3.1 PRIMARY REFERENCE SYSTEMS
5.3.2 SECONDARY REFERENCE SYSTEM
5.4. INFORMATION FLOW AND ACTORS
5.5. SUMMARY
6. DATA SUPPLY
6.1. REQUIREMENTS ON THE AVAILABLE DATA
6.2. DATA SOURCES
6.2.1 NVDB
6.2.2 TRISS
6.2.3 TELIA SERVICE INTEGRATOR
6.2.4 COMBINING STATIC DATA FROM MANY SOURCES
6.3. DYNAMIC DATA IN ROUTE-CHOICE ALGORITHMS
7. SERVER SOLUTION
7.1. GENERAL DEMANDS
7.2. STANDARDS
7.3. WEB APPLICATION
7.4. SERVER SOFTWARE, TRISS-MONITOR
7.5. THE USER DATABASE
8. MOBILE UNIT/CLIENT
8.1. GENERAL REQUIREMENTS
8.1.1 APPLICATION LIMITATIONS WHEN CHOOSING DUMB CLIENTS
8.2. STANDARDS
8.3. CLIENT REQUIREMENTS
8.3.1 CLIENTS WEB BROWSER REQUIREMENTS
8.3.2 COMMUNICATION CHANNEL REQUIREMENTS
9. SIMULATIONS
10. SUMMARY
10.1. MINIMIZING DATA TRANSFER BETWEEN SERVER AND CLIENT
10.2. MINIMIZING THE NUMBER OF POSITIONING REQUESTS
10.3. KNOWN LIMITATIONS IN THE SYSTEM
10.4. USING DYNAMIC DATA WHEN CALCULATING ROUTES
10.5. CONCLUSION AND RECOMMENDATIONS
10.6. FUTURE WORK
APPENDIX A. POSITIONING METHODS
APPENDIX B. COORDINATE SYSTEMS
REFERENCES
Author: Löfås, Peter
Source: Linköping University
Download URL 2: Visit Now