CN106225793A - navigation algorithm based on experience - Google Patents
navigation algorithm based on experience Download PDFInfo
- Publication number
- CN106225793A CN106225793A CN201610511118.XA CN201610511118A CN106225793A CN 106225793 A CN106225793 A CN 106225793A CN 201610511118 A CN201610511118 A CN 201610511118A CN 106225793 A CN106225793 A CN 106225793A
- Authority
- CN
- China
- Prior art keywords
- path
- experience
- time
- algorithm based
- navigation algorithm
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
Abstract
The present invention provides navigation algorithm based on experience, including: search corresponding result path according to current location and destination；According to the result path obtained and the empirical path of the time match different time dimension of trip；Contrast mileage and time that the empirical path obtained is spent, it is carried out ascending sort；Select the minimum or the shortest path of mileage according to demand.The invention has the beneficial effects as follows: this navigation algorithm calls data base and the most deposited experience route, restrictive condition plus information such as real-time road, restricted driving and peak periods on and off duty, destination according to user's input and consider the specific of user and to have, match applicable path to select for user, and then shorten navigation time.
Description
Technical field
The present invention relates to technical field of automobile navigation, particularly relate to navigation algorithm based on experience.
Background technology
Existing a lot of path navigation algorithm: A* algorithm, dijkstra's algorithm, Floyd algorithm etc..
A* algorithm: A* algorithm, A* (A-Star) algorithm is to solve shortest path most efficient method in a kind of static road network, estimates
Be worth with actual value obtain closer to, evaluation function the best；Dijkstra's algorithm: be typical signal source shortest path algorithm,
For one node of calculating to the shortest path of other all nodes, it is mainly characterized by centered by starting point outwards expanding layer by layer
Exhibition, until expanding to terminal；Floyd algorithm: be a kind of for finding in given weighted graph shortest path between many source points
The algorithm in footpath.
Existing major part algorithm is the most complicated, and is all the shortest target the most optimum of the space length with path,
But in practice, not only the demand of user is various, and it is likely to be due to the road conditions of road, restricted driving, vehicle peak on and off duty
Etc. determine and uncertain factor, thus most save time and meet user's request in the shortest path.
Summary of the invention
It is an object of the invention to provide navigation algorithm based on experience, solve above-mentioned one or many of the prior art
Individual.
The present invention provides navigation algorithm based on experience, including:
1) corresponding result path is searched according to current location and destination；
2) according to the result path obtained and the empirical path of the time match different time dimension of trip；
3) contrast mileage and the time that the empirical path obtained is spent, it is carried out ascending sort；
4) the minimum or the shortest path of mileage is selected according to demand.
In some embodiments, step 1) also include, input starting point, trip date and vehicle tail number；Input mesh
Ground；Mate situation of restricting driving the same day.
In some embodiments, step input starting point, trip date and vehicle tail number also include that user is the most defeated
Enter to specify starting point or be appointed as starting point by the position that is presently in of user, GPS positioning function location.
In some embodiments, step 2) also include, time data is divided into the legal festivals and holidays, day off at weekend with
And three sections of time datas on working day；One day is divided into working peak period, comes off duty peak period and three time periods of idle phase, formed
Time dimension.
In some embodiments, step 2) also include, first mate the experience section of the period of nearest three days, if coupling
Number of passes do not reach setting value, then at the empirical path of period in Upward match a nearest week or nearest month,
Until the empirical path bar number of coupling reaches setting value.
In some embodiments, the setting value in coupling experience section is 20.
The invention has the beneficial effects as follows: this navigation algorithm calls data base and the most deposited experience route, add real-time road,
Restrict driving and the restrictive condition of the information such as peak period on and off duty, according to the destination of user's input and consider user's
Specific to have, and matches applicable path and selects for user, and then shortens navigation time.
Accompanying drawing explanation
Fig. 1 is the flow chart of present invention navigation algorithm based on experience.
Detailed description of the invention
The present invention is further detailed explanation below in conjunction with the accompanying drawings.
The navigation algorithm based on experience that the present invention provides, comprises the following steps:
Step 1: search corresponding empirical data according to starting and terminal point, trip date, concrete time period and car owner's tail number.
Starting point i.e. starting point, user is manually entered and specifies starting point or position what user was presently in by GPS positioning function
Position is appointed as starting point, terminal i.e. destination and is inputted appointment by user.Automobile tail number on the same day is checked according to the trip date
Road restricted driving situation, and the section of restricted driving is cast out, obtain corresponding result path.
Step 2: extract pass.In result path, some paths are serious due to midway traffic congestion, and vehicle is the most forward
Travel, it is impossible to start electromotor, then wait of stopping working, these path datas can be uploaded in data base always.When selecting result
Behind path, call data base, then path the most flame-out in result path is got rid of, draw empirical path.
Step 3: the time dimension on coupling trip date.Time data is cut into different time dimensions, first the time
Data are divided into legal festivals and holidays, three sections of time datas of day off at weekend and working day, then one day are divided into peak of going to work, come off duty
Peak and three time periods of idle phase, form time dimension.Calculate which time dimension the trip date falls at.
Step 4: the data word segment table of coupling traffic information.Transfer starting point to the road conditions of destination and (check the most several
Day road situation, if road all passes through within the next few days, this road can pass through, on the contrary no thoroughfare) and peak period on and off duty
The crowded road conditions of road, get rid of the poor path in empirical path；
Step 5: according to the empirical path of time match different dimensions to be gone on a journey.Time period coupling difference according to trip
The empirical path of dimension, first mates the time period recently, limits and the most at least mates how many empirical path, if the road of coupling
Footpath very little, then one week of Upward match or the empirical path of this period of one month, until the experience that coupling is enough
Path (such as sets and at least needs to mate 20 present period empirical path, and mate path within the next few days and only have 5, then exist
One week of Upward match, not enough at the coupling empirical path of nearly month, by that analogy until having 20 and being
Only).
Step 6: the mileage of contrast traveling and the time of cost.The mileage that spent of empirical path that contrast obtains and time
Between, it is carried out ascending sort；
Step 7: select mileage and cost time the most relatively short path.The time choosing mileage and cost is forward the most relatively
Several few empirical path select required (example: mileage number and cost time the most less forward each three displays for user
Select for user at the page).
Above-described is only some embodiments of the present invention.For the person of ordinary skill of the art, not
On the premise of departing from the invention design, it is also possible to making some deformation and improvement, these broadly fall into the protection model of the present invention
Enclose.
Claims (6)
1. navigation algorithm based on experience, wherein, comprises the following steps:
1) corresponding result path is searched according to current location and destination；
2) according to the result path obtained and the empirical path of the time match different time dimension of trip；
3) contrast mileage and the time that the empirical path obtained is spent, it is carried out ascending sort；
4) the minimum or the shortest path of mileage is selected according to demand.
Navigation algorithm based on experience the most according to claim 1, wherein, step 1) also include, input starting point, trip
Date and vehicle tail number；Input destination；Mate situation of restricting driving the same day.
Navigation algorithm based on experience the most according to claim 2, wherein, step input starting point, trip the date and
Vehicle tail number also includes that user is manually entered the position specified starting point or be presently in by GPS positioning function location user
It is appointed as starting point.
Navigation algorithm based on experience the most according to claim 1, wherein, step 2) also include, time data is split
Become legal festivals and holidays, day off at weekend and three sections of time datas on working day；One day is divided into working peak period, peak period of coming off duty
And three time periods of idle phase, form time dimension.
Navigation algorithm based on experience the most according to claim 1, wherein, step 2) also include, first mate nearest three
The experience section of it period, if the number of passes of coupling does not reaches setting value, then in a Upward match nearest week or
The empirical path of the period of nearly one month, until the empirical path bar number of coupling reaches setting value.
Navigation algorithm based on experience the most according to claim 5, wherein, the setting value in coupling experience section is 20.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610511118.XA CN106225793A (en) | 2016-06-30 | 2016-06-30 | navigation algorithm based on experience |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610511118.XA CN106225793A (en) | 2016-06-30 | 2016-06-30 | navigation algorithm based on experience |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106225793A true CN106225793A (en) | 2016-12-14 |
Family
ID=57520243
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610511118.XA Pending CN106225793A (en) | 2016-06-30 | 2016-06-30 | navigation algorithm based on experience |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106225793A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107192399A (en) * | 2017-06-30 | 2017-09-22 | 广东欧珀移动通信有限公司 | Air navigation aid, device, storage medium and terminal |
| CN107270923A (en) * | 2017-06-16 | 2017-10-20 | 广东欧珀移动通信有限公司 | Method, terminal and storage medium that a kind of route is pushed |
| WO2018165848A1 (en) * | 2017-03-14 | 2018-09-20 | 深圳市南北汽车美容有限公司 | Method for analysing real-time road conditions to recommend travel time, and navigation system |
| CN108805320A (en) * | 2017-05-02 | 2018-11-13 | 北京嘀嘀无限科技发展有限公司 | A kind of method for information display and device |
| CN109241206A (en) * | 2017-06-30 | 2019-01-18 | 北京搜狗科技发展有限公司 | A kind of route inquiry method and device |
| CN109344247A (en) * | 2018-09-29 | 2019-02-15 | 百度在线网络技术（北京）有限公司 | Method and apparatus for output information |
| CN110608749A (en) * | 2019-09-06 | 2019-12-24 | 中国安全生产科学研究院 | Path determination method, path determination device and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007205764A (en) * | 2006-01-31 | 2007-08-16 | Equos Research Co Ltd | Route searching apparatus |
| CN101762282A (en) * | 2010-02-02 | 2010-06-30 | 中华电信股份有限公司 | Electronic map path planning method |
| CN102023019A (en) * | 2010-11-22 | 2011-04-20 | 东莞市泰斗微电子科技有限公司 | Navigation path planning method, system and terminal |
| CN103063223A (en) * | 2012-12-24 | 2013-04-24 | 深圳先进技术研究院 | Navigation system and method based on path sharing |
| CN104990559A (en) * | 2015-07-27 | 2015-10-21 | 福建工程学院 | Route recommending method based on taxi empirical data, system and client |
-
2016
- 2016-06-30 CN CN201610511118.XA patent/CN106225793A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007205764A (en) * | 2006-01-31 | 2007-08-16 | Equos Research Co Ltd | Route searching apparatus |
| CN101762282A (en) * | 2010-02-02 | 2010-06-30 | 中华电信股份有限公司 | Electronic map path planning method |
| CN102023019A (en) * | 2010-11-22 | 2011-04-20 | 东莞市泰斗微电子科技有限公司 | Navigation path planning method, system and terminal |
| CN103063223A (en) * | 2012-12-24 | 2013-04-24 | 深圳先进技术研究院 | Navigation system and method based on path sharing |
| CN104990559A (en) * | 2015-07-27 | 2015-10-21 | 福建工程学院 | Route recommending method based on taxi empirical data, system and client |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018165848A1 (en) * | 2017-03-14 | 2018-09-20 | 深圳市南北汽车美容有限公司 | Method for analysing real-time road conditions to recommend travel time, and navigation system |
| CN108805320A (en) * | 2017-05-02 | 2018-11-13 | 北京嘀嘀无限科技发展有限公司 | A kind of method for information display and device |
| CN107270923A (en) * | 2017-06-16 | 2017-10-20 | 广东欧珀移动通信有限公司 | Method, terminal and storage medium that a kind of route is pushed |
| CN107192399A (en) * | 2017-06-30 | 2017-09-22 | 广东欧珀移动通信有限公司 | Air navigation aid, device, storage medium and terminal |
| CN109241206A (en) * | 2017-06-30 | 2019-01-18 | 北京搜狗科技发展有限公司 | A kind of route inquiry method and device |
| CN107192399B (en) * | 2017-06-30 | 2020-02-18 | Oppo广东移动通信有限公司 | Navigation method, navigation device, storage medium and terminal |
| CN109344247A (en) * | 2018-09-29 | 2019-02-15 | 百度在线网络技术（北京）有限公司 | Method and apparatus for output information |
| CN110608749A (en) * | 2019-09-06 | 2019-12-24 | 中国安全生产科学研究院 | Path determination method, path determination device and storage medium |
| CN110608749B (en) * | 2019-09-06 | 2022-04-22 | 中国安全生产科学研究院 | Path determination method, path determination device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106225793A (en) | navigation algorithm based on experience | |
| CN104567900B (en) | vehicle fueling route planning system | |
| US9857191B2 (en) | Context-based routing and access path selection | |
| CN105960573B (en) | Vehicle information providing device | |
| JP6345274B2 (en) | Travel plan creation device and travel plan creation method | |
| US20160061618A1 (en) | Technique for navigating a vehicle to a parking place | |
| JP5350703B2 (en) | Traffic information generating apparatus, computer program, and traffic information generating method | |
| US20160025503A1 (en) | Vehicle parking management | |
| US9513135B2 (en) | Stochastic range | |
| US10255807B1 (en) | Method and apparatus for providing a map data update based on region-specific data turbulence | |
| CN103712630A (en) | Vehicle navigation system and vehicle navigation method | |
| WO2015179532A1 (en) | Context-based routing and access path selection | |
| CN104567897A (en) | Road condition forecast combined path planning method and navigation device | |
| CN112665600B (en) | Path planning method and device, computer readable storage medium and processor | |
| JP2007004290A (en) | Travel time database creation device | |
| CN106382939A (en) | System and method for predicating driving time on navigation path based on historical data | |
| US9188452B2 (en) | System and method for improved routing that combines real-time and likelihood information | |
| JP6257808B2 (en) | Travel plan creation device and travel plan change method | |
| JP2023535828A (en) | Routing method, device, equipment and medium | |
| CN110428101B (en) | Destination prediction method based on historical travel law and computer-readable storage medium | |
| Fagan et al. | Intelligent time of arrival estimation | |
| CN107085620A (en) | A kind of taxi and subway are plugged into the querying method and system of travel route | |
| CN111829538A (en) | Traffic safety navigation method, storage medium and electronic equipment | |
| JP2010271205A (en) | Method for verification of route in route verification system | |
| JP2014203370A (en) | Transportation means guide device, and transportation means guide method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161214 |