Mechanical garage lifting and moving control method

Abstract

This invention discloses a lifting and traversing control method for a mechanical parking garage, relating to the field of parking and retrieval technology for lifting and traversing parking garages. The method determines the driver's parking or retrieval needs by identifying NFC card information in the garage's backend. When the need is for parking, after the vehicle is parked, all available parking spaces in the garage are traversed, and the number of operations required for each space is calculated using both the space rotation method and the insertion method. The minimum of these two methods is taken as the optimal movement method for that space. The space with the fewest optimal movement operations is selected from all available spaces and moved to the bottom floor. Similarly, when the need is for retrieval, the optimal movement method required for the space number of the vehicle to be retrieved is calculated, and the vehicle is moved to the bottom floor according to the optimal movement method. This solves the problem of parking and retrieval with the fewest operations in a lifting and traversing parking garage.

Description

Technical Field

[0001] This invention belongs to the field of lifting and traversing parking garages and relates to automatic control technology, specifically a lifting and traversing control method for mechanical parking garages. Background Technology

[0002] With the increasing number of cars entering households, the number of cars in society is growing exponentially, resulting in a large number of cars in urban communities having nowhere to park and causing parking difficulties; the emerging lift-and-slide multi-level parking garage can effectively solve the problem of insufficient parking spaces.

[0003] However, since this type of lift-and-slide parking garage only has one vertical passage, parking spaces that are high off the ground or far from the vertical passage require multiple lift-and-slide operations to park or retrieve a car; and each lift-and-slide operation requires a lot of electricity and time; therefore, a method is needed to minimize the frequency of lift-and-slide operations.

[0004] Therefore, a lifting and lateral movement control method for mechanical garages is proposed. Summary of the Invention

[0005] This invention aims to at least solve one of the technical problems existing in the prior art. To this end, this invention proposes a mechanical parking garage lift-and-remote control method. This method determines the driver's parking or retrieval needs by identifying NFC card information in the garage's backend. When the need is for parking, after the vehicle is parked, all available parking spaces in the garage are traversed, and the number of operations required for each space is calculated using both the space rotation method and the insertion method. The minimum of these two methods is taken as the optimal movement method for that space. The space with the fewest optimal movement operations is selected from all available spaces and moved to the bottom floor. Similarly, when the need is for retrieval, the optimal movement method required for the space number of the vehicle to be retrieved is calculated, and the vehicle to be retrieved is moved to the bottom floor according to the optimal movement method. This solves the problem of parking and retrieving vehicles with the fewest operations in a lift-and-remote parking garage.

[0006] To achieve the above objectives, an embodiment of the first aspect of the present invention provides a method for controlling the lifting and traversing of a mechanical parking garage, comprising the following steps:

[0007] Step 1: Number each parking space in the horizontal and vertical order; the garage backend stores the unique physical number of each parking space; the garage backend updates the correspondence between the physical number and the spatial number of each parking space every time a parking space is raised, lowered, or moved laterally;

[0008] Step 2: When each vehicle enters the garage to park, it needs to swipe an NFC card in advance. The NFC card contains vehicle information, which may be license plate information. The vehicle information is entered into the garage management backend by swiping the NFC card.

[0009] Step 3: The driver selects an available parking space on the ground floor and parks the vehicle in the available space; the garage backend saves the correspondence between the physical address of the parking space and the vehicle information; when the vehicle is parked and no one is in the vehicle, the garage backend selects an available parking space to move to the ground floor with the fewest number of operations by lifting and traversing.

[0010] Step 4: When the driver comes to retrieve the car, they need to swipe the NFC card in advance. The garage backend obtains the corresponding parking space physical address based on the vehicle information in the NFC card; it then obtains the spatial location of the parking space based on the physical address; the garage backend calculates the method with the fewest lifting and lateral movements to move the car to the bottom floor based on the spatial location of the parking space; and moves the corresponding parking space to the bottom floor according to the corresponding plan.

[0011] The spatial numbering method, which combines horizontal and vertical numbering, is as follows: Horizontally, the parking space on each floor is numbered 1 if it is closest to the vertical aisle, and the remaining spaces on the same floor are numbered sequentially according to their horizontal distance from space 1. Vertically, the bottom-level parking space is numbered 1, and the remaining spaces on the same vertical line are numbered sequentially according to their vertical distance from space 1. Each parking space is labeled m for horizontal numbering and n for vertical numbering. Each parking space is assigned the spatial number mn. The number of parking spaces on the top floor horizontally is labeled M, and the number of parking floors vertically is labeled N.

[0012] A parking space is uniquely identified by assigning a unique physical number to each parking space; the physical number can be pre-set manually.

[0013] Step three, where the garage backend selects an available car to move to the bottom floor with the minimum number of operations, includes the following steps:

[0014] Step S1: The garage backend counts the space numbers of all available parking spaces; and iterates through all available parking spaces, then proceeds to step S2;

[0015] Step S2: For each available parking space, calculate the minimum number of operations based on its space number mn; obviously, when n=1, no parking space needs to be moved; that is, the minimum number of operations is 0; otherwise, calculate the minimum number of operations required.

[0016] There are two ways to move an idle car to the bottom layer:

[0017] Method 1: If n = N, m = 1; includes the following steps:

[0018] Step L1: Move parking space #1 on the top floor from the nth floor to the bottom floor;

[0019] Step L2: Move parking space #2 on the top floor one parking space away towards the vertical passage;

[0020] Step L3: Move the first train position of the first (n-1)th level upwards by one train position distance;

[0021] Step L4: Move the parking space in the bottom vertical passageway 1 parking space away from the vertical passageway in a horizontal direction;

[0022] Let n1 be the number of times the movement is raised, lowered, or horizontally traversed in Method 1; obviously, n1 = 4 at this time;

[0023] If n = N, m ≠ 1; the following steps are included:

[0024] Step K1: Move parking space #1 on the top floor from the nth floor to the bottom floor;

[0025] Step K2: Move parking space number 2-m on the top floor one parking space away towards the vertical passage;

[0026] Step K3: Move the (m-1)th column of layer 1-(N-1) upwards by one parking space distance;

[0027] Step K4: Parking space No. 1 on the nth floor and parking spaces No. 1-(m-1) on the bottom floor move together a distance of 1 parking space away from the vertical passage in a horizontal direction;

[0028] Step P5: It can be understood that at this time, parking space No. 1 on the top floor is the same as parking space No. 2 on the top floor before; repeat steps K1-K4 until parking space mn moves to the bottom floor;

[0029] Clearly, at this point, n1 = 4*m;

[0030] Otherwise, include the following steps:

[0031] Step P1: Move parking spaces 1-m on the nth floor towards the vertical aisle by a distance of 1 parking space;

[0032] Step P2: Move parking space number 1 on the nth floor from the nth floor to the bottom floor;

[0033] Step P3: Move the m-th train position on the 1-(n-1)th floor upwards by 1 train position.

[0034] Step P4: Parking space 1 on the nth floor and parking spaces 1-(m-1) on the bottom floor move together in a horizontal direction away from the vertical passage by a distance of 1 parking space.

[0035] Step P5: It can be understood that at this time, parking space No. 1 on the nth floor is the same as parking space No. 2 on the previous nth floor; repeat steps P1-P4 until parking space mn moves to the bottom floor;

[0036] Clearly, n1 = 4*m;

[0037] In conclusion, n1 = 4*m;

[0038] Method 2: Includes the following steps:

[0039] Step Q1: Parking spaces numbered 1-(m-1) from floor 1 to floor n-1 are moved 1 parking space distance towards the vertical passage; obviously, the number of moves is 4*(n-1).

[0040] Step Q2: Parking space number mn is moved down to the ground floor;

[0041] Step Q3: Move the parking space in the vertical passage upwards by one parking space.

[0042] Step Q4: Move the first m parking spaces from the vertical aisle on floors 2 to n a horizontal distance of 1 parking space away from the vertical aisle; obviously, the number of moves is 4*(n-1).

[0043] Let n2 be the number of times the movement is raised, lowered, or horizontally traversed in method 2; therefore, n2 = 4*(n-1) + 1 + 1 + 4*(n-1) = 8*n-6;

[0044] Therefore, by comparing the sizes of n1 and n2, we can obtain the solution with the fewest operations to move the idle vehicle to the bottom layer; that is, the minimum number of operations is the smaller value between n1 and n2.

[0045] Step S3: The garage backend finds the vacant parking space with the fewest number of operations from all vacant parking spaces, and moves the vacant parking space to the bottom floor according to the corresponding method of the fewest number of operations for that vacant parking space.

[0046] In step four, the method of moving the parked vehicle to the bottom floor with the fewest lifting and lateral movements is to calculate the number of movements n1 and n2 for method 1 and method 2 to move the vehicle to the bottom floor; and move the parking space to the bottom floor according to the method corresponding to the smaller value of the number of movements n1 and n2.

[0047] Compared with the prior art, the beneficial effects of the present invention are:

[0048] This invention identifies a driver's parking or retrieval needs by recognizing NFC card information in the garage backend. When the need is for parking, after the vehicle is parked, all available parking spaces in the garage are traversed. The number of operations required for each space is calculated using both the space rotation method and the insertion method. The minimum of these two methods is taken as the optimal movement method for that space. The space with the fewest optimal movement operations is selected from all available spaces and moved to the bottom floor. Similarly, when the need is for retrieval, the optimal movement method required for the space number of the vehicle to be retrieved is calculated, and the vehicle is moved to the bottom floor using the optimal movement method. This solves the problem of minimizing the number of operations for parking and retrieving vehicles in a lift-and-slide parking garage. Attached Figure Description

[0049] Figure 1 This is a flowchart of the present invention;

[0050] Figure 2 This is a schematic diagram of a lift-and-slide type parking garage. Detailed Implementation

[0051] The technical solution of the present invention will be clearly and completely described below with reference to the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0052] like Figure 1 As shown, a method for controlling the lifting and lateral movement of a mechanical parking garage includes the following steps:

[0053] Step 1: Number each parking space in the horizontal and vertical order; the garage backend stores the unique physical number of each parking space; the garage backend updates the correspondence between the physical number and the spatial number of each parking space every time a parking space is raised, lowered, or moved laterally;

[0054] Step 2: When each vehicle enters the garage to park, it needs to swipe an NFC card in advance. The NFC card contains vehicle information, which may be license plate information. The vehicle information is entered into the garage management backend by swiping the NFC card.

[0055] Step 3: The driver selects an available parking space on the ground floor and parks the vehicle in the available space; the garage backend saves the correspondence between the physical address of the parking space and the vehicle information; when the vehicle is parked and no one is in the vehicle, the garage backend selects an available parking space to move to the ground floor with the fewest number of operations by lifting and traversing.

[0056] Step 4: When the driver comes to retrieve the car, they need to swipe the NFC card in advance. The garage backend obtains the corresponding parking space physical address based on the vehicle information in the NFC card; it then obtains the spatial location of the parking space based on the physical address; the garage backend calculates the method with the fewest lifting and lateral movements to move the car to the bottom floor based on the spatial location of the parking space; and moves the corresponding parking space to the bottom floor according to the corresponding plan.

[0057] like Figure 2 As shown, except for the top floor of the garage, one parking space must be reserved on each of the middle and bottom floors for vehicle entry and exit; the top floor parking space can only be lowered and not raised; the bottom floor parking space can only be raised and not lowered.

[0058] The spatial numbering method, arranged in both horizontal and vertical directions, combines horizontal and vertical numbering. Horizontally, each parking space on each floor is numbered 1 if it's closest to the vertical aisle, and the remaining spaces on the same floor are numbered sequentially according to their horizontal distance from space 1. Vertically, the bottom-level parking space is numbered 1, and the remaining spaces on the same vertical line are numbered sequentially according to their vertical distance from space 1. Each parking space is labeled m horizontally and n vertically. Each parking space is assigned the spatial number mn. The number of horizontal parking spaces on the top floor is labeled M, and the number of vertical parking floors is labeled N. Clearly... Figure 2 The value of M is 3, and the value of N is 3;

[0059] It is understandable that because parking spaces can be raised, lowered, and moved laterally, the parking space numbers change in real time; therefore, by assigning a unique physical number to each parking space, a parking space can be uniquely identified; the physical number can be manually preset.

[0060] Step three, where the garage backend selects an available car to move to the bottom floor with the minimum number of operations, includes the following steps:

[0061] Step S1: The garage backend counts the space numbers of all available parking spaces; and iterates through all available parking spaces, then proceeds to step S2;

[0062] Step S2: For each available parking space, calculate the minimum number of operations based on its space number mn; obviously, when n=1, no parking space needs to be moved; that is, the minimum number of operations is 0; otherwise, calculate the minimum number of operations required.

[0063] It is understandable that each raising, lowering, and lateral movement of a parking space requires time and electricity; therefore, it is necessary to minimize the number of raising, lowering, and lateral movements. Moving vacant parking spaces to the lower level can be done in two ways:

[0064] Method 1: If n = N, m = 1; that is, the parking space is located within the vertical passageway on the top floor; including the following steps:

[0065] Step L1: Move parking space #1 on the top floor from the nth floor to the bottom floor;

[0066] Step L2: Move parking space #2 on the top floor one parking space away towards the vertical passage;

[0067] Step L3: Move the first train position of the first (n-1)th level upwards by one train position distance;

[0068] Step L4: Move the parking space in the bottom vertical passageway 1 parking space away from the vertical passageway in a horizontal direction;

[0069] Let n1 be the number of times the movement is raised, lowered, or horizontally traversed in Method 1; obviously, n1 = 4 at this time;

[0070] If n = N, m ≠ 1; that is, the parking space is on the top floor; the following steps are included:

[0071] Step K1: Move parking space #1 on the top floor from the nth floor to the bottom floor;

[0072] Step K2: Move parking space number 2-m on the top floor one parking space away towards the vertical passage;

[0073] Step K3: Move the (m-1)th column of layer 1-(N-1) upwards by one parking space distance;

[0074] Step K4: Parking space No. 1 on the nth floor and parking spaces No. 1-(m-1) on the bottom floor move together a distance of 1 parking space away from the vertical passage in a horizontal direction;

[0075] Step P5: It can be understood that at this time, parking space No. 1 on the top floor is the same as parking space No. 2 on the top floor before; repeat steps K1-K4 until parking space mn moves to the bottom floor;

[0076] Clearly, at this point, n1 = 4*m;

[0077] Otherwise, include the following steps:

[0078] Step P1: Move parking spaces 1-m on the nth floor towards the vertical aisle by a distance of 1 parking space;

[0079] Step P2: Move parking space number 1 on the nth floor from the nth floor to the bottom floor;

[0080] Step P3: Move the m-th train position on the 1-(n-1)th floor upwards by 1 train position.

[0081] Step P4: Parking space 1 on the nth floor and parking spaces 1-(m-1) on the bottom floor move together in a horizontal direction away from the vertical passage by a distance of 1 parking space.

[0082] Step P5: It can be understood that at this time, parking space No. 1 on the nth floor is the same as parking space No. 2 on the previous nth floor; repeat steps P1-P4 until parking space mn moves to the bottom floor;

[0083] Clearly, n1 = 4*m;

[0084] In conclusion, n1 = 4*m;

[0085] Method 2: Includes the following steps:

[0086] Step Q1: Parking spaces numbered 1-(m-1) from floor 1 to floor n-1 are moved 1 parking space distance towards the vertical passage; obviously, the number of moves is 4*(n-1).

[0087] Step Q2: Parking space number mn is moved down to the ground floor;

[0088] Step Q3: Move the parking space in the vertical passage upwards by one parking space.

[0089] Step Q4: Move the first m parking spaces from the vertical aisle on floors 2 to n a horizontal distance of 1 parking space away from the vertical aisle; obviously, the number of moves is 4*(n-1).

[0090] Let n2 be the number of times the movement is raised, lowered, or horizontally traversed in method 2; therefore, n2 = 4*(n-1) + 1 + 1 + 4*(n-1) = 8*n-6;

[0091] Therefore, by comparing the sizes of n1 and n2, we can obtain the solution with the fewest operations to move the idle vehicle to the bottom layer; that is, the minimum number of operations is the smaller value between n1 and n2.

[0092] Step S3: The garage backend finds the vacant parking space with the fewest number of operations from all vacant parking spaces, and moves the vacant parking space to the bottom floor according to the corresponding method of the fewest number of operations for that vacant parking space.

[0093] In step four, the method of moving the parked vehicle to the bottom floor with the fewest lifting and lateral movements is to calculate the number of movements n1 and n2 for method 1 and method 2 to move the vehicle to the bottom floor; and move the parking space to the bottom floor according to the method corresponding to the smaller value of the number of movements n1 and n2.

[0094] The above embodiments are only used to illustrate the technical methods of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical methods of the present invention without departing from the spirit and scope of the technical methods of the present invention.

Claims

1. A method for controlling the lifting and lateral movement of a mechanical parking garage, characterized in that, Includes the following steps: Step 1: Number each parking space in the horizontal and vertical order; the garage backend stores the unique physical number of each parking space; the garage backend updates the correspondence between the physical number and the spatial number of each parking space every time a parking space is raised, lowered, or moved laterally; Step 2: When each vehicle enters the garage to park, it swipes its NFC card in advance. The NFC card contains vehicle information. The vehicle information is then entered into the garage's backend system by swiping the NFC card. Step 3: The driver selects an available parking space on the ground floor and parks the vehicle in the available space; the garage backend saves the correspondence between the physical address of the parking space and the vehicle information; after parking is completed, the garage backend selects another available parking space on the ground floor with minimal operations by lifting and traversing. Step 4: When the driver comes to retrieve the car, they swipe the NFC card in advance. The garage backend obtains the corresponding parking space physical address based on the vehicle information in the NFC card; it then obtains the spatial location of the parking space based on the physical address; the garage backend calculates the minimum number of operations in the operation plan based on the spatial location of the parking space; and uses the corresponding plan as the car retrieval plan, moving the corresponding parking space to the bottom floor according to the car retrieval plan. The spatial numbering method, which combines horizontal and vertical numbering, is as follows: Horizontally, the parking space on each floor is numbered 1 if it is closest to the vertical aisle, and the remaining spaces on the same floor are numbered sequentially according to their horizontal distance from space 1. Vertically, the bottom-level parking space is numbered 1, and the remaining spaces on the same vertical line are numbered sequentially according to their vertical distance from space 1. Each parking space is labeled m for horizontal numbering and n for vertical numbering. Each parking space is assigned the spatial number mn. The number of parking spaces on the top floor horizontally is labeled M, and the number of parking floors vertically is labeled N. The garage backend selects an available car to move to the bottom floor with minimal operations, including the following steps: Step S1: The garage backend counts the space numbers of all available parking spaces; and iterates through all available parking spaces, then proceeds to step S2; Step S2: For each available parking space, calculate the minimum number of operations based on its space number mn; when n=1, the minimum number of operations is 0; otherwise, calculate the minimum number of operations required. Step S3: The garage backend finds the vacant parking space with the fewest number of operations from all vacant parking spaces, and moves the vacant parking space to the bottom floor according to the corresponding method of the fewest number of operations for that vacant parking space. There are two ways to calculate the minimum number of operations required to move an empty parking space to the ground floor: Method 1: If n=N, m=1; includes the following steps: Step L1: Move parking space #1 on the top floor from the nth floor to the bottom floor; Step L2: Move parking space #2 on the top floor one parking space away towards the vertical passage; Step L3: Move the first train position of the first (n-1)th level upwards by one train position distance; Step L4: Move the parking space in the bottom vertical passageway 1 parking space away from the vertical passageway in a horizontal direction; Let n1 be the number of ascents, descents, and lateral movements in Method 1; at this point, n1 = 4. 1=4 m; if n=N, m≠1; includes the following steps: Step K1: Move parking space #1 on the top floor from the nth floor to the bottom floor; Step K2: Move parking space 2-m on the top floor one parking space distance towards the vertical aisle; Step K3: Move column m-1 on the 1st to (N-1)th floor upwards one parking space distance; Step K4: Parking space No. 1 on the nth floor and parking spaces No. 1-(m-1) on the bottom floor move together a distance of 1 parking space away from the vertical passage in a horizontal direction; Step P5: Repeat steps K1-K4 until parking space mn moves to the bottom layer; at this point, n1=4. m; Otherwise, include the following steps: Step P1: Move parking spaces 1-m on the nth floor towards the vertical aisle by a distance of 1 parking space; Step P2: Move parking space number 1 on the nth floor from the nth floor to the bottom floor; Step P3: Move the m-th train position on the 1-(n-1)th floor upwards by 1 train position. Step P4: Parking space 1 on the nth floor and parking spaces 1-(m-1) on the bottom floor move together in a horizontal direction away from the vertical passage by a distance of 1 parking space. Step P5: Repeat steps P1-P4 until parking space mn moves to the bottom layer; at this point, n1=4. m; In conclusion, n1=4 m; Method 2: Includes the following steps: Step Q1: Parking spaces 1-(m-1) from level 1 to level n-1 are moved 1 parking space distance towards the vertical aisle; obviously, the number of moves is 4. (n-1) times; Step Q2: Parking space number mn is moved down to the ground floor; Step Q3: Move the parking space in the vertical passage upwards by one parking space. Step Q4: Move the first m parking spaces from the vertical aisle on floors 2 to n by a distance of 1 parking space in the horizontal direction away from the vertical aisle; obviously, the number of moves is 4. (n-1) times; let n2 be the number of times the ascent, descent, and lateral movement occur in method 2; therefore, n2 = 4 (n-1)+1+1+4 (n-1) = 8 n-6; Therefore, by comparing the sizes of n1 and n2, we can obtain the solution that requires the fewest operations to move the idle vehicle to the bottom layer; that is, the minimum number of operations is the smaller value between n1 and n2.

2. The lifting and lateral movement control method for a mechanical garage according to claim 1, characterized in that, The physical number is a unique number that is manually assigned to each parking space in advance.

3. The lifting and lateral movement control method for a mechanical garage according to claim 2, characterized in that, The vehicle retrieval scheme involves calculating the number of moves, n1 and n2, for both method 1 and method 2, and moving the parking space to the bottom level according to the smaller value of the number of moves, n1 and n2.

Images