JPS628582B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a device for automatically selecting a cage for loading a car in a vertical circulation type multi-level parking facility.

Conventionally, when selecting an empty cage for loading a car, in the case of automatic selection, the empty cage that is the shortest distance from the entrance/exit position is selected, or the empty cage that is more than a predetermined distance from the entrance/exit position is selected. It is used.

The former has the advantage of shortening call time, but on the other hand,
In a loop where multiple cages are connected in an endless manner, multiple parking cages may cluster together in one place, increasing the load on the multi-level parking system. Therefore, a drive rotary machine with a large maximum output must be provided in advance. There are disadvantages that cannot be avoided. In addition, in the latter case, the parking cages are not concentrated in one place but are appropriately distributed, so the load on the multi-story parking system is reduced on average, but it has the disadvantage that the call time becomes longer. On the other hand, in the case of manual selection, unless a skilled operator selects the cage ideally, the empty cage that is the shortest distance from the entrance/exit position with the shortest call time is selected, so the parking cage is placed on one side. There was a tendency to be biased toward

The present invention has been made in view of the above points, and is a positional relationship in which, when a car is stored in an empty cage, the positions of the parking cages are dispersed as much as possible, thereby making it possible to equalize and reduce the constantly changing load on the multilevel parking system as much as possible. An object of the present invention is to provide an optimal storage cage selection device that automatically selects an empty cage located at the entrance/exit location and closest to the entrance/exit position as the storage cage.

The apparatus of the present invention will be explained below with reference to the drawings.

FIG. 1 is a device configuration diagram showing an embodiment of the present invention. In the figure, 10 is the main body of a vertical circulation multi-story parking facility, and the total number of cages is N. 20 is a drive device (not shown) for driving the main body 10. (No) power control device, 3
0 is an arithmetic unit of the microcomputer, 40 is a signal line group for transmitting commands from the arithmetic unit 30 of the microcomputer to the power control device 20, 50
60 is a power line group that transmits power from the power control device 20 to the multi-story parking facility main body 10, and 60 is the multi-story parking facility main body 1.
0, that is, the parking status of each cage, the cage number of the cage facing the entrance/exit position, etc., are transmitted to the arithmetic unit 30. 100 is a register group of the microcomputer, and the parking register 1
01, parking number register 102, landing cage register 103, load data register 104, warehousing suitability value register 105, and maximum warehousing suitability value register 1
06 and an optimal warehousing cage register 107.

The parking register 101 has at least the total number of cages N
or more, and cages C(1) to C
Address that corresponds 1:1 to the cage number of (N)
It has AA(1) to AA(N). Addresses AA(1) to AA of this vacant register 101
Data A(1) to A(N) stored in (N)
is sent from the parking equipment main body 10 to the arithmetic unit 30 via the signal line group 60, and from the arithmetic unit 30 via the address bus 71, the address corresponding to each car is sent.
The parking information entered in AA(1) to AA(N) indicates the parking status of cages C(1) to C(N), and is 0 if the cage is empty and 1 if the cage is occupied. . In the parking number register 102, data P corresponding to the ever-changing number of parked vehicles at the address AP is written. That is, the data P of the parking number register 102 is counted by the arithmetic unit 30 for each parking information obtained via the signal line group 60.
This is data showing the number of parked cars discounted for each parking information. The landing cage register 103 stores data D at the address AD, which corresponds to the cage number of the cage always present in the entrance/exit zone, regardless of whether the parking facility is in operation or not. The load data register 104 has at least the number of bytes equal to or greater than the total number of cages, and has an address AL.
(1) to AL(N) have load data L(1) to L.
The data described below is stored as (N).

First, what meaning the load data L(1) of the cage C(1) has, and how it is calculated by the calculation device 30 will be explained. In Figure 2,
The driving force required to rotate the multi-story parking device clockwise and move the cage C(1) at the lowest position is defined as load data L(1) of the cage C(1).

Load data L(2) for cage C(2) also refers to the driving force required to rotate the multilevel parking device clockwise and move cage C(2) at the lowest position, and it is the driving force required to move cage C(2) at the lowest position. Load data L of C(N)
(3) to L(N) are similarly defined. This driving force can be easily calculated by subtracting the number of parked cars in the right half from the number of parked cars in the left half in FIG. 2, assuming that all the cars parked in each cage have the same weight. That is, the load data L(1) of cage C(1) is the parking data of cages C(N/2+2) to C(N), that is, the parking register 101.
From the value F(1), which is the sum of data A(N/2+2) to A(N) stored in addresses AA(N/2+2) to AA(N), cage C(2) to cage C
(N/2) parking data, that is, parking register 10
It is obtained as the value obtained by subtracting the value G(1) which is the sum of the data A(2) to A(N/2) stored at addresses AA(2) to AA(N/2) within 1. This operation is carried out by an arithmetic unit 30 connected to the vacant register 101 via a data bus 70 and an address bus 71.
The calculation result is stored at address AL(1) of the load data register 104 as load data L(1). This load data L(1) is calculated by the calculation device 30 each time the parking status of the cages C(2) to C(N/2) and cages C(N/2+2) to C(N) changes. Data is updated. This load data L(1) can naturally take positive and negative values, but the closer the value is to zero, the higher the cage C
(1) means that the load on the multilevel parking system when it is at the lowest position is small.

Next, considering the load data L(2) of cage C(2), the load data L(2) is
As in the case of (1), the number of parking cars on the left half, that is, the data A (N/2+3) stored at addresses AA (N/2 + 3) to AA (N), AA (1) in the parking register 101 ~The number of parking spaces on the right half of the value F(2), which is the sum of A(N) and A(1), that is, the address AA(3) in the parking register 101 ~Address
It is calculated as the value obtained by subtracting the value G(2) which is the sum of data A(3) to data A(N/2+1) stored in AA(N/2+1), and is stored in the load data register 10.
4 is stored at address AL(2). Thereafter, the load data of all the cages are calculated by the calculation device 30 in the same manner, and the calculation results are stored in the load data register 104.

In the above explanation, it was stated that the driving force required to rotate the multilevel parking device clockwise and move the cage at the lowest position is defined as the load data for this cage, but the reference position of this cage is at the lowest position. The position is not limited to , and may be at the uppermost position or at an intermediate position. Also, the rotation direction of the multilevel parking device can be either clockwise or counterclockwise; the driving force required for reverse rotation can be obtained by reversing the sign of the load data obtained assuming forward rotation. It is to live. Therefore, in the following explanation, we will proceed according to the above definition.

Next, the warehousing suitability value register 105 has a number of bytes at least equal to or greater than the total number of cages, and the cage C
Addresses AS(1) to AS(N) corresponding to the cage numbers of (1) to C(N) store storage suitability values S(1) to S(N) as described below. . These warehousing suitability values S(1) to S(N) exist on the left half (or right half) when each cage is at the reference position (lowest position in Figure 2), that is, on one side. The sum of the load data of all cages (the sum of the load data of all cages is zero)
It is calculated by the arithmetic unit 30 as follows. In other words, the warehousing suitability value S(1) of cage C(1) is S(1)=L(N/2+2)+L(N/2+3)+...+L(N-1)+L(N), cage C( The warehousing suitability value S(2) of 2) is S(2)=L(N/2+3)+L(N/2+(4)+...
...+L(N)+L(1), Similarly, the warehousing suitability value S of cage C(N)
(N) is S(N)=L(N/2+1)+L(N/2+2)+...
...+L(N-2)+L(N-1). This warehousing suitability value is calculated by the calculation device 30 each time the parking state of each cage changes, and the data is updated each time.

Below, the meaning of the warehousing suitability value is explained in Cage C (1).
The warehousing suitability value S(1) will be explained with reference to FIG. 2 as an example.

Assuming that cage C(1) is now empty, if a new car is parked in cage C(1), the load data L for the left cages C(N/2+2) to C(N) in FIG. The numbers from (N/2+2) to L(N) decrease by one, and the cage C(2) on the right side
The numerical values of loads L(2) to L(N/2) of ~C(N/2) increase by one.

From this, the warehousing suitability value S of cage C(1)
(1) is positive and has a large value, and if the car is empty, if a car is stored in cage C (1), the load data of each cage other than cage C (1) will be reduced and the It can be seen that the load on the parking device can be effectively reduced.

Considering this for all the cages, if the parking suitability value of each cage is determined by the calculation device 30 and the car is parked in the empty cage with the maximum parking suitability value, the multi-level parking system will be more appropriate. It can be seen that the load can be reduced.

To explain this more specifically by giving an example, in a parking device consisting of cages C(1) to C(6) as shown in FIG.
Assuming that (6) is a parking cage and all other cages are empty, the load data for cages C(1) to C(6) are L(1)=1, L(2)=0, L(3)=-
1, L(4)=-1, L(5)=0, L(6)=1
Therefore, the warehousing suitability values S(1) to S(6) of cages C(1) to C(6) are S(1)=1 and S(6), respectively.
(2)=2, S(3)=1, S(4)=-1, S
(5)=-2 and S(6)=-1.

Therefore, cage C with the largest warehousing suitability value
It is best to park the car at (2), and just to be safe, the load data for each cage L(1) to L(6) is shown in Figure 4, where cage C(2) is used as a parking cage.
When calculating, L(1)=0, L(2)=0, L(3)=0, L
(4) = 0, L(5) = 0, L(6) = 0, so that the load on this parking device can be minimized no matter which cage C(1) to C(6) is at the lowest position. I understand.

Therefore, the maximum warehousing suitability value register 106 stores the warehousing suitability values S(1) to S of the cages C(1) to C(N) stored in the above-mentioned warehousing suitability value register 105.
(N), the arithmetic device 30 selects the warehousing suitability value that is an empty cage and has the maximum value, and
Store it in AF as the maximum warehousing suitability value F. This maximum warehousing suitability value F is also calculated by the calculation device 30 each time the warehousing suitability value of each cage and the empty cage change, and the data is updated each time. Further, the optimum warehousing cage register 107 stores the warehousing suitability values S(1) to S stored in the above-mentioned warehousing suitability value register 105.
(N), the empty cage with the maximum warehousing suitability value is selected by the arithmetic unit 30, and the address AE (1) is selected.
Data E(1) corresponding to the empty cage number is stored in the empty cage number. If there are multiple cages with the maximum warehousing suitability value, address AE(2) to AE
Data E(2) to E(N) are sequentially stored in (N).

In such an apparatus configuration, when a user arrives at the entrance and exit position and operates a warehousing button (not shown), an warehousing signal is first transmitted from the main body 10 to the arithmetic unit 30 via the signal line group 60.

Next, the arithmetic unit 30 reads the optimal warehousing cage number from the optimal warehousing cage register 107 via the data bus 70, and if there are multiple optimal warehousing cages, the optimal warehousing cage closest to the landing cage read from the landing cage register 103 A car is selected, an operation command is given to the power control device 20 through the signal line group 40, and the power control device 20 causes the optimum storage cage to stop at the entrance/exit position.

As described above, the present invention captures the load state of a multilevel parking system that changes from time to time as the difference in the number of parked cars on the left half and the right half at the reference position of each cage, and uses it as load data for each cage. It is equipped with a load data register to store and a warehousing aptitude value register to memorize the sum of the load data of the left half or the right half at the reference position of each cage. The computing device selects the empty cage with the maximum value, and if there are multiple empty cages with the maximum warehousing suitability value, the computing device selects the cage closest to the entrance/exit position as the optimal warehousing cage.As a result, the parking When the cages are almost evenly distributed, the empty cage closest to the entrance/exit position is selected as the parking cage, and when the parking cages are unevenly spaced, the load on the multilevel parking system is most efficiently minimized by entering one vehicle. The empty cage that is available and closest to the entrance/exit position can be selected.

[Brief explanation of the drawing]

FIG. 1 is a device configuration diagram showing an embodiment of the present invention;
FIG. 2 is an explanatory diagram of load data, and FIGS. 3 and 4 are explanatory diagrams of warehousing suitability values. C(1) to C(N)... Cage, 10... Main body of vertical circulation multi-level parking facility, 20... Power control device, 30... Arithmetic device, 40, 60... Signal line group, 50... Power line group, 100...Register group,
101... Parking register, 102... Parking number register, 103... Landing cage register, 104
...Load data register, 105... Warehousing suitability value register, 106... Maximum stocking suitability value register,
107...Optimal warehousing cage register, L(1)~
L(N)...Load data, S(1) to S(N)...
... Warehousing suitability value.

Claims (1)

[Scope of Claims] 1. In a multi-story parking system in which a plurality of cars are driven in a vertical circulation manner, there is provided a parking register that stores the parking status of cars in each cage, and a parking register that stores the cage numbers of the cars existing in the entrance/exit zone. The load of the landing cage register and the multi-level parking device, which changes from time to time, is captured as the difference between the number of parked cars on the left half and the right half at the reference position of each cage, and is stored as load data for each cage. and a warehousing suitability value register that captures the warehousing suitability value of each cage as the sum of the load data of the left half or right half of each cage and stores it as warehousing suitability value data for each cage. and an optimal warehousing cage register that captures the empty cage having the maximum warehousing suitability value among the warehousing suitability values of the respective cages as the optimum warehousing cage and stores data corresponding to the cage number of the empty cage, Optimization of the multi-level parking system, characterized in that, when there is a plurality of empty cages having the maximum entry suitability value, an arithmetic device is provided for selecting the empty cage located at the shortest distance from the entrance/exit position among these empty cages. Incoming cage selection device.