CN113380064B - Efficient highway passing system and method - Google Patents

Efficient highway passing system and method Download PDF

Info

Publication number
CN113380064B
CN113380064B CN202110559252.8A CN202110559252A CN113380064B CN 113380064 B CN113380064 B CN 113380064B CN 202110559252 A CN202110559252 A CN 202110559252A CN 113380064 B CN113380064 B CN 113380064B
Authority
CN
China
Prior art keywords
user
highway
particle
road section
traffic
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.)
Active
Application number
CN202110559252.8A
Other languages
Chinese (zh)
Other versions
CN113380064A (en
Inventor
李子龙
鲍蓉
郑凌霄
王洪栋
鲍文正
厉丹
党向盈
王德江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xuzhou University of Technology
Original Assignee
Xuzhou University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xuzhou University of Technology filed Critical Xuzhou University of Technology
Priority to CN202110559252.8A priority Critical patent/CN113380064B/en
Publication of CN113380064A publication Critical patent/CN113380064A/en
Application granted granted Critical
Publication of CN113380064B publication Critical patent/CN113380064B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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
    • G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
    • G08G1/096838—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the user preferences are taken into account or the user selects one route out of a plurality
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0125—Traffic data processing
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Biophysics (AREA)
  • General Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Remote Sensing (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

The invention provides a high-efficiency highway passing system and a method thereof.A driving user transmits the position information and the user preference of a vehicle to a highway management end through a mobile end and receives the next section information recommended by the highway management end; the method comprises the following steps that a highway traffic data acquisition end acquires traffic parameters of each road section on a highway, wherein the traffic parameters comprise congestion degree, toll, traffic distance and traffic comfort level; and the expressway management end completes road section recommendation analysis of the driving user according to the position information of the user vehicle and the user preference, and sends a recommendation result to the user mobile end. The invention is beneficial to avoiding the congestion phenomenon of the expressway, improving the driving efficiency of the conventional expressway and reducing the driving time and cost.

Description

Efficient highway passing system and method
Technical Field
The invention relates to an intelligent traffic monitoring technology, in particular to a high-efficiency highway traffic system and a method thereof.
Background
At present, the congestion problem of the expressway in China is becoming more and more serious. However, the highway administration often takes grooming measures after congestion occurs, which causes losses to both the pedestrian and the administrator. Meanwhile, the navigation software on the intelligent mobile terminal can only provide various route plans for the user, the considered factors are few, and real-time and comprehensive road traffic information cannot be provided. Therefore, it is highly desirable to design an efficient highway traffic scheme to avoid congestion.
Disclosure of Invention
The invention aims to provide an efficient expressway passing system and an efficient expressway passing method.
The technical solution for realizing the purpose of the invention is as follows: an efficient highway transit system comprising: the system comprises a mobile terminal, an expressway management terminal and an expressway traffic data acquisition terminal, wherein a driving user transmits position information and user preference of a vehicle to the expressway management terminal through the mobile terminal and receives next segment information recommended by the expressway management terminal; the method comprises the following steps that a highway traffic data acquisition end acquires traffic parameters of each road section on a highway, wherein the traffic parameters comprise congestion degree, toll, traffic distance and traffic comfort level; and the expressway management end completes road section recommendation analysis of the driving user according to the position information of the user vehicle and the user preference, and sends a recommendation result to the user mobile end.
Further, the user preference is determined by setting the proportion of the four parameters of the crowdedness, the toll, the passing distance and the passing comfort.
Further, the highway management end completes road section recommendation analysis of the driving user according to the position information of the user vehicle and the user preference, and sends a recommendation result to the user mobile end, and the specific method comprises the following steps:
(1) according to the destination of the user, searching a set A of next road sections which are possibly driven by the user around the road section currently driven by the user, wherein the set A is { A1, A2.... An };
(2) acquiring the congestion degree C corresponding to each link Ai (i is 1, …, n) in the link set AAiToll TAiPassing distance DAiAnd passing comfort SAi；
(3) For the section Ai, C thereforAi、TAi、DAiAnd SAiPerforming z-score standardization to calculate the evaluation value Ei-P1C of the link AiAi+P2*TAi+P3*DAi-P4*SAiWherein P1, P2, P3 and P4 are the proportion of the crowdedness, the toll, the passing distance and the passing comfort;
(4) based on each link Ai (i ═ 1, …, n) in the link set a, the arrival is counted up using it as the starting pointThe minimum congestion degree of each possible route at the destination is FCAiThe minimum toll value is FTAiThe shortest passing distance is FDAiAnd the highest value of the passing comfort is FSAiFour subsequent paths of;
(5) for a section Ai, FC thereforAi、FTAi、FDAiAnd FSAiPerforming z-score standardization to calculate the evaluation value FEi-P1 FC of the path following the link AiAi+P2*FTAi+P3*FDAi-P4*FSAi；
(6) For the section Ai, the final evaluation value V is obtainedAiW1 Ei + W2 FEi, W1 and W2 are the weights of the current link and the subsequent path, respectively;
(7) selecting Ai as minAiAnd the analysis result is sent to the user mobile terminal.
Furthermore, before the next road section starts, parameters P1, P2, P3, P4, W1 and W2 are optimized by adopting a particle swarm optimization algorithm, and the specific method comprises the following steps:
1) setting parameters
Taking 6 parameters of P1, P2, P3 and P4, and W1 and W2 as six dimensions of a particle position vector, setting a population size of 10, a particle velocity of vj (j equals 1, …,10), and a particle position of xj (j equals 1, …, 10);
2) initializing a particle swarm
Randomly initializing the speed vj and the position xj of each particle in a search space, and obtaining the historical optimal position of each particle and the global optimal positions pBj and gBj of the particle group;
3) updating the velocity and position of particles
The formula for updating the particle velocity and position for the kth iteration is as follows:
vj(k+1)＝vj(k)+(pBj(k)-xj)+(gBj(k)-xj)
xj(k+1)＝xj(k)+vj(k)
4) evaluating the fitness of the particles, and updating the historical optimal position and the global optimal position
According to each particleThe position xj is used for calculating the final evaluation value V of each road section in the road section set AAiAnd select min { V }AiDetermining the historical optimal position of each particle and the global optimal position of the particle swarm according to the minimum value of the fitness as the fitness value of the particle j;
5) end condition determination
And if the number of the iterations reaches 100, ending the iteration, and selecting a globally optimal position vector value as setting values of 6 parameters of P1, P2, P3, P4 and W1 and W2 when the iteration is ended, otherwise, turning to the step 3) to continue execution.
An efficient highway passing method is based on the highway passing system to achieve efficient highway passing.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, when executing the computer program, enabling efficient highway traffic based on the highway traffic system.
A computer-readable storage medium on which a computer program is stored, which, when executed by a processor, realizes efficient highway transit based on the highway transit system.
Compared with the prior art, the invention has the following remarkable advantages: the system has the advantages that traffic information is collected in real time, a customer is helped to select a route, traffic flows can be dredged to travel as far as possible from the source, the highway congestion caused by too concentrated traveling vehicles is reduced to the greatest extent or even avoided, the highway service level and the traveling benefit of a traveling party are improved, and efficient traveling of the highway traveling party is realized.
Drawings
Fig. 1 is a flow chart of the efficient highway transit method of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
An efficient highway transit system comprising: the system comprises a mobile terminal, an expressway management terminal and an expressway traffic data acquisition terminal, wherein a driving user transmits position information and user preference of a vehicle to the expressway management terminal through the mobile terminal and receives next road section information recommended by the expressway management terminal. The highway traffic data acquisition end mainly acquires traffic parameters of all road sections on a highway: congestion, toll, distance traveled and comfort traveled. And the expressway management terminal is responsible for completing road section recommendation analysis of the driving user according to the position information of the user vehicle and the user preference and sending a recommendation result to the user mobile terminal.
An efficient highway passing method specifically comprises the following steps:
(1) the driving user sets specific preference values and start-stop positions of four parameters of P1, P2, P3 and P4 before departure, wherein P1+ P2+ P3+ P4 is 1. P1, P2, P3 and P4 respectively represent the proportion of the four parameters of congestion degree, toll, passing distance and passing comfort degree considered by the system when recommending the road section.
(2) When the vehicle of the user runs on a certain road section on the expressway, the current position of the vehicle can be sent to the expressway management end through the mobile end.
(3) The expressway management terminal searches a set A of next road sections which are possibly driven by the user around the road section currently driven by the user according to the destination of the user, wherein the set A is { A1, A2.
(4) Acquiring the congestion degree C corresponding to each road section Ai (i is 1, …, n) in the road section set A through a highway traffic data acquisition endAiToll TAiPassing distance DAiAnd passing comfort SAi。
(5) The expressway management end aims at the section Ai and C thereofAi、TAi、DAiAnd SAiPerforming standardization processing to calculate the evaluation value Ei-P1-C of the link AiAi+P2*TAi+P3*DAi-P4*SAi。
Description of the drawings: the z-score normalization process is mainly performed, which is an existing commonly used normalization method. The purpose of the standardization process is to eliminate the influence of the respective dimensions of the degree of congestion, toll, passing distance, and passing comfort being different from each other.
(6) Based on each link Ai (i is 1, …, n) in the link set A, the possible paths to the destination are counted by taking the link Ai as the starting point, and the minimum congestion degree value of each path composed of the multi-path segments is obtained as FCAiThe minimum toll value is FTAiThe shortest passing distance is FDAiAnd the highest value of the passing comfort is FSAiFour subsequent paths.
Description of the drawings: for each road section Ai, there are too many possible paths to reach the destination, and the relevant parameter values of the subsequent paths may change (such as the degree of congestion) as time goes by. For this reason, only four routes with the minimum congestion degree, the minimum traffic cost, the shortest traffic distance and the highest traffic comfort degree are simply considered.
(7) For a section Ai, FC for itAi、FTAi、FDAiAnd FSAiPerforming a normalization process to calculate an evaluation value FEi P1 FC of a path following the link AiAi+P2*FTAi+P3*FDAi-P4*FSAi。
(8) For the section Ai, the final evaluation value V is obtainedAiW1 Ei + W2 FEi, W1 and W2 are weights of the current link and the subsequent link, respectively, and W1 is set to 0.6 and W2 is set to 0.4.
(9) Finally selecting Ai as min { V ═ VAiAnd the expressway management end sends the analysis result to the user mobile end as the next road section to be selected by the current running vehicle.
For the four parameters of the preferences P1, P2, P3 and P4 set by the user and the two parameters W1 and W2 in the finally obtained evaluation value formula, the particle swarm optimization algorithm is adopted for system optimization, and some parameter values are not fixedly set. Before the next road section begins, parameters P1, P2, P3, P4, W1 and W2 are optimized by adopting a particle swarm optimization algorithm, and the method comprises the following specific steps:
1) taking the 6 parameters P1, P2, P3 and P4, and W1 and W2 as six dimensions of the particle position vector, the population size adopted by the invention is 10, the particle velocity is represented by vj (j equals 1, …,10), and the particle position is represented by xj (j equals 1, …, 10).
2) Initializing a particle swarm
And randomly initializing the speed vj and the position xj of each particle in a search space, and obtaining the historical optimal position of each particle and the global optimal positions pBj and gBj of the particle group.
3) Updating the velocity and position of particles
The formula for updating the particle velocity and position for the kth iteration is as follows:
vj(k+1)＝vj(k)+(pBj(k)-xj)+(gBj(k)-xj)
xj(k+1)＝xj(k)+vj(k)
4) evaluating the fitness of the particles, and updating the historical optimal position and the global optimal position
And calculating the final evaluation value VAi of each road section in the road section set A according to the position xj of each particle, and selecting min { VAi } as the fitness value of the particle j. According to the minimum fitness value, the historical optimal position of each particle and the global optimal position of the particle swarm can be obtained.
5) End condition determination
The iteration frequency of the method is 100 times, if the iteration frequency reaches 100 times, the iteration is ended, when the iteration is ended, the globally optimal position vector value is selected as the setting values of 6 parameters of P1, P2, P3, P4 and W1 and W2, and if not, the execution is continued in the step 3).
The invention also provides computer equipment which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein when the processor executes the computer program, efficient highway passing is realized based on the highway passing system and method.
A computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements efficient highway traffic based on the highway traffic system and method.
In conclusion, the invention collects the relevant traffic information on the road section in the driving process in real time, transmits the traffic information to the travelers in real time by means of the network, and continuously adjusts the driving route of the travelers in real time, thereby realizing an efficient passing process as far as possible, and having important significance for improving the service level of the expressway and the travel benefit.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (5)

1. An efficient highway transit system comprising: the system comprises a mobile terminal, an expressway management terminal and an expressway traffic data acquisition terminal, wherein a driving user transmits position information and user preference of a vehicle to the expressway management terminal through the mobile terminal and receives next section information recommended by the expressway management terminal; the method comprises the following steps that a highway traffic data acquisition end acquires traffic parameters of each road section on a highway, wherein the traffic parameters comprise congestion degree, toll, traffic distance and traffic comfort level; the expressway management end completes road section recommendation analysis of the driving user according to the position information of the user vehicle and the user preference, and sends a recommendation result to the user mobile end;
the user preference is determined by setting the proportion of four parameters of crowdedness, toll, passing distance and passing comfort;
the highway management end completes road section recommendation analysis of a driving user according to the position information of the user vehicle and the user preference and sends a recommendation result to the user mobile end, and the specific method comprises the following steps:
(1) according to the destination of the user, searching a set A of next road sections which are possibly driven by the user around the road section currently driven by the user, wherein the set A is { A1, A2.... An };
(2) acquiring the crowding degree C corresponding to each road section Ai in the road section set AAiToll TAiPassing distance DAiAnd passing comfort SAi；
(3) For section Ai, for C thereofAi、TAi、DAiAnd SAiPerforming z-score standardization to calculate the evaluation value Ei-P1C of the link AiAi+P2*TAi+P3*DAi-P4*SAiWherein P1, P2, P3 and P4 are the proportion of the crowdedness, the toll, the passing distance and the passing comfort;
(4) based on each link Ai in the link set A, taking the link Ai as a starting point, counting possible paths to a destination, and respectively obtaining the minimum congestion degree value FC of the paths composed of the multiple linksAiThe minimum toll value is FTAiThe shortest passing distance is FDAiAnd the highest value of the passing comfort is FSAiFour subsequent paths of;
(5) for a section Ai, FC thereforAi、FTAi、FDAiAnd FSAiPerforming z-score standardization to calculate the evaluation value FEi-P1 FC of the path following the link AiAi+P2*FTAi+P3*FDAi-P4*FSAi；
(6) For the section Ai, the final evaluation value V is obtainedAiW1 Ei + W2 FEi, W1 and W2 are the weights of the current link and the following path, respectively;
(7) finally selecting Ai as min { V ═ VAiAnd the road section is used as the next road section to be selected by the current running vehicle, and the analysis result is sent to the user mobile terminal.
2. The efficient highway transit system according to claim 1, wherein parameters P1, P2, P3, P4, W1 and W2 are optimized by a particle swarm optimization algorithm before the next road section is started, and the method comprises the following steps:
1) setting parameters
Taking 6 parameters of P1, P2, P3 and P4 and W1 and W2 as six dimensions of a particle position vector, setting the population size to be 10, the particle speed to be vj, and the particle position to be xj;
2) initializing a particle swarm
Randomly initializing the speed vj and the position xj of each particle in a search space, and obtaining the historical optimal position of each particle and the global optimal positions pBj and gBj of the particle group;
3) updating the velocity and position of particles
The formula for updating the particle velocity and position for the kth iteration is as follows:
vj(k+1)＝vj(k)+(pBj(k)-xj)+(gBj(k)-xj)
xj(k+1)＝xj(k)+vj(k)
4) evaluating the fitness of the particles, and updating the historical optimal position and the global optimal position
According to the position xj of each particle, calculating the final evaluation value V of each road section in the road section set AAiAnd select min { V }AiDetermining the historical optimal position of each particle and the global optimal position of the particle swarm according to the minimum value of the fitness as the fitness value of the particle j;
5) end condition determination
And if the number of the iterations reaches 100, ending the iteration, and selecting a globally optimal position vector value as setting values of 6 parameters of P1, P2, P3, P4 and W1 and W2 when the iteration is ended, otherwise, turning to the step 3) to continue execution.
3. An efficient highway transit method, characterized in that an efficient highway transit is realized based on the highway transit system according to any one of claims 1-2.
4. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, when executing the computer program, enabling efficient highway traffic based on the highway traffic system of any of claims 1-2.
5. A computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, realizes efficient highway traffic based on the highway traffic system of any one of claims 1-2.
CN202110559252.8A 2021-05-21 2021-05-21 Efficient highway passing system and method Active CN113380064B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110559252.8A CN113380064B (en) 2021-05-21 2021-05-21 Efficient highway passing system and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110559252.8A CN113380064B (en) 2021-05-21 2021-05-21 Efficient highway passing system and method

Publications (2)

Publication Number Publication Date
CN113380064A CN113380064A (en) 2021-09-10
CN113380064B true CN113380064B (en) 2022-07-05

Family

ID=77571706

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110559252.8A Active CN113380064B (en) 2021-05-21 2021-05-21 Efficient highway passing system and method

Country Status (1)

Country Link
CN (1) CN113380064B (en)

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5271637B2 (en) * 2008-08-28 2013-08-21 アイシン・エィ・ダブリュ株式会社 Travel route evaluation system and travel route evaluation program
CN105513400B (en) * 2015-12-03 2017-12-08 四川长虹电器股份有限公司 The method of Dynamic Programming trip route
CN105788334A (en) * 2016-04-01 2016-07-20 东南大学 Urban path finding method taking personal preferences of drivers into consideration
CN106940829B (en) * 2017-04-28 2021-06-18 兰州交通大学 Personalized path recommendation method in Internet of vehicles environment
CN108597246B (en) * 2017-12-11 2020-10-13 武汉大学 Method for solving real-time problem of path selection to avoid local congestion
CN108847037B (en) * 2018-06-27 2020-11-17 华中师范大学 Non-global information oriented urban road network path planning method
US11312372B2 (en) * 2019-04-16 2022-04-26 Ford Global Technologies, Llc Vehicle path prediction

Also Published As

Publication number Publication date
CN113380064A (en) 2021-09-10

Similar Documents

Publication Publication Date Title
CN110361024B (en) Method and system for dynamic lane-level vehicle navigation with vehicle group identification
Jabbarpour et al. Green vehicle traffic routing system using ant-based algorithm
CN104931063B (en) Path planning method
JP5602856B2 (en) Distributed traffic navigation using vehicle communication
US20190347932A1 (en) Method and apparatus for determining an estimated traffic congestion status of a tunnel based on probe data
Armant et al. Minimizing the driving distance in ride sharing systems
CN111982141B (en) Method, equipment and storage medium for path inference for low-frequency vehicle trajectory data
CN110516702B (en) Discrete path planning method based on streaming data
US9355560B2 (en) Differentiation of probe reports based on quality
EP3671689A1 (en) Method and apparatus for dynamic speed aggregation of probe data for high-occupancy vehicle lanes
CN114450557B (en) Route deviation quantification and vehicle route learning based thereon
Xu et al. Traffic aware route planning in dynamic road networks
US20190301876A1 (en) Dynamic reporting of location data for a vehicle based on a fitted history model
JP2017096636A (en) Recommended scheduled route acquisition system, method, and program
CN110136438A (en) Road switching method, device, equipment and storage medium based on artificial intelligence
Liu et al. Themis: A participatory navigation system for balanced traffic routing
RU2664034C1 (en) Traffic information creation method and system, which will be used in the implemented on the electronic device cartographic application
US20220082394A1 (en) Method and apparatus for ridesharing pickup wait time prediction
CN113191029B (en) Traffic simulation method, program, and medium based on cluster computing
CN113380064B (en) Efficient highway passing system and method
JP2004333377A (en) Route-search method
CN111445715B (en) Intelligent city traffic scheduling method and scheduling equipment based on Internet of things communication
CN116558521B (en) Track positioning method, track positioning device and computer readable storage medium
EP3779363A1 (en) Method and system for vehicle routing based on parking probabilities
JP2018147037A (en) Traffic information management system, traffic information guidance system, and program

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
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210910

Assignee: XUZHOU LANHU INFORMATION TECHNOLOGY Co.,Ltd.

Assignor: XUZHOU University OF TECHNOLOGY

Contract record no.: X2023320000179

Denomination of invention: An Efficient Expressway Traffic System and Method

Granted publication date: 20220705

License type: Common License

Record date: 20230731

EE01 Entry into force of recordation of patent licensing contract