| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 105 === This Research developed a more navigation plan path algorithm, and create a more paths planning system, the algorithm will be in driving historical data as directed planning path to take advantage of driving modem for cutting and matrix, Generate K path, and this research consider a road driving time, driving fuel economy, comfort, the algorithm using K-means methods, collect path of calcs its roads in driving time interval, fuel economy range of this study design with three paths recommended ratings of mode, the user can follow the requirements for different algorithms feedback data and feedback data contains K paths recommended sequence and the corresponding estimated driving time, fuel economy..
To build driving database, this research developed a data processing methods and data processing method will first to match & cut method to capture each run time driving the in conjunction with C^+ matrix storage module to the modem for cutting and reassembly, Last transfer station import into a database to build driving database.
This research for the algorithm to analyze that time, fuel economy, comfort this three user is relevant, but it actually three difference is only less obvious, and there is no absolute relevance, ongoing use hbase gather how much data analysis bus and how much time and money on selected, if time error in less than one hour, students are common will select bus spreads.
|
|---|
