碩士 / 元智大學 / 資訊工程學系 / 102 / This study developed a time-saving navigation route planning algorithm, and built a route planning system, this algorithm was using historical driving data as the basic for route planning, by the "match" and "cut" to achieve the result of k-routes, also, this study considered the factors about congestion and traveling time and so on, this algorithm uses K-means methodology to clustered the predict travelling time interval by historical driving data, include the smoothest time and congestion time, in this study we designed three route recommend and appraisal method, users could get different result by their requirement. The feedback information include: the K-recommended routes and the corresponding predict traveling time.
For building the database of driving data, this study developed an auto-data collection and its processing method, the auto-data collection include using Android application, which could collect driving data and OBD-II's data automatically, and the data processing method will do Match&;Cut method to extract history driving track in each time, and cut and match the data by the A* matrix, in the last, the data will transpose and store in to database.
This study carry out the analysis and verification for the traveling time of recommended routes, the results showed the accuracy of complete route was 63.69%, the route after once-connect was 55%, we compare the result with Yen's algorithm and Google map, we obtain that our study is a reasonable recommend route.
| Identifer | oai:union.ndltd.org:TW/102YZU05392047 |
| Creators | Cheng-Da Huang, 黃承達 |
| Contributors | Hsiu Hsen Yao, 姚修慎 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 74 |
Page generated in 0.0482 seconds