JPS629704B2 - - 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. etc. are used. The former has the advantage of shortening the call time, but on the other hand, there is a risk that multiple parking cages will be clustered in one place in a loop where multiple cages are connected in an endless manner, increasing the load on the multi-level parking system. There is a drawback that a driving rotary machine with a large maximum output must be provided in advance. In addition, in the latter case, since the drive 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. 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 there is only one parking cage. It tended to clump together.

The present invention has been made in view of the above points, and when a car is stored in an empty cage, the positions of the parking cages are dispersed as much as possible so that the load on the multi-level parking device, which changes from time to time, can be made as uniform as possible and reduced 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 that is related to the entrance/exit position and is 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 diagram showing the configuration of an apparatus according to an embodiment of the present invention. In the figure, 10 is the main body of a vertical circulation multi-level parking facility, and the total number of cages is N. 20 is a power control device for a drive device (not shown) that drives the main body 10;
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, a parking number register 102, a landing cage register 103, an empty cage number register 104, a parking cage number register 105, a warehousing suitability value register 106, a maximum warehousing suitability value register 107, and an optimum warehousing cage register 108. The parking register 101 has a number of bits that is at least the total number of cages N or more, and has an address AA that corresponds one-to-one to the cage numbers of cages C(1) to C(N).
(1) has ~AA(N). The data A(1) to A(N) stored at addresses AA(1) to AA(N) of this parking register 101 are transmitted from the parking equipment main body 10 to the arithmetic unit 3 via the signal line group 60.
0 from the arithmetic unit 30 to the address bus 71.
Address AA (1) corresponding to each cage through
The parking information input to ~AA(N) indicates the parking status of cages C(1) to B(N), such as 0 if the car is empty and 1 if it is in stock. 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 data indicating the number of parked vehicles counted by the arithmetic unit 30 for each entry information obtained via the signal line group 60 and discounted for each exit information. Implantation cage register 103 is address AD
Data D is stored as data D corresponding 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. Empty cage number register 104 contains data B(1) to B(N)
Cage number of empty cage is counted as AB
(1) to AB(N) are sequentially written. That is, the vacant cage number register 104 stores the vacant cage data A(1) to 1 stored in the vacant cage register 101 described above.
The arithmetic unit 30 selects a cage number with a numerical value of 0 from A(N) and assigns it to addresses AB(1) to
Data B corresponding to that cage number in AB(N)
(1) to B(N). On the other hand, the parking cage number register 105 is the parking cage register 10 described above.
Among the parking data A(1) to A(N) stored in 1, a cage number having a numerical value of 1 is selected by the calculation device 30, and counts AG(1) to AG(N) correspond to that cage number. Data G(1) to G
Store the cage number as (N). Both the data stored in the counts of the empty car number register 104 and the parking car number register 105 are updated by the arithmetic unit 30 each time the parking status of each car changes.

Next, the warehousing suitability value register 106 has at least the number of bytes equal to or more 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. .

First, what is the meaning of the warehousing suitability value S(1) of the cage C(1) and how is it applied to the calculation device 30?
Let us explain how it is calculated. For convenience of explanation, a multilevel parking system having 12 cages will be taken as an example and explained using FIG. 2.

Now suppose cages C(1), C(3), C(4), C
(6), C(7), C(9), C(11) are empty cages, cages C(2), C(5), C(8), C(1
2) is a parking cage, then cage C
The parking suitability value S(1) of (1) is calculated from cage C(1) to parking cage, that is, cages C(2), C(5), and C.
(8), C(12) is defined as the sum of the distances (closer) in cage pitch units. The parking suitability value S(2) of cage C(2) is also the parking cage from cage C(2), that is, cages C(2), C(5), and C.
(8), refers to the sum of the distances (closer) in cage pitch units to C(12), and the warehousing suitability values S(3) to S(12) for cages C(3) to C(12)
is defined similarly. How to obtain the warehousing suitability value will be explained using the warehousing suitability value S(1) of the cage C(1) as an example. First, the cage number 1 of cage C(1) is subtracted from the cage number stored in parking cage number register 105, and the absolute value is taken to calculate the distance from cage C(1) to each parking cage. That is, cage number 2 to cage number 1 of cage C(2), cage number 5 to cage number 1 of cage C(5), cage number 8 to cage number 1 of cage C(8),
The distance from cage C(1) to each parking cage is determined by subtracting cage number 1 from cage number 12 of cage 12 and taking the absolute value. However, this distance is defined as taking the closer one between the one measured counterclockwise and the one measured clockwise, so if a value of 6 or more is calculated, it means that the farther distance is being calculated. Correction is required.

In this case, the closer distance can be easily determined by subtracting the farther distance from the maximum cage bit distance 12. Therefore, the warehousing suitability value S(1) of drive C(1) is S(1)=|2-1+|5-1|+
[12-|8-1|]+[12-|12-1|]=11.

Similarly, cage C(2) to cage C(1)
When calculating the warehousing suitability values S(2) to S(12) of 2), S(2)=|2-2|+|5-2|+|8-2| [12-|12-2|] =11 S(3)=|5-3|+|8-3|+[12-|12-3|]+|2-3I=11 S(4)=|5-4|+|8-4 |+[12 −|12−4|]+|2−4|=11 S(5)=|5−5|+|8−5|+[12 −|12−5|]+|2−5 |=11 S(6)=|8-6|+|12-6|+|2-6| +|5-6|=13 S(7)=|8-7|+|12-7|+ |2-7| +|5-7|=13 S(8)=|8-8|+|12-8|+|2-8| +|5-8|=13 S(9)=|12 -9|+[12-|2-9|] +|5-9|+|8-9|=13 S(10)=|12-10|+[12-|2-10|] +|5 −10 | + | 8-10 | = 13 S(11) = | 12-11 | + [12- | 2-11 |] + | 5-11 | + | 8-11 | = 13 S(12) = |12-12|+[12-|2-12|] +[12-|5-12|]+|8-12|=11.

In this way, this warehousing suitability value is calculated by the arithmetic unit 30 and stored in the warehousing suitability value register 106, and the data is updated each time the parking status of each cage changes.

By the way, this parking suitability value represents the variation in parking cages based on each cage, so the empty cage with the highest parking suitability value is selected as the parking cage from among multiple cages, and the car is parked in that cage. If so, it can be seen that the parking cage has the best variation and the load on the multi-level parking system can be reduced.

Next, the maximum warehousing suitability value register 107 stores the cage C stored in the above-mentioned warehousing suitability value register 106.
(1) to C(N) warehousing suitability values S(1) to S
The arithmetic device 30 selects the warehousing suitability value of (N) empty cages and 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 every time the warehousing suitability value of an empty cage changes, and the data is updated each time. Further, the optimum warehousing cage register 108 calculates data corresponding to the empty cage number having the maximum warehousing suitability value among the warehousing suitability values S(1) to S(N) stored in the warehousing suitability value register 106. Selected by device 30, address AE
(1) as data E(1). If there are multiple cages with the maximum warehousing suitability value, data E is sent to addresses AE(2) to AE(N).
(2) to E(N) are stored sequentially.

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 computing device 30 reads the optimal warehousing cage number from the optimal warehousing cage register 108 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 calculates the parking suitability of each car by calculating the load condition of a multi-story parking system, which changes from time to time, by calculating the sum of the short distances from each car to other parking cages based on each car. It is equipped with a warehousing suitability value register that stores the warehousing suitability value data for each cage as a value, and the empty cage with the maximum value among the warehousing suitability values for each cage stored in this warehousing suitability value register. is selected by the computing device, and if there are multiple empty cages with the maximum parking suitability value, the computing device selects the cage closest to the entrance/exit position as the optimal parking cage.As a result, the parking cages are almost evenly distributed. When the car is parked, the empty cage closest to the entrance is selected as the parking cage, and when the parking cages are clustered in one place or in several places, the maximum load on the multi-level parking system is reduced by entering one car. The available empty cage and the closest empty cage 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 the warehousing suitability value. 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... Empty cage number register, 105 ...Parking cage number register, 106...
Warehousing aptitude value register, 107...Maximum warehousing suitability value register, 108...Optimum warehousing cage register, S
(1) to S(N)... Warehousing suitability value.

Claims (1)

[Claims] 1. A multi-story parking system in which a plurality of cages are driven in a vertical circulation manner, comprising: a landing cage register that stores the cage number of the cages existing in the entrance/exit zone; and a parking state of the car in each cage. The parking register to be stored and the load state of the multi-story parking device that changes moment by moment are calculated as the sum of the nearest distances from each cage to other parking cages based on each cage. A warehousing aptitude value register that is captured as an aptitude value and stored as warehousing aptitude value data for each cage, and an empty cage having the maximum warehousing aptitude value among the warehousing aptitude values of each cage is captured as the optimal warehousing cage. An optimal parking cage selection device for a multilevel parking system, further comprising: an optimal parking cage register that stores data corresponding to the cage number of the empty cage.