CN106875734A - A kind of method and device for pushing parking route - Google Patents
A kind of method and device for pushing parking route Download PDFInfo
- Publication number
- CN106875734A CN106875734A CN201710193175.2A CN201710193175A CN106875734A CN 106875734 A CN106875734 A CN 106875734A CN 201710193175 A CN201710193175 A CN 201710193175A CN 106875734 A CN106875734 A CN 106875734A
- Authority
- CN
- China
- Prior art keywords
- parking
- time
- route
- temporary route
- temporary
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
- G08G1/145—Traffic control systems for road vehicles indicating individual free spaces in parking areas where the indication depends on the parking areas
- G08G1/146—Traffic control systems for road vehicles indicating individual free spaces in parking areas where the indication depends on the parking areas where the parking area is a limited parking space, e.g. parking garage, restricted space
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07B—TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
- G07B15/00—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points
- G07B15/02—Arrangements or apparatus for collecting fares, tolls or entrance fees at one or more control points taking into account a variable factor such as distance or time, e.g. for passenger transport, parking systems or car rental systems
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of method and device for pushing parking route.Wherein, the method includes：Determine current location and target location, and determine the parking lot information in all parking lots in the preset range of target location；A temporary route is chosen in all of predetermined paths, predetermined paths are from current location to a route of idle parking stall；Determine the very first time of temporary route；Determine the second time of temporary route；Parking total time according to temporary route judge whether temporary route is optimal route, and temporary route is pushed to user when temporary route is optimal route, parking total time is the very first time and the second time sum.The method can save amount of calculation, improve computational efficiency；Meanwhile, the method can be combined with parking lot information and the optimal route for directly reaching idle parking stall pushed to user, it is to avoid user voluntarily finds parking stall, shortens down time, improves out line efficiency.
Description
Technical field
The present invention relates to route line decision technical field, more particularly to a kind of method and device for pushing parking route.
Background technology
With the continuous improvement of the fast-developing and name living standard of China's economy, automobile largely enters the family of people
Front yard, facilitates the traffic trip of people.Meanwhile, with GPS (Global Positioning System, global positioning system)
Popularization, user (such as driver) can utilize GPS easily get the route of destination.
In process of the present invention is realized, inventor has found that at least there are the following problems in the prior art：
Existing navigation system is simply to send starting point to the travel route between destination, can't be pushed
Vehicle is travelled to the route on parking stall, and stopping for free time is voluntarily found so as to cause to drive needed after vehicle is arrived in user
Parking stall.And the urbanization, motorization level with China are improved constantly, each big city successively faces serious parking problem, and
Construction of parking facilities is subject to land used nervous, the restriction of shortage of resources, parking supply and demand contradiction.For large-scale parking
, because internal place is larger, driver is difficult accurately to search out parking stall, delays the time of driver, reduces parking lot
Utilization rate；At the same time the low speed redundancy traffic that driver produces to find parking lot, improves the cost of traveler.
The content of the invention
The embodiment of the present invention provides a kind of method and device for pushing parking route, for solving existing parking inefficiency
Technical problem.
A kind of method for pushing parking route provided in an embodiment of the present invention, comprises the following steps：
Determine current location and target location, and determine the parking lot letter in all parking lots in the preset range of target location
Breath, parking lot information includes the positional information of at least one idle parking stall in the positional information in parking lot and parking lot；
A temporary route is chosen in all of predetermined paths, predetermined paths are from current location to an idle parking stall
A route；
Determine the very first time of temporary route, the very first time is that vehicle is needed along temporary route from current location to parking facility
Time；Determine the second time of temporary route, the second time is for needed for vehicle along temporary route from parking lot to idle parking stall
Time；
Parking total time according to temporary route judge whether temporary route is optimal route, and be optimal in temporary route
Temporary route is pushed to user during route, parking total time is the very first time and the second time sum.
In a kind of possible implementation, parking lot information also includes Parking Fee；
Parking total time according to temporary route judge whether temporary route is optimal route, including：According to temporary route
Parking total time and Parking Fee judge whether temporary route is optimal route.
In a kind of possible implementation, temporary route is judged at parking total time and Parking Fee according to temporary route
Whether it is optimal route, including：
It is that parking total time and Parking Fee are respectively allocated corresponding weighted value；
The default parking total time from current location to idle parking stall along different predetermined paths is determined successively, and is determined pre-
If the maximum and minimum value of total time of stopping；The default Parking Fee and default Parking Fee in all parking lots are determined simultaneously
Maximum and minimum value；
Calculate the decision value C of temporary route：
Wherein, TpIt is default parking total time,
T ' is the parking total time of temporary route, MpTo preset Parking Fee, M ' is the Parking Fee corresponding with temporary route, λ1For
The weighted value of parking total time, λ2It is the weighted value of Parking Fee；
When the decision value of temporary route is not less than the decision value of other any predetermined paths, determine that temporary route is optimal
Route.
In a kind of possible implementation, the very first time of temporary route is determined, including：
It is determined that from current location a1To parking lot amAll feasible node set U0, and determine relative with temporary route
Answer from current location a1To parking lot amOrdered nodes set U1={ a1,a2,…,am, and set U1In node category
In set U0；
It is determined that the set U with ordered nodes1Corresponding section set
Calculate along temporary route from current location a1To parking lot amThe required very first time
Wherein, i and j belong to set U0, and there is feasible section P from node i to node jij,
SijIt is section PijLength, vijIt is vehicle in section PijOn travel speed；It is section decision variable, and works as
When,Otherwise
In a kind of possible implementation, the second time of temporary route is determined, including：
It is determined that from parking lot amEntrance b1To free time parking stall bnAll feasible node set U '0, and determine with it is interim
Route it is corresponding from entrance b1To free time parking stall bnOrdered nodes set U2={ b1,b2,…,bn, and set U2In
Node belongs to set U '0；
It is determined that the set U with ordered nodes2Corresponding section setAnd based on thing
Networking technology determine vehicle dimension, the driving age and with idle parking stall bnCorresponding enters a difficulty；
Calculate along temporary route from entrance b1To free time parking stall bnThe second required time
Wherein, i ' and j ' belong to set U '0, and from node i ' to node
There is feasible section P in j 'i′j′, Si′j′It is section Pi′j′Length, vi′j′It is vehicle in section Pi′j′On travel speed；
It is section decision variable, and works asWhen,Otherwiseθ ' is preset constant, T0During for default standard
Between；S ' is vehicle dimension regulation coefficient, and has positive correlation between vehicle dimension；D ' be into an adjusting of difficulty coefficient,
And with entering there is positive correlation between a difficulty；E ' is driving age regulation coefficient, and has positive correlation between the driving age.
Based on same inventive concept, the embodiment of the present invention also provides a kind of device for pushing parking route, including：
Position determination module, for determining current location and target location, and determines own in the preset range of target location
The parking lot information in parking lot, parking lot information includes at least one idle parking stall in the positional information in parking lot and parking lot
Positional information；
Module is chosen, for choosing a temporary route in all of predetermined paths, predetermined paths are from current location
To a route of idle parking stall；
Very first time determining module, the very first time for determining temporary route, the very first time is vehicle along temporary route
The time needed from current location to parking facility；
Second time determining module, the second time for determining temporary route, the second time is vehicle along temporary route
Time from needed for parking lot to idle parking stall；
Processing module, for judging whether temporary route is optimal route according to the parking total time of temporary route, and
Temporary route is pushed to user when temporary route is optimal route, parking total time is the very first time and the second time sum.
In a kind of possible implementation, parking lot information also includes Parking Fee；
Processing module is used for：Judge parking total time and Parking Fee whether temporary route is optimal according to temporary route
Route.
In a kind of possible implementation, processing module includes：
Allocation unit, for being that parking total time and Parking Fee are respectively allocated corresponding weighted value；
Determining unit, it is total along the default parking of different predetermined paths from current location to idle parking stall for determining successively
Time, and determine the maximum and minimum value of default parking total time；Determine simultaneously the default Parking Fee in all parking lots with
And the maximum and minimum value of default Parking Fee；
Computing unit, the decision value C for calculating temporary route：
Wherein, TpIt is default parking total time,
T ' is the parking total time of temporary route, MpTo preset Parking Fee, M ' is the Parking Fee corresponding with temporary route, λ1For
The weighted value of parking total time, λ2It is the weighted value of Parking Fee；
Processing unit, for temporary route decision value not less than other any predetermined paths decision value when, it is determined that
Temporary route is optimal route.
In a kind of possible implementation, very first time determining module includes：
Determining unit, for determining from current location a1To parking lot amAll feasible node set U0, and determine with
Temporary route it is corresponding from current location a1To parking lot amOrdered nodes set U1={ a1,a2,…,am, and set
U1In node belong to set U0；It is determined that the set U with ordered nodes1Corresponding section set
Time calculating unit, for calculating along temporary route from current location a1To parking lot amThe required very first time
Wherein, i and j belong to set U0, and there is feasible section P from node i to node jij,
SijIt is section PijLength, vijIt is vehicle in section PijOn travel speed；It is section decision variable, and works as
When,Otherwise
In a kind of possible implementation, the second time determining module includes：
Determining unit, for determining from parking lot amEntrance b1To free time parking stall bnAll feasible node set U
′0, and determine corresponding with temporary route from entrance b1To free time parking stall bnOrdered nodes set U2={ b1,b2,…,
bn, and set U2In node belong to set U '0；It is determined that the set U with ordered nodes2Corresponding section setAnd based on technology of Internet of things determine vehicle dimension, the driving age and with idle parking stall bnIt is corresponding
Enter a difficulty；
Time calculating unit, for calculating along temporary route from entrance b1To free time parking stall bnThe second required time
Wherein, i ' and j ' belong to set U '0, and from node i ' to node
There is feasible section P in j 'i′j′, Si′j′It is section Pi′j′Length, vi′j′It is vehicle in section Pi′j′On travel speed；
It is section decision variable, and works asWhen,Otherwiseθ ' is preset constant, T0During for default standard
Between；S ' is vehicle dimension regulation coefficient, and has positive correlation between vehicle dimension；D ' be into an adjusting of difficulty coefficient,
And with entering there is positive correlation between a difficulty；E ' is driving age regulation coefficient, and has positive correlation between the driving age.
A kind of method and device for pushing parking route provided in an embodiment of the present invention, will as spliting node using parking lot
The route of selection is divided into two sections, and two sections of very first times and the second time of route are determined respectively, can save amount of calculation, improves meter
Calculate efficiency；Meanwhile, the method can be combined with parking lot information and the optimal route for directly reaching idle parking stall pushed to user, keep away
Exempt from user and voluntarily find parking stall, shorten down time, improve out line efficiency.Stopped by comprehensive descision and total time and stopped
Fare can cause that the optimal route chosen more meets user's request, can not only reduce the time cost of user's trip, also
Financial cost can be reduced.The very first time and the second time are determined by setting section decision variable, can further be reduced
Amount of calculation, improves computational efficiency.
Other features and advantages of the present invention will be illustrated in the following description, also, the partly change from specification
Obtain it is clear that or being understood by implementing the present invention.The purpose of the present invention and other advantages can be by the explanations write
Specifically noted structure is realized and obtained in book, claims and accompanying drawing.
Below by drawings and Examples, technical scheme is described in further detail.
Brief description of the drawings
Accompanying drawing is used for providing a further understanding of the present invention, and constitutes a part for specification, with reality of the invention
Applying example is used to explain the present invention together, is not construed as limiting the invention.In the accompanying drawings：
Fig. 1 is the first method flow chart of push parking route in the embodiment of the present invention；
Fig. 2 be the embodiment of the present invention in judge temporary route whether be optimal route method flow diagram；
Fig. 3 is the first method flow chart of push parking route in the embodiment of the present invention；
Fig. 4 is a kind of schematic diagram of route digraph in the embodiment of the present invention；
Fig. 5 is parking lot free time parking stall schematic diagram in the embodiment of the present invention；
Fig. 6 is parking stall form schematic diagram in the embodiment of the present invention；
Fig. 7 is the structure chart of the device of push parking route in the embodiment of the present invention；
Fig. 8 is the structure chart of processing module in the embodiment of the present invention；
Fig. 9 is the structure chart of very first time determining module in the embodiment of the present invention；
Figure 10 is the structure chart of the second time determining module in the embodiment of the present invention.
Specific embodiment
The preferred embodiments of the present invention are illustrated below in conjunction with accompanying drawing, it will be appreciated that preferred reality described herein
Apply example to be merely to illustrate and explain the present invention, be not intended to limit the present invention.
Referring to Fig. 1, a kind of flow of the method for pushing parking route provided in an embodiment of the present invention is as follows, specifically includes step
Rapid 101-104：
Step 101：Determine current location and target location, and determine stopping for all parking lots in the preset range of target location
Car pool information, parking lot information includes the positional information of at least one idle parking stall in the positional information in parking lot and parking lot.
In the embodiment of the present invention, current location is vehicle in the location of current time, specifically can be according to vehicle
Positioner (such as GPS) determine the current location；Target location is the position that user needs the destination of arrival, specifically may be used
Target location is determined with the destination information according to user input.Additionally, in the embodiment of the present invention, it is determined that behind target location really
A fixed preset range, the preset range can be the circle with target location as the center of circle, or other shapes, specific root
Depending on actual conditions.Meanwhile, all of parking lot inquired about in the preset range, each parking lot oneself one of correspondence stop
Car pool information, the parking lot information includes the positional information of at least one idle parking stall, if a certain parking lot is in the absence of the free time
Parking stall, then it is negligible.Specifically, it is possible to use technology of Internet of things obtains parking lot information, and determines whether there is sky
Not busy parking stall.
Step 102：A temporary route is chosen in all of predetermined paths, predetermined paths are from current location to one
One route of idle parking stall.
In the embodiment of the present invention, due to there may be multiple parking lots, and each parking lot there may be many free time parking stalls,
Then there is a plurality of route from current location to different idle parking stall；And be likely to deposit to same idle parking stall from current location
In a plurality of route, the predetermined paths in the embodiment of the present invention are from current location to a route of idle parking stall, should
Temporary route is that the route chosen from all of predetermined paths, i.e. temporary route are substantially also a predetermined paths.
Step 103：Determine the very first time of temporary route, the very first time is vehicle along temporary route from current location to stopping
Time needed for parking lot；Determine the second time of temporary route, the second time is for vehicle along temporary route from parking lot to the free time
Time needed for parking stall.
In the embodiment of the present invention, it is determined that can determine the corresponding parking lot of the temporary route after temporary route and stop
Idle parking stall in parking lot.Specifically, there may be a plurality of route from current location to Entrance, and from Entrance
Also likely to be present a plurality of route, i.e. Entrance to idle parking stall can be as predetermined paths spliting node.This hair
The temporary route is divided into two sections in bright embodiment：Wherein one section is that from current location to parking lot, another section is from parking lot
To idle parking stall；Meanwhile, each section of running time, the i.e. very first time and the second time are determined respectively.By calculating respectively
One time and the second time can reduce Time Calculation amount.For example, there are 4 routes from current location to Entrance, from
Entrance leaves 3 routes to idle parking stall, then have 4 × 3 from current location to the actual predetermined paths of idle parking stall
=12；If using predetermined paths an as entirety, needing to calculate 12 running times；And predetermined paths are divided into two sections
Afterwards, then only need to calculate 3+4=7 running time, can respectively determine that 12 are preset by simple addition afterwards
The running time of route.
Step 104：Parking total time according to temporary route judge whether temporary route is optimal route, and on interim road
Temporary route is pushed to user when line is optimal route, parking total time is the very first time and the second time sum.
In the embodiment of the present invention, total time of the parking total time for needed for from current location to idle parking stall, each pre-
If route is respectively provided with corresponding parking total time, this can be determined according to the time length of the parking total time of temporary route
Whether temporary route is optimal route, i.e. the parking total time of temporary route is most short in all predetermined paths, it is possible to
The temporary route is set to optimal route, by being pushed after the optimal route to user so that user refers to the optimal route
Travel to the idle parking stall near destination.
It is provided in an embodiment of the present invention it is a kind of push parking route method, using parking lot as spliting node by choose
Route is divided into two sections, and two sections of very first times and the second time of route are determined respectively, can save amount of calculation, improves and calculates effect
Rate；Meanwhile, the method can be combined with parking lot information and the optimal route for directly reaching idle parking stall pushed to user, it is to avoid use
Parking stall is voluntarily found at family, shortens down time, improves out line efficiency.
Another embodiment of the present invention provides the method for pushing parking route, and it includes the step 101-104 shown in Fig. 1,
And it implements process and technique effect embodiment shown in Figure 1；Meanwhile, in embodiments of the present invention, in step 101
The parking lot information of the acquisition also Parking Fee including the parking lot；Now, step 104 is " when the parking according to temporary route is total
Between judge whether temporary route is optimal route " specifically include：Parking total time and Parking Fee according to temporary route judge
Whether temporary route is optimal route.
In the embodiment of the present invention, when it is determined that whether temporary route is optimal route, parking total time is not only considered, also examine
Consider the Parking Fee in the parking lot that the temporary route is reached, can be caused by comprehensive descision parking total time and Parking Fee
The optimal route of selection more meets user's request, can not only reduce the time cost of user's trip, can also reduce it is economical into
This.
Optionally, determined by calculating the decision value of temporary route the temporary route whether optimal route.Specifically,
It is shown in Figure 2, judge parking total time and Parking Fee whether temporary route is optimal route according to temporary route, including
Step 201-204：
Step 201：It is that parking total time and Parking Fee are respectively allocated corresponding weighted value.
In the embodiment of the present invention, when it is determined that can determine that the parking corresponding with the temporary route is total after temporary route
Between and Parking Fee, and then determine which side is faced distributing by way of weighted value parking total time and Parking Fee
It is more important for user.For example, if user is it is pressed for time, what can be set the weighted value of total time of stopping is larger.Tool
Body, the weighted value of parking total time and the weighted value sum of Parking Fee can be 1, i.e. λ1+λ2=1, wherein, λ1It is parking
The weighted value of total time, λ2It is the weighted value of Parking Fee, now only needs to distribute a weighted value.For example, by true
Surely the weighted value λ of parking total time can determine it is that time priority or expense are preferential when optimal route is judged.Now, may be used
Selected for user with pre-setting Three models：Intelligent mode, time priority and expense are preferential；The corresponding parking of each pattern
The value of the weighted value λ of total time can be with as shown in table 1 below：
Table 1
| Pattern | λ |
| Intelligent recommendation | 0.50 |
| Time priority | 0.75 |
| Expense is preferential | 0.25 |
Step 202：The default parking total time from current location to idle parking stall along different predetermined paths is determined successively,
And determine the maximum and minimum value of default parking total time；The default Parking Fee in all parking lots is determined simultaneously and is preset
The maximum and minimum value of Parking Fee.
In the embodiment of the present invention, determine the parking total time of all predetermined paths, for distinguish temporary route parking it is total when
Between, default parking total time will be referred to as the parking total time of predetermined paths, calculate the mode of the default parking total time and calculate
The parking total time of temporary route is identical, and the parking total time of the temporary route is also a default parking total time.True
Can determine maximum therein and minimum value after fixed all of default parking total time.Similarly, in order to distinguish temporary route
Parking Fee, the Parking Fee in all of parking lot is turned into default Parking Fee, the Parking Fee of temporary route is substantially
It is also a default Parking Fee；It is determined that after the default Parking Fee in all parking lots, you can to determine default Parking Fee
Maximum and minimum value.Additionally, it is determined that it is all of it is default parking total time and default Parking Fee after, it is determined that the two is most
The process of big value and minimum value only needs to perform once；And it is determined that can easily determine after above-mentioned value current interim
The decision value of route.
Step 203：Calculate the decision value C of temporary route.
Specifically,Wherein, TpIt is default parking
Total time, T ' is the parking total time of temporary route, MpTo preset Parking Fee, M ' is the parking fee corresponding with temporary route
With λ1It is the weighted value of total time of stopping, λ2It is the weighted value of Parking Fee；Wherein, λ can be set according to the actual requirements1+λ2
=1.
Step 204：When the decision value of temporary route is not less than the decision value of other any predetermined paths, it is determined that interim road
Line is optimal route.
It can be seen from process according to above-mentioned calculating decision value, the parking total time of temporary route is smaller, and decision value C is bigger, and
The Parking Fee corresponding with temporary route is smaller, and decision value C is also bigger；Therefore it is being not less than other any default roads when decision value
During the decision value of line, illustrate that the parking total time of the temporary route is smaller and/or Parking Fee is less, now can be interim by this
Route is used as the optimal route in all predetermined paths.
The process step of the method is discussed in detail below by one embodiment.
Shown in Figure 3 in the embodiment of the present invention, the method for push parking route specifically includes step 301-311：
Step 301：Determine current location and target location, and determine stopping for all parking lots in the preset range of target location
Car pool information.
Wherein, parking lot information includes the position letter of at least one idle parking stall in the positional information in parking lot and parking lot
Breath.
Step 302：A temporary route is chosen in all of predetermined paths.
The predetermined paths are from current location to a route of idle parking stall.
Step 303：It is determined that the set of all feasible node from current location to parking lot, and determine and temporary route phase
The set of the corresponding ordered nodes from current location to parking lot.
Step 304：It is determined that the section set corresponding with the set of ordered nodes.
Specifically, from current location a1To parking lot amThe collection of all feasible node be combined into U0, it is corresponding with temporary route
From current location a1To parking lot amOrdered nodes set U1={ a1,a2,…,am, and set U1In node belong to
Set U0.Now, with the set U of ordered nodes1Corresponding section collection is combined into
In the embodiment of the present invention, feasible node can be determined by from current location to the digraph between parking lot
Set and the set of ordered nodes, and corresponding section set.For example, it is assumed that current location is node A, destination
(i.e. parking lot) is node M, and a kind of digraph from current location A to parking lot M is shown in Figure 4, node B, C in figure,
D, E are the node of centre, and now from current location A to parking lot M, the collection of feasible node is combined into { A, B, C, D, E, M }, feasible
Section includes AB, BC, CM, BD, DM, AE, ED, EM；If temporary route is A → B → D → M, now corresponding with temporary route
The collection of the ordered nodes from current location to parking lot be combined into { A, B, D, M }, corresponding section collection is combined into { PAB,PBD,
PDM}.It should be noted that the order of element can not be converted in the set of the feasible node, i.e., ordered nodes set A, B, D,
M } it is different with { A, D, B, M }.Likewise, in the embodiment of the present invention, according to from current location a1To parking lot amFeasible node and
Ordered nodes just can directly determine set U0, U1And
Step 305：Calculate the very first time needed from current location to parking facility along temporary route.
Specifically, along temporary route from current location a1To parking lot amThe required very first timeFor：Wherein, i and j belong to set U0, and there is feasible section P from node i to node jij, SijIt is section
PijLength, vijIt is vehicle in section PijOn travel speed；It is section decision variable, and works asWhen,
Otherwise
Wherein, set U0Containing multiple nodes, understand there is feasible section between any two nodes according to digraph.For example
Shown in Fig. 4, there is feasible section P between node B and CBCBut, do not exist feasible section between node B and E；That is, according to oriented
Figure can determine the value of i and j in the formula for calculate the very first time.Meanwhile, as feasible section PijBelong to and ordered nodes
Set U1Corresponding section set, then illustrate section PijCan be used for calculating the very first time, therefore section decision variableFor
1。
In the embodiment of the present invention, the running time in different feasible sections can be simultaneously determined, calculating the of temporary route
During one time, it is only necessary to which judging the value of section decision variable can very easily calculate the very first time, for needing to calculate
The situation of a large amount of predetermined paths very first times, the method can equally reduce amount of calculation, improve computational efficiency.
Above-mentioned steps 303-305 is the process for calculating the very first time, and step 306-308 below is second time that calculated
Process, it is specific as follows shown.
Step 306：It is determined that from the entrance in parking lot to the set of all feasible node of idle parking stall, and determine with it is interim
Route it is corresponding from entrance to the set of the ordered nodes of idle parking stall.
In the embodiment of the present invention, parking lot amThe node of expression and entrance b1The node of expression is identical, and two are distinguished for convenience
Section route, therefore entrance b is used when calculating for the second time1Represent starting point.Specifically, from parking lot amEntrance b1To the free time
Parking stall bnThe collection of all feasible node be combined into U '0, it is corresponding with temporary route from entrance b1To free time parking stall bnOrderly section
The collection of point is combined into U2={ b1,b2,…,bn, and set U2In node belong to set U '0.Determination set U '0And U2Mode
With above-mentioned determination set U0And U1Mode it is identical, i.e., can very easily be determined by digraph.
For example, in parking lot vehicle sail into idle parking stall a schematic diagram it is shown in Figure 5, wherein hatched
Quadrangle represents that parking stall is occupied, and blank quadrangle represents idle parking stall, and the small box indicating of each black solid one is interim
One node of route.Fig. 5 is actually a kind of digraph with reference to parking lot layout, convenient to determine corresponding set of node
Close.
Step 307：It is determined that corresponding with the set of ordered nodes section set, and determine vehicle dimension, the driving age and with
Idle parking stall bnCorresponding enters a difficulty.
Specifically, determining the set U with ordered nodes2Corresponding section set
And based on technology of Internet of things determine vehicle dimension, the driving age and with idle parking stall bnCorresponding enters a difficulty.
Step 308：Calculate along the second time needed for temporary route from Entrance to idle parking stall.
Specifically, calculating along temporary route from entrance b1To free time parking stall bnThe second required time
Wherein, i ' and j ' belong to set U '0, and from node i ' to node
There is feasible section P in j 'i′j′, Si′j′It is section Pi′j′Length, vi′j′It is vehicle in section Pi′j′On travel speed；
It is section decision variable, and works asWhen,Otherwiseθ ' is preset constant, T0During for default standard
Between；S ' is vehicle dimension regulation coefficient, and has positive correlation between vehicle dimension；D ' be into an adjusting of difficulty coefficient,
And with entering there is positive correlation between a difficulty；E ' is driving age regulation coefficient, and has positive correlation between the driving age.
Specifically, the relation between vehicle dimension and vehicle dimension regulation coefficient, driving age and driving age can be pre-set adjusting
Relation between integral coefficient, enter a difficulty and enter the relation between an adjusting of difficulty coefficient.Wherein, with axle in the embodiment of the present invention
Away from vehicle dimension is represented, the relation between vehicle dimension and vehicle dimension regulation coefficient, between driving age and driving age regulation coefficient is detailed
See the table below 2.
Table 2
Additionally, idle parking stall enters a difficulty according to the different and different of parking stall situation, i.e., set according to parking stall situation
This enters an adjusting of difficulty coefficient.Specifically, parking stall form can be divided into yi word pattern parking stall, non-font parking stall, bias type parking stall, tool
Body is shown in Figure 6.Wherein, a kind of set-up mode ginseng for entering an adjusting of difficulty coefficient is shown in Table 3.
Table 3
| Parking stall ambient conditions | Yi word pattern parking stall | Non- font parking stall | Bias type parking stall |
| Both sides is without car | 3 | 2 | 1 |
| There is car side | 4 | 3 | 2 |
| There is car both sides | 5 | 4 | 3 |
Step 309：Determine all predetermined paths successively from the default parking total time of current location to idle parking stall and its
Maximum and minimum value, while determining the default Parking Fee and its maximum and minimum value in all parking lots.
In the embodiment of the present invention, the parking total time of temporary route isCalculate other predetermined paths
The method of default parking total time is identical with the method for calculating parking total time T ', refers to above-mentioned steps 303-308.
Step 310：Calculate the decision value of temporary route.
Specifically, the weighted value and the weighted value sum of Parking Fee of the total time that will be stopped in the embodiment of the present invention are set to 1,
NowWherein, TpIt is default parking total time, T '
It is the parking total time of temporary route, MpTo preset Parking Fee, M ' is the Parking Fee corresponding with temporary route, and λ is to stop
The weighted value of car total time.
Step 311：When the decision value of temporary route is not less than the decision value of other any predetermined paths, it is determined that interim road
Line is optimal route.
It can be seen from process according to above-mentioned calculating decision value, the parking total time of temporary route is smaller, and decision value C is bigger, and
The Parking Fee corresponding with temporary route is smaller, and decision value C is also bigger；Therefore it is being not less than other any default roads when decision value
During the decision value of line, illustrate that the parking total time of the temporary route is smaller and/or Parking Fee is less, now can be interim by this
Route is used as the optimal route in all predetermined paths.
It is provided in an embodiment of the present invention it is a kind of push parking route method, using parking lot as spliting node by choose
Route is divided into two sections, and two sections of very first times and the second time of route are determined respectively, can save amount of calculation, improves and calculates effect
Rate；Meanwhile, the method can be combined with parking lot information and the optimal route for directly reaching idle parking stall pushed to user, it is to avoid use
Parking stall is voluntarily found at family, shortens down time, improves out line efficiency.By comprehensive descision parking total time and parking fee
More meet user's request with the optimal route that can cause to choose, can not only reduce the time cost of user's trip, can be with
Reduce financial cost.The very first time and the second time are determined by setting section decision variable, calculating can be further reduced
Amount, improves computational efficiency.
The flow of the method for push parking route in the embodiment of the present invention is described in detail above, and the method can also pass through
Corresponding device realization, is described in detail below the 26S Proteasome Structure and Function of the device.
A kind of device for pushing parking route provided in an embodiment of the present invention, it is shown in Figure 7, including：Position determines mould
Block 71, selection module 72, very first time determining module 73, the second time determining module 74 and processing module 75.
Position determination module 71 is used to determine current location and target location, and determines own in the preset range of target location
The parking lot information in parking lot, parking lot information includes at least one idle parking stall in the positional information in parking lot and parking lot
Positional information.
Choosing module 72 is used to choose a temporary route in all of predetermined paths, and predetermined paths are from current location
To a route of idle parking stall.
Very first time determining module 73 is used to determine the very first time of temporary route, and the very first time is vehicle along temporary route
The time needed from current location to parking facility.
Second time determining module 74 is used to determine the second time of temporary route, and the second time was vehicle along temporary route
Time from needed for parking lot to idle parking stall.
Processing module 75 be used for judge whether temporary route is optimal route according to the parking total time of temporary route, and
Temporary route is pushed to user when temporary route is optimal route, parking total time is the very first time and the second time sum.
In a kind of possible implementation, parking lot information also includes Parking Fee；Processing module 75 specifically for：Root
According to judging the parking total time of temporary route and Parking Fee whether temporary route is optimal route.
Shown in Figure 8 in a kind of possible implementation, processing module 75 includes：Allocation unit 751, determination are single
Unit 752, computing unit 753 and processing unit 754.
Allocation unit 751 is used to be that parking total time and Parking Fee are respectively allocated corresponding weighted value.
Determining unit 752 is used to determine the default parking along different predetermined paths from current location to idle parking stall successively
Total time, and determine the maximum and minimum value of default parking total time；The default Parking Fee in all parking lots is determined simultaneously
And the maximum and minimum value of default Parking Fee.
Computing unit 753 is used to calculate the decision value C of temporary route：
Wherein, TpIt is default parking total time,
T ' is the parking total time of temporary route, MpTo preset Parking Fee, M ' is the Parking Fee corresponding with temporary route, λ1For
The weighted value of parking total time, λ2It is the weighted value of Parking Fee.
Processing unit 754 is used for when the decision value of temporary route is not less than the decision value of other any predetermined paths, really
Temporary route is determined for optimal route.
Shown in Figure 9 in a kind of possible implementation, very first time determining module 73 includes：Determining unit 731
With time calculating unit 732.
Determining unit 731 is used to determine from current location a1To parking lot amAll feasible node set U0, and determine
It is corresponding with temporary route from current location a1To parking lot amOrdered nodes set U1={ a1,a2,…,am, and collection
Close U1In node belong to set U0；It is determined that the set U with ordered nodes1Corresponding section set
Time calculating unit 732 is used to calculate along temporary route from current location a1To parking lot amThe required very first time
Wherein, i and j belong to set U0, and there is feasible section P from node i to node jij,
SijIt is section PijLength, vijIt is vehicle in section PijOn travel speed；It is section decision variable, and works as
When,Otherwise
Shown in Figure 10 in a kind of possible implementation, the second time determining module 74 includes：Determining unit
741st, time calculating unit 742.
Determining unit 741 is used to determine from parking lot amEntrance b1To free time parking stall bnAll feasible node set
U′0, and determine corresponding with temporary route from entrance b1To free time parking stall bnOrdered nodes set U2={ b1,b2,…,
bn, and set U2In node belong to set U '0；It is determined that the set U with ordered nodes2Corresponding section setAnd based on technology of Internet of things determine vehicle dimension, the driving age and with idle parking stall bnIt is corresponding
Enter a difficulty.
Time calculating unit 742 is used to calculate along temporary route from entrance b1To free time parking stall bnThe second required time
Wherein, i ' and j ' belong to set U '0, and from node i ' to node
There is feasible section P in j 'i′j′, Si′j′It is section Pi′j′Length, vi′j′It is vehicle in section Pi′j′On travel speed；
It is section decision variable, and works asWhen,Otherwiseθ ' is preset constant, T0During for default standard
Between；S ' is vehicle dimension regulation coefficient, and has positive correlation between vehicle dimension；D ' be into an adjusting of difficulty coefficient,
And with entering there is positive correlation between a difficulty；E ' is driving age regulation coefficient, and has positive correlation between the driving age.
A kind of method and device for pushing parking route provided in an embodiment of the present invention, will as spliting node using parking lot
The route of selection is divided into two sections, and two sections of very first times and the second time of route are determined respectively, can save amount of calculation, improves meter
Calculate efficiency；Meanwhile, the method can be combined with parking lot information and the optimal route for directly reaching idle parking stall pushed to user, keep away
Exempt from user and voluntarily find parking stall, shorten down time, improve out line efficiency.Stopped by comprehensive descision and total time and stopped
Fare can cause that the optimal route chosen more meets user's request, can not only reduce the time cost of user's trip, also
Financial cost can be reduced.The very first time and the second time are determined by setting section decision variable, can further be reduced
Amount of calculation, improves computational efficiency.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or computer program
Product.Therefore, the present invention can be using the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Apply the form of example.And, the present invention can be used and wherein include the computer of computer usable program code at one or more
The shape of the computer program product implemented in usable storage medium (including but not limited to magnetic disk storage and optical memory etc.)
Formula.
The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product
Figure and/or block diagram are described.It should be understood that every first-class during flow chart and/or block diagram can be realized by computer program instructions
The combination of flow and/or square frame in journey and/or square frame and flow chart and/or block diagram.These computer programs can be provided
The processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that produced for reality by the instruction of computer or the computing device of other programmable data processing devices
The device of the function of being specified in present one flow of flow chart or multiple one square frame of flow and/or block diagram or multiple square frames.
These computer program instructions may be alternatively stored in can guide computer or other programmable data processing devices with spy
In determining the computer-readable memory that mode works so that instruction of the storage in the computer-readable memory is produced and include finger
Make the manufacture of device, the command device realize in one flow of flow chart or multiple one square frame of flow and/or block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that in meter
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented treatment, so as in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
Obviously, those skilled in the art can carry out various changes and modification without deviating from essence of the invention to the present invention
God and scope.So, if these modifications of the invention and modification belong to the scope of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to comprising these changes and modification.
Claims (10)
1. it is a kind of push parking route method, it is characterised in that comprise the following steps：
Determine current location and target location, and determine the parking lot information in all parking lots in the preset range of target location, institute
State the positional information of at least one idle parking stall in positional information and the parking lot of the parking lot information including parking lot；
A temporary route is chosen in all of predetermined paths, the predetermined paths are from the current location to a free time
One route of parking stall；
Determine the very first time of the temporary route, the very first time is vehicle along the temporary route from the current location
To the time that the parking facility is needed；Determine the second time of the temporary route, second time is that vehicle faces described in
When route from the parking lot to the idle parking stall needed for time；
Parking total time according to the temporary route judge whether the temporary route is optimal route, and on the interim road
The temporary route is pushed to user when line is optimal route, when the parking total time is the very first time and described second
Between sum.
2. method according to claim 1, it is characterised in that the parking lot information also includes Parking Fee；
The parking total time according to the temporary route judge whether the temporary route is optimal route, including：
Judge parking total time and Parking Fee whether the temporary route is optimal route according to the temporary route.
3. method according to claim 2, it is characterised in that the parking total time according to the temporary route and stop
Fare judges whether the temporary route is optimal route, including：
It is that the parking total time and the Parking Fee are respectively allocated corresponding weighted value；
The default parking total time from the current location to idle parking stall along different predetermined paths is determined successively, and determines institute
State the maximum and minimum value of default parking total time；The default Parking Fee in all parking lots and described default is determined simultaneously
The maximum and minimum value of Parking Fee；
Calculate the decision value C of the temporary route：
Wherein, TpIt it is default parking total time, T ' is
The parking total time of temporary route, MpTo preset Parking Fee, M ' is the Parking Fee corresponding with temporary route, λ1It is parking
The weighted value of total time, λ2It is the weighted value of Parking Fee；
When the decision value of the temporary route is not less than the decision value of other any predetermined paths, determine that the temporary route is
Optimal route.
4. according to any described methods of claim 1-3, it is characterised in that the determination temporary route first when
Between, including：
It is determined that from current location a1To parking lot amAll feasible node set U0, and determine relative with the temporary route
Answer from current location a1To parking lot amOrdered nodes set U1={ a1,a2,…,am, and set U1In node category
In set U0；
It is determined that the set U with ordered nodes1Corresponding section set
Calculate along the temporary route from current location a1To parking lot amThe required very first time
Wherein, i and j belong to set U0, and there is feasible section P from node i to node jij, SijFor
Section PijLength, vijIt is vehicle in section PijOn travel speed；It is section decision variable, and works asWhen,Otherwise
5. according to any described methods of claim 1-3, it is characterised in that the determination temporary route second when
Between, including：
It is determined that from parking lot amEntrance b1To free time parking stall bnAll feasible node set U0', and determine interim with described
Route it is corresponding from entrance b1To free time parking stall bnOrdered nodes set U2={ b1,b2,…,bn, and set U2In
Node belongs to set U0′；
It is determined that the set U with ordered nodes2Corresponding section setAnd based on Internet of Things
Technology determine vehicle dimension, the driving age and with idle parking stall bnCorresponding enters a difficulty；
Calculate along the temporary route from entrance b1To free time parking stall bnThe second required time
Wherein, i ' and j ' belong to set U0', and deposited from node i ' to node j '
In feasible section Pi′j′, Si′j′It is section Pi′j′Length, vi′j′It is vehicle in section Pi′j′On travel speed；It is road
Section decision variable, and work asWhen,Otherwiseθ ' is preset constant, T0It is the default standard time；S′
It is vehicle dimension regulation coefficient, and there is positive correlation between the vehicle dimension；D ' be into an adjusting of difficulty coefficient, and
With it is described enter a difficulty between have positive correlation；E ' is driving age regulation coefficient, and has positive correlation between the driving age
Relation.
6. it is a kind of push parking route device, it is characterised in that including：
Position determination module, for determining current location and target location, and determines all parkings in the preset range of target location
The parking lot information of field, the parking lot information includes at least one idle car in the positional information in parking lot and the parking lot
The positional information of position；
Module is chosen, for choosing a temporary route in all of predetermined paths, the predetermined paths are from described current
Position is to a route of idle parking stall；
Very first time determining module, the very first time for determining the temporary route, the very first time is vehicle along described
The time that temporary route is needed from the current location to the parking facility；
Second time determining module, the second time for determining the temporary route, second time is vehicle along described
Time needed for temporary route from the parking lot to the idle parking stall；
Processing module, for judging whether the temporary route is optimal route according to the parking total time of the temporary route,
And the temporary route is pushed to user when the temporary route is optimal route, when the parking total time is described first
Between and the second time sum.
7. device according to claim 6, it is characterised in that the parking lot information also includes Parking Fee；
The processing module is used for：The temporary route that judges parking total time and Parking Fee according to the temporary route is
No is optimal route.
8. device according to claim 7, it is characterised in that the processing module includes：
Allocation unit, for being that the parking total time and the Parking Fee are respectively allocated corresponding weighted value；
Determining unit, it is total along the default parking of different predetermined paths from the current location to idle parking stall for determining successively
Time, and determine the maximum and minimum value of the default parking total time；The default parking fee in all parking lots is determined simultaneously
With and the default Parking Fee maximum and minimum value；
Computing unit, the decision value C for calculating the temporary route：
Wherein, TpIt it is default parking total time, T ' is
The parking total time of temporary route, MpTo preset Parking Fee, M ' is the Parking Fee corresponding with temporary route, λ1It is parking
The weighted value of total time, λ2It is the weighted value of Parking Fee；
Processing unit, for the temporary route decision value not less than other any predetermined paths decision value when, it is determined that
The temporary route is optimal route.
9. according to any described devices of claim 6-8, it is characterised in that the very first time determining module includes：
Determining unit, for determining from current location a1To parking lot amAll feasible node set U0, and determine with it is described
Temporary route it is corresponding from current location a1To parking lot amOrdered nodes set U1={ a1,a2,…,am, and set
U1In node belong to set U0；It is determined that the set U with ordered nodes1Corresponding section set
Time calculating unit, for calculating along the temporary route from current location a1To parking lot amThe required very first time
Wherein, i and j belong to set U0, and there is feasible section P from node i to node jij, SijFor
Section PijLength, vijIt is vehicle in section PijOn travel speed；It is section decision variable, and works asWhen,Otherwise
10. according to any described devices of claim 6-8, it is characterised in that the second time determining module includes：
Determining unit, for determining from parking lot amEntrance b1To free time parking stall bnAll feasible node set U0', and really
It is fixed corresponding with the temporary route from entrance b1To free time parking stall bnOrdered nodes set U2={ b1,b2,…,bn,
And set U2In node belong to set U0′；It is determined that the set U with ordered nodes2Corresponding section setAnd based on technology of Internet of things determine vehicle dimension, the driving age and with idle parking stall bnIt is corresponding
Enter a difficulty；
Time calculating unit, for calculating along the temporary route from entrance b1To free time parking stall bnThe second required time
Wherein, i ' and j ' belong to set U0', and deposited from node i ' to node j '
In feasible section Pi′j′, Si′j′It is section Pi′j′Length, vi′j′It is vehicle in section Pi′j′On travel speed；It is road
Section decision variable, and work asWhen,Otherwiseθ ' is preset constant, T0It is the default standard time；S′
It is vehicle dimension regulation coefficient, and there is positive correlation between the vehicle dimension；D ' be into an adjusting of difficulty coefficient, and
With it is described enter a difficulty between have positive correlation；E ' is driving age regulation coefficient, and has positive correlation between the driving age
Relation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710193175.2A CN106875734B (en) | 2017-03-28 | 2017-03-28 | A kind of method and device of push parking route |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710193175.2A CN106875734B (en) | 2017-03-28 | 2017-03-28 | A kind of method and device of push parking route |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106875734A true CN106875734A (en) | 2017-06-20 |
| CN106875734B CN106875734B (en) | 2019-06-28 |
Family
ID=59160260
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710193175.2A Expired - Fee Related CN106875734B (en) | 2017-03-28 | 2017-03-28 | A kind of method and device of push parking route |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106875734B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108120999A (en) * | 2017-12-19 | 2018-06-05 | 大陆汽车投资（上海）有限公司 | In-vehicle navigation apparatus and parking lot guide method |
| CN110956839A (en) * | 2019-12-13 | 2020-04-03 | 斑马网络技术有限公司 | Roadside temporary parking lot recommendation method and device and server |
| CN111862674A (en) * | 2020-06-24 | 2020-10-30 | 西安艾润物联网技术服务有限责任公司 | Route planning method and device |
| CN114202961A (en) * | 2021-12-17 | 2022-03-18 | 北京长信泰康通信技术有限公司 | Intelligent parking method and system based on Internet of things |
| WO2022085320A1 (en) * | 2020-10-23 | 2022-04-28 | 株式会社アイシン | Driving assistance device and computer program |
| CN114842661A (en) * | 2022-07-04 | 2022-08-02 | 成都宜泊信息科技有限公司 | Method and system for managing real-time state of indoor map passing road section |
| CN114973756A (en) * | 2022-05-13 | 2022-08-30 | 保利物业服务股份有限公司 | Parking lot guiding method and system based on property industry |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103136955A (en) * | 2011-11-24 | 2013-06-05 | 北京四维图新科技股份有限公司 | Navigation method and navigation device |
| CN103258438A (en) * | 2013-04-25 | 2013-08-21 | 山东省科学院自动化研究所 | Intelligent going-out and best carport navigation system and navigation method thereof |
| WO2014072909A1 (en) * | 2012-11-06 | 2014-05-15 | S-Parking Technologies Ltd. | Parking spot coordination system |
| CN106297383A (en) * | 2016-08-25 | 2017-01-04 | 华南师范大学 | The parking induction method learnt based on big data and the degree of depth and system |
-
2017
- 2017-03-28 CN CN201710193175.2A patent/CN106875734B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103136955A (en) * | 2011-11-24 | 2013-06-05 | 北京四维图新科技股份有限公司 | Navigation method and navigation device |
| WO2014072909A1 (en) * | 2012-11-06 | 2014-05-15 | S-Parking Technologies Ltd. | Parking spot coordination system |
| CN103258438A (en) * | 2013-04-25 | 2013-08-21 | 山东省科学院自动化研究所 | Intelligent going-out and best carport navigation system and navigation method thereof |
| CN106297383A (en) * | 2016-08-25 | 2017-01-04 | 华南师范大学 | The parking induction method learnt based on big data and the degree of depth and system |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108120999A (en) * | 2017-12-19 | 2018-06-05 | 大陆汽车投资（上海）有限公司 | In-vehicle navigation apparatus and parking lot guide method |
| CN108120999B (en) * | 2017-12-19 | 2020-07-21 | 大陆投资(中国)有限公司 | Vehicle-mounted navigation equipment and parking lot guiding method |
| CN110956839A (en) * | 2019-12-13 | 2020-04-03 | 斑马网络技术有限公司 | Roadside temporary parking lot recommendation method and device and server |
| CN111862674A (en) * | 2020-06-24 | 2020-10-30 | 西安艾润物联网技术服务有限责任公司 | Route planning method and device |
| WO2022085320A1 (en) * | 2020-10-23 | 2022-04-28 | 株式会社アイシン | Driving assistance device and computer program |
| JP7439726B2 (en) | 2020-10-23 | 2024-02-28 | 株式会社アイシン | Driving support equipment and computer programs |
| CN114202961A (en) * | 2021-12-17 | 2022-03-18 | 北京长信泰康通信技术有限公司 | Intelligent parking method and system based on Internet of things |
| CN114973756A (en) * | 2022-05-13 | 2022-08-30 | 保利物业服务股份有限公司 | Parking lot guiding method and system based on property industry |
| CN114842661A (en) * | 2022-07-04 | 2022-08-02 | 成都宜泊信息科技有限公司 | Method and system for managing real-time state of indoor map passing road section |
| CN114842661B (en) * | 2022-07-04 | 2022-09-16 | 成都宜泊信息科技有限公司 | Method and system for managing real-time state of indoor map passing road section |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106875734B (en) | 2019-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106875734B (en) | A kind of method and device of push parking route | |
| CN108197739B (en) | Urban rail transit passenger flow prediction method | |
| CN105091892B (en) | Vehicle energy management apparatus | |
| CN103630142B (en) | Method and apparatus to determine energy-conservation route are processed map datum | |
| CN108873905A (en) | Automatic driving vehicle control method, automatic driving vehicle and readable storage medium storing program for executing | |
| CN101465058B (en) | Method for making decision of inductive unit of intelligent dynamic route inductive system | |
| CN107832882A (en) | A kind of taxi based on markov decision process seeks objective policy recommendation method | |
| CN109579858B (en) | Navigation data processing method, device, equipment and storage medium | |
| CN101465057B (en) | Method for coordinating inductive sub-zone of intelligent dynamic route inductive system | |
| CN108072381A (en) | A kind of method and device of path planning | |
| CN102324128A (en) | Method for predicting OD (Origin-Destination) passenger flow among bus stations on basis of IC (Integrated Circuit)-card record and device | |
| CN113415288B (en) | Sectional type longitudinal vehicle speed planning method, device, equipment and storage medium | |
| CN113375689B (en) | Navigation method, navigation device, terminal and storage medium | |
| CN111400425B (en) | Method and system for automatically optimizing and selecting paths | |
| CN114781267A (en) | Multi-source big data-based dynamic bus management method and system for stop and transfer | |
| CN104574966B (en) | Variable information identity device and variable information identification method | |
| CN113936475A (en) | Traffic control method and system for optimizing multi-road resources | |
| CN113515892A (en) | Multi-agent traffic simulation parallel computing method and device | |
| CN108020235A (en) | Method and system based on taxi empirical data dynamic access path weight value | |
| Dragan et al. | USING GIS FOR THE OPTIMIZATION OF PUPILS TRANSPORTATION: THE CASE OF LASKO MUNICIPALITY | |
| CN115083198A (en) | Multi-vehicle transport capacity resource scheduling method and device | |
| CN106204404A (en) | The method of adjustment of a kind of public transport transport power and system | |
| CN114413923B (en) | Driving route recommendation method, device, storage medium and system | |
| CN110426215A (en) | A kind of method for establishing model and intelligent driving system for vehicle ride comfort test | |
| CN111881548B (en) | Computer simulation method for intelligent transportation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190628 |