CN105157716B - Lorry trip network drawing generating method, device and system - Google Patents
Lorry trip network drawing generating method, device and system Download PDFInfo
- Publication number
- CN105157716B CN105157716B CN201510585822.5A CN201510585822A CN105157716B CN 105157716 B CN105157716 B CN 105157716B CN 201510585822 A CN201510585822 A CN 201510585822A CN 105157716 B CN105157716 B CN 105157716B
- Authority
- CN
- China
- Prior art keywords
- route
- priority
- lorry
- information
- feasible
- 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
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000033228 biological regulation Effects 0.000 abstract description 12
- 206010039203 Road traffic accident Diseases 0.000 abstract description 10
- 239000011159 matrix material Substances 0.000 description 6
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
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/3461—Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries
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)
Abstract
The present invention relates to a kind of lorry trip network drawing generating method, device and system, obtain the essential information of the restricted information and vehicle of route, and the feasible route of lorry and infeasible route are determined according to the two, infeasible route is excluded in the n rank undirected graphs of acquisition, lorry trip network, selection for reference are generated according to the feasible route of lorry.The feasible route of offer is set for this particular vehicle of lorry, being avoided that after user reaches the route needs return to select other routes again, it reduces operation cost, reduce haulage time, simultaneously, due to avoiding the route of limitation, so reducing risk violating the regulations and the risk of traffic accident.
Description
Technical field
The present invention relates to traffic and transport fields, more particularly to a kind of lorry trip network drawing generating method, device and are
System.
Background technology
With the development of GPS positioning technology, people input departure place and destination in navigation system, you can obtain from going out
Hair ground arrives all paths of destination, and then therefrom chooses suitable route.This gives people, especially to the unfamiliar department of road conditions
Machine brings many facilities.
But navigation system in the prior art only only accounts for whether the route can arrive at from departure place,
All routes arrived at from departure place are all supplied to user, do not consider other factors.However, lorry, as one
The special vehicles of kind, Public Security Department may have many policies to limit in different routes, to lorry, such as limit for height, limit for width, limit
Weight, certain period restrict driving etc., this allows for navigation system in the prior art, is not particularly suited for lorry this specific traffic work
Lorry, may be directed to the route limited by policy by tool, caused driver to need to turn around to return or break rules and regulations to pass through, led to transport
Cost increases, or even causes traffic accident, casualties on some limitation sections.So how to be provided for load truck special
Fixed feasible route is a problem in existing communications and transportation.
Invention content
Based on this, it is necessary to the problem of to how to provide particular feasible route for load truck, provide a kind of lorry and go out
Row network drawing generating method,
All routes for obtaining departure place to destination generate the n rank Undirected networks of all routes according to all routes
Figure.
Obtain the restricted information of all routes.
Obtain the essential information of lorry.
According to restricted information, essential information and n rank undirected graphs, lorry trip network is generated.
The present invention also provides a kind of lorry trip network generating means, including：
First acquisition module, all routes for obtaining departure place to destination generate all roads according to all routes
The n rank undirected graphs of line.
Second acquisition module, the restricted information for obtaining all routes.
Third acquisition module, the essential information for obtaining lorry.
Generation module, for according to restricted information, essential information and n rank undirected graphs, generating lorry trip network.
The present invention also provides a kind of lorry trip networks to generate system, including above-mentioned lorry trip network generating means
And
Route restricted information provides device, the restricted information for providing all routes.
Lorry provided by the invention trip network drawing generating method, device and system, obtain the restricted information and vehicle of route
Essential information, and the feasible route of lorry and infeasible route are determined according to the two, in the n rank undirected graphs of acquisition
Infeasible route is excluded, lorry trip network, selection for reference are generated according to the feasible route of lorry.What is provided is feasible
Route is set for this particular vehicle of lorry, is avoided that after user reaches the route and return is needed to select it again
His route, reduces operation cost, reduces haulage time, simultaneously as the route of limitation is avoided, so reducing violating the regulations
The risk of risk and traffic accident.
Description of the drawings
Fig. 1 is the flow chart of one embodiment of lorry trip network drawing generating method in the present invention；
Fig. 2 is the schematic diagram of undirected graph in the present invention；
Fig. 3 is the flow chart of the first preferred embodiment of lorry trip network drawing generating method in the present invention；
Fig. 4 is the flow chart of the second preferred embodiment of lorry trip network drawing generating method in the present invention；
Fig. 5 is the flow chart of the third preferred embodiment of lorry trip network drawing generating method in the present invention；
Fig. 6 is the flow chart of the 4th preferred embodiment of lorry trip network drawing generating method in the present invention；
Fig. 7 is the flow chart of the 5th preferred embodiment of lorry trip network drawing generating method in the present invention；
The structure chart of one embodiment of lorry trip network generating means in Fig. 8 present invention；
The structure chart of one embodiment of the second acquisition module of lorry trip network generating means in Fig. 9 present invention；
The structure chart of one embodiment of the third acquisition module of lorry trip network generating means in Figure 10 inventions；
The structure chart of one embodiment of the generation module of lorry trip network generating means in Figure 11 inventions；
Lorry trip network generates the structure chart of one embodiment of system in Figure 12 inventions.
Specific implementation mode
As shown in Figure 1, it is shown that first embodiment of the invention, a kind of lorry trip network drawing generating method, including：
S100：Departure place is obtained to all routes of destination, according to all routes, the n ranks for generating all routes are undirected
Network.
Specifically, can be according to all routes of existing airmanship acquisition departure place to destination, by this all route
Each corner be set as the intersections of a node either two different routes and be set as a node or each traffic lights
Place is set as a node or the track of road occurs to be set as a node at increase and decrease, it is of course also possible to by above-mentioned each factor
Synthesis accounts for node is arranged, and to form the node of undirected graph, and is numbered to each node, is denoted as respectively
Node 1, node 2 ... node n.The each two adjacent node communicated by road forms all routes, forms undirected graph
Side.By node and side, the n rank undirected graphs for characterizing departure place to all routes of destination are formed.As shown in Figure 2.
S200：Obtain the restricted information of all routes.
Specifically, the restricted information of route can be by communicating to connect with the Information Network of Public Security Department, wired or wireless side
Formula obtains the restricted information of all routes from origin to destination, also can directly be carried by third-party server or operator
For the restricted information.In another embodiment, restricted information can also be automatically generated by information network platform or user according to
Information is collected voluntarily to input.In addition, restricted information, policy limitation that is optional but being not limited only to Public Security Department.Restricted information is also
May include the information that other drivers or user provide.Such as, certain driver reaches certain section, it is found that standard the section is not suitable for
Lorry pass through after, which can be fed back to server, operator or public information network platform, which goes on a journey network
Generation method, can be thus to obtain the restricted information of route.
S300：Obtain the essential information of lorry.
Specifically, the essential information of lorry can be provided by user oneself, input, or obtained by the sensor sensing of setting
.The sensor, it is optional but be not limited only to infrared sensor, pressure sensor etc..
S400：According to restricted information, essential information and n rank undirected graphs, lorry trip network is generated.
Specifically, according to the route restricted information of acquisition and the essential information of lorry, in institute from origin to destination
Have in route, the intransitable route of lorry is excluded, the route of only remaining lorry P Passable is presented on lorry trip network
On figure, for reference, selection.Preferably, include or being sent to the hand of user on terminal server by the wireless network figure
Hold mobile terminal.
In this embodiment, the restricted information of route and the essential information of vehicle are obtained, and lorry is determined according to the two
Feasible route and infeasible route, exclude infeasible route in the n rank undirected graphs of acquisition, and according to lorry can walking along the street
Line generates lorry trip network, selection for reference.The feasible route of offer is for this particular vehicle of lorry
And set, it is avoided that after user reaches the route and return is needed to select other routes again, and then cut operating costs, reduce fortune
The defeated time, simultaneously as the route of limitation is avoided, so reducing risk violating the regulations and the risk of traffic accident.
As shown in Figure 3, it is shown that the first preferred embodiment of the present embodiment,
Step S200, including S210：Obtain the maximum height limit of all routes.
Step S300, including S310：Obtain lorry height.
Step S400, including：
S410：The maximum height limit of every route and lorry height are compared one by one, if the maximum height limit of route is more than lorry
Highly, it is determined that route is feasible route；If the maximum height limit of route is less than or equal to lorry height, it is determined that route is can not
Walking along the street line.
S420：According to feasible route, lorry trip network is generated.
It is optional but be not limited only to use matrix H specifically, obtain the maximum height limit of all routes from origin to destination
The real-time height h of expression and charge of trucks cargo, by each element in matrix H compared with real-time height h, if route
Maximum height limit is more than lorry height, then it represents that the lorry can be determined as the feasible route of lorry by the route；If route
Maximum height limit is less than or equal to lorry height, then it represents that if the lorry cannot be forced through by the route or the lorry
The route can cause to break rules and regulations, in some instances it may even be possible to cause traffic accident, be determined as the infeasible route of lorry.In turn, not by lorry
Feasible route excludes on n rank undirected graphs, according to the feasible route of lorry, generates lorry trip network.Preferably, if
Public Security Department is that estimation lorry reaches to the maximum height limit that the maximum height limit of certain route is the route at times, then obtained
The time corresponding maximum height limit of the route.Specifically, the maximum height limit may be, for example, level-one, the maximum height limit of Class II highway
For 5.0m；Three-level, the maximum height limit of Class IV highway are 4.5m；Bridge, tunnel maximum height limit be 3.5m etc..
In this embodiment, the maximum height limit of route and the current real-time height of lorry are obtained, by lorry cannot by or
Do not allow by route exclude, be avoided that after driver reaches the route to need to return and select other routes again, reduce fortune
Battalion's cost and haulage time reduce risk violating the regulations and friendship simultaneously because having evaded the route limited in Public Security Department's policy
Logical accident risk.
As shown in Figure 4, it is shown that second preferred embodiment of the present embodiment,
Step S200, including S220：Obtain the Max. Clearance _M. of all routes.
Step S300, including S320：Obtain lorry width.
Step S400, including：
S430：The Max. Clearance _M. of every route and lorry width are compared one by one, if the Max. Clearance _M. of route is more than lorry
Width, it is determined that route is feasible route.If the Max. Clearance _M. of route is less than or equal to lorry width, it is determined that route is can not
Walking along the street line.
S440：According to feasible route, lorry trip network is generated.
It is optional but be not limited only to use matrix W specifically, obtain the Max. Clearance _M. of all routes from origin to destination
It indicates and current real-time width w when charge of trucks cargo, by the current real-time width w of each element and the lorry in matrix W
Compare, if the Max. Clearance _M. of route is more than lorry width, then it represents that the lorry can be determined as the feasible of lorry by the route
Route；If the Max. Clearance _M. of route is less than or equal to lorry width, then it represents that the lorry cannot pass through the route or the lorry
If being forced through the route, it can cause to break rules and regulations, in some instances it may even be possible to cause traffic accident, be determined as the infeasible route of lorry.Into
And exclude the infeasible route of lorry on n rank undirected graphs, according to the feasible route of lorry, generate lorry trip net
Network figure.Preferably, if Public Security Department is at times to the Max. Clearance _M. of certain route, it estimates that lorry reaches the route
Time, the Max. Clearance _M. information of the period is obtained according to the time.Specifically, the Max. Clearance _M. may be, for example, certain bridge
Max. Clearance _M. is 2.5m.
In this embodiment, the Max. Clearance _M. of route and the real-time width of lorry are obtained, it will be due to the real-time width of lorry
Cannot by or do not allow by route exclude, be avoided that after driver reaches the route and need to return, reduce operation cost
And haulage time reduces risk violating the regulations and traffic accident simultaneously because having evaded the route limited in Public Security Department's policy
Risk.
As shown in Figure 5, it is shown that the third preferred embodiment of the present embodiment,
Step S200, including S230：Obtain the maximum weight of all routes.
Step S300, including S330：Obtain lorry weight.
Step S400, including：
S450：The maximum weight of every route and lorry weight are compared one by one, if the maximum weight of route is more than lorry
Weight, it is determined that route is feasible route.If the maximum weight of route is less than or equal to lorry weight, it is determined that route is can not
Walking along the street line.
S460：According to feasible route, lorry trip network is generated.
It is optional but be not limited only to use matrix O specifically, obtain the maximum weight of all routes from origin to destination
Current real-time weight o when expression and charge of trucks cargo, by the real-time weight o ratios of each element and lorry in matrix O
Compared with if the maximum weight of route is more than lorry weight, then it represents that the lorry can be by the route, and be determined as lorry can walking along the street
Line；If the maximum weight of route is less than or equal to lorry weight, then it represents that the lorry cannot be by the route or the lorry such as
Fruit is forced through the route, can cause to break rules and regulations, in some instances it may even be possible to cause the traffic accidents such as bridge collapse, be determined as the infeasible of lorry
Route.In turn, the infeasible route of lorry is excluded on n rank undirected graphs, according to the feasible route of lorry, generates lorry
Trip network.Preferably, if Public Security Department is at times to the maximum weight of certain route, it estimates that lorry reaches
The time of the route obtains the maximum weight information of the period according to the time.Specifically, the maximum weight may be, for example, certain
The freight weight limit of bridge is 20t.
In this embodiment, the maximum weight of route and the real-time weight of lorry are obtained, it will be due to lorry current weight not
Can by or do not allow by route exclude, be avoided that after driver reaches the route and need to return, reduce operation cost and
Operating cost reduces risk violating the regulations and traffic accident wind simultaneously because having evaded the route limited in Public Security Department's policy
Danger.
As shown in Figure 6, it is shown that the 4th preferred embodiment of the present embodiment,
Step S200, including S240：Obtain the limitation time of all routes.
Step S300, including S340：Obtain time of the lorry by certain route.
Step S400, including：
S470：The limitation time of every route and lorry are compared one by one by the time of certain route, if lorry passes through
The time of certain route is outside the limitation time of certain route, it is determined that the route is feasible route.If lorry passes through certain road
The time of line is within the limitation time of certain route, it is determined that the route is infeasible route.
S480：According to feasible route, lorry trip network is generated.
Specifically, obtaining the limitation time of all routes and estimating that lorry reaches the time of the route, if the lorry of estimation
By the time of certain route outside the limitation time of this route, it is determined that the route is feasible route.If the lorry of estimation
By the time of certain route within the limitation time of this route, it is determined that the route is infeasible route.In turn, by lorry
Infeasible route excluded on n rank undirected graphs, according to the feasible route of lorry, generate lorry and go on a journey network.Specifically
, which can be morning 9:00 to afternoon 7:00, lorry can not enter urban road；At night 12:After 00, lorry can not
By the road etc. near campus.
It in this embodiment, the time for obtaining the limitation time and lorry estimation arrival of the route route, will be in certain period
Lorry do not allow by route exclude, be avoided that after driver reaches the route and need to return, reduce operation cost and transport
Time reduces risk violating the regulations and street accidents risks simultaneously because having evaded the route limited in Public Security Department's policy.
Preferably, the first-the four preferred embodiment of above-mentioned first embodiment can be combined arbitrarily, and step S200 may include walking
The arbitrary one or multi-step of rapid S210-S240, step S300 may include arbitrary one or multi-step, the step of step S310-S340
S400 may include that step S410-S420, S430-S440, S450-S460, S470-S480's is arbitrary one or more groups of.Such as Fig. 7 institutes
Show, with step S200 include step S210-S230, step S300 include step S310-S330, step S400 includes step
For the substantive content of S410-S460, it is shown that the 5th preferred embodiment of the present embodiment,
Step S200, including：It is excellent to obtain the first priority restricted information, the second priority restricted information and third by S250
First grade restricted information.
Step S300, including：S350, acquisition the first priority essential information corresponding with the first priority restricted information,
The second priority essential information corresponding with the second priority restricted information, and third corresponding with third priority restricted information
Priority essential information.
Step S400, including：
S490：First priority restricted information of every route and the first priority essential information are compared one by one, if road
First priority restricted information of line is more than the first priority essential information, it is determined that route is the first feasible route.If route
The first priority restricted information be less than or equal to the first priority essential information, it is determined that route be the first infeasible route.
S4100：By the second priority restricted information of the first feasible route and the second priority essential information one by one compared with,
If the second priority restricted information of the first feasible route is more than the second priority essential information, it is determined that the first feasible route is
Second feasible route.If the second priority restricted information of the first feasible route is less than or equal to the second priority essential information,
Then determine that the first feasible route is the second infeasible route.
S4110：By the third priority restricted information of the second feasible route and third priority essential information one by one compared with,
If the third priority restricted information of the second feasible route is more than third priority essential information, it is determined that the second feasible route is
Third feasible route.If the third priority restricted information of the second feasible route is less than or equal to third priority essential information,
Then determine that the second feasible route is the infeasible route of third.
S4120：According to third feasible route, lorry trip network is generated.
Wherein, the first priority restricted information, the second priority restricted information and third priority restricted information include road
The maximum weight of the maximum height limit of line, the Max. Clearance _M. of route, route, the maximum height limit of route, the Max. Clearance _M. of route and road
The maximum weight of line is respectively as the first priority restricted information, the second priority restricted information and third priority restricted information
Priority orders can convert.
First priority essential information, the second priority essential information and third priority essential information include lorry height
Degree, lorry width, lorry weight, lorry height is corresponding with the maximum height limit of route, the Max. Clearance _M. of lorry width and route
Corresponding, lorry weight is corresponding with the maximum weight of route.
Specifically, using the first priority restricted information as maximum height limit, the second priority restricted information be Max. Clearance _M.,
Three priority restricted informations are the first limitation height according to all routes of lorry trip network drawing generating method for maximum weight
The feasible route of degree and the determination of lorry height based on height, i.e. the first feasible route, then on this basis can walking along the street according to first
The Max. Clearance _M. and lorry width of line, further screen the first feasible route, determine based on highly feasible with width
Route, i.e. the second feasible route, then on this basis according to the maximum weight of the second feasible route and lorry weight, it can to second
Walking along the street line is further screened, and the feasible route based on height, width and weight, i.e. third feasible route is determined, to raw
At the lorry trip network based on height, width and weight.In addition, the first-the four of above-mentioned first embodiment is preferably implemented
The specific implementation of other arbitrary combination embodiments of example is similar with the 5th preferred embodiment, and details are not described herein.
In this embodiment, lorry trip network drawing generating method can obtain the first priority limitation letter of all routes
Breath, the second priority restricted information, third priority restricted information and corresponding first priority essential information, the second priority
Essential information, third priority essential information determine therefrom that the lorry trip network based on three restrictive conditions, due to considering
More comprehensively, so the lorry determined is gone on a journey, network is more accurate for factor.
As shown in figure 8, in the second embodiment, the present invention also provides a kind of lorry trip network generating means, packets
It includes：
First acquisition module 100, all routes for obtaining departure place to destination generate institute according to all routes
There are the n rank undirected graphs of route.
Specifically, the first acquisition module 100 is connect with GPS communication, all routes of acquisition departure place to destination, and will
Each corner of this all route be set as a node either two different routes intersection be set as a node or
Each traffic light is set as a node or the track of road occurs to be set as a node at increase and decrease, it is of course also possible to by upper
It states each combined factors to account for node is arranged, to form the node of undirected graph, and node is numbered, point
It is not denoted as node 1, node 2 ... node n.The each two adjacent node communicated by road forms all routes, is formed undirected
The side of network.By node and side, characterization departure place is formed to the n rank undirected graphs of all routes of destination, such as Fig. 2
It is shown.First acquisition module 100 can also directly be connect with existing navigation system, directly acquire from origin to destination all
Route generates the n rank undirected graphs of all routes.
Second acquisition module 200, the restricted information for obtaining all routes.
Specifically, the second acquisition module 200 can be connect with the official website Platform communication of Public Security Department, current all roads are obtained
The policy restricted information of line can also be paid with server, operators in co-operation and obtain the restricted information of route, the second acquisition module
200 can also be an existing input unit, and user can collect the restricted information of route by internet, browser oneself, and
It is manually entered by the second acquisition module 200.In addition, the second acquisition module 200, can also be a mobile Internet platform, it can
The restricted information for receiving other users or government's transmission, generates the restricted information of all routes in time.
Third acquisition module 300, the essential information for obtaining lorry.
Optional but be not limited only to an input unit specifically, third acquisition module 300, user can voluntarily input lorry
Essential information.Third acquisition module 300 can be also other sensors, can incude the essential information of lorry.
Generation module 400, for according to restricted information, essential information and n rank undirected graphs, generating lorry trip network
Figure.
Specifically, generation module 400 is according to the route restricted information of acquisition and the essential information of lorry, from departure place to
In all routes of destination, the intransitable route of lorry is excluded, the route of only remaining lorry P Passable is presented on goods
Vehicle is gone on a journey on network, for reference, selection.
In this embodiment, lorry trip network generating means, obtain the restricted information of route and the basic letter of vehicle
Breath, and the feasible route of lorry and infeasible route are determined according to the two, it is excluded in the n rank undirected graphs of acquisition infeasible
Route generates lorry trip network according to the feasible route of lorry, and selection for reference is avoided that user reaches the route
After need return select other routes again, reduce operation cost, reduce haulage time, simultaneously as avoiding limitation
Route, so reducing risk violating the regulations and the risk of traffic accident.
As shown in figs. 9-11, in the first preferred embodiment of second embodiment,
Second acquisition module 200, including maximum height limit acquiring unit 210, the maximum height limit for obtaining all routes.
Third acquisition module 300, including height acquiring unit 310, for obtaining lorry height.
Generation module 400, including：
First judging unit 410, for comparing the maximum height limit of every route and lorry height one by one, if the limit of route
System height is more than lorry height, it is determined that route is feasible route.If the maximum height limit of route is less than or equal to lorry height,
Determine that route is infeasible route.
First generation unit 420, for according to feasible route, generating lorry trip network.
In the second preferred embodiment of second embodiment,
Second acquisition module 200, including Max. Clearance _M. acquiring unit 220, the Max. Clearance _M. for obtaining all routes.
Third acquisition module 300, including width acquisition unit 320, for obtaining lorry width.
Generation module 400, including：
Second judgment unit 430, for comparing the Max. Clearance _M. of every route and lorry width one by one, if the limit of route
Width processed is more than lorry width, it is determined that route is feasible route.If the Max. Clearance _M. of route is less than or equal to lorry width,
Determine that route is infeasible route.
Second generation unit 440, for according to feasible route, generating lorry trip network.
In the third preferred embodiment of second embodiment,
Second acquisition module 200 further includes maximum weight acquiring unit 230, the maximum weight for obtaining all routes.
Third acquisition module 300 further includes weight acquiring unit 330, for obtaining lorry weight.
Generation module 400 further includes：
Third judging unit 450, for comparing the maximum weight of every route and lorry weight one by one, if the limit of route
Weight processed is more than lorry weight, it is determined that route is feasible route.If the maximum weight of route is less than or equal to lorry weight,
Determine that route is infeasible route.
Third generation unit 460, for according to feasible route, generating lorry trip network.
In the 4th preferred embodiment of second embodiment,
Second acquisition module 200, including limitation time acquisition unit 240, the limitation time for obtaining all routes.
Third acquisition module 300, including time acquisition unit 340, the time for obtaining lorry by certain route.
Generation module 400, including：
4th judging unit 470, for by the limitation time of every route and lorry by time of certain route one by one
Compare, if lorry by the time of certain route outside the limitation time of certain route, it is determined that the route be feasible route.If
Lorry is by the time of certain route within the limitation time of certain route, it is determined that the route is infeasible route.
4th generation unit 480, for according to feasible route, generating lorry trip network.
Preferably, the first-the four preferred embodiment of above-mentioned second embodiment can be combined arbitrarily, the second acquisition module 200
May include any one or more units of 210-240, third acquisition module 300 may include 310-340 any one or it is more
A unit, the 4th acquisition module 400 may include any one group of unit or more of 410-420,430-440,450-460,470-480
Group unit.
As shown in figure 12, in the third embodiment, the present invention also provides a kind of lorry trip networks to generate system, including
Above-mentioned arbitrary lorry trip network generating means 10 and,
Route restricted information provides device 20, the restricted information for providing all routes.
Specifically, route restricted information provides device 20, can be server, operator, public information platform etc., by having
Line or wireless mode provide route restricted information from origin to destination for lorry trip network generating means.
Preferably, lorry trip network generates system, further includes：
Lorry information provider unit 30, the essential information for providing lorry.
Specifically, lorry information provider unit 30 is sensor, the letters such as height, width, the weight of lorry can be sensed in real time
Breath is supplied to lorry trip network generating means.
It is corresponding with lorry trip network drawing generating method with Truck trip network generating means, system, it is specific real
Applying details, details are not described herein.Each technical characteristic of embodiment described above can be combined arbitrarily, to keep description succinct,
Combination not all possible to each technical characteristic in above-described embodiment is all described, as long as however, these technical characteristics
Combination be not present contradiction, be all considered to be this specification record range.
Several embodiments of the invention above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the protection of the present invention
Range.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (3)
- The network drawing generating method 1. a kind of lorry is gone on a journey, which is characterized in that including：Departure place is obtained to all routes of destination, node, each two phase for having road to communicate are set in all routes Neighbors forms the side of undirected graph, and the n rank undirected graphs of all routes are generated by the node and side；Obtain the restricted information of all routes；Obtain the essential information of the lorry；According to the restricted information, the essential information and the n ranks undirected graph, the lorry trip network is generated；The step of restricted information for obtaining all routes, including：Obtain the first priority restricted information, second preferentially The limitation time of grade restricted information, third priority restricted information and all routes；The step of essential information for obtaining the lorry, including：It obtains corresponding with the first priority restricted information First priority essential information, the second priority essential information corresponding with the second priority restricted information, with described The time that the corresponding third priority essential information of three priority restricted informations and lorry pass through all routes；It is described according to the restricted information, the essential information and the n ranks undirected graph, generate the lorry trip network The step of figure, including：The first priority restricted information of every route and the first priority essential information are compared one by one, if route The first priority restricted information be more than the first priority essential information, it is determined that the route is first can walking along the street Line；If the first priority restricted information of route is less than or equal to the first priority essential information, it is determined that described Route is the first infeasible route；The second priority restricted information of first feasible route and the second priority essential information are compared one by one Compared with if the second priority restricted information of first feasible route is more than the second priority essential information, really Fixed first feasible route is the second feasible route；If the second priority restricted information of first feasible route is small In or equal to the second priority essential information, it is determined that first feasible route is the second infeasible route；The third priority restricted information of second feasible route is compared one by one with the third priority essential information Compared with if the third priority restricted information of second feasible route is more than the third priority essential information, really Fixed second feasible route is third feasible route；If the third priority restricted information of second feasible route is small In or equal to the third priority essential information, it is determined that second feasible route is the infeasible route of third；The limitation time of each third feasible route and lorry are compared one by one by the time of each third feasible route, If lorry is by the time of the third feasible route outside the limitation time of third feasible route, it is determined that third feasible route For feasible route；If lorry is by the time of the third feasible route within the limitation time of third feasible route, it is determined that third is feasible Route is infeasible route；According to the feasible route, lorry trip network is generated；Wherein, the first priority restricted information, the second priority restricted information and third priority limitation letter Breath include the maximum height limit of route, the Max. Clearance _M. of route, route maximum weight, the maximum height limit of the route, the road The maximum weight of the Max. Clearance _M. of line and the route is respectively as the first priority restricted information, second priority The priority orders of restricted information and the third priority restricted information can convert；The first priority essential information, the second priority essential information and the third priority essential information include Lorry height, lorry width, lorry weight, the lorry height is corresponding with the maximum height limit of the route, and the lorry is wide Degree is corresponding with the Max. Clearance _M. of the route, and the lorry weight is corresponding with the maximum weight of the route.
- The network generating means 2. a kind of lorry is gone on a journey, which is characterized in that including：First acquisition module, all routes for obtaining departure place to destination are arranged node in all routes, have The each two adjacent node that road communicates forms the side of undirected graph, and the n of all routes is generated by the node and side Rank undirected graph；Second acquisition module, the restricted information for obtaining all routes；Third acquisition module, the essential information for obtaining the lorry；Generation module, for according to the restricted information, the essential information and the n ranks undirected graph, generating the goods Vehicle trip network；Second acquisition module, for obtaining the first priority restricted information, the second priority restricted information, third priority The limitation time of restricted information and all routes；The third acquisition module is believed substantially for obtaining the first priority corresponding with the first priority restricted information Breath, the second priority essential information corresponding with the second priority restricted information and the third priority restricted information Corresponding third priority essential information and acquisition time of the lorry by all routes；The generation module, for believing the first priority restricted information of every route and first priority substantially Breath compares one by one, if the first priority restricted information of route is more than the first priority essential information, it is determined that institute It is the first feasible route to state route；If the first priority restricted information of route is less than or equal to the first priority base This information, it is determined that the route is the first infeasible route；The second priority restricted information of first feasible route and the second priority essential information are compared one by one Compared with if the second priority restricted information of first feasible route is more than the second priority essential information, really Fixed first feasible route is the second feasible route；If the second priority restricted information of first feasible route is small In or equal to the second priority essential information, it is determined that first feasible route is the second infeasible route；The third priority restricted information of second feasible route is compared one by one with the third priority essential information Compared with if the third priority restricted information of second feasible route is more than the third priority essential information, really Fixed second feasible route is third feasible route；If the third priority restricted information of second feasible route is small In or equal to the third priority essential information, it is determined that second feasible route is the infeasible route of third；The limitation time of each third feasible route and lorry are compared one by one by the time of each third feasible route, If lorry is by the time of the third feasible route outside the limitation time of third feasible route, it is determined that third feasible route For feasible route；If lorry is by the time of the third feasible route within the limitation time of third feasible route, it is determined that Third feasible route is infeasible route；According to the feasible route, lorry trip network is generated；Wherein, the first priority restricted information, the second priority restricted information and third priority limitation letter Breath include the maximum height limit of route, the Max. Clearance _M. of route, route maximum weight, the maximum height limit of the route, the road The maximum weight of the Max. Clearance _M. of line and the route is respectively as the first priority restricted information, second priority The priority orders of restricted information and the third priority restricted information can convert；The first priority essential information, the second priority essential information and the third priority essential information include Lorry height, lorry width, lorry weight, the lorry height is corresponding with the maximum height limit of the route, and the lorry is wide Degree is corresponding with the Max. Clearance _M. of the route, and the lorry weight is corresponding with the maximum weight of the route.
- 3. a kind of lorry trip network generates system, which is characterized in that including lorry as claimed in claim 2 trip network Figure generating means and route restricted information provide device, the restricted information for providing all routes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510585822.5A CN105157716B (en) | 2015-09-15 | 2015-09-15 | Lorry trip network drawing generating method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510585822.5A CN105157716B (en) | 2015-09-15 | 2015-09-15 | Lorry trip network drawing generating method, device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105157716A CN105157716A (en) | 2015-12-16 |
| CN105157716B true CN105157716B (en) | 2018-09-11 |
Family
ID=54798655
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510585822.5A Expired - Fee Related CN105157716B (en) | 2015-09-15 | 2015-09-15 | Lorry trip network drawing generating method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105157716B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105651297A (en) * | 2016-03-01 | 2016-06-08 | 深圳市凯立德科技股份有限公司 | Route planning method, device and equipment |
| CN106846869B (en) * | 2017-02-21 | 2019-03-08 | 驼队重卡（北京）物流信息技术有限责任公司 | A kind of update method of lorry navigation road auxiliary information |
| CN107490371A (en) * | 2017-07-19 | 2017-12-19 | 广州贰拾肆机器人科技有限公司 | The system of selection of smart machine walking path, smart machine and storage medium |
| CN109559500A (en) * | 2018-11-13 | 2019-04-02 | 上海建工集团股份有限公司 | The selection of engineering transportation vehicle travel path and tracking and system |
| CN112197784A (en) * | 2020-09-30 | 2021-01-08 | 深圳道可视科技有限公司 | Obstacle detection system for vehicle |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101571401A (en) * | 2009-06-01 | 2009-11-04 | 深圳市凯立德计算机系统技术有限公司 | Navigation system and method for planning navigation route used for the system |
| CN102037319A (en) * | 2009-01-14 | 2011-04-27 | 通腾科技股份有限公司 | Improvements relating to navigation apparatus used in-vehicle |
| CN102331260A (en) * | 2010-06-08 | 2012-01-25 | 霍尼韦尔国际公司 | Show navigator restriction on the airborne display element of the vehicles |
| CN103109161A (en) * | 2010-06-22 | 2013-05-15 | 通腾科技股份有限公司 | Navigation device & method |
| CN103542859A (en) * | 2013-10-22 | 2014-01-29 | 深圳市凯立德科技股份有限公司 | Path planning method and positioning and navigation equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8935086B2 (en) * | 2007-02-06 | 2015-01-13 | GM Global Technology Operations LLC | Collision avoidance system and method of detecting overpass locations using data fusion |
-
2015
- 2015-09-15 CN CN201510585822.5A patent/CN105157716B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102037319A (en) * | 2009-01-14 | 2011-04-27 | 通腾科技股份有限公司 | Improvements relating to navigation apparatus used in-vehicle |
| CN101571401A (en) * | 2009-06-01 | 2009-11-04 | 深圳市凯立德计算机系统技术有限公司 | Navigation system and method for planning navigation route used for the system |
| CN102331260A (en) * | 2010-06-08 | 2012-01-25 | 霍尼韦尔国际公司 | Show navigator restriction on the airborne display element of the vehicles |
| CN103109161A (en) * | 2010-06-22 | 2013-05-15 | 通腾科技股份有限公司 | Navigation device & method |
| CN103542859A (en) * | 2013-10-22 | 2014-01-29 | 深圳市凯立德科技股份有限公司 | Path planning method and positioning and navigation equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105157716A (en) | 2015-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105157716B (en) | Lorry trip network drawing generating method, device and system | |
| US10989556B1 (en) | Traffic risk a avoidance for a route selection system | |
| US11257377B1 (en) | System for identifying high risk parking lots | |
| US11656094B1 (en) | System for driver's education | |
| Brownell et al. | A driverless alternative: fleet size and cost requirements for a statewide autonomous taxi network in New Jersey | |
| US11037444B2 (en) | Designing preferred vehicle routes based on driving scores from other vehicles | |
| Shaheen et al. | Mobility and the sharing economy: Potential to facilitate the first-and last-mile public transit connections | |
| EP3400573B1 (en) | Data processing system communicating with a map data processing system to generate a display of one or more segments of one or more vehicle routes | |
| US20180075747A1 (en) | Systems, apparatus, and methods for improving safety related to movable/ moving objects | |
| TWI515411B (en) | Method and system for route personalization | |
| US20170011465A1 (en) | Method and apparatus for providing fee rate based on safety score | |
| JP6919405B2 (en) | Digital signage control device, digital signage control method, program, recording medium | |
| US20210270620A1 (en) | Traffic Risk Notification System | |
| Furth et al. | Measuring low-stress connectivity in terms of bike-accessible jobs and potential bike-to-work trips | |
| JP6190627B2 (en) | Information processing system, information processing server, information processing method, and information processing program | |
| CN105091898A (en) | Truck traveling path generating method, device and system based on time and cost | |
| CN105222798B (en) | Time-based lorry traffic path generation method, device and system | |
| Tarapiah et al. | Offline public transportation management system based on GPS/WiFi and open street maps | |
| Din et al. | The use of geographical information system in the assessment of level of service of transit systems in Kuala Lumpur | |
| CN106949899A (en) | A kind of bicycle transfer public transport combined type Route Generation device and route generation method | |
| Ouyang et al. | Safe path planning strategy for bike net | |
| Kunchev | Methodology for selection the truck route | |
| CN105303504A (en) | Cost-based truck travel route generation method, device and system | |
| Ullah et al. | Service-Oriented Architecture for Providing ITS Services in Vehicular Ad Hoc Networks | |
| van Eggermond et al. | Mobility |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180911 |