CN115359678A - Parking space resource integration method for three-dimensional parking garage - Google Patents
Parking space resource integration method for three-dimensional parking garage Download PDFInfo
- Publication number
- CN115359678A CN115359678A CN202210852987.4A CN202210852987A CN115359678A CN 115359678 A CN115359678 A CN 115359678A CN 202210852987 A CN202210852987 A CN 202210852987A CN 115359678 A CN115359678 A CN 115359678A
- Authority
- CN
- China
- Prior art keywords
- parking
- available resources
- berth
- garage
- scheme
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 230000010354 integration Effects 0.000 title claims abstract description 24
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000010845 search algorithm Methods 0.000 claims description 4
- 238000005457 optimization Methods 0.000 abstract description 8
- 238000004422 calculation algorithm Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012821 model calculation Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
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
- 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/0108—Measuring and analyzing of parameters relative to traffic conditions based on the source of data
-
- 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
-
- 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/148—Management of a network of parking areas
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Chemical & Material Sciences (AREA)
- Analytical Chemistry (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention relates to the technical field of intelligent parking, in particular to a parking space resource integration method for a three-dimensional parking garage. The method comprises the steps of S1, obtaining parking requirements; s2, inquiring directly available resources, including: s21, directly distributing berths when directly available resources exist; s22, executing the next step S3 when no directly available resource exists; s3, searching and integrating available resources, comprising: s31, informing that no parking space exists when available resources are not integrated; s32, executing the next step S4 when available resources are integrated; and S4, selecting an optimal scheme according to a multi-factor comprehensive decision method, adjusting the replacement berth according to the scheme, reserving the target berth, and arranging vehicles to be warehoused. The invention integrates according to the requirements facing the upcoming parking requirement, thereby simplifying a resource integration optimization model, solving the resource integration optimization model in a short time and improving the overall utilization rate of the garage.
Description
Technical Field
The invention relates to the technical field of intelligent parking, in particular to a parking space resource integration method for a three-dimensional parking garage.
Background
The existing three-dimensional parking garage generally searches available parking space sets in a target time period for vehicles before the vehicles are put in a garage, and considers multiple factors to allocate the optimal parking space in the sets. And then the vehicle is put into the parking space by a carrier of the stereo parking garage for storage until a customer takes the vehicle out of the garage. In the whole parking process of the vehicle, the storage position of the vehicle is influenced only by 'distribution before storage', and the physical position of the vehicle in the garage is not changed from the completion of storage to the removal of the vehicle from the garage. The disadvantages of the prior art are as follows:
1) Once the berths are distributed to the vehicles, the dynamic adjustment cannot be carried out, the fragment resources cannot be integrated, and the overall utilization rate of the garage is reduced. In the prior art, once a specific parking space is allocated to a vehicle and the vehicle is put into the parking space, the position of the vehicle is not changed; the 'gap time interval' between the parking time intervals of the vehicles on the berth is fixed, so that the gap time cannot be shortened in a dynamic vehicle replacement mode, and the berth resource waste is caused. On the whole, because the gap duration in the whole garage can not be reduced, the parking resources can not be integrated, and the resource utilization rate can not be continuously improved.
2) And the universal resource integration optimization model has high time complexity and cannot support dynamic and effective integration of the berths. In order to integrate the idle time, a resource integration optimization model is required. The general model in the field is generally based on overall optimization, a better reconfiguration scheme is obtained through searching and calculating, the vehicle condition stored in each berth is rearranged according to the scheme, and the higher garage utilization rate is realized from the whole. However, the time complexity of the general model is high, so that the calculation is difficult to complete in a short time, and the practical use is difficult to support.
The information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The invention aims to provide a parking space resource integration method for a three-dimensional parking garage, which aims to solve the technical problems in the prior art.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention provides a parking space resource integration method for a three-dimensional parking garage, which is characterized by comprising the following steps:
s1, acquiring parking demand
S2, querying directly available resources, comprising:
s21, directly distributing berths when directly available resources exist;
s22, executing the next step S3 when no directly available resource exists;
s3, searching and integrating available resources, comprising:
s31, informing that no parking space exists when available resources are not integrated;
s32, executing the next step S4 when available resources are integrated;
and S4, selecting an optimal scheme according to a multi-factor comprehensive decision method, adjusting the replacement berth according to the scheme, reserving the target berth, and arranging vehicles to be warehoused.
Preferably, step S1 comprises: the parking requirement is from reservation software or from information applied on the parking building site; the parking demand includes at least: a period of expected parking.
Preferably, step S2 comprises: inquiring parking conditions of all parking places in the current stereo garage according to the parking requirements in the step S1, and obtaining whether directly available resources exist at present or not by comparing the expected parking time period of the required vehicle with the remaining available time period of each parking place;
if the directly available resources exist, directly allocating the berthage according to the step S21;
if no direct available resource exists, executing the next step S3 according to the step S22;
preferably, step S3 comprises: searching and integrating available resources based on a Monte Carlo tree search algorithm;
if the search result is that there is no available integrated resource, executing step S31;
if the set of potential berths for parking the vehicle and the specific scheme that each potential berth requires the replacement operation are output by the search, step S32 is performed.
Preferably, step S4 comprises:
the multi-factor comprehensive decision method comprises at least the following factors: the replacement time a, the replacement times b and the replacement final profit c are respectively given weight w to each factor 1 、w 2 、w 3 Carrying out comprehensive weighted calculation on the numerical value of each factor and the weight of each factor, and calculating the score R = aw of each scheme 1 +bw 2 +cw 3 . And the final income is measured and calculated according to the estimated parking time of the target vehicle and the parking charging rule. And selecting the scheme with the highest comprehensive score R as the optimal scheme.
By adopting the technical scheme, the invention has the following beneficial effects:
1) The present invention enhances the flexibility of use of the berth.
The vehicle inside the three-dimensional parking building can be used for replacing and adjusting the parking positions of the vehicles inside so as to optimize the usage rate of the parking positions, and has no influence on the external traffic environment and the user experience.
2) The invention reduces the complexity of resource integration search.
Aiming at the parking requirement of the target vehicle, the target vehicle is accepted as an optimization target to carry out searching calculation, so that the complexity of model calculation is reduced, and quick calculation is realized.
3) The method of the invention has strong adaptability.
The method realizes resource integration aiming at the parking requirement of a single vehicle, can form single requirements through disassembly for complex requirement sets arriving in batches and can solve the single requirements one by one, and cannot fail when facing the complex requirement sets.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following descriptions are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a parking space resource integration method for a stereo parking garage according to an embodiment of the present invention.
Fig. 2 is a schematic parking space diagram of a garage scene provided by an embodiment of the present invention.
Detailed Description
The embodiments of the present invention will be described in further detail with reference to the drawings and examples. The following detailed description of the embodiments and the accompanying drawings are provided to illustrate the principles of the invention and are not intended to limit the scope of the invention, which is defined by the claims, i.e., the invention is not limited to the preferred embodiments described.
Referring to fig. 1, this embodiment provides a parking space resource integration method for a stereo parking garage, including the following steps:
s1, obtaining a parking demand.
Specifically, the parking requirement is derived from reservation software or from information applied on site in a parking building; the parking demand includes at least: a period of expected parking.
S2, inquiring directly available resources, including: s21, directly distributing berths when directly available resources exist; and S22, executing the next step S3 when no directly available resource exists.
Specifically, the parking condition of each parking space in the current stereo garage is inquired according to the parking requirement in the step S1, and whether direct available resources exist or not is known by comparing the expected parking time period of the required vehicle with the remaining available time period of each parking space; if the directly available resources exist, directly allocating the berthage according to the step S21; if there are no directly available resources, the next step S3 is performed according to step S22.
S3, searching and integrating available resources, comprising: s31, informing that no parking space exists when available resources are not integrated; and S32, executing the next step S4 when available integrated resources exist.
Specifically, searching and integrating available resources based on a Monte Carlo tree search algorithm; if the search result is that there is no integrated available resource, executing step S31; if the set of potential berths for parking the vehicle and the specific scheme that each potential berth requires the replacement operation are output by the search, step S32 is performed. Wherein the model is used to search for a set of potential berths that satisfy the parking of the vehicleAnd a scheme where each potential berth requires a permutation operation. The model is a Monte Carlo tree search algorithm (the basic version of the algorithm is published and mature, and the method does not substantially change the algorithm), and the algorithm outputs a plurality of potential available berth adjusting schemes, wherein each scheme is a specific adjusting and replacing method. The adjustment replacement method comprises the following steps: each available berth-adjusting scheme comprises a berth number, a permutation operation sequence = { a = 1 ,a 2 ,a 3 ,...,a i ,...,a n }; each permutation operation a i The method indicates that a certain vehicle is moved from an original berth to another berth, so that the original berth resources are released for subsequent replacement operation. The target of the vehicle operated by each time in the replacement operation sequence may be different, and after the replacement operation sequence is operated for multiple times, the available berth of the target is vacated.
And S4, selecting an optimal scheme according to a multi-factor comprehensive decision method, adjusting the replacement berth according to the scheme, reserving the target berth, and arranging vehicles to be warehoused. Specifically, the multi-factor comprehensive decision method comprises at least the following factors: the replacement time a, the replacement times b and the replacement final profit c are respectively given weight w to each factor 1 、w 2 、w 3 Carrying out comprehensive weighted calculation on the numerical value and the weight of each factor, and calculating the score R = aw of each scheme 1 +bw 2 +cw 3 . And the final income is measured and calculated according to the estimated parking time of the target vehicle and the parking charging rule. And selecting the scheme with the highest comprehensive score R as the optimal scheme.
The process of "acquiring demand-examining direct resources-searching for integrated available resources-adjusting permutation" described above is repeated in cycles. The embodiment allows parked vehicles to be dynamically replaced by carriers (AGVs, elevation translation mechanisms, etc.) within a stereo garage, thereby supporting dynamic integration of fragmented berth resources within the garage; the parking system is integrated according to the requirements facing the upcoming parking requirements, so that a resource integration optimization model is simplified, the resource integration optimization model can be solved in a short time, and the overall utilization rate of the garage is improved.
For a better understanding of the present invention, embodiments according to the present invention will be described in detail below with reference to the accompanying drawings. Referring to fig. 2, a simplified three-stall garage scene is taken as an example for explanation.
Step one, obtaining a parking demand: obtaining information of an upcoming parking demand vehicle (10-17), the expected parking period being 10.
Step two, inquiring directly available resources: inquiring the three public parking spaces of the current stereo garage; the parking situation in each parking space is that parking space 1 has parked vehicle 1 (9-12) and vehicle 2 (14. And comparing the required vehicle time interval with the remaining available time interval of each parking space to obtain that no directly available parking space resource exists currently.
Step three, searching and integrating available resources: using Monte Carlo tree search to respectively obtain three parking space integration adjustment schemes: the parking space 1 scheme = { the vehicle 1 is replaced to the parking space 3, and the vehicle 2 is replaced to the parking space 2}; the parking space 2 scheme = { the vehicle 1 is replaced to the parking space 3, and the vehicle 3 is replaced to the parking space 1}; the parking space 3 scheme = { the vehicle 2 is replaced to the parking space 2, and the vehicle 4 is replaced to the parking space 1}; note that no available solutions may be searched after the search using the monte carlo tree is completed.
Step four, calculating an optimal scheme according to multi-factor decision: parameters of the parking space 1 scheme = { number of permutations =2, permutation time =95, final profit =100}, parameters of the parking space 2 scheme = { number of permutations =2, permutation time =150, final profit =90}, and parameters of the parking space 3 scheme = { number of permutations =2, permutation time =120, final profit =105}. The weights of the number of times of replacement, the time of replacement, and the benefit of replacement are-0.4, -0.01, and 0.1, respectively. It can be calculated that the comprehensive score of parking space 1 is-0.4 x 2-0.01 x 95+0.02 x 100= -0.25, the comprehensive score of parking space 2 is-0.4 x 2-0.01 x 150+0.02 x 90= -0.5, and the comprehensive score of parking space 3 is-0.4 x 2-0.01 x 120+0.02 + 105= -0.1. And selecting the parking space 1 scheme with the highest score as the optimal scheme.
And fifthly, replacing according to the parking space 1 scheme steps, leaving the parking space 1, and preparing to receive the required vehicle to enter the field.
Step six, preparing to obtain the next parking demand information, and turning to the first step.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (5)
1. A parking space resource integration method for a three-dimensional parking garage is characterized by comprising the following steps:
s1, acquiring a parking demand;
s2, inquiring directly available resources, including:
s21, directly distributing berths when directly available resources exist;
s22, executing the next step S3 when no directly available resource exists;
s3, searching and integrating available resources, comprising:
s31, informing that no parking space exists when available resources are not integrated;
s32, executing the next step S4 when available resources are integrated;
and S4, selecting an optimal scheme according to a multi-factor comprehensive decision method, adjusting and replacing the berth according to the scheme, and arranging vehicles to enter the garage after the target berth is vacated.
2. The stereo garage-oriented berth resource integration method according to claim 1, wherein the step S1 comprises: the parking requirement is from reservation software or from information applied on the parking building site;
the parking demand includes at least: a period of expected parking.
3. The stereo garage-oriented berth resource integration method according to claim 1, wherein the step S2 comprises: inquiring parking conditions of all parking places in the current stereo garage according to the parking requirements in the step S1, and obtaining whether directly available resources exist at present or not by comparing the expected parking time period of the required vehicle with the remaining available time period of each parking place;
if the directly available resources exist, directly allocating the berthage according to the step S21;
if there are no directly available resources, the next step S3 is performed according to step S22.
4. The stereo garage-oriented berth resource integration method according to claim 1, wherein the step S3 comprises: searching and integrating available resources based on a Monte Carlo tree search algorithm;
if the search result is that there is no integrated available resource, executing step S31;
if the set of potential berths for parking the vehicle and the specific scheme that each potential berth requires the replacement operation are output by the search, step S32 is performed.
5. The stereo parking garage-oriented berth resource integration method according to claim 1, wherein the step S4 comprises:
the multi-factor comprehensive decision-making method comprises at least the following factors: the replacement time a, the replacement times b and the replacement final profit c are respectively given weight w to each factor 1 、w 2 、w 3 Carrying out comprehensive weighted calculation on the numerical value of each factor and the weight of each factor, and calculating the score R = aw of each scheme 1 +bw 2 +cw 3 (ii) a And the final income is measured and calculated according to the estimated parking time of the target vehicle and the parking charging rule, and the scheme with the highest comprehensive score R is selected as the optimal scheme.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210852987.4A CN115359678A (en) | 2022-07-20 | 2022-07-20 | Parking space resource integration method for three-dimensional parking garage |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210852987.4A CN115359678A (en) | 2022-07-20 | 2022-07-20 | Parking space resource integration method for three-dimensional parking garage |
Publications (1)
Publication Number | Publication Date |
---|---|
CN115359678A true CN115359678A (en) | 2022-11-18 |
Family
ID=84032827
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210852987.4A Pending CN115359678A (en) | 2022-07-20 | 2022-07-20 | Parking space resource integration method for three-dimensional parking garage |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115359678A (en) |
Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140149153A1 (en) * | 2011-07-01 | 2014-05-29 | Christos G. Cassandras | Method and system for dynamic parking allocation in urban settings |
KR20180057802A (en) * | 2016-11-22 | 2018-05-31 | 탑라이트 주식회사 | Integrated management system of parking lot and integrated management control method |
CN108389426A (en) * | 2018-04-20 | 2018-08-10 | 驭势科技(北京)有限公司 | A kind of method and apparatus for controlling vehicle parking |
JP2019038350A (en) * | 2017-08-24 | 2019-03-14 | 三菱自動車工業株式会社 | Parking assist apparatus |
CN111524382A (en) * | 2020-04-03 | 2020-08-11 | 西南交通大学 | Automatic three-dimensional parking garage system for parking and taking reservation and control method |
CN111653119A (en) * | 2020-04-30 | 2020-09-11 | 南京理工大学 | Shared parking space distribution system and method adapting to delay requirement |
US20210174682A1 (en) * | 2018-02-26 | 2021-06-10 | Veoneer Sweden Ab | Method and system for detecting parking spaces which are suitable for a vehicle |
CN114418413A (en) * | 2022-01-24 | 2022-04-29 | 上海理工大学 | Unmanned-oriented shared parking demand and parking space-time matching method |
CN114707825A (en) * | 2022-03-21 | 2022-07-05 | 上海理工大学 | Reservation type shared parking supply and demand matching self-adaptive evolution algorithm under AVP condition |
-
2022
- 2022-07-20 CN CN202210852987.4A patent/CN115359678A/en active Pending
Patent Citations (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140149153A1 (en) * | 2011-07-01 | 2014-05-29 | Christos G. Cassandras | Method and system for dynamic parking allocation in urban settings |
KR20180057802A (en) * | 2016-11-22 | 2018-05-31 | 탑라이트 주식회사 | Integrated management system of parking lot and integrated management control method |
JP2019038350A (en) * | 2017-08-24 | 2019-03-14 | 三菱自動車工業株式会社 | Parking assist apparatus |
US20210174682A1 (en) * | 2018-02-26 | 2021-06-10 | Veoneer Sweden Ab | Method and system for detecting parking spaces which are suitable for a vehicle |
CN108389426A (en) * | 2018-04-20 | 2018-08-10 | 驭势科技(北京)有限公司 | A kind of method and apparatus for controlling vehicle parking |
CN111524382A (en) * | 2020-04-03 | 2020-08-11 | 西南交通大学 | Automatic three-dimensional parking garage system for parking and taking reservation and control method |
CN111653119A (en) * | 2020-04-30 | 2020-09-11 | 南京理工大学 | Shared parking space distribution system and method adapting to delay requirement |
CN114418413A (en) * | 2022-01-24 | 2022-04-29 | 上海理工大学 | Unmanned-oriented shared parking demand and parking space-time matching method |
CN114707825A (en) * | 2022-03-21 | 2022-07-05 | 上海理工大学 | Reservation type shared parking supply and demand matching self-adaptive evolution algorithm under AVP condition |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110505644B (en) | User task unloading and resource allocation joint optimization method | |
CN100571086C (en) | System message dynamic dispatching method in a kind of broadband CDMA system | |
CN111669213B (en) | Dynamic management and control system and management and control method for satellite communication resources | |
CN106781663A (en) | System and method for processing parking stall reservation information | |
CN102917441B (en) | Target network selection method on basis of particle swarm algorithm for multi-mode terminals | |
CN112356721A (en) | Electric vehicle charging guiding method and system based on cloud platform | |
CN104484134A (en) | Method and device for allocating distributed type storage magnetic discs | |
CN104684095A (en) | Resource allocation method based on genetic operation in heterogeneous network convergence scenes | |
CN1684439A (en) | The allocation of channels to wireless LANs | |
CN110705746B (en) | Optimal configuration method for electric taxi quick charging station | |
CN103052127A (en) | Dispatching communication method and device in industrial wireless sensing network | |
CN115440059A (en) | Wisdom parking stall management system based on thing networking | |
CN115359678A (en) | Parking space resource integration method for three-dimensional parking garage | |
CN108830436B (en) | Shared bicycle scheduling method based on fractal tree self-balancing division | |
Nakayama et al. | Simulation Analysis for the Management of an Electric Vehicle–Sharing System: Case of the Kyoto Public-Car System | |
KR101372695B1 (en) | Method of scheduling tasks for charging electric vehicles and device using the method | |
CN110866668A (en) | Battery changing station service capability assessment method and battery changing station service resource scheduling system | |
CN111091286A (en) | Public bicycle scheduling model and solving method | |
CN115731748A (en) | Flight runway sequencing method and storage medium | |
CN115617526A (en) | Cloud data center energy-saving method based on cloud data center construction and virtual machine integration | |
KR20130049932A (en) | Method of scheduling tasks for charging electric vehicles and device using the method | |
CN114444400A (en) | Autonomous passenger-riding parking group garage space allocation method | |
CN110334723B (en) | Dynamically-increased baggage picking and delivering order scheduling method | |
CN111429166A (en) | Electric vehicle charging demand spatial distribution prediction method based on maximum contour clustering | |
CN112235755B (en) | Internet of vehicles access method, device and system |
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 | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20221118 |
|
RJ01 | Rejection of invention patent application after publication |