CN105571603B - The oiling of urban traffic road network is up to index construction method - Google Patents
The oiling of urban traffic road network is up to index construction method Download PDFInfo
- Publication number
- CN105571603B CN105571603B CN201510970744.0A CN201510970744A CN105571603B CN 105571603 B CN105571603 B CN 105571603B CN 201510970744 A CN201510970744 A CN 201510970744A CN 105571603 B CN105571603 B CN 105571603B
- Authority
- CN
- China
- Prior art keywords
- oiling
- point
- section
- position mark
- road network
- 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.)
- Expired - Fee Related
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/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3476—Special cost functions, i.e. other than distance or default speed limit of road segments using point of interest [POI] information, e.g. a route passing visible POIs
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of oiling of urban traffic road network up to index construction method.Described refuel comprises the following steps up to index construction method：A, calculated by implementing projection, obtain arest neighbors section data of each oiling website in road network；B, a position mark point data is obtained at interval of 100 meters in each section of road network；C, implement to calculate by the position mark point data generated in the arest neighbors section data and step b of the oiling website for obtaining step a, obtain the oiling of all position mark points in road network up to index；D, the oiling of optional position in road network is calculated up to index up to index using the oiling of all position mark points in the road network generated in step c.The present invention can calculate the complexity that optional position in road network reaches gas station, and this method can be applicable to during the generation of navigation data, the application function beneficial to enhancing road data towards group refueling demand.
Description
Technical field
The invention belongs to navigator fix and intelligent transportation field, and in particular to a kind of oiling of urban traffic road network can
Up to index construction method, suitable for weighing the complexity at optional position arrival plus oil/gas station on road.
Background technology
With China's rapid development of economy, the car ownership in city is unprecedented soaring year by year, adds oil/gas station in city
Energy services function day aobvious protrusion in road traffic.Oiling difficulty or ease journey be present in the vehicle travelled in the network of urban traffic road
The problem of spending.The oiling complexity on this road is weighed, all there is reality for driver and Jia oil/gas station owned enterprise
Meaning.So-called reachable index of refueling is exactly that the one kind for weighing arrival gas station's complexity in optional position on road is measured.At present,
Do not have to optional position on road in the application of the navigation equipment of in the market and various mobile terminals and pertinent literature
This method built up to index of refueling.As can be seen here, prior art requires further improvement.
The content of the invention
It is an object of the invention to propose a kind of oiling of urban traffic road network up to index construction method, with convenient
The oiling of optional position in road network is calculated up to index.
To achieve these goals, the present invention adopts the following technical scheme that：
The oiling of urban traffic road network comprises the following steps up to index construction method：
A is calculated by implementing projection, obtains arest neighbors section data of each oiling website in road network；
B obtains a position mark point data in each section of road network at interval of 100 meters；
The position mark point generated in arest neighbors section data and step b that c passes through the oiling website obtained to step a
Data are implemented to calculate, and obtain the oiling of all position mark points in road network up to index；
D utilizes the oiling of all position mark points in the road network generated in step c that road is calculated up to index
The oiling of optional position is up to index in network.
Preferably, the step a is specially：
A1, the quantity of definition oiling website are m；Determine a nearby sphere of j-th of oiling station data：Oiling website
Coordinate is Pj, calculate with PjCentered on the length of side be 200 meters of a square R；Wherein, j initial value is 1, and 1≤j≤m；
A2, the shape point coordinate sequence for taking out in road network data road section E, respectively p [0], p [1] ... p
[n], wherein, E start node is v, terminal node w；
Then the coordinate of first shape point coordinates p [0] and last shape point coordinates p [n] respectively with v, w overlaps；
A3, judge whether road section E all shape point coordinates are all fallen within the square R of step a1 determinations；
If a4, passing through judgement, road section E all shape point coordinates are all fallen within the square R of step a1 determinations, then
Show that road section E intersects with square R；Calculate gas station point coordinates PjTo shape point line segment p [i] p [i+1] distance, its
In, 0≤i≤n-1；Gas station point coordinates PjTo the starting point coordinate serial number i of the most short shape point line segment of distancemin, gas station
Point coordinates PjTo shape point line segment p [imin]p[imin+ 1] intersection point is pf, gas station point coordinates PjTo pfDistance value be d1, p
[imin] arrive pfDistance be d2, then gas station's point coordinates PjTo shape point p [imin] distance value df=d1+d2, be recorded as (E,
imin,df)；
A5, repeat the above steps a2-a4, calculates gas station point coordinates PjAll road sections into road network data
Distance；Take gas station point coordinates PjInto all road sections, the most short arest neighbors section for oiling website of distance, is designated as
Emin, calculate section EminStart node to gas station point coordinates PjAssociated EminShape point p [imin] distance be dp,
Calculate EminDistance d of the start node to gas stationg=dp+df；By the numbering j and distance value d of the oiling websitegForm (j, dg),
By (j, dg) associated record is to section EminStart node data in；
A6, j=j+1 is made, repeat the above steps a1-a5, calculates the arest neighbors section data of m oiling website.
Preferably, the step b is specially：
B1, shape point coordinate sequence p [0], p [1] ... the p [n] for taking out in road network data road section E；Calculate
Shape point line segment p [i] p [i+1] length, and accumulate the length of all line segment p [i] p [i+1] in section and obtain section E's
Length lenE；Wherein, 0≤i≤n；
If the len that b2, step b1 are obtainedELess than 100 meters, then by section E two shape point coordinates p [0] and p [n]
Position mark point as section E；
If the len that b3, step b1 are obtainedEMore than 100 meters, then all shape point line segment p [i] p [i are traveled through along section E
+ 1], a position mark point is inserted every 100 meters since starting point p [0]；If last position mark point of insertion
It is misaligned with terminal node p [n], then using terminal node p [n] as position mark point；
B4, each position mark point is stored in position mark point data to terminal node distance value；
B5, all sections of traversal, repeat the above steps b1-b4, obtains the position mark point data of all road sections.
Preferably, the step c is specially：
C1, setting are refueled up to threshold value dthreshold；
C2, position mark point L on road section E ' is taken, set E ' terminal node as s；Then position mark point L is to eventually
Only node s distance value is dL；Implement signal source shortest path search in road network by start node of s, work as shortest path
Distance length be more than dthreshold-dLWhen, then search is terminated, judges the whether relevant oiling website of node being each numbered
Numbering；Assuming that in the node being numbered before search terminates, the interstitial content for being associated oiling website is N number of, these nodes
Respectively t [1], t [2] ... t [N], the distance that node s to these nodes are passed through from position mark point L is d [1], d [2] ... d
[N]；It is d from these nodes to the distance of associated oiling websiteg[1]、…dg[N]；
Then position mark point L oiling up to index I=N/ (d [1]+d [2]+...+d [N]+dg[1]+…+dg[N])；
All position mark points on c3, traversal section E ', repeat the above steps c2, calculates each position on the E ' of section
The oiling of mark point is up to index；
All road sections in c4, traversal road network, repeat the above steps c2-c3, calculates in road network and owns
Position mark point oiling up to index.
Preferably, the step d is specially：
If optional position overlaps with position mark point coordinates in d1, road network, the oiling of the position mark point can
It is the oiling of the position mark point up to index up to index；
If optional position and position mark point coordinates are misaligned in d2, road network, the section where taking it is gone forward
Afterwards position mark point oiling up to index average value as the position oiling up to index.
The invention has the advantages that：
The present invention is constructed in a set of calculating road network according to position of the gas station in the network of urban traffic road to be appointed
The method for position arrival gas station's complexity of anticipating, this method can be applied during the generation of navigation data, beneficial to enhancing road
Application function of the circuit-switched data towards group refueling demand.The inventive method uses distance to describe, the describing mode with by distance
It is the same to be transformed into corresponding vehicle and travel the describing mode essence of time used in the distance.
Brief description of the drawings
Fig. 1 is schematic flow sheet of the oiling up to index construction method of urban traffic road network in the present invention.
Embodiment
Below in conjunction with the accompanying drawings and embodiment is described in further detail to the present invention：
With reference to shown in Fig. 1, the oiling of urban traffic road network comprises the following steps up to index construction method：
A is calculated by implementing projection, obtains arest neighbors section data of each oiling website in road network；
Step a is specifically included：
A1, the quantity of definition oiling website are m；Determine a nearby sphere of j-th of oiling station data：Oiling website
Coordinate is Pj, calculate with PjCentered on the length of side be 200 meters of a square R；Wherein, j initial value is 1, and 1≤j≤m；
A2, the shape point coordinate sequence for taking out in road network data road section E, respectively p [0], p [1] ... p
[n], wherein, E start node is v, terminal node w；
Then the coordinate of first shape point coordinates p [0] and last shape point coordinates p [n] respectively with v, w overlaps；
A3, judge whether road section E all shape point coordinates are all fallen within the square R of step a1 determinations；
If a4, passing through judgement, road section E all shape point coordinates are all fallen within the square R of step a1 determinations, then
Show that road section E intersects with square R；Calculate gas station point coordinates PjTo shape point line segment p [i] p [i+1] distance, its
In, 0≤i≤n-1；Gas station point coordinates PjTo the starting point coordinate serial number i of the most short shape point line segment of distancemin, gas station
Point coordinates PjTo shape point line segment p [imin]p[imin+ 1] intersection point is pf, gas station point coordinates PjTo pfDistance value be d1, p
[imin] arrive pfDistance be d2, then gas station's point coordinates PjTo shape point p [imin] distance value df=d1+d2, be recorded as (E,
imin,df)；
A5, repeat the above steps a2-a4, calculates gas station point coordinates PjAll road sections into road network data
Distance；Take gas station point coordinates PjInto all road sections, the most short arest neighbors section for oiling website of distance, is designated as
Emin, calculate section EminStart node to gas station point coordinates PjAssociated EminShape point p [imin] distance be dp,
Calculate EminDistance d of the start node to gas stationg=dp+df；By the numbering j and distance value d of the oiling websitegForm (j, dg),
By (j, dg) associated record is to section EminStart node data in；
A6, j=j+1 is made, repeat the above steps a1-a5, calculates the arest neighbors section data of m oiling website.
B obtains a position mark point data in each section of road network at interval of 100 meters, and the process for example may be used
To be completed by implementing spaced markings calculating method；
Step b is specifically included：
B1, shape point coordinate sequence p [0], p [1] ... the p [n] for taking out in road network data road section E；Calculate
Shape point line segment p [i] p [i+1] length, and accumulate the length of all line segment p [i] p [i+1] in section and obtain section E's
Length lenE；Wherein, 0≤i≤n；
If the len that b2, step b1 are obtainedELess than 100 meters, then by section E two shape point coordinates p [0] and p [n]
Position mark point as section E；
If the len that b3, step b1 are obtainedEMore than 100 meters, then all shape point line segment p [i] p [i are traveled through along section E
+ 1], a position mark point is inserted every 100 meters since starting point p [0]；If last position mark point of insertion
It is misaligned with terminal node p [n], then using terminal node p [n] as position mark point；
B4, each position mark point is stored in position mark point data to terminal node distance value；
B5, all sections of traversal, repeat the above steps b1-b4, obtains the position mark point data of all road sections.
The position mark point generated in arest neighbors section data and step b that c passes through the oiling website obtained to step a
Data are implemented to calculate, and obtain the oiling of all position mark points in road network up to index；
Step c is specifically included：
C1, setting are refueled up to threshold value dthreshold；
C2, position mark point L on road section E ' is taken, set E ' terminal node as s；Then position mark point L is to eventually
Only node s distance value is dL；Implement signal source shortest path search in road network by start node of s, work as shortest path
Distance length be more than dthreshold-dLWhen, then search is terminated, judges the whether relevant oiling website of node being each numbered
Numbering；Assuming that in the node being numbered before search terminates, the interstitial content for being associated oiling website is N number of, these nodes
Respectively t [1], t [2] ... t [N], the distance that node s to these nodes are passed through from position mark point L is d [1], d [2] ... d
[N]；It is d from these nodes to the distance of associated oiling websiteg[1]、…dg[N]；
Then position mark point L oiling up to index I=N/ (d [1]+d [2]+...+d [N]+dg[1]+…+dg[N])；
All position mark points on c3, traversal section E ', repeat the above steps c2, calculates each position on the E ' of section
The oiling of mark point is up to index；
All road sections in c4, traversal road network, repeat the above steps c2-c3, calculates in road network and owns
Position mark point oiling up to index.
D utilizes the oiling of all position mark points in the road network generated in step c that road is calculated up to index
The oiling of optional position is up to index in network；
Step d is specifically included：
If optional position overlaps with position mark point coordinates in d1, road network, the oiling of the position mark point can
It is the oiling of the position mark point up to index up to index；
If optional position and position mark point coordinates are misaligned in d2, road network, the section where taking it is gone forward
Afterwards position mark point oiling up to index average value as the position oiling up to index.
Herein it should be noted that above-mentioned road section E and road section E ' do not refer specifically to a certain spy in road network
Determine section, but refer to any one section in road network.
The inventive method can provide in navigation data weighs arrival gas station's complexity in optional position on road
Function, applied at present in navigation software on the market without this.
Certainly, described above is only presently preferred embodiments of the present invention, and the present invention is not limited to enumerate above-described embodiment, should
When explanation, any those skilled in the art are all equivalent substitutes for being made, bright under the teaching of this specification
Aobvious variant, all falls within the essential scope of this specification, ought to be protected by the present invention.
Claims (4)
1. the oiling of urban traffic road network is up to index construction method, it is characterised in that comprises the following steps：
A is calculated by implementing projection, obtains arest neighbors section data of each oiling website in road network；
The step a is specially：
A1, the quantity of definition oiling website are m；Determine a nearby sphere of j-th of oiling station data：Gas station's point coordinates
For Pj, calculate with PjCentered on the length of side be 200 meters of a square R；Wherein, j initial value is 1, and 1≤j≤m；
A2, the shape point coordinate sequence for taking out in road network data road section E, respectively p [0], p [1] ... p [n], its
In, E start node is v, terminal node w；
Then the coordinate of first shape point coordinates p [0] and last shape point coordinates p [n] respectively with v, w overlaps；
A3, judge whether road section E all shape point coordinates are all fallen within the square R of step a1 determinations；
If a4, passing through judgement, road section E all shape point coordinates all fall within the square R of step a1 determinations, then shown
Road section E intersects with square R；Calculate gas station point coordinates PjTo shape point line segment p [i] p [i+1] distance, wherein, 0
≤i≤n-1；Gas station point coordinates PjTo the starting point coordinate serial number i of the most short shape point line segment of distancemin, oiling website seat
Mark PjTo shape point line segment p [imin]p[imin+ 1] intersection point is pf, gas station point coordinates PjTo pfDistance value be d1, p [imin]
To pfDistance be d2, then gas station's point coordinates PjTo shape point p [imin] distance value df=d1+d2, it is recorded as (E, imin,
df)；
A5, repeat the above steps a2-a4, calculates gas station point coordinates PjThe distance of all road sections into road network data；
Take gas station point coordinates PjInto all road sections, the most short arest neighbors section for oiling website of distance, is designated as Emin, calculate
Section EminStart node to gas station point coordinates PjAssociated EminShape point p [imin] distance be dp, calculate EminRise
Distance d of the beginning node to gas stationg=dp+df；By the numbering j and distance value d of the oiling websitegForm (j, dg), by (j, dg)
Associated record is to section EminStart node data in；
A6, j=j+1 is made, repeat the above steps a1-a5, calculates the arest neighbors section data of m oiling website；
B obtains a position mark point data in each section of road network at interval of 100 meters；
The position mark point data generated in arest neighbors section data and step b that c passes through the oiling website obtained to step a
Implement to calculate, obtain the oiling of all position mark points in road network up to index；
D utilizes the oiling of all position mark points in the road network generated in step c that road network is calculated up to index
The oiling of middle optional position is up to index.
2. the oiling of urban traffic road network according to claim 1 is up to index construction method, it is characterised in that institute
Stating step b is specially：
B1, shape point coordinate sequence p [0], p [1] ... the p [n] for taking out in road network data road section E；Calculate shape
Point line segment p [i] p [i+1] length, and accumulate the length of all line segment p [i] p [i+1] in section and obtain section E length
lenE；Wherein, 0≤i≤n-1；
If the len that b2, step b1 are obtainedELess than 100 meters, then section E two shape point coordinates p [0] and p [n] are regard as this
Section E position mark point；
If the len that b3, step b1 are obtainedEMore than 100 meters, then all shape point line segment p [i] p [i+1] are traveled through along section E,
Since starting point p [0] a position mark point is inserted every 100 meters；If last position mark point and the end of insertion
Only node p [n] is misaligned, then using terminal node p [n] as position mark point；
B4, each position mark point is stored in position mark point data to terminal node distance value；
B5, all sections of traversal, repeat the above steps b1-b4, obtains the position mark point data of all road sections.
3. the oiling of urban traffic road network according to claim 1 is up to index construction method, it is characterised in that institute
Stating step c is specially：
C1, setting are refueled up to threshold value dthreshold；
C2, position mark point L on road section E ' is taken, set E ' terminal node as s；Then position mark point L is to terminal node
Point s distance value is dL；Implement signal source shortest path search in road network by start node of s, when shortest path away from
It is more than d from lengththreshold-dLWhen, then search is terminated, judges the whether relevant oiling site number of node being each numbered；
Assuming that in the node being numbered before search terminates, it is N number of to be associated the interstitial content of oiling website, and these nodes are respectively
T [1], t [2] ... t [N], the distance that node s to these nodes are passed through from position mark point L is d [1], d [2] ... d [N]；From this
The distance of a little node to associated oiling websites is dg[1]、…dg[N]；
Then position mark point L oiling up to index I=N/ (d [1]+d [2]+...+d [N]+dg[1]+…+dg[N])；
All position mark points on c3, traversal section E ', repeat the above steps c2, calculates each position mark on the E ' of section
The oiling of point is up to index；
All road sections in c4, traversal road network, repeat the above steps c2-c3, calculates position all in road network
The oiling of tagging point is up to index.
4. the oiling of urban traffic road network according to claim 1 is up to index construction method, it is characterised in that institute
Stating step d is specially：
If optional position overlaps with position mark point coordinates in d1, road network, the oiling of the position mark point is up to finger
Mark is the oiling of the position mark point up to index；
If optional position and position mark point coordinates are misaligned in d2, road network, anteroposterior position on the section where it is taken
Tagging point oiling up to index average value as the position oiling up to index.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510970744.0A CN105571603B (en) | 2015-12-22 | 2015-12-22 | The oiling of urban traffic road network is up to index construction method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510970744.0A CN105571603B (en) | 2015-12-22 | 2015-12-22 | The oiling of urban traffic road network is up to index construction method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105571603A CN105571603A (en) | 2016-05-11 |
| CN105571603B true CN105571603B (en) | 2018-03-27 |
Family
ID=55882006
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510970744.0A Expired - Fee Related CN105571603B (en) | 2015-12-22 | 2015-12-22 | The oiling of urban traffic road network is up to index construction method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105571603B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109767638B (en) * | 2018-12-17 | 2021-08-10 | 北京百度网讯科技有限公司 | Vehicle control method, device, equipment and computer readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6240364B1 (en) * | 1999-02-06 | 2001-05-29 | Daimlerchrysler Ag | Method and device for providing traffic information |
| CN1464642A (en) * | 2002-06-10 | 2003-12-31 | 北京北方正星数据技术有限公司 | Radio communication fuel charger, fuel station system and implementation method for the same |
| CN102200446A (en) * | 2010-03-23 | 2011-09-28 | 日电（中国）有限公司 | Continuous path detection device and method based on traffic data |
| CN102211582A (en) * | 2010-04-08 | 2011-10-12 | 罗伯特·博世有限公司 | Method for the range management of vehicle driven by electric motor and device therefor |
| CN103047991A (en) * | 2012-12-25 | 2013-04-17 | 杨国琴 | Method for prompting running route to nearest gasoline station |
| CN104567906A (en) * | 2015-01-14 | 2015-04-29 | 合肥革绿信息科技有限公司 | Beidou-based urban road network vehicle path planning method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103236179B (en) * | 2012-12-18 | 2015-04-15 | 清华大学 | Method for charging and navigating electric vehicles on basis of traffic information and power grid information |
-
2015
- 2015-12-22 CN CN201510970744.0A patent/CN105571603B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6240364B1 (en) * | 1999-02-06 | 2001-05-29 | Daimlerchrysler Ag | Method and device for providing traffic information |
| CN1464642A (en) * | 2002-06-10 | 2003-12-31 | 北京北方正星数据技术有限公司 | Radio communication fuel charger, fuel station system and implementation method for the same |
| CN102200446A (en) * | 2010-03-23 | 2011-09-28 | 日电（中国）有限公司 | Continuous path detection device and method based on traffic data |
| CN102211582A (en) * | 2010-04-08 | 2011-10-12 | 罗伯特·博世有限公司 | Method for the range management of vehicle driven by electric motor and device therefor |
| CN103047991A (en) * | 2012-12-25 | 2013-04-17 | 杨国琴 | Method for prompting running route to nearest gasoline station |
| CN104567906A (en) * | 2015-01-14 | 2015-04-29 | 合肥革绿信息科技有限公司 | Beidou-based urban road network vehicle path planning method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105571603A (en) | 2016-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7516041B2 (en) | System and method for identifying road features | |
| Boriboonsomsin et al. | Eco-routing navigation system based on multisource historical and real-time traffic information | |
| CN102183256B (en) | Map matching method for marching fleet | |
| CN107798855A (en) | A kind of lane width computational methods and device | |
| CN101986102B (en) | Method for matching electronic map in urban geographic information system | |
| CN102200446B (en) | Continuous path detection device and method based on traffic data | |
| CN107909187B (en) | Method for quickly matching bus stops and road sections in electronic map | |
| CN112530158B (en) | Road network supplementing method based on historical track | |
| CN105973252A (en) | Method for route planning and terminal | |
| CN105928529A (en) | Map-matching algorithm for combining multiple evidences | |
| CN108351220A (en) | The polymerization of lane information for numerical map service | |
| CN111982135B (en) | Conversion method between map formats based on different protocols | |
| CN103258440A (en) | Algorithm for restoring wheel path based on road attributes and real-time road conditions | |
| CN103884349A (en) | Evaluation-based navigation method | |
| CN113779430A (en) | Road network data generation method and device, computing equipment and storage medium | |
| US10928211B2 (en) | Method and apparatus for selectively qualifying trajectories in regards to a determination of travel time for a maneuver | |
| CN110232470A (en) | A kind of method and device of determining vehicle running path | |
| CN101169331B (en) | Vehicular navigation device using tri-dimensional picture | |
| CN113554891B (en) | Method for constructing electronic map road network based on bus GPS track | |
| CN105571603B (en) | The oiling of urban traffic road network is up to index construction method | |
| CN109341704A (en) | A kind of accuracy of map determines method and device | |
| CN103927437A (en) | Method for measuring space headway at nonlinear road section | |
| CN101169330A (en) | Vehicular navigation device using single branched graph | |
| CN105717517B (en) | A kind of vehicle-mounted big dipper multi-mode GNSS high accuracy roads basis collecting method | |
| CN111613052B (en) | Traffic condition determining method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191204 Address after: No. 25, building 76, family home of Information College, No. 5, Jianxue street, Jinshui District, Zhengzhou City, Henan Province 450002 Patentee after: Zhengzhou Tianci Beidou Navigation Technology Co.,Ltd. Address before: 266555 No. 66 West Changjiang Road, Qingdao economic and Technological Development Zone, Shandong Patentee before: China University of Petroleum (East China) |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180327 Termination date: 20211222 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |