JPS6320987B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a storage control method in a parking lot, and particularly to a storage control method suitable for storing bicycles at a parking entrance in a bicycle parking lot at a predetermined location in the hangar using an automatic transport device. Regarding the method.

Bicycle parking lots are either equipped with automatic transportation devices that allow bicycles to be manually transported to a designated location within a hangar or to an empty location, and stored at designated locations at the center. There are various forms such as those that do. Among these, when storing a bicycle using an automatic transport device, the speed of storage may become an issue. For example, parking lots located in front of train stations are flooded with a large number of bicycles during the morning commuting hours, so a large number of bicycles must be stored in a short period of time.

An object of the present invention is to provide a storage control method capable of quickly performing storage processing when there are many vehicles entering the warehouse per unit time when storing vehicles at a storage entrance using an automatic transport device.

In this invention, vehicles include not only bicycles but also automobiles, and the invention is applied to parking lots for bicycles, automobiles, and other vehicles.

Hereinafter, an embodiment in which the present invention is applied to a bicycle parking lot will be described in detail with reference to the drawings.

The parking lot is provided with a bicycle hangar and a bicycle entrance and exit. The storage entrance and the storage exit may also be used as the storage entrance and exit. and,
An appropriate number of entrances and exits will be provided depending on the number of bicycles accommodated in the hangar. The hangar may be a one-story flat type or a multi-layered three-dimensional type, but the hangar is provided with many bicycle storage areas, and each of these storage areas has a unique design in advance. numbered. The parking lot is also equipped with automatic bicycle transport equipment. This transport device transports the bicycle at the storage entrance to a designated storage location when the bicycle is in the garage, and transports the bicycle from the designated storage location to the exit exit when the bicycle is out of the garage.

In this embodiment, the bicycle hangar consists of five floors from the first floor to the fifth floor, as shown in FIG. 1, and for convenience of explanation, it is assumed that one bicycle storage space is provided on each floor. These storage locations are numbered No. 1, No. 2, . . . No. 5 from the first floor to the fifth floor. Entrance and exit for bicycles shall be on the first floor. Therefore, the No. 1 storage location on the first floor is closest to the storage entrance, and the time required to transport the bicycle by the transport device is the shortest. The higher the floor, the further away from the entrance, and the longer the transportation time required by the transportation device.

FIG. 2 shows an example of a warehouse entrance. There is a bicycle stopping position 211 at the entrance, and a bicycle detector (205 in FIG. 4) is installed here. This bicycle detector is composed of a mat switch or a photoelectric switch. Bicycle stop position 21
1, there is a hanger holding device 212, and a number of hangers 214 are held on a holding rod 213 of this holding device 212. These hangers 214 are equipped with unique keys 215, and key 2
15 is connected to the card 216 by a chain or the like. Each hanger 214 is assigned a hanger number ((Nr.1) to (Nr.5)) as described later. The card 216 is provided with a magnetic stripe, and a hanger number to which the key 215 of the card 216 fits is magnetically recorded on the magnetic stripe. In addition, for each hanger 214, a key detector (FIG. 4, 20
6) is provided.

Lower the tip of the holding rod 213 downward, and as shown in FIG.
Hang it on the center of the bicycle handlebar, then press key 21.
When the number 5 is removed, the hook 217 is locked. Furthermore, when the key 215 is removed, the detector 206 outputs a key removal signal. This makes the bicycle ready for transportation. As will be described later, a conveyance device, for example a crane, is started, and the crane grasps the hanger 214 and holds the holding rod 2.
After being removed from 13, the bicycle is transported by crane to a designated storage location. When the most advanced hanger 214 is pulled out, the holding rod 21
The hangers 214 remaining in the third position are moved up one by one, and the hanger 214 in the second position is moved to the most extreme position. The key 215 and card 216 removed from the hanger 214 belong to the customer who deposited the bicycle.

The bicycle exit entrance has a similar structure to the above-mentioned entrance. A bicycle calling machine (204 in FIG. 4) is provided at the exit. This calling machine 204 is equipped with a card reader for reading at least the contents recorded on the card 216. If necessary, this calling machine should be equipped with a function to receive the bicycle deposit fee (such as a coin slot), and if it is possible to use the parking lot with a commuter pass, it should be equipped with a function to read and verify the commuter pass. It is also equipped with various indicators. These entrances and exits are provided with gate devices (not shown) that prohibit or permit bicycles to be carried in and out, people to enter and exit, and the like. A bicycle calling machine may be installed at a location other than the entry/exit entrance, and based on the data read from the card 216, the entry/exit exit to which the customer should go is displayed on the calling machine.

FIG. 4 shows a storage control device for a bicycle.
This control device mainly consists of a central processing unit (referred to as CPU) 200. CPU200 is
A control circuit including operation registers RA and RB, an operation circuit 201, flags F1 and F2 for storing operation results, registers F1, R2, and R3 for data storage, a clock 202, an instruction register, a decoder, an interrupt processing circuit, etc. 203.
The input/output devices of this CPU 200 include a bicycle calling device 204, a bicycle detector 205, and a key detector 2.
06, a crane control circuit 207, etc. are connected. The hanger number read by the calling machine 204 is stored in the register 209. Crane control circuit 20
7 controls a crane (transport device) 208.

CPU 200 also includes a storage device 210. This storage device 210 includes a hanger holding device 2.
Area M1 (addresses m1 to m5) stores the hanger numbers corresponding to the 12 hangers 214, and area M2 (addresses m6 to m5) stores the hanger numbers of the bicycles stored in the storage locations corresponding to each storage location. m15), area M3 (address m16, m17) that stores the time period when a large number of bicycles arrive (this is called the rush time period), and area M4 that stores the number of storage locations for bicycles.
(address m18) is provided. In this embodiment, there are five bicycle storage locations, so the holding device 212 is equipped with five hangers 214, and the storage area M1 has addresses m1 to m5 in order from the tip of the holding rod 213. Hanger numbers (Nr.1) to (Nr.5) are memorized. In storage area M2, addresses m6, m8...
. . m14 stores storage location numbers No. 1...No. 5, and addresses m7, m9 . . . m15 store hanger numbers of bicycles stored in each of the above storage locations. Elijah M3's address m16 contains the rush start time t1 (for example, 6:50 a.m.).
minute), but address m17 contains the rush end time t.
2 (for example, 7:40 a.m.) are stored respectively. In this embodiment, 5 is stored at address m18. The address of each memory location in this memory device 210 is specified by address register AD.

The bicycle storing process by the CPU 200 is executed by the following procedure. First, regarding the warehousing process, referring to FIG. 5, it is checked whether the bicycle calling device 204 outputs the calling signal B (step 1). As will be described later, the call signal B is output when the bicycle is taken out from the storage location, so if the signal B is output, the process moves to the exit process shown in FIG. 6. Next, whether or not a bicycle detection signal is output from the bicycle detector 205 ((Step 2),
It is sequentially checked whether the key detector 206 detects removal of the key 215 (step 3). When the customer brings the bicycle into the storage entrance and brings it to the stopping position 211, a bicycle detection signal is output (YES in step 2). Then, when the hook 217 of the hanger 214 is hung on the bicycle and the key 215 is removed, the key detection signal stops (NO in step 3), and the crane 208 becomes ready for warehousing work.

First, the program puts the address m16 of the storage device 210 into the address register AD (step 4), specifies this storage location using the address register AD, reads out its content t1, and transfers it to the register RA (step 5). . t1 is the rush start time. Then, the current time t is read from the clock 202 and placed in the register RB (step 6), the contents of the register RB are subtracted from the contents of the register RA, and the result is stored in the flag F1. Flag F1 is set to 1 when RA-RB>0, and set to 0 in other cases. If the current time t is before the rush start time t1, the flag F1 is 1;
Move to 51. If the rush start time t1 has passed, there is a possibility that it is within the rush time period, so the process advances to step 9 to check the rush end time t2.

In step 9, the contents of address register AD are incremented by 1 to designate address m17. Then, the content t2 of this memory location is read out and registered.
Put it in RA (step 10). t2 is the rush end time. Register from the contents of register RA
The contents of RB are subtracted and the result is placed in flag F1 (step 11). If flag F1 is 1,
Since it is before the rush end time t2, when considered together with the result of step 8, the current time t is within the rush time zone. In this case, proceed to step 13. If the flag F1 is not 1, the process moves to step 51.

In this invention, a rush time period and other time periods are distinguished. During rush hours, a large number of bicycles rush in, so it is necessary to store the bicycles quickly. Therefore, during the rush hours, the storage location closer to the entrance (in this example,
I try to store my bicycle starting from the No. 1 storage location. The closer the storage location is to the entrance, the shorter the transportation time by the transportation device. In addition, in this embodiment, during times other than the rush hours, storage locations that are farther away from the entrance (in this embodiment,
Store your bicycle from storage location No. 5). During times other than the rush hours, the transportation time with the transport device may be a little long, but there is not much of a problem.If you store your bicycle in a storage location that is further away from the storage entrance, you can store your bicycle in a storage location that is closer to the storage entrance. This will allow for more efficient storage of bicycles during rush hours.

If it is rush time (in step 12)
YES), first add + to the contents of address register AD.
1 (step 13), the storage location of the address m18 is specified, and its contents, the number of storage locations 5, are transferred to the register R1 (step 14). Next, the address m of the location where the hanger number of the bicycle stored in the storage location (No. 1) is stored by the program.
7 into address register AD (step
15) Read the contents of address m7 and store it in the register.
Put it in RA (step 16). 0 is placed in register RB (step 17), the contents of register RB are subtracted from the contents of register RA, and the result is stored in flag F1 (step 18). Flag F1 is 1
If so (YES in step 19), the hanger number is already stored in the memory location at address m7, and the bicycle is stored in the storage location (No. 1), so the next storage location (No. 1) is stored. Proceed to step 20 to test No. 2).

In order to check whether all storage locations have been searched, the number of storage locations saved in register R1 is stored in register RA (step 20).
Put 1 in register RB (step 21), subtract the contents of register RB from the contents of register RA,
The result is placed in register R1, its contents are updated, and it is stored in flag F2 (step
twenty two). Flag F2 is set to 1 when RA-RB=0. If flag F2 is 0 (step
Since there is still a location to be searched (NO at 23), the process advances to step 24, where the contents of address register AD are incremented by 2 to specify the next memory location. The contents of address register AD is address m
In the case of 7, the contents of address register AD become address m9 by the processing of step 24,
The storage location (No. 2) where the hanger number is stored is specified. Thereafter, the process returns to step 16 and the same process is repeated for the address updated in step 24 (for example, address m9). If the content of flag F2 is 1 in step 23, this means that the search for all locations in storage area M2 has been completed and hanger numbers have been stored in all locations, so that bicycles are already stored in all storage locations. has been stored, and the process proceeds to step 50, where an appropriate indicator, such as the bicycle caller 204, is displayed.
The process ends with a message indicating that the vehicle is full on the display.

If the content of flag F1 is 0 in step 19, that is, if a storage location where no bicycle is stored is found, the content of address register AD (in this case, address m7 is changed to address register AD in step 15). Since it is stored in register AD, m7)
is placed in register R2 (step 25) and also placed in register RA (step 26). Then, put 1 in register RB (step 27) and register
The contents of register RB are subtracted from the contents of RA and the result is placed in address register AD (step 28). As a result of this operation, the contents of address register AD become m6, so this address m
The storage location number (No. 1) stored in 6 is sent to the crane control circuit 207 to designate the location where the bicycle is to be stored (step 29). When the crane control circuit 207 receives this signal, it controls the crane 208 to transport the bicycle at the entrance to the designated storage location (No. 1).

Since the bicycle was stored in the storage location of the bicycle (No. 1) hung on the hanger 214 with the hanger number (Nr. 1), this hanger number (Nr. 1) is stored in the memory corresponding to the storage location (No. 1). It is necessary to store it in the location address m7. Before that, first calculate the shift number of the hanger number, which will be described later. m by program
18 into the address register AD to specify the storage location of the number of storage locations (step 30), put the contents (number of storage locations 5) into the register RA (step 31), and convert the contents of the register RB from the contents of the register RA. (1 is stored in step 27) and the result (4 in this case) is stored in register R3 (step 32).

The program puts address m1 into address register AD to specify the storage location of that address (step 33), and transfers the contents of this storage location (in this case (Nr.1)) to register R1 (step 34). ). In register R2, in step 25,
Since the address m7 of the memory location for storing the hanger number of the storage location where the bicycle is stored is stored, the contents of this register R2 (address m7) are put into the address register AD and address m7 is designated (step 35). , stores the contents of register R1 (Nr.1) in this storage location (step 36).
Through this process, the hanger number (Nr.1) is stored in the storage location of address m7.

As mentioned above, when the most extreme hanger 214 of the hanger retaining device 212 is removed for transporting the bicycle, the other hangers 214 are raised one by one. The hanger numbers in storage area M1 correspond to the order of the hangers in hanger holding device 212. Therefore, when a bicycle is stored, hanger 21
4, the contents of each storage location in the storage area M1 must also be sequentially shifted.
For this shift process, the program first puts address m1 into address register AD (step 37), and then puts this content, that is, address m1, into register R2 (step 37).
38), the contents of address register AD are incremented by 1 and the contents are set as address m2 (step 39).
Then, the contents (hanger number (Nr.2)) of the storage location (address m2) specified by address register AD are read out and stored in register R1 (step 40). Next, in step 38, register R
Address m1, which was temporarily stored in register R1, is placed in address register AD, and address m1 is designated (step 41), and the hanger number (Nr.2) stored in register R1 is stored in this designated storage location. (Step 42). Register R3 contains step 3.
Since the shift number calculated in step 2 is stored, put the contents of register R3 into register RA (step 43), set 0 to register RB (step 44), and subtract the contents of register RB from the contents of register RA. Then, the result is stored again in register R3 (step 45), and the subtraction result is stored in flag F2. If flag F2 is not 1 (NO in step 46), the shift process has not yet finished, so the contents of the address register (which contains address m1 in step 41) are incremented by 1 (step 47). , the process returns to step 38 and the same process is repeated. When the flag F2 becomes 1 (YES at step 46), that is, when the number of shifts becomes 0, all processing ends. Through the above processing, hanger numbers (Nr.2) to (Nr.5) are stored in addresses m1 to m4 of area M1, respectively.

If it is outside the rush time period (in step 8)
YES (or NO in step 12), the contents of address register AD is address m17, so add 1 to this (step 51) to set address m1.
8 storage location and transfer its contents, the number of storage locations 5, to register R1 (step
52). Next, address m15 of the storage location where the hanger number of the storage location (No. 5) is stored by the program.
into address register AD (step 53),
The contents of address m15 are read and placed in register RA (step 54). 0 into register RB (step 55), and register from the contents of register RA.
The contents of RB are subtracted and the result is stored in flag F1 (step 56). If flag F1 is 1 (YES in step 57), the hanger number has already been stored in the memory location at address m15, and a bicycle is stored in the storage location (No. 5), so the next Proceed to step 58 to check the storage location (No. 4).

In order to check whether all storage locations have been searched, the number of storage locations stored in register R1 is stored in register RA (step 58).
1 is placed in register RB (step 59), the contents of register RB are subtracted from the contents of register RA, the result is placed in register R1, the contents are updated, and the contents are stored in flag F2 (step 60). If flag F2 is 0 (step 61
(NO), since there are still locations to be searched, the process advances to step 62 and the contents of the address register AD are decremented by 2 to specify the next storage location. After this, the process returns to step 54 and the same process is repeated.
If the content of flag F2 is 1 in step 61,
Since the vehicle is full, we move to step 50, display a message to that effect, and complete the process.

If the content of flag F1 is 0 in step 57, it means that a place to store the bicycle has been found, and the process proceeds to step 25 to start the crane and perform the above-mentioned processes.

When leaving a bicycle, the customer inserts the card 21 into the card slot of the bicycle calling machine 204 located at the bicycle exit.
6, or scan the card 216 into the card reader if manually scanned. As a result, the hanger number recorded on the card 216 is read into the register 209. This example is a case where the exit door is also used as the entry entrance. When the bicycle calling device 204 correctly reads the data on the card 216, it outputs a calling signal B, so the process moves from step 1 in FIG. 5 to step 101 shown in FIG. 6. At this time, it is checked whether the bicycle detector 205 is outputting a bicycle detection signal (step 101). If there is a bicycle at the entrance/exit, it will not be possible to use a crane to transport the bicycle from the storage area, and it will be dangerous, so if there is a bicycle, a sign will be posted asking you to leave (step 102). Then, the unloading process is started only after confirming that there are no bicycles at the entrance. First, close the entrance/exit gate (step 103), and read the hanger number stored in register 209 into register R1 (step 103).
104).

Next, the process moves on to search processing for the hanger number read into the register R1. The program puts the address m18 into the address register AD and specifies the address (step 105), and reads out the storage location number 5 and stores it in the register R3 (step 106). Then, each storage location of the hanger number (address m7, m
9...m15), first put the address m7 into the address register AD and designate that address (step 107).
The contents of the memory location are placed in register RA (step 108), and the hanger number stored in register R1 is placed in register RB. The difference between both registers RA and RB is taken and the result is stored in flag F2 (step 110), and it is checked whether the contents of both registers RA and RB match (step 111). Flag F2 is 1
If so, it means that the read hanger number has been stored in the memory location at address m7, so the process moves to step 117 for unloading work using a crane.

If flag F2 is not 1, in order to check whether the search for all storage locations has been completed, the number of storage locations stored in register R3 is placed in register RA (step 112), and 1 is placed in register RB. (step 113), subtracts the contents of register RB from the contents of register RA, puts the result in register R3, updates the contents of register R3 (step 114), and stores the above deceleration result in flag F2. . If the flag F2 is 0, it means that the search has not yet been completed for all storage locations, so the process advances to step 116. Then, the contents of the address register AD are incremented by 2 to designate the next storage location (in this case, the storage location at address m9), and the process returns to step 108 to repeat the same process.

If flag F2 is 1 in step 115, this means that no matching hanger number was found even after searching all memory locations;
The process moves to 143, displays the message ``No matching vehicle'', and ends the process.

If the flag F2 is 1 in step 111, that is, if the hanger number read from the register 209 of the calling machine 204 and the hanger number read from the storage area M2 match, the process proceeds to step 117, where the address register is first read. Write 0 to the memory location specified by AD to erase the hanger number stored there. The contents of the address register AD are determined in step 107 or 116, and the matched hanger number is stored at the address specified thereby.

Next, the crane 208 is activated to transport the stored bicycles to the exit. Put the contents of address register AD into register RA (step
118) and put 1 into register RB (step
119), subtract the contents of register RB from the contents of register RA and put the result in address register AD to find the memory location where the storage location number corresponding to the location where the matching hanger number was stored is stored. Specify (step 120). Then, it sends a bicycle unloading command C to the crane control circuit 207 (step 121), reads the storage location number from the storage location specified by the contents of the address register AD, and sends it to the crane control circuit 207 (step 121). 122). By this crane 20
8 carries the bicycle out of the designated storage area and brings it to the exit.

When the bicycle is transported to the exit, the hanger 214 on which the bicycle was hung is returned to the most advanced position of the holding rod 213, and the position of each hanger is moved down one by one. It is necessary to sequentially shift the contents of the storage area M1. To do this, the program first puts address m18 into address register AD (step 123), and then reads the number of storage locations, which is the content of that address, into read register RA (step 123).
124). Then, from the contents of register RA, register
The content of RB, 1 (see step 119), is subtracted and the result is stored in register R3 (step 125). Next, the program puts address m4 into address register AD (step 126), and temporarily stores the contents of address m4 in register R2 (step 127). address register
The contents of AD are incremented by 1 to designate address m5 (step 128), and the contents of address m4 stored in register R2 are transferred to the storage location of address m5 (step 129).

In order to check whether this shift process has been completed for all storage locations in storage area M1, the contents of register R3 (see step 125) are placed in register RA (step 130), and
Put 1 in RB (step 131) and register RA
The contents of register RB are subtracted from the contents of , and the result is placed in register R3 to update the contents of register R3 (step 132), and the result of the above subtraction is stored in flag F2. The contents of the flag F2 are checked (step 133), and if the flag F2 is 0, it means that the shift process has not finished yet, so the process proceeds to step 134, subtracts 2 from the contents of the address register AD, and returns to step 127.

If the flag F2 is 1, the shift processing has ended, so the address m1 is entered into the address register AD (step 137), and the hanger number stored in the register R1 is stored in the memory location of this address m1. (Step 138).

When the crane 208 carries the bicycle to the exit, a detection signal is output from the bicycle detector 205, and the presence or absence of the bicycle is determined based on the output state of the bicycle detection signal (step 139). If you have a bicycle, open the gate of the gate device described above (step 14).
0). Then a customer comes in and crane 208
The key 215 is inserted into the hanger 214 on which the bicycle brought to the exit is hung. When the key detector 206 detects that the key is inserted (step 141), the presence or absence of a bicycle is checked again based on the detection signal from the bicycle detector 205 (step 142). Since the absence of the bicycle means that the bicycle has already been taken away by the customer, all processing is terminated.

In the above embodiment, only one entrance and exit are provided for convenience, but it goes without saying that the present invention can be similarly applied even if there are multiple entrances and exits.

As described above in detail, the storage control method of the present invention includes a vehicle storage entrance, a vehicle hangar with a large number of vehicle storage locations each having a unique number, and a storage control method that corresponds to the number of each of these vehicle storage locations. In a parking lot that includes at least a storage device that stores the presence or absence of a stored vehicle at that location, and a transportation device that transports a vehicle at an entrance to a predetermined storage location, each vehicle storage location is In addition to arranging the vehicles in order of the shortest time required to transport them from the storage entrance to the storage location, a rush time period with the most incoming vehicles per unit time is set in advance, and each vehicle is stored at the storage location. It is determined whether or not it is a rush time zone, and during the rush time, the vehicle storage location in the storage device is searched in the above order, and in a time zone other than the rush time, the vehicle storage location in the storage device is searched. The storage locations are searched in order of the length of time required for the transportation device to transport the vehicle from the storage entrance to the vehicle storage location.

During rush hours when a large number of vehicles, especially bicycles, rush in at once, bicycles are stored in the order of location starting from the location that is closest to the entrance and takes less time to transport, reducing the amount of time it takes to store one vehicle. This shortens the storage process and allows for quick storage. During times other than the rush time, bicycles and the like are stored in the order of the length of time required for the transportation device to transport the vehicles from the entrance to the vehicle storage location. In times other than the rush hours, the transportation time by the transportation device may be somewhat long, but there is no problem. If you store your bicycle in a storage location that takes longer to transport during times other than the rush hours, there will be space in storage locations where the transport time is shorter. More bicycles, etc. can be stored in a shorter storage space.

[Brief explanation of the drawing]

Figure 1 is a configuration diagram showing the storage location, Figure 2 is the storage location,
FIG. 3 is a perspective view showing the hanger in detail, FIG. 4 is a block diagram showing the storage control device, FIG. 5 is a flow chart showing the procedure for the storage process, and FIG. 6 is the storage exit This is a flow chart showing the processing procedure. 200...CPU, 208...Crane, 21
0...Storage device.

Claims (1)

[Claims] 1. A vehicle storage entrance, a vehicle hangar with a large number of vehicle storage locations, each with a unique number, and a storage device that stores at least the presence or absence of a stored vehicle at that location in correspondence with the number of these vehicle storage locations; In a parking lot that includes a transportation device that transports vehicles at the storage entrance to a predetermined storage location, each vehicle storage location is defined as the time required for the transportation device to transport the vehicle from the storage entrance to the storage location. In addition to arranging the vehicles in order from shortest to shortest, a rush time period in which many vehicles enter the warehouse per unit time is set in advance, and each time a vehicle is stored at a vehicle storage location, it is determined whether or not it falls within the rush time period.
During the rush time, vehicle storage locations in the storage device are searched in the above order, and during times other than the rush time, vehicle storage locations in the storage device are retrieved by the transport device. A storage control method in a parking lot, characterized in that the search is performed in order of the length of time required to transport vehicles from the storage entrance to the storage location.