A vehicle platoon parking system and method for large parking lots

The vehicle platooning parking system, which utilizes wireless communication and sensor technologies, solves the problem of insufficient information exchange in existing parking lots. It enables real-time information exchange and collaborative parking between vehicles and parking lots, thereby improving parking efficiency and parking lot utilization.

CN118629255BActive Publication Date: 2024-11-26SHANDONG UNIV OF SCI & TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411066951.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-06
Publication Date
2024-11-26
Estimated Expiration
2044-08-06

AI Technical Summary

Technical Problem

Existing parking management systems cannot effectively achieve real-time information exchange between vehicles and parking lots, resulting in low parking efficiency, long times for vehicles to find parking spaces, traffic congestion, and low parking lot utilization, causing problems especially during peak hours.

Method used

The vehicle platooning parking system, which employs wireless communication and sensor technologies, enables information exchange between vehicles and parking lots through a parking lot platooning subsystem and an in-vehicle platooning parking guidance subsystem. It identifies the status of vehicles and parking spaces in real time, plans parking routes, and provides guidance, thereby improving parking efficiency.

Benefits of technology

It reduces the time and cost for vehicles to find parking spaces, improves the utilization rate and parking efficiency of parking lots, and reduces the risk of traffic congestion.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118629255B_ABST
    Figure CN118629255B_ABST
Patent Text Reader

Abstract

The present invention proposes a vehicle formation parking system and method for large parking lots, which relates to the field of intelligent parking and management. Based on wireless communication and sensor technology, the real-time information of parked vehicles and the real-time usage status of parking spaces in the parking lot are detected in real time, and effective information exchange and coordination are achieved between vehicles and parking lots, so as to implement relevant guidance on the parking formation and parking process of vehicles, so as to reduce the time and cost of parking vehicles looking for parking spaces and improve parking efficiency. The vehicle formation parking system for large parking lots is composed of a parking lot parking formation subsystem and an in-vehicle formation parking guidance subsystem; the parking lot parking formation subsystem identifies vehicles entering the parking lot and parking spaces in the parking lot to obtain vehicle information and parking space information, forms a formation for vehicles entering the parking lot, and plans a parking plan for formation vehicles to generate parking guidance information; the two subsystems exchange information through their respective communication modules.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to a vehicle formation parking system and method for a large parking lot, and relates to the field of intelligent parking and management. Background Art

[0002] With the rapid development of economy and the continuous improvement of people's living standards, the number of motor vehicles has increased sharply, resulting in increasingly tight urban land use and increasingly prominent parking problems. In order to solve the parking problem during people's travel, large and medium-sized cities have built a large number of large parking facilities.

[0003] The existing technology still has many deficiencies in parking space management and vehicle entry and exit information provision, and cannot effectively meet parking needs. Especially during peak parking hours, vehicles have to wait in line for a long time, causing traffic jams and low parking lot utilization, and sometimes even causing traffic accidents, which brings great troubles to drivers and parking lot management.

[0004] The main reason is that existing parking facilities generally lack support for effective communication between vehicles and parking lots, and lack consideration for dynamic changes in vehicles. They are unable to adapt to real-time changes in vehicle parking, nor can they achieve collaborative parking of multiple vehicles.

[0005] Therefore, it is of great significance to develop a vehicle platoon parking system that can achieve fast and efficient parking in large parking lots. In view of this, this application is specially proposed. Summary of the invention

[0006] The present invention proposes a vehicle formation parking system and method for large parking lots, which aims to solve the problems existing in the prior art and is based on wireless communication and sensor technology to detect the real-time information of parked vehicles and the real-time usage status of parking spaces in the parking lot in real time, thereby realizing effective information exchange and coordination between vehicles and parking lots, thereby implementing relevant guidance on the parking formation and parking process of vehicles, thereby achieving the purpose of reducing the time and cost of parked vehicles looking for parking spaces and improving parking efficiency.

[0007] To achieve the above-mentioned design objectives, a vehicle formation parking system for a large parking lot is composed of a parking lot parking formation subsystem and an in-vehicle formation parking guidance subsystem; the parking lot parking formation subsystem is arranged at the parking lot, identifies vehicles entering the parking lot and parking spaces in the parking lot to obtain vehicle information and parking space information, forms a formation for vehicles entering the parking lot according to the real-time parking space information of the parking lot, plans a parking plan for the formation vehicles to generate parking guidance information, and sends it to the formation vehicles; the in-vehicle formation parking guidance subsystem is installed in the vehicle, and is used to receive parking vehicle information, parking space information and vehicle formation parking guidance information entering the parking lot from the parking lot parking formation subsystem, and guide the driver through the display module and the voice module according to the information; the parking lot parking formation subsystem and the in-vehicle formation parking guidance subsystem exchange information through their respective communication modules.

[0008] Furthermore, the parking lot parking formation subsystem includes:

[0009] The parking lot parking formation micro-control module is used to manage and call the following modules; after the parking lot parking formation subsystem is working, the parking lot parking formation micro-control module obtains the vehicle information input by the communication module to generate vehicle formation parking guidance information, and sends it to the in-vehicle formation parking guidance subsystem through the communication module;

[0010] A wireless communication module, used for identifying vehicles entering the parking lot to obtain vehicle information, transmitting the vehicle formation parking guidance information generated by the parking lot parking formation microcontroller module to the in-vehicle formation parking guidance subsystem, and receiving the vehicle information transmitted by the in-vehicle formation parking guidance subsystem;

[0011] A storage module, used to store the parking vehicle information, parking space information and vehicle formation parking guidance information entering the parking lot acquired by the wireless communication module;

[0012] Parking space sensing module, used to identify the parking space usage status and determine whether the parking space is available;

[0013] Power module, used to provide stable voltage.

[0014] Furthermore, the in-vehicle formation parking guidance subsystem includes:

[0015] The in-vehicle formation parking micro-control module is used to receive the vehicle formation parking guidance information generated by the parking lot formation subsystem and display the parking guidance information in the display module, make voice broadcasts through the voice module, and receive and process the vehicle information sent by the positioning module;

[0016] Positioning module, used to access the Beidou navigation system and collect the location information of vehicles entering the parking lot during driving;

[0017] The wireless communication module is used to receive the vehicle formation parking guidance information transmitted by the parking lot parking formation subsystem, and collect vehicle information including vehicle location and whether there is a parking demand, and send the vehicle information to the in-vehicle formation parking micro-control module;

[0018] A display module, used for displaying the vehicle formation parking guidance information received from the parking lot parking formation subsystem;

[0019] The voice module is used to voice broadcast the parking guidance information of the vehicle formation, which plays the role of guiding the driver to park;

[0020] A storage module, used to store the vehicle formation parking guidance information transmitted by the parking lot parking formation subsystem and the vehicle position information collected by the positioning module;

[0021] The power module is used to provide power to other modules of the in-vehicle platoon parking guidance subsystem.

[0022] Based on the above-mentioned vehicle platoon parking system for large parking lots, the present application also proposes the following vehicle platoon parking method for large parking lots;

[0023] It includes the following stages:

[0024] Stage (I), parking vehicle formation and parking space allocation method;

[0025] The parking lot parking formation subsystem identifies the vehicle information entering the parking lot through the wireless communication module and the parking space information through the parking space sensing module, and forms a formation for the vehicles entering the parking lot according to the location distribution of the parked vehicles and the parking space usage status;

[0026] Phase (II), parking fleet coordinated parking guidance;

[0027] After the parking vehicle formation and parking space allocation are completed, the parking lot parking formation subsystem first plans the parking path for the parking vehicle fleet and sends it to the in-vehicle formation parking guidance subsystem. Then the display module and voice module of the in-vehicle formation parking guidance subsystem provide the path information to the driver to guide the vehicle to the parking space area.

[0028] Furthermore, the stage (I) includes the following execution steps:

[0029] Step (1), obtaining and processing parking vehicle information;

[0030] The parking lot parking formation subsystem communicates with the in-vehicle formation parking guidance subsystem through the wireless communication module to obtain vehicle information;

[0031] Step (2), parking lot space status identification and processing;

[0032] The parking space status recognition is completed by the parking space sensing module. According to the parking space sensing module, the location and usage status of all parking spaces in the parking lot can be obtained. The detected parking space status information is statistically processed to generate the vacant parking space data corresponding to the parking lot;

[0033] Step (3), vehicle formation;

[0034] Step 3.1 Determine the number of parked vehicles;

[0035] Step 3.2: Calculation of parking vehicle location distribution;

[0036] Before platooning the parked vehicles, the parking lot parking formation microcontroller module calculates the vehicle position distribution;

[0037] Specifically, according to the obtained parking vehicle positions, namely P1, P2, ..., P M . Assume that the position distribution of M parked vehicles is L={L1,L2,…,L Q}, Q represents the number of vehicle position distribution. At the same time, P1, P2, ..., P M are (x1,y1), (x2,y2),…,(x M ,y M ), according to the distance formula, the distance between two adjacent parking vehicles is:

[0038] (1);

[0039] Where i=1,2,…,M-1;

[0040] It can be obtained that the vehicle spacing of M vehicles is d={d1,d2,…,d M-1};

[0041] Assume that the average length of the vehicle is l. If d={d1,d2,…,d M-1 Any d in} i <2l, the vehicles are continuously distributed, Q = 1, and the position distribution of M parked vehicles is L = {L1};

[0042] If there is d in d i >2l, the vehicles are discontinuously distributed. Let the distances between all vehicles greater than 2l be d1, d2, …, d Q-1 , then the position distribution of M parked vehicles is L={L1,L2,…,L Q};

[0043] Step 3.3 Vehicle formation;

[0044] (1) When the position distribution of M parked vehicles is discontinuous;

[0045] Then the parking formation for the M vehicles is fleet 1: V1-V Length(L1) ,Team 2: V Length(L1)+1 -V Length(L1)+Length(L2) ,…, team n: V M-Length(LQ)+1 -V M ,wherein,Length(L1),Length(L2),…,Length(L Q ) is the length of the convoy, V1-V Length(L1) It represents the vehicles V1, V2, ..., V Length(L1) The team composed of V Length(L1)+1 -V Length(L1)+Length(L2) It is represented by V Length(L1)+1 , V Length(L1)+2 , …, V Length(L1)+Length(L2) The team composed of V M-Length(LQ)+1 -V M It means that the vehicle V M-Length(LQ)+1 , V M-Length(LQ)+2 , …, V M The fleet formed;

[0046] (2) When the position distribution of M parked vehicles is continuous;

[0047] Parking vehicles are arranged in a parking formation according to the parking space usage status. First, the continuous free parking space distribution area and its position are obtained according to the spatial distribution of the free parking spaces. Then, the continuous free parking space distribution area is sorted according to the distance from the parking lot exit, and the parking vehicles are arranged in a formation according to the sequence.

[0048] Step (4): Allocate parking spaces for the fleet.

[0049] Furthermore, in step (2) of stage (I), the spatial distribution of the vacant parking spaces is obtained by analyzing the vacant parking space data of the parking lot;

[0050] Assume that the total number of free parking spaces in the current parking lot is M, and the spatial distribution of free parking spaces is S, which is composed of free parking space spatial distribution areas, that is, S={S1 1,…,Sk1 1,S1 2,…,Sk2 2,…,S1 n,…,Skn n}, where S11,…,Sk1 1,S1 2,…,Sk2 2,…,S1 n,…,Skn n are free parking space spatial distribution areas. k1 is the number of areas for a single free parking space, k2 is the number of areas for two consecutive free parking spaces, …kn is the number of areas for n consecutive free parking spaces;

[0051] If the parking lot is completely empty, the maximum number of consecutive empty parking spaces in the parking lot is M. At this time, the empty parking space distribution area is only S1 M, and the number of empty parking space areas is k. M = 1. The parking space number in the free parking space distribution area is p A1 ,p A2 ,…,p B1 ,p B2 ,…indicates fixed parking space numbers.

[0052] Furthermore, in step (4) of the stage (I), when the position distribution of the M parked vehicles is discontinuous;

[0053] First, the overall parking space allocation is performed for the fleet 1 entering the parking lot: V1-V Length(L1) ; Search whether there are Length(L1) consecutive free parking spaces in the parking lot free parking space distribution;

[0054] a. If k Length(L1) >0, the vacant parking space distribution area SopLength(L1) closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, that is, there is no vacant parking space distribution area with the same number of parking spaces available for the team to park, and the k value is determined again. Length(L1)+1 Is it zero?

[0055] b. If k Length(L1)+1 >0, the vacant parking space distribution area SopLength(L1)+1 closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, there is no vacant parking space distribution area with Length(L1)+1 parking spaces available for the team to park, and the k Length(L1)+2 Is it zero?

[0056] c. If k M >0, the vacant parking space distribution area Sop M closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, that is, there is no vacant parking space distribution area with M parking spaces available for the team to park, then the k Length(L1)-1 Is it zero?

[0057] d. If k Length(L1)-1 >0, then park the fleet V1-V Length(L1) Organized into sub-teams V1-V Length(L1)-1 With sub-team V Length(L1) ; These include:

[0058] d1. Allocate the free parking space distribution area Sop Length(L1)-1 closest to the destination parking lot exit to sub-vehicle V1-V Length(L1)-1 , complete the overall parking space allocation for the sub-fleet;

[0059] d2. is the sub-carriage V Length(L1) To allocate parking spaces to vehicles, we first obtain the free parking space distribution area containing the least number of parking spaces, set as {S1 min, S2 min, …, Sj min}, and then allocate the free parking space distribution area Sop min closest to the exit of the destination parking lot to the sub-vehicle V Length(L1) , complete the overall parking space allocation for the sub-fleet;

[0060] Otherwise, there is no Length(L1)-1 number of free parking spaces in the space distribution area that can be provided for the team to park, and continue to determine k Length(L1)-2 Is it zero?

[0061] e. From the free parking space distribution area {S1 1,…,S1 k1}, allocate the Length(L1) free parking space distribution areas Sop1 1, Sop2 1,…, SopLength(L1) 1 closest to the destination parking lot exit to the fleet. Complete the overall parking space allocation for the fleet.

[0062] According to the above process a to e, the overall parking space allocation is performed for the subsequent fleet 2, fleet 3, etc. in turn.

[0063] Furthermore, in step (4) of the stage (I), when the position distribution of the M parked vehicles is a continuous distribution, the vehicle formation process of step 3.3 is executed to obtain the parking space allocation of the continuous distribution of the vehicle fleet.

[0064] Furthermore, the stage (ii) includes the following execution steps:

[0065] Step (1), planning the parking route of the fleet;

[0066] Combining Dijkstra algorithm and K shortest path algorithm, the parking path is planned for the fleet according to the parking space location assigned to the fleet and the current location of the fleet; including the following process,

[0067] Step 1.1: Establish a path record table to store the convoy path information, which includes the path and length information;

[0068] Step 1.2: planning the path for each fleet;

[0069] Step 1.3 determines whether the path planning for all fleets has been completed; if so, jump to the following step 1.4; if not, jump to the above step 1.2 and continue to plan the path for the next fleet;

[0070] Step 1.4: The final parking paths of all fleets, i.e., A1, A2, ..., A n (n is the total number of fleets) is stored in the path record table;

[0071] Step (2), providing fleet parking guidance information;

[0072] The fleet parking guidance information includes the fleet parking guidance information before the fleet arrives at the target free parking space distribution area, and the fleet parking guidance information after the fleet arrives at the target free parking space distribution area;

[0073] Step (3), fleet parking guidance;

[0074] Step 3.1: Parking guidance for the fleet after it enters the parking lot and before it reaches the target vacant parking space distribution area;

[0075] After the parking lot parking formation subsystem plans the parking route for the parking fleet, the fleet parking information is sent to the in-vehicle formation parking guidance subsystem to guide the driver before he reaches the target free parking space distribution area;

[0076] Step 3.2: Parking guidance for the fleet after the fleet arrives at the target free parking space distribution area;

[0077] After the parking fleet arrives at the target parking space area, the parking lot parking formation subsystem sends the fleet parking information to the in-vehicle formation parking guidance subsystem to guide the driver after he arrives at the target vacant parking space distribution area.

[0078] Furthermore, step 1.2 of step (1) of the stage (ii) includes the following process:

[0079] Taking the location of fleet 1 as the starting point and the target free parking space area of ​​fleet 1 as the end point, the Dijkstra algorithm is used to obtain the shortest path of fleet 1, which is set as A1, and the path A1 and the length L are A1 The information is stored in the path record table;

[0080] Taking the location of fleet 2 as the starting point and the target free parking space area of ​​fleet 2 as the end point, the K shortest paths of fleet 2 are obtained using the K shortest path algorithm; specifically,

[0081] ① Use Dijkstra algorithm to get the shortest path of fleet 2, set it as A 21 ;

[0082] ② A 21As the iterative path, perform the first iteration and get the second shortest path A 22 ;

[0083] ③ Determine whether K shortest paths that meet the requirements are obtained. If so, jump to step d, otherwise jump to step b and continue iterating until K shortest paths are obtained;

[0084] ④ The K shortest paths A of fleet 2 21 ,A 22 ,…,A 2K The shortest path A of fleet 1 stored in the path record table 11 Compare and get K paths with A 11 The length of the repeated part of the path is set to R 21 ,R 22 ,…,R 2K If L A21 ≥L A11 , then select R 21 ,R 22 ,…,R 2K The path corresponding to the minimum value is the final path of fleet 2, set to A2. If R 21 ,R 22 ,…,R 2K If there are multiple minimum values, select R in order. 21 ,R 22 ,…,R 2K The path corresponding to the minimum value in is the final path of fleet 2; otherwise, L A21 < L A11 , then select A 21 is the final parking path of fleet 2, i.e. A2. At the same time, the final path A2 and length L of fleet 2 are A2 The information is stored in the path record table.

[0085] In summary, compared with the prior art, the vehicle formation parking system and method proposed in this application are suitable for large parking lots, and can realize multi-vehicle collaborative parking management to significantly improve parking efficiency and convenience. The parking lot parking formation subsystem is set at the parking lot. It uses wireless communication and sensor technology to identify vehicles entering the parking lot and parking spaces in the parking lot, obtain vehicle information and parking space information, and form a formation for vehicles entering the parking lot according to the real-time parking space information of the parking lot, plan the parking plan for the formation vehicles, generate parking guidance information, and send it to the formation vehicles. The in-vehicle formation parking guidance subsystem is installed in the vehicle. After receiving the parking guidance information, it guides the vehicle driver in a parallel manner of on-board screen display and voice broadcast to complete the parking of the formation vehicles, thereby improving parking efficiency and reducing the time and cost of finding parking spaces. BRIEF DESCRIPTION OF THE DRAWINGS

[0086] Figure 1 A schematic diagram of a parking lot parking formation subsystem for a vehicle formation parking system;

[0087] Figure 2 This is a schematic diagram of the in-vehicle formation parking guidance subsystem;

[0088] Figure 3 This is a schematic diagram of the parking space usage status;

[0089] Figure 4 A schematic diagram of the current parking lot usage status and vehicle location distribution;

[0090] Figure 5 This is a schematic diagram of a parking lot and parked vehicles;

[0091] Figure 6 This is a schematic diagram of the parking lot topology;

[0092] Figure 7 The actual road network topology diagram of the parking lot of the sub-team 1 in the team 1;

[0093] Figure 8 The actual road network topology diagram of the parking lot of fleet 2 in fleet 1;

[0094] Fig. 9 The actual road network topology diagram of the parking lot of fleet 2;

[0095] Fig.10 This is the actual road network topology diagram of the parking lot of fleet 3;

[0096] Fig.11 Schematic diagrams of parking paths for fleet 1, fleet 2, and fleet 3; wherein, Figure (a) is the parking path of fleet 1, a sub-fleet 1 of fleet 1; Figure (b) is the parking path of fleet 2, a sub-fleet 2 of fleet 1; Figure (c) is the parking path of fleet 2; and Figure (d) is the parking path of fleet 3;

[0097] Fig.12 Sending a guidance electronic map of the route and fleet information to the first vehicle V1 in sub-fleet 1;

[0098] Fig.13 Sending a guidance electronic map of the route and fleet information to the second vehicle V2 in sub-vehicle fleet 1;

[0099] Fig.14 The electronic map for guiding the first vehicle V1 in the sub-vehicle fleet 1 to reach the target parking area;

[0100] Fig.15 This is a diagram of the fleet and parking space information sent to vehicle V1 after the fleet arrives at the target free parking space area; the arrow pointing and the flashing box in the diagram are the content of the vehicle prompt;

[0101] Fig.16 This is a fleet and parking space information diagram sent to vehicle V2 after the fleet arrives at the target free parking space area; the arrow pointing and the flashing box in the figure are the content of the vehicle prompt;

[0102] Fig.17 This is a fleet and parking space information diagram sent to vehicle V2 after vehicle V1 completes parking. The arrows and flashing boxes in the diagram indicate the content of the vehicle prompts.

[0103] Fig.18 This is a fleet and parking space information diagram sent to vehicle V3 after vehicle V1 completes parking. The arrows and flashing boxes in the diagram indicate the content of the vehicle prompts.

[0104] Fig.19 This is a fleet and parking space information diagram sent to vehicle V3 after vehicle V2 completes parking. The arrows and flashing boxes in the diagram indicate the content of the vehicle prompts.

[0105] Fig. 20 This is a fleet and parking space information diagram sent to vehicle V4 after vehicle V3 completes parking. The arrows and flashing boxes in the diagram indicate the content of the vehicle prompts.

[0106] Fig.21 This is a fleet and parking space information diagram sent to vehicle V5 after vehicle V4 completes parking. The arrows and flashing boxes in the diagram indicate the content of the vehicle prompts.

[0107] Fig. 22 A schematic diagram of the process flow of the vehicle platoon parking method for a large parking lot described in this application; DETAILED DESCRIPTION

[0108] In order to more clearly understand the above-mentioned purpose, features and advantages of the present invention, the present invention is further described below in conjunction with the accompanying drawings and embodiments. In the following description, many specific details are set forth to facilitate a full understanding of the present invention, but the present invention can also be implemented in other ways different from those described herein, and therefore, the present invention is not limited to the specific embodiments disclosed below.

[0109] like Figure 1 and Figure 2 As shown, this embodiment proposes a vehicle formation parking system for large parking lots, which is composed of a parking lot parking formation subsystem and an in-vehicle formation parking guidance subsystem to achieve multi-vehicle collaborative parking management. Specifically,

[0110] The parking lot parking formation subsystem is set up in the parking lot. It uses wireless communication and sensor technology to identify vehicles entering the parking lot and parking spaces in the parking lot to obtain vehicle information and parking space information, and forms a formation for vehicles entering the parking lot according to the real-time parking space information of the parking lot. It plans parking plans for the formation vehicles to generate parking guidance information and sends it to the formation vehicles.

[0111] The in-vehicle formation parking guidance subsystem is installed in the vehicle and is used to receive parking vehicle information, parking space information and vehicle formation parking guidance information entering the parking lot from the parking lot parking formation subsystem, and guide the driver through the display module and voice module based on the information.

[0112] The parking lot parking formation subsystem and the in-vehicle formation parking guidance subsystem exchange information through their respective communication modules.

[0113] The parking lot parking formation subsystem includes:

[0114] The parking lot parking formation micro-control module is used to manage and call the following modules; after the parking lot parking formation subsystem is working, the parking lot parking formation micro-control module obtains the vehicle information input by the communication module to generate vehicle formation parking guidance information, and sends it to the in-vehicle formation parking guidance subsystem through the communication module;

[0115] A wireless communication module, used for identifying vehicles entering the parking lot to obtain vehicle information, transmitting the vehicle formation parking guidance information generated by the parking lot parking formation microcontroller module to the in-vehicle formation parking guidance subsystem, and receiving the vehicle information transmitted by the in-vehicle formation parking guidance subsystem;

[0116] A storage module, used to store the parking vehicle information, parking space information and vehicle formation parking guidance information entering the parking lot acquired by the wireless communication module;

[0117] The parking space sensing module is used to identify the parking space usage status (including idle and occupied status) and determine whether the parking space is available. Specifically, an infrared sensor is installed at each parking space in the parking lot to detect whether the parking space is occupied. When a vehicle enters the parking space, the infrared sensor detects the presence of the vehicle and updates the parking space information to "occupied". When the vehicle leaves the parking space, the parking space information is updated to "idle". Then, the parking lot parking formation micro-control module reads the parking space occupancy / idle status information of the infrared sensor. Moreover, it can record the time when the vehicle enters and leaves the parking space, as well as the parking time, and transmit the relevant information to the parking lot parking formation micro-control module.

[0118] Power module, used to provide stable voltage.

[0119] The in-vehicle formation parking guidance subsystem includes:

[0120] The in-vehicle formation parking micro-control module is used to receive the vehicle formation parking guidance information generated by the parking lot formation subsystem and display the parking guidance information in the display module, broadcast it by voice through the voice module, and receive and process the vehicle information sent by the positioning module, including counting the position and number of vehicles with parking requirements, so as to obtain the parking vehicle distribution;

[0121] Positioning module, used to access the Beidou navigation system and collect the location information of vehicles entering the parking lot during driving;

[0122] The wireless communication module is used to receive the vehicle formation parking guidance information transmitted by the parking lot parking formation subsystem, and collect vehicle information including vehicle location and whether there is a parking demand, and send the vehicle information to the in-vehicle formation parking micro-control module;

[0123] A display module, used for displaying the vehicle formation parking guidance information received from the parking lot parking formation subsystem;

[0124] The voice module is used to voice broadcast the parking guidance information of the vehicle formation, which plays the role of guiding the driver to park;

[0125] A storage module, used to store the vehicle formation parking guidance information transmitted by the parking lot parking formation subsystem and the vehicle position information collected by the positioning module;

[0126] The power module is used to provide power to other modules of the in-vehicle platoon parking guidance subsystem.

[0127] like Figures 3 to 22 As shown, the vehicle platoon parking for a large parking lot includes the following implementation process:

[0128] Phase 1: Parking vehicle formation and parking space allocation method

[0129] The parking lot parking formation subsystem identifies the vehicle information entering the parking lot through the wireless communication module and the parking space information through the parking space sensing module, and forms a formation for the vehicles entering the parking lot according to the location distribution of the parked vehicles and the parking space usage status;

[0130] Step (1), obtaining and processing parking vehicle information;

[0131] The parking lot parking formation subsystem communicates with the in-vehicle formation parking guidance subsystem through the wireless communication module to obtain vehicle information;

[0132] Assume that the vehicles that need to park are V1, V2, ..., V N(N represents the total number of vehicles), and their positions are P1, P2, ..., P N According to the obtained parking positions of the vehicles, the vehicles are sorted from near to far according to their distance from the parking lot entrance. The sorted vehicles are recorded as V1, V2, ..., V N , that is, V1 is the vehicle closest to the parking lot entrance, V N The vehicle farthest from the parking lot entrance.

[0133] Specifically, at a certain time T1, the number of vehicles with parking needs obtained within the wireless communication range is N1, then at this time, the vehicle formation parking process is performed on the N1 vehicles; at time T2 after the first batch of parking vehicles are processed, that is, the number of vehicles with parking needs obtained from T1 to T2 is N2, then the same vehicle formation parking process is continued for the N2 parking vehicles. That is, during the process of vehicle formation, parking space allocation, and path planning and guidance for the initial N1 parking vehicles, there will be new parking vehicles with parking needs. Assuming that there are N2 new parking vehicles in this process, the same process will be continued for the N2 vehicles after the N1 vehicles are processed.

[0134] Step (2), parking lot space status identification and processing;

[0135] The parking space status recognition is completed by the parking space sensing module. According to the parking space sensing module, the location and usage status of all parking spaces in the parking lot can be obtained. The detected parking space status information is statistically processed to generate the vacant parking space data corresponding to the parking lot.

[0136] Furthermore, by analyzing the data of free parking spaces in the parking lot, the spatial distribution of free parking spaces is obtained. Assuming that the total number of free parking spaces in the current parking lot is M, and the spatial distribution of free parking spaces is S, which is composed of free parking space spatial distribution areas, that is, S={S1 1,…,Sk1 1,S1 2,…,Sk2 2,…,S1 n,…,Skn n}, where S1 1,…,Sk11,S1 2,…,Sk2 2,…,S1 n,…,Skn n are free parking space spatial distribution areas. k1 is the number of areas for a single free parking space, k2 is the number of areas for two consecutive free parking spaces, and …kn is the number of areas for n consecutive free parking spaces.

[0137] If the parking lot is completely empty, the maximum number of consecutive empty parking spaces in the parking lot is M. At this time, the empty parking space distribution area is only S1 M, and the number of empty parking space areas is k. M = 1. The parking space number in the free parking space distribution area is p A1 ,p A2 ,…,p B1 ,p B2,…indicates fixed parking space numbers.

[0138] like Figure 3 According to the parking space usage status of the parking lot shown, the total number of vacant parking spaces in the current parking lot is 34, and the spatial distribution of vacant parking spaces is S = {S1 1, S2 1, S1 2, S2 2, S1 3, S2 3, S3 3, S1 4, S1 5, S2 5, S3 5}.

[0139] Step (3), vehicle formation:

[0140] Step 3.1 Determine the number of parked vehicles;

[0141] If M ≤ N, that is, the number of available parking spaces in the parking lot is less than the number of vehicles required for parking, the first M vehicles park in formation and inform the following NM vehicles to wait;

[0142] If M>N, the number of free parking spaces in the parking lot is greater than the number of vehicles in need of parking, and all parking vehicles can park without waiting. The vehicle formation method in the above two cases is the same, the only difference is whether there are vehicles that need to wait;

[0143] The following is a parking formation description for the first M parked vehicles to be processed;

[0144] Step 3.2: Calculation of parking vehicle location distribution;

[0145] Before platooning the parked vehicles, the parking lot parking formation microcontroller module calculates the vehicle position distribution;

[0146] Specifically, according to the obtained parking vehicle positions, namely P1, P2, ..., P M . Assume that the position distribution of M parked vehicles is L={L1,L2,…,L Q}, Q represents the number of vehicle position distribution. At the same time, P1, P2, ..., P M are (x1,y1), (x2,y2),…,(x M ,y M ), according to the distance formula, the distance between two adjacent parking vehicles is:

[0147] (1);

[0148] Where i=1,2,…,M-1;

[0149] It can be obtained that the vehicle spacing of M vehicles is d={d1,d2,…,d M-1};

[0150] Assume that the average length of the vehicle is l. If d={d1,d2,…,dM-1 Any d in} i <2l, the vehicles are continuously distributed, Q = 1, and the position distribution of M parked vehicles is L = {L1};

[0151] If there is d in d i >2l, the vehicles are discontinuously distributed. Let the distances between all vehicles greater than 2l be d1, d2, …, d Q-1 , then the position distribution of M parked vehicles is L={L1,L2,…,L Q};

[0152] Step 3.3 Vehicle formation;

[0153] (1) When the position distribution of M parked vehicles is discontinuous;

[0154] Then the parking formation for the M vehicles is fleet 1: V1-V Length(L1) ,Team 2: V Length(L1)+1 -V Length(L1)+Length(L2) ,…, team n: V M-Length(LQ)+1 -V M ,wherein,Length(L1),Length(L2),…,Length(L Q ) is the length of the convoy, V1-V Length(L1) It represents the vehicles V1, V2, ..., V Length(L1) The team composed of V Length(L1)+1 -V Length(L1)+Length(L2) It is represented by V Length(L1)+1 , V Length(L1)+2 , …, V Length(L1)+Length(L2) The team composed of V M-Length(LQ)+1 -V M It means that the vehicle V M-Length(LQ)+1 , V M-Length(LQ)+2 , …, V M The team formed.

[0155] like Figure 4 Taking the current parking space usage status and vehicle position distribution shown in the figure as an example, the parking vehicles are formed into a team. Among them, nodes A, B, and C represent intersections in the parking lot. According to the 10 vehicles V1, V2, V3, ..., V 10 The position distribution of the vehicles is discontinuous. According to the above vehicle formation method, the parking formation of the vehicles can be obtained: the parking formation of the fleet 1 is V1-V6, the parking formation of the fleet 2 is V7-V9, and the parking formation of the fleet 3 is V 10 .

[0156] (2) When the position distribution of M parked vehicles is continuous;

[0157] Parking vehicles are arranged in a parking formation according to the parking space usage status. First, the continuous free parking space distribution area and its position are obtained according to the spatial distribution of the free parking spaces. Then, the continuous free parking space distribution area is sorted according to the distance from the parking lot exit, and the parking vehicles are arranged in a formation according to the sequence.

[0158] like Figure 5 The parking lot and parked vehicles shown have a total of 10 parked vehicles that are not arranged continuously;

[0159] First, in order to realize the formation of the continuously distributed vehicles, according to Figure 3 The parking lot and parked vehicles shown in the figure show that the distribution of vacant parking spaces in the parking lot is: S = {S1 1, S2 1, S1 2, S2 2, S1 3, S2 3, S3 3, S1 4, S1 5, S2 5, S3 5};

[0160] Secondly, the parking lot exit and the vacant parking space distribution area are taken as vertices, and the parking lot road network is combined to obtain the parking lot topology map, such as Figure 6 As shown in the figure, the parking lot exit is marked as the starting vertex n0, and the vertices are c1, c2, ..., c 11 , the weights between each vertex are obtained from the actual parking lot road network;

[0161] Then, the Dijkstra algorithm is used to calculate the parking lot exit node n0 to other vertices c1-c 11 The minimum distances from small to large are c1, c2, c5, c6, c9, c3, c7, c4, c8, c 10 ,c 11 , it can be obtained that the distances from the continuous free parking spaces distribution area to the parking lot exit from near to far are S1 2, S1 4, S1 3, S2 3, S2 5, S1 5, S2 2, S1 1, S33, S2 1, S3 5;

[0162] Finally, according to the number of parking spaces in the continuous free parking space distribution area from near to far from the parking lot exit, the parking formations for the M vehicles are fleet 1: V1-V2, fleet 2: V3-V6, fleet 3: V7-V9, fleet 4: V 10 -V 12 ,Team 5: V 13 -V 17 ,Team 6: V 18 -V 22 ,Team 7: V 23 -V 24 ,Team 8: V 25 ,Team 9: V 26 -V 28 ,Team 10: V29 ,Team 11: V 30 -V 34 ;

[0163] exist Figure 5 There are only ten vehicles distributed continuously in the middle. Then the parking formations for the M vehicles are: Team 1: V1-V2, Team 2: V3-V6, Team 3: V7-V9, Team 4: V 10 ;

[0164] Step (4), fleet parking space allocation;

[0165] Step 4.1 When the position distribution of M parked vehicles is discontinuous;

[0166] First, the overall parking space allocation is performed for the fleet 1 entering the parking lot: V1-V Length(L1) ; Search whether there are Length(L1) consecutive free parking spaces in the parking lot free parking space distribution;

[0167] a. If k Length(L1) >0, the vacant parking space distribution area SopLength(L1) closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, that is, there is no vacant parking space distribution area with the same number of parking spaces available for the team to park, and the k value is determined again. Length(L1)+1 Is it zero?

[0168] b. If k Length(L1)+1 >0, the vacant parking space distribution area SopLength(L1)+1 closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, there is no vacant parking space distribution area with Length(L1)+1 parking spaces available for the team to park, and the k Length(L1)+2 Is it zero?

[0169] c. If k M >0, the vacant parking space distribution area Sop M closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, that is, there is no vacant parking space distribution area with M parking spaces available for the team to park, then the k Length(L1)-1 Is it zero?

[0170] d. If k Length(L1)-1 >0, then park the fleet V1-V Length(L1) Organized into sub-teams V1-V Length(L1)-1 With sub-team V Length(L1) ; These include:

[0171] d1. Allocate the free parking space distribution area Sop Length(L1)-1 closest to the destination parking lot exit to sub-vehicle V1-V Length(L1)-1 , complete the overall parking space allocation for the sub-fleet;

[0172] d2. is the sub-carriage V Length(L1) To allocate parking spaces to vehicles, we first obtain the free parking space distribution area containing the least number of parking spaces, set as {S1 min, S2 min, …, Sj min}, and then allocate the free parking space distribution area Sop min closest to the exit of the destination parking lot to the sub-vehicle V Length(L1) , complete the overall parking space allocation for the sub-fleet;

[0173] Otherwise, there is no Length(L1)-1 number of free parking spaces in the space distribution area that can be provided for the team to park, and continue to determine k Length(L1)-2 Is it zero?

[0174] e. From the free parking space distribution area {S1 1,…,S1 k1}, allocate the Length(L1) free parking space distribution areas Sop1 1, Sop2 1,…, SopLength(L1) 1 closest to the destination parking lot exit to the fleet. Complete the overall parking space allocation for the fleet.

[0175] According to the above process a to e, the overall parking space allocation is performed for the subsequent fleet 2, fleet 3, etc. Figure 3 Taking the current parking space usage status and vehicle formation shown in the figure as an example, the overall parking space allocation is performed for the fleet. The free parking space distribution S={S1 1, S2 1, S1 2, S2 2, S1 3, S2 3, S3 3, S1 4, S1 5, S2 5, S3 5} can be obtained from the current parking space usage status. According to the above-mentioned parking fleet overall parking space allocation method, the overall parking space allocation is performed for fleet 1, fleet 2, and fleet 3.

[0176] Perform overall parking space allocation for fleet 1: Length(L1) = 6, then first determine whether k6 is zero. Since k6<0, determine whether k5 is zero; if k5>0, then organize parking fleet V1-V6 into sub-fleet V1-V5 and sub-fleet V6, and allocate the free parking space distribution area S2 5 closest to the destination parking lot exit to V1-V5 in the fleet, completing the overall parking space allocation for parking fleet V1-V5; at the same time, allocate parking spaces for sub-fleet V6 vehicles, first obtain the free parking space distribution area {S1 1, S2 1} containing the least parking spaces, and then allocate the free parking space distribution area S1 1 closest to the destination parking lot exit to sub-fleet V6, completing the overall parking space allocation for the sub-fleet; thus completing the overall parking space allocation for the fleet.

[0177] Perform overall parking space allocation for fleet 2: k3>0, allocate the free parking space distribution area S1 3 to the fleet, and complete the overall parking space allocation for parking fleets V7-V9.

[0178] Assign parking spaces to fleet 3 as a whole: k1>0, assign the free parking space distribution area S1 2 to the fleet, and complete the parking fleet V 10 Overall parking space allocation.

[0179] Step 4.2 When the position distribution of M parked vehicles is continuous distribution;

[0180] Execute the vehicle formation process in step 3.3 above to obtain the parking space allocation of the continuously distributed vehicle fleet;

[0181] like Figure 4 Taking the current parking lot parking space usage status and vehicle formation as an example, the overall parking space allocation is performed for the fleet. From the parking formation fleet 1: V1-V2, fleet 2: V3-V6, fleet 3: V7-V9, fleet 4: V 10 , we can get the fleet parking space allocation. That is, the 2 parking spaces in the S1 2 area are allocated to fleet 1, and the 4 parking spaces in the S1 4 area are allocated to fleet 2. The 3 parking spaces in the S1 3 area are allocated to fleet 3, and the middle parking space in the S2 3 area is allocated to fleet 4. After the overall parking space allocation is completed, specific parking spaces are allocated to the vehicles in the parking fleet in order.

[0182] like Figure 5 Taking the current parking space usage status and parking space allocation of fleet 2 as an example, specific parking space allocation is performed for vehicles V3-V6 in fleet 2. In the S1 4 area, the parking space allocated to V3 is p A5 , the parking space allocated to V4 is p A6 , the parking space allocated to V5 is p A7 , the parking space allocated to V4 is p A8.

[0183] Phase (II), parking fleet coordinated parking guidance;

[0184] After the parking vehicle formation and parking space allocation are completed, the parking lot parking formation subsystem first plans the parking path for the parking fleet and sends it to the in-vehicle formation parking guidance subsystem. Then the display module and voice module of the in-vehicle formation parking guidance subsystem provide the path information to the driver to guide the vehicle to the parking space area.

[0185] Step (1), planning the parking route of the fleet;

[0186] Combining Dijkstra algorithm and K shortest path algorithm, the parking path is planned for the fleet according to the parking space location assigned to the fleet and the current location of the fleet; including the following process,

[0187] Step 1.1: Create a path record table to store the convoy path information. The record table includes path and length information, as shown in the following table:

[0188] Table 1 Path record table

[0189] ;

[0190] Step 1.2: planning the path for each fleet;

[0191] Taking the location of fleet 1 as the starting point and the target free parking space area of ​​fleet 1 as the end point, the Dijkstra algorithm is used to obtain the shortest path of fleet 1, which is set as A1, and the path A1 and the length L are A1 The information is stored in the path record table;

[0192] Taking the location of fleet 2 as the starting point and the target free parking space area of ​​fleet 2 as the end point, the K shortest paths of fleet 2 are obtained using the K shortest path algorithm; specifically,

[0193] ① Use Dijkstra algorithm to get the shortest path of fleet 2, set it as A 21 ;

[0194] ② A 21 As the iterative path, perform the first iteration and get the second shortest path A 22 ;

[0195] ③ Determine whether K shortest paths that meet the requirements are obtained. If so, jump to step d, otherwise jump to step b and continue iterating until K shortest paths are obtained;

[0196] ④ The K shortest paths A of fleet 2 21 ,A 22 ,…,A 2KThe shortest path A of fleet 1 stored in the path record table 11 Compare and get K paths with A 11 The length of the repeated part of the path is set to R 21 ,R 22 ,…,R 2K If L A21 ≥L A11 , then select R 21 ,R 22 ,…,R 2K The path corresponding to the minimum value is the final path of fleet 2, set to A2. If R 21 ,R 22 ,…,R 2K If there are multiple minimum values, select R in order. 21 ,R 22 ,…,R 2K The path corresponding to the minimum value in is the final path of fleet 2; otherwise, L A21 < L A11 , then select A 21 is the final parking path of fleet 2, i.e. A2. At the same time, the final path A2 and length L of fleet 2 are A2 The information is stored in the path record table.

[0197] Step 1.3 determines whether the path planning for all fleets has been completed; if so, jump to the following step 1.4; if not, jump to the above step 1.2 and continue to plan the path for the next fleet;

[0198] Step 1.4: The final parking paths of all fleets, i.e., A1, A2, ..., A n (n is the total number of fleets) is stored in the path record table.

[0199] like Figure 4 The parking lot and the parking vehicles shown in the figure are divided into fleet 1: V1-V6, fleet 2: V7-V9, fleet 3: V 10 , where fleet 1 contains two sub-fleet groups, V1-V5 and V6. The parking spaces allocated to them are as follows Figure 3 The areas S2 5, S1 1, S1 3, and S1 2 are shown. The above method is used to plan parking paths for fleet 1 (including sub-fleet 1 and sub-fleet 2), fleet 2, and fleet 3;

[0200] Specifically, a path record table is established to store the path information of fleet 1, fleet 2, and fleet 3, including path and length information.

[0201] Path planning for sub-convoy 1 in fleet 1: take the location of sub-convoy 1 as the starting point c0 and the target free parking space distribution area as the end point c1-1 ,Let the intersections in the parking lot be intermediate nodes n1, n2, n3, n4, n5, n6, according to Figure 7 The actual road network topology of the parking lot shown in the figure uses the Dijkstra algorithm to calculate the shortest path A1 of the sub-fleet 1 -1 :c0→n1→c1,L A1-1 =20, the above path information is stored in the path record table, and the updated path record table is shown in the following table:

[0202] Table 2 Path record table

[0203] ;

[0204] Path planning for sub-convoy 2 in fleet 1: take the location of sub-convoy 2 as the starting point c0 and the target free parking space distribution area as the end point c 1-2 ,Let the intersections in the parking lot be intermediate nodes n1, n2, n3, n4, n5, n6, such as Figure 8 The actual road network topology of the parking lot shown in the figure uses the K shortest path algorithm to obtain the K shortest paths of sub-fleet 2. The specific process is:

[0205] Use Dijkstra algorithm to get the shortest path of sub-convoy 2, set it as A 1-21 ; A 1-21 c0→n1→n2→n3→c 1-2 , L A1-21 =11;

[0206] A 1-21 As the iteration path, perform the first iteration:

[0207] a. Set the weight between the n1→n2 path to infinity and use the Dijkstra algorithm to obtain the shortest path A under this condition. 1-22-1 c0→n1→n4→n5→n6→c 1-2 , L A1-22-1 =51;

[0208] b. Set the weight between the n2→n3 path to infinity and use the Dijkstra algorithm to obtain the shortest path A under this condition. 1-22-2 c0→n1→n2→n5→n6→c 1-2 , L A1-22-2 =51;

[0209] So far c0 to c 1-2 All paths are included.

[0210] The three shortest paths A of sub-convoy 2 1-21 ,A 1-22-1 ,A1-22-2 The shortest path A of sub-convoy 1 in fleet 1 stored in the path record table 1-1 By comparison, we get 3 paths with A 1-1 The length of the repeated portion of the path, R 1-21 =3, R 1-22-1 =3, R 1-22-2 =20. Since L A1-21 < L A1-1 ;

[0211] Since the K-path algorithm can obtain the shortest path, the second shortest path, ... the Kth shortest path of the fleet, if the mutual interference with other fleets is not considered, the shortest path can be directly selected as the final parking path of the fleet. Considering that the parking process of the previous fleet will affect the progress of the next fleet, when the total length of the shortest path preferred by fleet i+1 is greater than the final path of fleet i, that is, fleet i+1 may pass through the parking area of ​​fleet i during the parking process of fleet i and continue to move forward, the shortest path of fleet i+1 is abandoned and the path with the least overlap with the path of fleet i is selected among the K shortest paths. In this way, the mutual influence between fleets is minimized.

[0212] Therefore, select A 1-21 is the final path of sub-convoy 2, A 1-2 =A 1-21 , L A1-2 = 11. At the same time, the final path A of sub-convoy 2 1-2 And length L A1-2 The information is stored in the path record table. The updated path record table is shown in the following table:

[0213] Table 3 Path record table

[0214] ;

[0215] Path planning for fleet 2: Take the location of fleet 2 as the starting point c0 and the target free parking area as the end point c2, such as Fig. 9 The actual road network topology of the parking lot shown in the figure uses the K shortest path algorithm to obtain the K shortest paths of fleet 2.

[0216] The specific process is as follows:

[0217] Use Dijkstra algorithm to get the shortest path of fleet 2, set it as A 21 ; A 21 For c0→n1→n2→c2, L A21 =25;

[0218] A 21 As the iteration path, perform the first iteration:

[0219] Set the weight between the n1→n2 path to infinity, and use the Dijkstra algorithm to obtain the shortest path A under this condition. 22 c0→n1→n4→n5→c 22 , L A22 =31;

[0220] So far, all paths excluding the invalid path c0 to c2 have been included. The invalid path refers to the path including the segment n2→n5→c2.

[0221] The two shortest paths A of fleet 2 21 ,A 22 The final path A of sub-convoy 2 of convoy 1 stored in the path record table 1-2 By comparison, we get two paths with A 1-2 The length of the repeated portion of the path, R 21 =6, R 22 =3. Since L A21 > L A1-2 , then select R 22 The corresponding path is the final path of fleet 2, A2=A 22 , L A2 =31. At the same time, the final path A2 and length L of team 2 A2 The information is stored in the path record table. The updated path record table is shown in the following table:

[0222] Table 4 Path record table

[0223] ;

[0224] So far, the final parking path of fleet 1 (including sub-fleet 1 and sub-fleet 2), fleet 2, and fleet 3 is obtained, that is, A 1-1 , A 1-2 , A2, A3, and stored in the path record table.

[0225] The parking paths of fleet 1, fleet 2, and fleet 3 obtained by the above path planning method are as follows Fig.11 shown.

[0226] Step (2), providing fleet parking guidance information;

[0227] The fleet parking guidance information includes the fleet parking guidance information before the fleet arrives at the target free parking space distribution area, and the fleet parking guidance information after the fleet arrives at the target free parking space distribution area;

[0228] Step 2.1 determining the parking guidance information of the fleet before the fleet arrives at the target free parking space distribution area;

[0229] The parking guidance information of the fleet before it reaches the target free parking space distribution area includes parking path, fleet information, and voice information;

[0230] Parking path, including the path for each vehicle in the fleet to reach the target vacant parking space and the nodes along the path that require voice guidance;

[0231] Fleet information, including the number of vehicles in the fleet, the location of the vehicles, and the positional relationship between the vehicle and other vehicles in the fleet; the current vehicle is distinguished by the use of shadow color in the positional relationship sent by different vehicles in the fleet;

[0232] Voice information, including vehicle straight-ahead, left-turn and right-turn information, distance information between the fleet's current position and the target vacant parking space distribution area, and parking and waiting parking information;

[0233] Step 2.2 determines the parking guidance information of the fleet after the fleet arrives at the target free parking space distribution area;

[0234] After the fleet arrives at the target free parking space distribution area, the fleet parking guidance information includes fleet and parking space information and voice information;

[0235] Fleet and parking space information, including the correspondence between vehicles in the fleet and parking spaces;

[0236] Voice messages, including parking or waiting parking messages;

[0237] The parking guidance information of the above-mentioned fleet before and after arriving at the target free parking space distribution area is generated by the parking lot parking formation micro-control module.

[0238] The parking route is obtained by parking route planning, the fleet and parking space information is obtained by information exchange between vehicles and between vehicles and parking lots through wireless communication modules, and the voice information is obtained through speech synthesis technology based on the corresponding guidance text; the above information is based on the fleet parking guidance information of the parking lot map generation system.

[0239] Step (3), fleet parking guidance;

[0240] Step 3.1: Parking guidance for the fleet after it enters the parking lot and before it reaches the target vacant parking space distribution area;

[0241] After the parking lot parking formation subsystem plans the parking route for the parking fleet, the fleet parking information is sent to the in-vehicle formation parking guidance subsystem to guide the driver before he reaches the target free parking space distribution area;

[0242] like Figure 4Taking the parking lot and the parking guidance of fleet 1 in fleet 1 as an example, parking guidance is provided to the fleet according to the parking path planned for it by the parking lot subsystem as shown in Figure (a).

[0243] First, send the path and fleet information to the first vehicle V1 in sub-fleet 1, such as Fig.12 As shown in the figure, the solid icon represents the vehicle V1, and the icons behind represent other vehicles V2, V3, V4, and V5 in the convoy. The second vehicle V2 in the convoy 1 is sent the path and convoy information as follows: Fig.13 As shown, the solid icon represents the vehicle V2, the front represents the first vehicle V1 in the convoy, and the rear represents the vehicles V3, V4, and V5 in the convoy. Similarly, the corresponding path and convoy information are sent to the subsequent vehicles in the convoy.

[0244] Secondly, when the first vehicle V1 in the convoy is about to arrive at the parking lot entrance, a voice message is sent to V1: "The front has arrived at the parking lot entrance, please pay attention to turn left." At the same time, a voice message is sent to the following vehicles V2, V3, V4, and V5: "The front has arrived at the parking lot entrance, please follow the front vehicle and pay attention to turn left."

[0245] When the convoy enters the parking lot, a voice message is sent to V1: "Please go straight to Intersection C and turn left at Intersection C." At the same time, a voice message is sent to the following vehicles V2, V3, V4, and V5: "Please follow the vehicle in front and turn left at Intersection C."

[0246] When vehicle V1 in the convoy is about to arrive at position C, a voice message is sent to the first vehicle V1 in the convoy: "Please turn left at intersection C, and then you will reach the target parking space 34 meters away." At the same time, a voice message is sent to the following vehicles V2, V3, V4, and V5: "Please follow the vehicle in front, pay attention to turn left, and then you will reach the target parking space 34 meters away."

[0247] like Fig.14 As shown, when the vehicle V1 in the convoy passes through point C and reaches C1, it is about to reach the target parking space area. At this time, a voice message is sent to the vehicles V1-V5 in the convoy: "The target parking space is about to be reached, please be ready to park."

[0248] Step 3.2: Parking guidance for the fleet after the fleet arrives at the target free parking space distribution area;

[0249] After the parking fleet arrives at the target parking space area, the parking lot parking formation subsystem sends the fleet parking information to the in-vehicle formation parking guidance subsystem to guide the driver after arriving at the target free parking space distribution area;

[0250] like Figure 4 Taking the parking lot and sub-carriage 1 parking guidance shown in the figure as an example, after the car fleet arrives at the target parking space area, first, the car fleet and parking space information is sent to the first car V1 in the car fleet. Fig.15 As shown, the parking space p corresponding to the V1 vehicle C2 The flashing prompt is given, and at the same time, the arrow points to the target parking space of each vehicle; the fleet and parking space information is sent to the second vehicle V2 in the fleet. Fig.16 As shown; similarly, corresponding guidance information is also sent to other vehicles in the fleet;

[0251] Secondly, send a voice message to the first vehicle V1 in the convoy: "You have arrived at the target parking space, please park your vehicle in p C2 Parking space." At the same time, a voice message is sent to vehicle V2: "You have arrived at the target parking space, please stop and wait for V1 to complete parking, and prepare for parking." A voice message is sent to vehicles V3, V4 and V5: "You have arrived at the target parking space, please stop and wait for V1 to complete parking."

[0252] When V1 completes parking, it sends the fleet and parking space information to vehicle V2. Fig.17 As shown, a voice message is sent: "The front vehicle V1 has completed parking, please park the vehicle in the target parking space p C3 . "Similarly, the fleet and parking space information is sent to vehicle V3 as follows Fig.18 As shown, a voice message is sent: "The first vehicle V1 has completed parking. Please wait for V2 to complete parking and prepare for parking." The corresponding fleet and parking space information is sent to vehicles V4 and V5, and a voice message is sent: "The first vehicle V1 has completed parking. Please wait for V2 to complete parking."

[0253] When V2 completes parking, it sends fleet and parking space information to vehicle V3. Fig.19 As shown, a voice message is sent: "The front vehicle V2 has completed parking, please park the vehicle in the target parking space p C4 . "Similarly, the corresponding fleet and parking space information is sent to vehicle V4, and a voice message is sent: "Vehicle V2 has completed parking, please wait for V3 to complete parking and prepare for parking." At the same time, the corresponding fleet and parking space information is sent to vehicle V5, and a voice message is sent: "Vehicle V2 has completed parking, please wait for V3 to complete parking."

[0254] When V3 completes parking, it sends the fleet and parking space information to vehicle V4. Fig. 20 The following message is displayed: "The front vehicle V3 has completed parking. Please park the vehicle in the target parking space p C5 At the same time, the fleet and parking space information is sent to vehicle V5, and a voice message is sent: "Vehicle V3 has completed parking, please wait for V4 to complete parking and prepare for parking."

[0255] When V4 completes parking, it sends fleet and parking space information to vehicle V5. Fig.21The following message is displayed: "The front vehicle V4 has completed parking. Please park the vehicle in the target parking space p C6 . "

[0256] At this point, all vehicles in the fleet have completed parking. The working process of the entire system is as follows: Fig. 22 shown.

[0257] The above description is only a preferred embodiment of the present invention and does not limit the present invention in other forms. Any technician familiar with the profession may use the technical content disclosed above to change or modify it into an equivalent embodiment with equivalent changes and apply it to other fields. However, any simple modification, equivalent change and modification made to the above embodiment based on the technical essence of the present invention without departing from the content of the technical solution of the present invention still falls within the protection scope of the technical solution of the present invention.

Claims

1. A vehicle platoon parking method for a large parking lot, characterized by: It includes the following stages: Stage (I), parking vehicle formation and parking space allocation method; The parking lot parking formation subsystem identifies the vehicle information entering the parking lot through the wireless communication module and the parking space information through the parking space sensing module, and forms a formation and allocates parking spaces for the vehicles entering the parking lot according to the location distribution of the parked vehicles and the parking space usage status of the parking lot; it includes the following execution steps: Step (1), obtaining and processing parking vehicle information; The parking lot parking formation subsystem communicates with the in-vehicle formation parking guidance subsystem through the wireless communication module to obtain vehicle information; Step (2), parking lot space status identification and processing; The parking space status recognition is completed by the parking space sensing module; the parking space sensing module can obtain the location and usage status of all parking spaces in the parking lot; the detected parking space status information is statistically processed to generate the vacant parking space data corresponding to the parking lot; Step (3), vehicle formation; Step 3.1 Determine the number of parked vehicles; Step 3.2: Calculation of parking vehicle location distribution; Before platooning the parked vehicles, the parking lot parking formation microcontroller module calculates the vehicle position distribution; Specifically, the positions of the N parked vehicles are P1, P2, ..., P N ; Assume that the position distribution of N parked vehicles is L={L1,L2,…,L Q }, Q represents the number of vehicle position distribution; at the same time, P1, P2, ..., P N are (x1,y1), (x2,y2),…,(x N ,y N ), according to the distance formula, the distance between two adjacent parking vehicles is: (1) Where i=1,2,…,N-1; It can be obtained that the vehicle spacing of N vehicles is d={d1,d2,…,d N-1 }; Assume that the average length of the vehicle is l. If d={d1,d2,…,d N-1 Any d in} i < 2l, then the vehicles are continuously distributed, in which case Q = 1, and the position distribution of N parked vehicles is L = {L1}; If there is d in d i > 2l, the vehicles are discontinuously distributed. Let the distances between all vehicles greater than 2l be d1, d2, …, d Q-1 , then the position distribution of N parked vehicles is L={L1,L2,…,L Q }; Step 3.3 Vehicle formation; (1) When the position distribution of N parked vehicles is discontinuous; Then the parking formation for the N vehicles is fleet 1: V1-V Length(L1) ,Team 2: V Length(L1)+1 -V Length(L1)+Length(L2) ,…, team n: V N-Length(LQ)+1 -V N ,wherein,Length(L1),Length(L2),…,Length(L Q ) is the length of the convoy, V1-V Length(L1) It represents the vehicles V1, V2, ..., V Length(L1) The team composed of V Length(L1)+1 -V Length(L1)+Length(L2) It is represented by V Length(L1)+1 , V Length(L1)+2 , …, V Length(L1)+Length(L2) The team composed of V N-Length(LQ)+1 -V N It means that the vehicle V N-Length(LQ)+1 , V N-Length(LQ)+2 , …, V N The fleet formed; (2) When the position distribution of N parked vehicles is continuous; Parking vehicles are arranged in a parking formation according to the parking space usage status. First, the continuous free parking space distribution area and its position are obtained according to the spatial distribution of the free parking spaces. Then, the continuous free parking space distribution area is sorted according to the distance from the parking lot exit, and the parking vehicles are arranged in a formation according to the sorting result. Step (4), fleet parking space allocation; Phase (II), parking fleet coordinated parking guidance; After the parking vehicle formation and parking space allocation are completed, the parking lot parking formation subsystem first plans the parking path for the parking vehicle fleet and sends it to the in-vehicle formation parking guidance subsystem. Then the display module and voice module of the in-vehicle formation parking guidance subsystem provide the path information to the driver to guide the vehicle to the parking space area.

2. The vehicle platoon parking method for a large parking lot according to claim 1, characterized in that: In step (2) of phase (I), the spatial distribution of the vacant parking spaces is obtained by analyzing the vacant parking space data of the parking lot; Assume that the total number of free parking spaces in the current parking lot is M, and the spatial distribution of free parking spaces is S, which is composed of the free parking space spatial distribution areas, that is, S={S1 1,…,Sk1 1,S1 2,…,Sk2 2,…,S1 n,…,Skn n}, where S11,…,Sk1 1,S1 2,…,Sk2 2,…,S1 n,…,Skn n are the free parking space spatial distribution areas; k1 is the number of areas of a single free parking space, k2 is the number of areas of two consecutive free parking spaces, and kn is the number of areas of n consecutive free parking spaces; If the parking lot is completely empty, the maximum number of consecutive empty parking spaces in the parking lot is M. At this time, the empty parking space distribution area is only S1 M, and the number of empty parking space areas is k. M =1; the parking space number in the free parking space distribution area is p A1 ,p A2 ,…,p B1 ,p B2 ,…represents the fixed parking space number; among them, k M Represents the number of parking space distribution areas with M consecutive free parking spaces.

3. The vehicle platoon parking method for a large parking lot according to claim 1, characterized in that: In step (4) of the stage (I), when the position distribution of the N parked vehicles is discontinuous; First, the overall parking space allocation is performed for the fleet 1 entering the parking lot: V1-V Length(L1) ; Search whether there are Length(L1) consecutive free parking spaces in the parking lot free parking space distribution; a. If k Length(L1) > 0, the vacant parking space distribution area SopLength(L1) closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, that is, there is no vacant parking space distribution area with the same number of parking spaces available for the team to park, and the k value is determined again. Length(L1)+1 Is it zero? Among them, k Length(L1) represents the number of parking space distribution areas with Length(L1) consecutive free parking spaces, k Length(L1)+1 Indicates the number of parking space distribution areas with Length(L1)+1 consecutive free parking spaces; b. If k Length(L1)+1 > 0, the free parking space distribution area SopLength(L1)+1 closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, there is no free parking space distribution area with Length(L1)+1 parking spaces available for the team to park, and the k Length(L1)+2 Is it zero? Among them, k Length(L1)+2 Indicates the number of parking space distribution areas with Length(L1)+2 consecutive free parking spaces; c. If k M > 0, the vacant parking space distribution area Sop M closest to the destination parking lot exit is allocated to the team to complete the overall parking space allocation for the parking team; otherwise, that is, there is no vacant parking space distribution area with M parking spaces available for the team to park, then the k Length(L1)-1 Is it zero? Among them, k M represents the number of parking space distribution areas with M consecutive free parking spaces, k Length(L1)-1 Indicates the number of parking space distribution areas with Length(L1)-1 consecutive free parking spaces; d. If k Length(L1)-1 > 0, then park the fleet V1-V Length(L1) Organized into sub-teams V1-V Length(L1)-1 With sub-team V Length(L1) ; These include, d1. Allocate the free parking space distribution area Sop Length(L1)-1 closest to the destination parking lot exit to sub-vehicle V1-V Length(L1)-1 , complete the overall parking space allocation for the sub-fleet; d2. is the sub-team V Length(L1) To allocate parking spaces to vehicles, we first obtain the free parking space distribution area containing the least number of parking spaces, set as {S1 min, S2 min, …, Sj min}, and then allocate the free parking space distribution area Sop min closest to the exit of the destination parking lot to the sub-vehicle V Length(L1) , complete the overall parking space allocation for the sub-fleet; Otherwise, there is no Length(L1)-1 number of free parking spaces in the space distribution area that can be provided for the team to park, and continue to determine k Length(L1)-2 Is it zero? Among them, k Length(L1)-2 Indicates the number of parking space distribution areas with Length(L1)-2 consecutive free parking spaces; e. From the free parking space distribution area {S1 1,…,S1 k1}, allocate the Length(L1) free parking space distribution areas Sop1 1, Sop2 1,…, SopLength(L1) 1 closest to the destination parking lot exit to the fleet, completing the overall parking space allocation for the fleet; According to the above steps a to e, the overall parking spaces are allocated to the subsequent fleet in sequence.

4. The vehicle platoon parking method for a large parking lot according to claim 1, characterized in that: In step (4) of the stage (I), when the position distribution of the N parked vehicles is a continuous distribution, the vehicle formation process of step 3.3 is executed to obtain the parking space allocation of the continuous distribution of the vehicle fleet.

5. The vehicle platoon parking method for a large parking lot according to claim 1, characterized in that: The stage (ii) includes the following execution steps: Step (1), planning the parking route of the fleet; Integrate Dijkstra algorithm and K shortest path algorithm to plan parking paths for the fleet based on the parking spaces allocated to the fleet and the fleet's current location; Including the following process, Step 1.1: Establish a path record table to store the convoy path information, which includes the path and length information; Step 1.2: planning the path for each fleet; Step 1.3 determines whether the path planning for all fleets has been completed; if so, jump to the following step 1.4; if not, jump to the above step 1.2 and continue to plan the path for the next fleet; Step 1.4: The final parking paths of all fleets, i.e., A1, A2, ..., A n (n is the total number of fleets) is stored in the path record table; Step (2), providing fleet parking guidance information; The fleet parking guidance information includes the fleet parking guidance information before the fleet arrives at the target free parking space distribution area, and the fleet parking guidance information after the fleet arrives at the target free parking space distribution area; Step (3), fleet parking guidance; Step 3.1: Parking guidance for the fleet after it enters the parking lot and before it reaches the target vacant parking space distribution area; After the parking lot parking formation subsystem plans the parking route for the parking fleet, the fleet parking information is sent to the in-vehicle formation parking guidance subsystem to guide the driver before he reaches the target free parking space distribution area; Step 3.2: Parking guidance for the fleet after the fleet arrives at the target free parking space distribution area; After the parking fleet arrives at the target parking space area, the parking lot parking formation subsystem sends the fleet parking information to the in-vehicle formation parking guidance subsystem to guide the driver after he arrives at the target vacant parking space distribution area.

6. A vehicle platoon parking method for a large parking lot according to claim 5, characterized in that: Step 1.2 of step (1) of stage (ii) includes the following process: Taking the location of fleet 1 as the starting point and the target free parking space area of ​​fleet 1 as the end point, the shortest path of fleet 1 is obtained by Dijkstra algorithm and is set as A1. A1 The information is stored in the path record table; Taking the location of fleet 2 as the starting point and the target free parking space area of ​​fleet 2 as the end point, the K shortest paths of fleet 2 are obtained using the K shortest path algorithm; specifically, ① Use Dijkstra algorithm to get the shortest path of fleet 2, set it as shortest path A 21 ; ② A 21 As the iterative path, perform the first iteration and get the second shortest path A 22 ; ③ Determine whether the K shortest paths that meet the requirements are obtained. If so, jump to step ④, otherwise jump to step ② and continue iterating until K shortest paths are obtained; ④ The K shortest paths A of fleet 2 21 ,A 22 ,…,A 2K Compare it with the shortest path A1 of fleet 1 stored in the path record table, and get the length of the overlapping part of the K paths and path A1, set it as R 21 ,R 22 ,…,R 2K ; If L A21 ≥ L A1 , then select R 21 ,R 22 ,…,R 2K The path corresponding to the minimum value is the final path of fleet 2, set to A2. If R 21 ,R 22 ,…,R 2K If there are multiple minimum values, select R in order. 21 ,R 22 ,…,R 2K The path corresponding to the minimum value in is the final path of fleet 2; otherwise, L A21 < L A1 , then select A 21 is the final parking path of fleet 2, i.e. A2; at the same time, the final path A2 and length L of fleet 2 A2 The information is stored in the path record table.