CN201918027U - Road haul processing system for vehicles - Google Patents
Road haul processing system for vehicles Download PDFInfo
- Publication number
- CN201918027U CN201918027U CN2010206678006U CN201020667800U CN201918027U CN 201918027 U CN201918027 U CN 201918027U CN 2010206678006 U CN2010206678006 U CN 2010206678006U CN 201020667800 U CN201020667800 U CN 201020667800U CN 201918027 U CN201918027 U CN 201918027U
- Authority
- CN
- China
- Prior art keywords
- gps
- road
- monitoring center
- vehicle
- data
- 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 - Lifetime
Links
Images
Landscapes
- Instructional Devices (AREA)
- Navigation (AREA)
Abstract
The utility model relates to a road haul processing system for vehicles, which is based on the MapX, map matching algorithm routine and the shortest path method. The road haul processing system comprises a digital map and a GPS (Global Positioning System) positioning information receiving system, wherein the GPS positioning information receiving system comprises a GPS receiver, a communication broadcasting station and a monitoring center; the monitoring center is provided with a monitoring center server; the digital map is mounted on the monitoring center server; the GPS receiver achieves real-time positioning and sends the positioning information to the monitoring center through the communication broadcasting station; a geological information system and a database are mounted on the monitoring center server; the monitoring center works together with the geological information system to manage the vehicles, receive data from a serial port and store the received data in a cache; the data stored in the cache is converted into positioning information data to be stored in the database; and positioning information data stored in the database is processed by the coordination of the digital map, the map matching algorithm routine and the shortest path method to obtain the road haul of the vehicles, and the obtained road haul is stored in the database.
Description
Technical field
The utility model relates to a kind of disposal system of Vehicle-Miles of Travel, and particularly a kind of being applicable in the vehicle remote management information service is based on the disposal system of the Vehicle-Miles of Travel of MapX, map-matching algorithm program and shortest path first program.
Background technology
Along with the GPS location technology is used more and more widely in actual life, corresponding just more and more higher to the accuracy requirement of GPS vehicle positioning system.At present, in a lot of navigation and positioning system for vehicles, the function of location is not very perfect, the preparation rate neither be very high, be offset about road through being everlasting, even because the influence of barrier, location not accurate, thus the Vehicle-Miles of Travel accuracy rate that calculates based on such locator data neither be very high.
Present measurement adopts GPS to measure, and is the information that receives satellite transmission by ground receiving equipment, calculates the synchronization ground receiving equipment to the pseudo-distance between the multi-satellite, adopts space length resection method, determines topocentric three-dimensional coordinate.Therefore, all can measure the generation error for gps satellite, satellite-signal communication process and ground receiving equipment to GPS.Main source of error can be divided into: the error relevant with gps satellite; Propagate relevant error with signal; The error relevant with receiving equipment.
Summary of the invention
The purpose of a kind of Vehicle-Miles of Travel disposal system of the utility model is the problem at present gps satellite location survey low precision, a kind of disposal system of uploading the distance travelled of data computation vehicle in conjunction with numerical map and GPS vehicle is provided, it is a kind of electronic chart of making based on Mapinfo, secondary development control and VC++ development technique in conjunction with Mapinfo, adopt map-matching algorithm program, shortest path first program and Method for Calculate Mileage to come to handle effectively flexibly the disposal system of Vehicle-Miles of Travel, can improve the accuracy of GPS vehicle positioning system.This method is on the basis of analyzing the GPS source of error, at the error relevant with the GPS receiver, vehicle data is carried out Filtering Processing, compare, mate with electronic map road data then, thereby find the road at vehicle place, and handle the real data that obtains on the road, carry out mileage on this basis and handle, thereby improved the degree of accuracy of mileage, also provide more accurate foundation for oil consumption analysis based on mileage.
A kind of Vehicle-Miles of Travel disposal system of the utility model takes following technical scheme to realize: a kind of Vehicle-Miles of Travel disposal system comprises numerical map and GPS locating information receiving system, GPS locating information receiving system comprises the GPS receiver, communication station and Surveillance center, Surveillance center has monitoring central server, numerical map is installed on the monitoring central server, GPS receiver real-time positioning also is sent to Surveillance center with locating information by communication station, Geographic Information System and database are installed on monitoring server, combining geographic information system of Surveillance center manages vehicle, promptly be positioned over the buffer memory from serial ports reception data and with it, information with each field extracts from the buffer memory byte stream again, convert it into and be of practical significance, locating information data for the decision of the senior level use, leave in the database, then in conjunction with numerical map, map-matching algorithm program and shortest-path method are handled and are obtained the distance travelled of vehicle and store database into.
Described GPS receiver comprises GPS receiving antenna, frequency converter, signalling channel, microprocessor, storer and power supply.
Described numerical map adopts commercially available numerical map.
Described GPS receiver adopts commercially available GPS receiver.
A kind of disposal route of Vehicle-Miles of Travel disposal system may further comprise the steps:
1) extracts the GPS locator data, because GPS locating information content is less, by the RS-232 serial ports locating information (NEMA0183 statement) is sent to from the GPS receiver and carries out information extraction the computing machine and handle, promptly be positioned over the buffer memory from serial ports reception data and with it, information with each field extracts from the buffer memory byte stream again, convert it into be of practical significance, for the locating information data that decision of the senior level uses, leave in the database; Adopt the filtering algorithm program that the vehicle GPS locator data that derives from database is carried out Filtering Processing then, filter out invalid data.
2) Geographic Information System program MapX5 is installed in monitoring central server, with the gst file of Geoset Manager generation map of China, the tab file of registration map of China.
3) in Visual Studio2008, create VC++ project based on dialog class, and in project, importing MapX control relevant header file MAPX.H and master file MAPX.CPP, these two files comprise the class definition and the method that are used for the MapX control is conducted interviews to be realized.
4) added Mapinfo MapX V5 control in the dialog box window of the dialog class in the last step, bind with map of China.
5) judgement time spacing parameter dateTimeSpan, if less than 180s, then change next step over to, otherwise, carry out step 6) earlier the GPS anchor point that imports into is mated, carry out step 7) then and adopt the shortest path first program to find out shortest path and the distance between former and later two vehicle GPS anchor point matched position points in the electronic chart.
6) GPS anchor point matcher
In this program,, road is divided into three types according to the node number of electronic chart center line pel: the one, linear pattern, promptly route map unit in road has only two nodes; The 2nd, nonlinear type, promptly road route map unit node number is greater than 2, less than 20; The 3rd, camber, promptly road route map unit node number is greater than 19;
This program may further comprise the steps:
6-1) receive the locating point position value, described locating point position value comprises longitude and latitude, direction, speed and mode bit etc.;
6-2) judge whether locator data is invalid,, then infer coupling, change step 6-8 then) according to historical location data if invalid; If effectively, then enter step 6-3);
6-3) judge that current whether being in of vehicle stops or the low speed sliding state, stop or the low speed sliding state then handles accordingly to it, change step 6-8 then) if be in; If be in the cruising state, then enter 6-4);
6-4) design corresponding moving window, and then obtain highway section wherein by locating point position point; If highway section quantity is 0, then infer coupling according to historical location data, change step 6-8 then); If highway section quantity greater than 0, then enters step 6-5);
6-5) to step 6-4) highway section that obtains is carried out the connectivity topology and is checked, will be the matching candidate highway section by the highway section of topology inspection;
6-6) judge the quantity in matching candidate highway section, if unique, then directly with it as the coupling highway section, do projection by anchor point to it, change step 6-8 then); If anchor point is on last a coupling road, then directly with anchor point as the point after mating, change step 6-8 then); Otherwise, handle all candidate road section matching degree metric comJudge[i] (i=1,2., N);
6-7) to comJudge[i] the minimum rule of utilization, select a coupling highway section, perhaps handle by it fails to match;
6-8) finish this coupling;
7) shortest path first program
This algorithm routine may further comprise the steps:
7-1) generate the rectangular surfaces pel that shortest path is sought the zone
With former and later two vehicle GPS anchor point matched position points as two of rectangle to angle point, again rectangle expanded a variable λ up and down respectively, can find a shortest path that meets the demands up to this rectangle, generate a face pel according to this rectangle then;
The road route map unit that the face pel comprises above 7-2) handling in the Chinese road network figure layer is cloned into these road route map units in the interim figure layer;
7-3) handle the interim abutment points of scheming between the layer center line pel, structure abutment points matrix;
7-4) employing enlightening Coase thorough (Dijkstra) method program is handled shortest path and the distance between the terminal;
8) judge whether identical with the coupling road of last data the coupling road of current anchor point is, if then utilize and divide segment distance between former and later two match points and as The last mile; Otherwise, change next step over to;
9) judge before and after the coupling road whether intersect, if intersect, then obtain intersection point, calculate the distance between intersection point and former and later two match points more respectively, will apart from after the addition and as The last mile; Otherwise, change next step over to;
10) handle before and after the road that links to each other of coupling road, and calculate intersection point, handle respectively again starting point to intersection point, intersection point to intersection point, intersection point is to the distance of terminal point, addition is afterwards as The last mile then;
11) output mileage.
Invalid data described in the step 1) comprises that repeating data, mode bit are 0 data and the data that do not have searching route.
Map-matching algorithm program positioning principle is: vehicle location or driving trace that other localization methods obtain are compared, mated with vehicle-mounted electronic map road data, thereby find the road at vehicle place, and demonstrate the real time position of vehicle.Map matching process can be divided into two relatively independent processes: the one, and the road of searching vehicle current driving; The 2nd, current anchor point is projected on the road of vehicle '.
The shortest path first program is used to handle the gps signal interruption, according to 2 longitude and latitude data before and after the signal interruption, the longitude and latitude matching value before interrupting is composed to starting point, judges that terminating point is valid data and is on road; If not valid data, then take off an effective gps data; If not on road, then terminating point is carried out the matching algorithm program, it is matched on the road.Select to comprise the rectangular area of terminal again, judge whether this zone has the road that comprises starting point,, then suitably relax the zone if do not have.The intersection point of road and the distance between the intersection point in the processing region are used shortest path and distance between enlightening Coase thorough (Dijkstra) the algorithm routine processing starting point then.
Mapinfo is carried out secondary development three kinds of common methods, promptly utilizes three kinds of methods such as MapBasic language, Mapx assembly, OLE technology.The MapX control be Map Info company to the ActiveX control that the user provides with map analysis function formidably, be applicable to most of object oriented languages, can seamlessly be embedded in the middle of the application system of every field.On Visual Studio2008 platform, utilize VC++ exploitation and since VC support class inherit and function polymorphic, so code recycling rate of waterused height, extendability are strong, have the high efficiency of programming, be easy to maintenance.
The advantage of a kind of Vehicle-Miles of Travel disposal system of the utility model: improved the GPS bearing accuracy of vehicle and the precision of distance travelled, solved the influence that the gps signal interruption brings, also provide reference method for the work of GPS Research on Locating System.This utility model achievement can directly be used by the terminal user, the distance travelled number of enquiring vehicle, also can be called, provide foundation as calculating, maintain foundation, alert service and information management for vehicle activity query, vehicle monitoring, running cost by the car operation management service system that GPS is correlated with.
Description of drawings
The utility model is described in further detail below with reference to accompanying drawing:
Fig. 1 is a kind of system chart of Vehicle-Miles of Travel disposal system.
Fig. 2 be before the map-matching algorithm program and after two kinds of vehicle driving trace synoptic diagram.
Embodiment
With reference to accompanying drawing 1～2, a kind of Vehicle-Miles of Travel disposal system of the utility model comprises numerical map and GPS locating information receiving system, GPS locating information receiving system comprises the GPS receiver, communication station and Surveillance center, Surveillance center has monitoring central server, numerical map is installed on the monitoring central server, GPS receiver real-time positioning also is sent to Surveillance center with locating information by communication station, Geographic Information System and database are installed on monitoring server, combining geographic information system of Surveillance center manages vehicle, promptly be positioned over the buffer memory from serial ports reception data and with it, information with each field extracts from the buffer memory byte stream again, convert it into and be of practical significance, locating information data for the decision of the senior level use, leave in the database, then in conjunction with numerical map, map-matching algorithm program and shortest path first routine processes obtain the distance travelled of vehicle and store database into.
Described GPS receiver comprises GPS receiving antenna, frequency converter, signalling channel, microprocessor, storer and power supply.
Described numerical map adopts commercially available numerical map.
Described GPS receiver adopts commercially available GPS receiver.
A kind of disposal route of Vehicle-Miles of Travel disposal system may further comprise the steps:
1) extracts the GPS locator data, because GPS locating information content is less, by the RS-232 serial ports locating information (NEMA0183 statement) is sent to from the GPS receiver and carries out information extraction the computing machine and handle, promptly be positioned over the buffer memory from serial ports reception data and with it, information with each field extracts from the buffer memory byte stream again, convert it into be of practical significance, for the locating information data that decision of the senior level uses, leave in the database; Adopt the filtering algorithm program that the vehicle GPS locator data that derives from database is carried out Filtering Processing then, filter out invalid data.
2) Geographic Information System program MapX5 is installed in monitoring central server, with the gst file of Geoset Manager generation map of China, the tab file of registration map of China.
3) in Visual Studio2008, create VC++ project based on dialog class, and in project, importing MapX control relevant header file MAPX.H and master file MAPX.CPP, these two files comprise the class definition and the method that are used for the MapX control is conducted interviews to be realized.
4) added Mapinfo MapX V5 control in the dialog box window of the dialog class in the last step, bind with map of China.
5) judgement time spacing parameter dateTimeSpan, if less than 180s, then change next step over to, otherwise, carry out step 6) earlier the GPS anchor point that imports into is mated, carry out step 7) then and adopt the shortest path first program to find out shortest path and the distance between former and later two vehicle GPS anchor point matched position points in the electronic chart.
6) GPS anchor point matcher
In this program,, road is divided into three types according to the node number of electronic chart center line pel: the one, linear pattern, promptly route map unit in road has only two nodes; The 2nd, nonlinear type, promptly road route map unit node number is greater than 2, less than 20; The 3rd, camber, promptly road route map unit node number is greater than 19;
This program may further comprise the steps:
6-1) receive the locating point position value, described locating point position value comprises longitude and latitude, direction, speed and mode bit etc.;
6-2) judge whether locator data is invalid,, then infer coupling, change step 6-8 then) according to historical location data if invalid; If effectively, then enter step 6-3);
6-3) judge that current whether being in of vehicle stops or the low speed sliding state, stop or the low speed sliding state then handles accordingly to it, change step 6-8 then) if be in; Otherwise, then enter 6-4);
6-4) design corresponding moving window, and then obtain highway section wherein by locating point position point; If highway section quantity is 0, then infer coupling according to historical location data, change step 6-8 then); If highway section quantity greater than 0, then enters step 6-5);
6-5) to step 6-4) highway section that obtains is carried out the connectivity topology and is checked, will be the matching candidate highway section by the highway section of topology inspection;
6-6) judge the quantity in matching candidate highway section, if unique, then directly with it as the coupling highway section, do projection by anchor point to it, change step 6-8 then); If anchor point is on last a coupling road, then directly with anchor point as the point after mating, change step 6-8 then); Otherwise, handle all candidate road section matching degree metric comJudge[i] (i=1,2., N);
6-7) to comJudge[i] the minimum rule of utilization, select a coupling highway section, perhaps handle by it fails to match;
6-8) finish this coupling;
7) shortest path first program
This algorithm routine may further comprise the steps:
7-1) generate the rectangular surfaces pel that shortest path is sought the zone
With former and later two vehicle GPS anchor point matched position points as two of rectangle to angle point, again rectangle expanded a variable λ up and down respectively, can find a shortest path that meets the demands up to this rectangle, generate a face pel according to this rectangle then;
The road route map unit that the face pel comprises above 7-2) handling in the Chinese road network figure layer is cloned into these road route map units in the interim figure layer;
7-3) handle the interim abutment points of scheming between the layer center line pel, structure abutment points matrix;
7-4) employing Dijkstra method is handled shortest path and the distance between the terminal;
8) judge whether identical with the coupling road of last data the coupling road of current anchor point is, if then utilize and divide segment distance between former and later two match points and as The last mile; Otherwise, change next step over to;
9) judge before and after the coupling road whether intersect, if intersect, then obtain intersection point, handle the distance between intersection point and former and later two match points more respectively, will apart from after the addition and as The last mile; Otherwise, change next step over to;
10) handle before and after the road that links to each other of coupling road, and calculate intersection point, handle respectively again starting point to intersection point, intersection point to intersection point, intersection point is to the distance of terminal point, addition is afterwards as The last mile then;
11) output mileage.
Invalid data described in the step 1) comprises that repeating data, mode bit are 0 data and the data that do not have searching route.
Claims (2)
1. Vehicle-Miles of Travel disposal system, it is characterized in that comprising numerical map and GPS locating information receiving system, GPS locating information receiving system comprises GPS receiver, communication station and Surveillance center, Surveillance center has monitoring central server, numerical map is installed on the monitoring central server, and Geographic Information System and database are installed on monitoring server.
2. a kind of Vehicle-Miles of Travel disposal system according to claim 1 is characterized in that described GPS receiver comprises GPS receiving antenna, frequency converter, signalling channel, microprocessor, storer and power supply.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010206678006U CN201918027U (en) | 2010-12-20 | 2010-12-20 | Road haul processing system for vehicles |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010206678006U CN201918027U (en) | 2010-12-20 | 2010-12-20 | Road haul processing system for vehicles |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN201918027U true CN201918027U (en) | 2011-08-03 |
Family
ID=44417819
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010206678006U Expired - Lifetime CN201918027U (en) | 2010-12-20 | 2010-12-20 | Road haul processing system for vehicles |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN201918027U (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105070088A (en) * | 2015-08-05 | 2015-11-18 | 四川隧唐科技股份有限公司 | GPS docking highway milepost number system and implementation method thereof |
-
2010
- 2010-12-20 CN CN2010206678006U patent/CN201918027U/en not_active Expired - Lifetime
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105070088A (en) * | 2015-08-05 | 2015-11-18 | 四川隧唐科技股份有限公司 | GPS docking highway milepost number system and implementation method thereof |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102096702B (en) | Process system of vehicle travel mileage and process method thereof | |
| EP2172048B1 (en) | System and methods for determining location using cellular transition patterns | |
| EP3109594B1 (en) | Midpoint-based map-agnostic navigation routing | |
| CN103177561B (en) | Method for generating bus real-time traffic status | |
| CN100357987C (en) | Method for obtaining average speed of city rode traffic low region | |
| AU2005334686A1 (en) | Method, device and system for modeling a road network graph | |
| CN101957208B (en) | Method for discovering new road based on probe vehicle technology | |
| CN106454722A (en) | Dynamic differential positioning method based on map matching for mobile communication terminals | |
| US8260532B2 (en) | Traffic probe in-vehicle map-based process to reduce data communications and improve accuracy | |
| Liu et al. | Calibrating large scale vehicle trajectory data | |
| CN104076377A (en) | Satellite differential positioning system based on broadcast communication and method for positioning according to satellite differential positioning system | |
| CN101361106A (en) | Traffic information providing system using digital map for collecting traffic information and method thereof | |
| CA2711252A1 (en) | Methods and systems for mapping railroad tracks | |
| CN103177585B (en) | Road turning average travel speed calculating method based on floating car data | |
| CN108415057A (en) | A kind of relative positioning method that unmanned fleet cooperates with roadside unit | |
| CN101832779A (en) | Navigation method in complicated environment | |
| CN105788263A (en) | Method for predicating road jam through mobile phone information | |
| CN101408434B (en) | Zero drift double-mould positioning and single-mould positioning method | |
| Schulze et al. | Map-matching cell phone trajectories of low spatial and temporal accuracy | |
| CN104034337B (en) | Map matching method and device for geographic position point of floating vehicle | |
| Santos et al. | A roadside unit-based localization scheme to improve positioning for vehicular networks | |
| CN201918027U (en) | Road haul processing system for vehicles | |
| CN108111979A (en) | Vehicle location trace scheduling system and method based on BDS and LoRa | |
| Bai et al. | Vehicle precise positioning based on integrated navigation system in vehicle networking | |
| Alrefaie et al. | Map matching accuracy: Energy efficient location sampling using smartphones |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: TIANZE INFORMATION INDUSTRY CORPORATION Free format text: FORMER NAME: JIANGSU TIANZE INFORMATION CO., LTD. |
|
| CP01 | Change in the name or title of a patent holder |
Address after: 210019 Yunlong District, Nanjing, Jiangsu, No. 80, No. Patentee after: Tianze Information Industry Corporation Address before: 210019 Yunlong District, Nanjing, Jiangsu, No. 80, No. Patentee before: Jiangsu Tianze Information Industry Co., Ltd. |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Assignee: JIANGSU SEA LEVEL DATA TECHNOLOGY Co.,Ltd. Assignor: TIANZE INFORMATION INDUSTRY Corp. Contract record no.: X2020320000015 Denomination of utility model: Process system of vehicle travel mileage and process method thereof Granted publication date: 20110803 License type: Exclusive License Record date: 20200518 |
|
| CX01 | Expiry of patent term | ||
| CX01 | Expiry of patent term |
Granted publication date: 20110803 |