CN102252687A - Method and device for acquiring fastest running path of vehicle - Google Patents
Method and device for acquiring fastest running path of vehicle Download PDFInfo
- Publication number
- CN102252687A CN102252687A CN2011101879652A CN201110187965A CN102252687A CN 102252687 A CN102252687 A CN 102252687A CN 2011101879652 A CN2011101879652 A CN 2011101879652A CN 201110187965 A CN201110187965 A CN 201110187965A CN 102252687 A CN102252687 A CN 102252687A
- Authority
- CN
- China
- Prior art keywords
- path
- vehicle
- segment
- speed
- soonest
- 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
Images
Abstract
The invention discloses a method for acquiring a fastest running path of a vehicle. The method comprises the following steps of: segmenting each running path; and calculating the running time of the whole path by calculating an average speed of each small segment of the path so as to find the fastest running path. Because the path is segmented, the calculated average speed is finer and more accurate. The invention also discloses a device for acquiring the fastest running path of the vehicle, which corresponds to the method. Due to the combination of the method and the device, the aim of the invention can be fulfilled.
Description
Technical field
The present invention relates to technical field of traffic control, particularly a kind of vehicle travel the soonest route method and device of obtaining.
Background technology
Along with the development in city, traffic is more and more crowded, and traffic congestion becomes ordinary affair.Under the congested traffic situation, seek a driving path the fastest, thereby help faster arrival destination to raise the efficiency, further the spreading of the situation of also avoiding blocking up.
Prior art provides the method for obtaining traffic by equipment such as GPS, but the driver differs from simple traffic and obtains the fastest driving path surely.
Summary of the invention
The present invention proposes a kind of vehicle travel the soonest route method and device of obtaining, between starting point, find a shortest path of running time,, reduce running time on its road for the driver provides reference.
The present invention obtains the vehicle route method of travelling the soonest, and described vehicle is equipped with orientator and knotmeter, and regularly sends from the residing position in electronic chart and the speed of travelling to the server of orientator and knotmeter, comprises the steps:
From electronic chart, select to travel starting point and terminal point;
From electronic chart, select the nearest preceding M bar driving path of origin-to-destination distance;
Every driving path in the described M bar driving path is divided into some segments path, obtain the speed of all vehicles in the every segment of process path from described server, calculate the average velocity of vehicle through every segment path, again according to the length computation vehicle in every segment path averaging time, addition averaging time in every segment path is obtained every running time that driving path is total through every segment path;
The running time of each bar driving path relatively, with travel the shortest one as the path of travelling the soonest.
Preferably, described step with the division methods that every driving path in the described M bar driving path is divided in some segments path is: be that unit divides every paths with the preset distance.
Preferably, described step with the division methods that every driving path in the described M bar driving path is divided in some segments path is: the path between adjacent two crossings is divided into a bit of path.
Preferably, described step is calculated vehicle and is specially through the average velocity in every segment path: will be through the speed sum of all vehicles in every segment path divided by vehicle fleet size, and described vehicle fleet size approaches quantity behind the zero vehicle for the speed of a motor vehicle of rejecting predetermined ratio.
Preferably, described step is calculated vehicle and is specially through the average velocity in every segment path: from the speed through all vehicles in every segment path, choose prestissimo, jogging speed and midrange speed, with the mean value of three speed as the average velocity of vehicle through every segment path.
The present invention obtains travel the soonest device in path of vehicle, and described vehicle is equipped with orientator and knotmeter, and regularly sends from the residing position in electronic chart and the speed of travelling to the server of orientator and knotmeter, comprising:
Starting point is selected module, is used for selecting to travel starting point and terminal point from electronic chart;
The road is used for selecting the nearest preceding M bar driving path of origin-to-destination distance from electronic chart through the screening module;
The running time computing module, be used for every driving path of described M bar driving path is divided into some segments path, obtain the speed of all vehicles in the every segment of process path from described server, calculate the average velocity of vehicle through every segment path, again according to the length computation vehicle in every segment path averaging time, addition averaging time in every segment path is obtained every running time that driving path is total through every segment path;
The path determination module that travels the soonest is used for the running time of each bar driving path of comparison, with travel the shortest one as the path of travelling the soonest.
Preferably, described running time computing module is that unit divides the every paths in the described M bar driving path with the preset distance.
Preferably, described running time computing module is divided into a bit of path with the path between adjacent two crossings.
Preferably, described running time computing module will obtain the average velocity of vehicle through every segment path divided by vehicle fleet size through the speed sum of all vehicles in every segment path, and described vehicle fleet size approaches the quantity behind zero the vehicle for the speed of a motor vehicle of rejecting predetermined ratio.
Preferably, described running time computing module is chosen prestissimo, jogging speed and midrange speed from the speed through all vehicles in every segment path, with the mean value of three speed as the average velocity of vehicle through every segment path.
The present invention obtains the vehicle route method of travelling the soonest, and every driving path is carried out segmentation, calculates the running time in whole piece path by the average speed that calculates every segment path, thereby finds out the path of travelling the soonest.Because segmentation has been carried out in the path, the average velocity that is calculated is meticulousr more accurate.It is the device corresponding with said method that the present invention obtains travel the soonest device in path of vehicle, and its beneficial effect repeats no more.
Description of drawings
Fig. 1 is that the present invention obtains travel the soonest schematic flow sheet of route method of vehicle;
Fig. 2 is that the present invention obtains vehicle and travels the soonest and calculate the schematic flow sheet of every paths running time in the route method;
Fig. 3 is that the present invention obtains travel the soonest structural representation of device in path of vehicle.
Embodiment
Central idea of the present invention is that every possible driving path is carried out segmentation, calculates the running time in whole piece path by the average speed that calculates every segment path, thereby finds out the path of travelling the soonest, and it comprises the steps:
The vehicle that travels in S01, the city obtains the self-position and the speed of a motor vehicle by orientator and knotmeter, regularly information is reported the server of orientator and knotmeter, and described position is the position of vehicle in electronic chart;
S02, selection will be obtained the starting point and the terminal point in the path of travelling the soonest;
S03, inquire from electronic chart according to starting point and terminal point before the shortest driving path of M bar distance;
The countless versions combination may appear in the driving path of origin-to-destination, and usually, the fastest path appears in the shortest former paths of distance.Therefore, choose the shortest preceding M paths of distance here, the concrete numerical value of M can be provided with according to actual conditions.
S04: calculate the running time of every paths in the above-mentioned M paths, as shown in Figure 2, concrete steps are:
S0401: every driving path is divided into N segment, and each segment is represented with Di, i=1 ... N;
Described segmentation method can be to be that unit divides with the certain-length, for example every 50 meters standardized segments, also can be to divide the highway section between two traffic intersections into a section.
S0402: obtain the speed of a motor vehicle that current location is in all vehicles in Di highway section from server, ask the average speed of its average speed as the Di highway section.The method of described calculating average speed can be that speed of a motor vehicle sum with all vehicles is divided by vehicle fleet size.Consider that may minority there be the vehicle of stop in the roadside, the speed of a motor vehicle that therefore also may reject predetermined ratio is calculated the average speed of residue vehicle after near zero vehicle again.In order to reduce calculated amount, can also be from all speed of a motor vehicle of all vehicles, select prestissimo, jogging speed and these three speed of midrange speed as representative, three's sum obtains vehicle through the Di average speed after three.
S0403: use the average velocity of the length in Di path, obtain the running time Ti in Di highway section divided by the Di highway section;
S0404: the running time summation to every segment path obtains total running time
S05: the running time of each paths relatively, the shortest path of select time is as the path of travelling the soonest.
The present invention obtains travel the soonest device in path of vehicle, and described vehicle is equipped with orientator and knotmeter, and regularly sends from the residing position in electronic chart and the speed of travelling to the server of orientator and knotmeter, as shown in Figure 3, comprising:
Starting point is selected module, is used for selecting to travel starting point and terminal point from electronic chart;
The road is used for selecting the nearest preceding M paths of origin-to-destination distance from electronic chart through the screening module;
The running time computing module, be used for every paths of described M paths is divided into some segments path, obtain the speed of all vehicles in the every segment of process path from described server, calculate the average velocity of vehicle through this segment path, again according to the length computation vehicle in this segment path averaging time, addition averaging time in every segment path is obtained the total running time of every paths through this segment path;
The path determination module that travels the soonest is used for the running time of each paths of comparison, with the shortest one as the path of travelling the soonest.
As a preferred embodiment, described running time computing module is that unit divides the every paths in the described M paths with the preset distance.
As a preferred embodiment, described running time computing module is divided into a bit of path with the path between adjacent two crossings.
As a preferred embodiment, described running time computing module will obtain the average velocity of vehicle through this segment path divided by vehicle fleet size through the speed sum of all vehicles in this segment path, and described vehicle fleet size approaches the quantity behind zero the vehicle for the speed of a motor vehicle of rejecting predetermined ratio.
As a preferred embodiment, described running time computing module is from the speed of all vehicles in the every segment of process path, choose prestissimo, jogging speed and midrange speed, with the mean value of three speed as the average velocity of vehicle through every segment path.
The present invention obtains the vehicle route method of travelling the soonest, and every driving path is carried out segmentation, calculates the running time in whole piece path by the average speed that calculates every segment path, thereby finds out the path of travelling the soonest.Because segmentation has been carried out in the path, the average velocity that is calculated is meticulousr more accurate.It is the device corresponding with said method that the present invention obtains travel the soonest device in path of vehicle, with method and apparatus in conjunction with realizing purpose of the present invention.
Above-described embodiment of the present invention does not constitute the qualification to protection domain of the present invention.Any modification of being done within the spirit and principles in the present invention, be equal to and replace and improvement etc., all should be included within the claim protection domain of the present invention.
Claims (10)
1. one kind is obtained the vehicle route method of travelling the soonest, and described vehicle is equipped with orientator and knotmeter, and regularly sends from the residing position in electronic chart and the speed of travelling to the server of orientator and knotmeter, it is characterized in that, comprises the steps:
From electronic chart, select to travel starting point and terminal point;
From electronic chart, select the nearest preceding M bar driving path of origin-to-destination distance;
Every driving path in the described M bar driving path is divided into some segments path, obtain the speed of all vehicles in the every segment of process path from described server, calculate the average velocity of vehicle through every segment path, again according to the length computation vehicle in every segment path averaging time, addition averaging time in every segment path is obtained every running time that driving path is total through every segment path;
The running time of each bar driving path relatively, with travel the shortest one as the path of travelling the soonest.
2. the vehicle route method of travelling the soonest of obtaining according to claim 1, it is characterized in that described step with the division methods that every driving path in the described M bar driving path is divided in some segments path is: be that unit divides every paths with the preset distance.
3. the vehicle route method of travelling the soonest of obtaining according to claim 1, it is characterized in that described step with the division methods that every driving path in the described M bar driving path is divided in some segments path is: the path between adjacent two crossings is divided into a bit of path.
4. according to claim 1 or the 2 or 3 described vehicle route method of travelling the soonest of obtaining, it is characterized in that, described step is calculated vehicle and is specially through the average velocity in every segment path: will be through the speed sum of all vehicles in every segment path divided by vehicle fleet size, and described vehicle fleet size approaches quantity behind the zero vehicle for the speed of a motor vehicle of rejecting predetermined ratio.
5. according to claim 1 or the 2 or 3 described vehicle route method of travelling the soonest of obtaining, it is characterized in that, described step is calculated vehicle and is specially through the average velocity in every segment path: from the speed through all vehicles in every segment path, choose prestissimo, jogging speed and midrange speed, with the mean value of three speed as the average velocity of vehicle through every segment path.
6. one kind is obtained travel the soonest device in path of vehicle, and described vehicle is equipped with orientator and knotmeter, and regularly sends from the residing position in electronic chart and the speed of travelling to the server of orientator and knotmeter, it is characterized in that, comprising:
Starting point is selected module, is used for selecting to travel starting point and terminal point from electronic chart;
The road is used for selecting the nearest preceding M bar driving path of origin-to-destination distance from electronic chart through the screening module;
The running time computing module, be used for every driving path of described M bar driving path is divided into some segments path, obtain the speed of all vehicles in the every segment of process path from described server, calculate the average velocity of vehicle through this segment path, again according to the length computation vehicle in this segment path averaging time, addition averaging time in every segment path is obtained every running time that driving path is total through this segment path;
The path determination module that travels the soonest is used for the running time of each bar driving path of comparison, with travel the shortest one as the path of travelling the soonest.
7. travel the soonest device in path of vehicle that obtains according to claim 6 is characterized in that described running time computing module is that unit divides every driving path in the described M paths with the preset distance.
8. the vehicle route method of travelling the soonest of obtaining according to claim 6 is characterized in that described running time computing module is divided into a bit of path with the path between adjacent two crossings.
9. according to claim 6 or 7 or 8 described travel the soonest devices in path of vehicle that obtain, it is characterized in that, described running time computing module will obtain the average velocity of vehicle through this segment path divided by vehicle fleet size through the speed sum of all vehicles in this segment path, and described vehicle fleet size approaches the quantity behind zero the vehicle for the speed of a motor vehicle of rejecting predetermined ratio.
10. according to claim 6 or 7 or 8 described travel the soonest devices in path of vehicle that obtain, it is characterized in that, described running time computing module is from the speed of all vehicles in the every segment of process path, choose prestissimo, jogging speed and midrange speed, with the mean value of three speed as the average velocity of vehicle through every segment path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101879652A CN102252687A (en) | 2011-07-06 | 2011-07-06 | Method and device for acquiring fastest running path of vehicle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101879652A CN102252687A (en) | 2011-07-06 | 2011-07-06 | Method and device for acquiring fastest running path of vehicle |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102252687A true CN102252687A (en) | 2011-11-23 |
Family
ID=44980101
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101879652A Pending CN102252687A (en) | 2011-07-06 | 2011-07-06 | Method and device for acquiring fastest running path of vehicle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102252687A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102927990A (en) * | 2012-10-29 | 2013-02-13 | 苏州两江科技有限公司 | Method for determining urban road optimal path of automobile by geographic information system |
| CN103593712A (en) * | 2013-11-01 | 2014-02-19 | 中国电子科技集团公司第十五研究所 | Resource optimization dispatching system and dispatching method |
| CN103700258A (en) * | 2013-12-09 | 2014-04-02 | 深圳市中兴云服务有限公司 | Road condition information acquisition method and device |
| CN104332046A (en) * | 2014-02-23 | 2015-02-04 | 曾昭兴 | Taxi pooling method, system and server |
| CN104376604A (en) * | 2014-02-23 | 2015-02-25 | 广州市沃希信息科技有限公司 | Charging method, system and server used in taxi sharing |
| CN105547315A (en) * | 2015-12-25 | 2016-05-04 | 上海电机学院 | Vehicle real time optimal traffic planning method and system |
| CN105608508A (en) * | 2015-12-25 | 2016-05-25 | 上海电机学院 | Vehicle optimum route query method and system |
| CN105890588A (en) * | 2016-03-31 | 2016-08-24 | 百度在线网络技术（北京）有限公司 | Display method and device for navigation routes |
| CN108847042A (en) * | 2018-08-24 | 2018-11-20 | 讯飞智元信息科技有限公司 | A kind of traffic information dissemination method and device |
| CN110021181A (en) * | 2019-04-24 | 2019-07-16 | 北京长城华冠汽车技术开发有限公司 | Route planning system and route planning method based on signal lamp state |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6263277B1 (en) * | 2000-08-07 | 2001-07-17 | Alpine Electronics, Inc. | Route searching method |
| CN101131796A (en) * | 2007-08-30 | 2008-02-27 | 济南卓信智能科技有限公司 | Road traffic parameter checking device and method thereof |
| DE102007049509A1 (en) * | 2007-10-15 | 2009-04-16 | Bayerische Motoren Werke Aktiengesellschaft | Motor vehicle navigation system for calculating route between starting point and destination, has processor device for calculating expected arrival time or travel time, where arrival time or travel time is determined based on average speed |
| CN101769759A (en) * | 2008-12-31 | 2010-07-07 | 深圳易拓科技有限公司 | Vehicle real-time route optimization method and vehicle-mounted terminal |
| CN101950481A (en) * | 2010-08-27 | 2011-01-19 | 杭州妙影微电子有限公司 | Method for obtaining road traffic flow cloud picture in real-time manner |
-
2011
- 2011-07-06 CN CN2011101879652A patent/CN102252687A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6263277B1 (en) * | 2000-08-07 | 2001-07-17 | Alpine Electronics, Inc. | Route searching method |
| CN101131796A (en) * | 2007-08-30 | 2008-02-27 | 济南卓信智能科技有限公司 | Road traffic parameter checking device and method thereof |
| DE102007049509A1 (en) * | 2007-10-15 | 2009-04-16 | Bayerische Motoren Werke Aktiengesellschaft | Motor vehicle navigation system for calculating route between starting point and destination, has processor device for calculating expected arrival time or travel time, where arrival time or travel time is determined based on average speed |
| CN101769759A (en) * | 2008-12-31 | 2010-07-07 | 深圳易拓科技有限公司 | Vehicle real-time route optimization method and vehicle-mounted terminal |
| CN101950481A (en) * | 2010-08-27 | 2011-01-19 | 杭州妙影微电子有限公司 | Method for obtaining road traffic flow cloud picture in real-time manner |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102927990B (en) * | 2012-10-29 | 2015-10-21 | 苏州两江科技有限公司 | Locomotive is by the method for Geographic Information System determination urban road optimal path of automobile |
| CN102927990A (en) * | 2012-10-29 | 2013-02-13 | 苏州两江科技有限公司 | Method for determining urban road optimal path of automobile by geographic information system |
| CN103593712A (en) * | 2013-11-01 | 2014-02-19 | 中国电子科技集团公司第十五研究所 | Resource optimization dispatching system and dispatching method |
| CN103593712B (en) * | 2013-11-01 | 2017-07-21 | 中国电子科技集团公司第十五研究所 | A kind of Resource Scheduling System and dispatching method |
| CN103700258A (en) * | 2013-12-09 | 2014-04-02 | 深圳市中兴云服务有限公司 | Road condition information acquisition method and device |
| CN104332046A (en) * | 2014-02-23 | 2015-02-04 | 曾昭兴 | Taxi pooling method, system and server |
| WO2015124106A1 (en) * | 2014-02-23 | 2015-08-27 | 曾昭兴 | Taxi sharing method and system and server |
| CN104376604A (en) * | 2014-02-23 | 2015-02-25 | 广州市沃希信息科技有限公司 | Charging method, system and server used in taxi sharing |
| CN105547315A (en) * | 2015-12-25 | 2016-05-04 | 上海电机学院 | Vehicle real time optimal traffic planning method and system |
| CN105608508A (en) * | 2015-12-25 | 2016-05-25 | 上海电机学院 | Vehicle optimum route query method and system |
| CN105890588A (en) * | 2016-03-31 | 2016-08-24 | 百度在线网络技术（北京）有限公司 | Display method and device for navigation routes |
| CN108847042A (en) * | 2018-08-24 | 2018-11-20 | 讯飞智元信息科技有限公司 | A kind of traffic information dissemination method and device |
| CN108847042B (en) * | 2018-08-24 | 2021-04-02 | 讯飞智元信息科技有限公司 | Road condition information publishing method and device |
| CN110021181A (en) * | 2019-04-24 | 2019-07-16 | 北京长城华冠汽车技术开发有限公司 | Route planning system and route planning method based on signal lamp state |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102252687A (en) | Method and device for acquiring fastest running path of vehicle | |
| CN106715224B (en) | Functional licensing of highly automated driving functions | |
| CN102353381B (en) | Method and device for obtaining optimal path to hurry to scene of traffic accident | |
| CN107784835B (en) | Traffic state mode prediction system based on traffic data analysis and prediction method thereof | |
| CN102473346B (en) | Vehicle controller, control method for vehicle and control system for vehicle | |
| JP6397827B2 (en) | Map data update device | |
| JP5796740B2 (en) | Traffic information notification system, traffic information notification program, and traffic information notification method | |
| CN105258707A (en) | Navigation optimization method and system, and electronic equipment | |
| CN105788322A (en) | Special vehicle passing method based on vehicle networking and system thereof | |
| US11127289B2 (en) | Traffic congestion estimating device, traffic congestion estimating method, and recording medium storing program thereof | |
| CN102288193A (en) | Motor vehicle travel route determination method based on historical data | |
| CN108871357B (en) | Method for displaying accident lane of congested road section on electronic map | |
| CN101490730A (en) | Traffic information creating method, traffic information creating device, display, navigation system, and electronic control unit | |
| JP2010102575A (en) | Apparatus and method for generating traffic information | |
| JP2009048560A (en) | Traffic information creation method, traffic information creation device, and navigation system | |
| CN108806242B (en) | Determination of a set of road engineering regional characteristics | |
| CN101799300A (en) | Method and device for navigation according to road conditions | |
| CN101183006A (en) | Method for confirming remaining time of navigation system, device and navigation system | |
| CN105277202A (en) | Vehicle path planning method and system | |
| CN106157694A (en) | The pedestrian anti-collision method for early warning of a kind of intersection and device | |
| CN104870289A (en) | Method for providing an operating strategy for a motor vehicle | |
| CN104236577A (en) | Information processing method and electronic equipment | |
| CN104240527A (en) | Road condition early warning method and device | |
| CN103730005A (en) | Method and system for predicting journey running time | |
| CN114761985A (en) | Road utilization rate of V2X vehicle |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20111123 |