JPS629703B2 - - 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, methods for automatically selecting an empty cage for loading a car include methods that always select the empty cage that is the shortest distance from the entrance/exit position, or systems that always select the empty cage that is more than a predetermined distance from the entrance/exit position. It is being

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. Furthermore, in the latter case, since the parking cages are not concentrated in one place but are appropriately distributed, the load on the multilevel parking system is reduced on average, but it has the disadvantage that the call time becomes longer. The contradictory demands of shortening the call time of empty cages and reducing the load on rotating machines cannot be easily satisfied at the same time, and it is necessary to decide which one to give priority to depending on the state of vehicles entering and leaving the warehouse at that time. It is something that should be done.

The present invention has been made in view of the above points, and an object of the present invention is to provide an optimal parking cage selection device that automatically selects an appropriate empty cage as a parking cage at all times depending on the state of entering and exiting a vehicle.

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 number of parked vehicles, which changes from time to time, is written to the address AP. 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). The load data L(2) of cage C(2) is the same as that of cage C at the lowest position after rotating the multi-story parking device to the right.
(2) refers to the driving force required to move the cage C(3) to C(N) load data L(3) to
L(N) is also defined in the same way. 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 address in the parking register 101.
From the value F(1) obtained by adding the data A(N/2+2) to A(N) stored in AA(N/2+2) to AA(N), cage C(2) to cage C(N/2 ), that is, the address in the vacant register 101
It is determined as the value obtained by subtracting the value G(1) which is the sum of the data A(2) to A(N/2) stored in AA(2) to AA(N/2). This operation is performed using the vacant register 101, the data bus 70, and the address bus 71.
It is instantaneously performed by the arithmetic unit 30 connected to the load data register 104, and the result of the arithmetic operation is stored at address AL(1) of the load data register 104 as load data L(1). This load data L(1) is the cage C
(2) Each time the parking status of the cages C(N/2) to C(N/2) to C(N) changes, the calculation is performed by the calculation device 30, and the data is updated each time. This load data L(1) can naturally take positive and negative values, but the closer the value is to zero, the smaller the load on the multi-level parking system when the cage C(1) is at the lowest position.

Next, considering the load data L(2) of cage C(2), the load data L(2) is
As in case (1), the number of parked cars on the left half, that is, the address AA (N/2+3) in the parking register 101 ~AA(N), the data A (N/2+3) stored in AA(1)~ 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 to the 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 , but 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) of cage C(2). The warehousing suitability value S(2) is S(2)=L(N/2+3)+L(N/2+4) +...+L(N)+L(1) Similarly, the warehousing suitability value SN of cage CN 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), load data L(N/2+2) to CN on the left in FIG. The numbers from 2+2) to L(N) decrease by one, and the cages on the right C(2) to C
The numerical values of (N/2) load data L(2) to L(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 cage (6) is the drive 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, and cage C(1)
The warehousing suitability values S(1) to S(6) of ~C(6) are S(1)=1, S(2)=2, S(3)=1, and S(4)=-, respectively.
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, which cages C(1) to C
It can be seen that even if (6) is at the lowest position, the load on this parking device can be minimized.

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 The cage is selected and the signal line group 40 is connected by the power control device 20.
An operation command is given through the power controller 20, and the power control device 20 causes the optimal storage cage to stop at the entrance/exit position.

By the way, if you always try to select the receiving cage using the method explained above, even though there are empty cages near the entrance/exit position, the empty cage furthest from the entrance/exit will be selected, resulting in an extremely long call waiting time. This may cause some inconvenience.
When users of a multi-level parking system keep coming to the multi-storey parking system, when there is not much time to spend on each vehicle entering the parking space, long-waiting calls become a fatal flaw in the multi-storey parking system.

For this reason, in the present invention, the problem tends to occur when the load of the multi-level parking device, which changes from time to time, is within a predetermined value, that is, when there are relatively many empty cages, when there are relatively many parking cages, or when parking is well-balanced. If all of the load data for each cage is within a predetermined value, the arithmetic unit 30 selects the empty cage closest to the entrance/exit position as the warehousing cage, regardless of the above-mentioned warehousing suitability value, and eliminates the long-waiting call. I'm trying to prevent it from happening.

As described above, the present invention captures the load state of a multi-story parking system, which changes from moment to moment, 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 stores it as load data for each cage. This warehousing suitability value register is provided with a load data register for storing the data, a warehousing suitability value register for storing the sum of load data for the left or right half of the reference position of each cage, and a parking number register for storing parking devices. The arithmetic unit selects the empty cage with the maximum value among the entry suitability values for each cage stored in , and if there are multiple empty cages with the maximum entry suitability value, the cage closest to the entrance/exit position is selected as the optimum cage. When the load data for each car is within a predetermined value, that is, when the maximum value of the load of the multi-story parking system that changes from moment to moment is still small, the device selected by the computing device as the parking cage is selected from the empty space closest to the entrance/exit position. When a car is selected as an input car, and at least one of the load data for each car exceeds a predetermined value, that is, when the maximum value of the load of the multilevel parking device that changes from moment to moment becomes large, one car is Since it is possible to select an empty cage that can reduce the maximum load on the multi-story parking system by entering the car and is closest to the entrance/exit location, the waiting time for calls becomes extremely long in cases where users visit continuously. Moreover, the load on the multilevel parking system does not become extremely large.

[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, 3
0... Arithmetic device, 40, 60... Signal line group, 50... Power line group, 100... Register group, 101... Vacant parking register, 102... Parking number register, 103... Landing cage register, 104... Load data register,
105... Warehousing aptitude value register, 106... Maximum warehousing suitability value register, 107... Optimum warehousing cage register, L(1) to L(N)... Load data, S(1)
~S(N)... Warehousing suitability value.

Claims (1)

[Claims] 1 The load state of a multi-level parking system in which multiple cages are driven in a vertical circulation manner and changes moment by moment is captured 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 the load data for each cage is calculated. and a warehousing aptitude that stores the warehousing suitability value of each cage as the sum of the load data of the left half or the right half of each cage and stores it as warehousing suitability value data for each cage. A value register and a landing cage register for storing cage numbers of cages existing in the entrance/exit zone are provided, and when at least one of the load data for each cage exceeds a predetermined value, it is stored in the storage suitability value register. If the empty cage with the maximum value is selected from among the storage suitability values of the cages, and all of the load data for each cage is within the predetermined value, the cage stored in the implantation cage register is selected. An optimal parking cage selection device for a multi-level parking system, characterized by comprising a calculation device for selecting an empty cage closest to the empty cage.