JPS59183483A - Coin processor - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] The word ``in'' refers not only to real hard coins, but also to private coins,
Refers to slugs and other items having a shape and/or dimensions similar to real coins.

The invention is particularly applicable to coin handling devices comprising coin storage means, in particular means for storing and disbursing one or more specified denominations (denominations) of coins.

Means of this type are usually provided for the purpose of receiving coins from a validator and dispensing them as change, for example in vending machines, gaming machines and machines intended solely for exchange.

A conventional coin processing device incorporating several coin storage containers determines whether received coins should be sent to a common iron box or to a sorting device that sends different denominations of coins to each container. It has a single gate. However, in some cases it may be desirable to provide each coin receptacle with a separate gate that first sorts the coins and controls whether a particular unit of coins is delivered to the receptacle or to a secondary route leading to the iron box. Such an arrangement is particularly advantageous when a unit or entire unit of coins has individual iron boxes that store coins in excess of the storage capacity of each coin receptacle.

There is another reason for categorizing coins after classification. For example, if there are a large number of coins and it takes time to sort them, and the coins have already passed through the gate, the control circuit will detect that there is space in the container and try to introduce the coins. However, if there is another coin in the classifier at the time of detection, the container will receive two coins and there is a risk of overfilling.

Therefore, it is desirable to provide a separate gate for each container. However, doing so requires considerable expense (mostly the Kate actuator).

According to a first embodiment of the present invention, by providing a gate that sends coins to each first path or sub-path and has a common actuator, the coins A coin handling device is provided that includes a plurality of supply channels, such that coins can enter from the supply channel into the first channel or the secondary channel.

The above embodiments are particularly useful in coin storage assemblies where the first passageway leads to each receptacle, but may also be applied to other applications.

According to the embodiment described above, the expense associated with installing each gate actuator can be avoided. Under normal conditions, the coin is 1
Since one coin is processed at a time and the gate can be controlled as desired for each coin, there is no problem. but,
When processing two coins in succession, each requiring a different gate position by a common actuator, at high speed, there is not enough time for the actuator to transfer the gate to the desired position of the second coin.

This is handled in the preferred embodiment by controlling the machine to give priority to coins to be routed to the second path. As a result, since the coins are sometimes conveyed to each side route, the speed at which the container becomes full is slower than in other cases, but there is virtually no problem.

In a preferred embodiment, if a coin to be delivered to a receptacle is immediately followed by a coin to be delivered to a secondary channel, the gate will move the coin to secondary channel 1 in sufficient time to accurately deliver the subsequent coin. (Transferred towards the delivery location.

While the leading coin reaches the gate, the gate can be shifted completely toward a position for delivering the coin to a side route, or it can be shifted to an intermediate position. Therefore, the destination of the preceding coin may be uncertain, but there is no problem because the coin should originally be delivered to the container, and there is no problem in delivering it to the secondary route as described above.

If the coin to be delivered to the secondary channel is immediately followed by the coin to be delivered to the receptacle, the gate is controlled in such a way as to ensure that the preceding coin is delivered to the secondary channel.The gate is then preferably Because it is held in that position, subsequent coins will enter the secondary channel unless the spacing between the coins is sufficient to allow adequate time to transfer the gate to the opposite position before the subsequent coin arrives. Similarly, subsequent coins can be delivered to either the container or the secondary route without any problem.

In this type of configuration, since the gate is in an intermediate position when the coin reaches the coin, the coin may become stuck or stop near one gate without entering the container or the secondary channel. Note that in the particular configuration described above, this only occurs when the gate moves from the first position to the second position.

This potential problem is therefore alleviated by using further advantageous features of the present invention.

That is, at least one gate, preferably all gates, are arranged so that jamming will not occur due to movement of the gates from the first position to the second position.

For this reason, each gate preferably includes a coin path IC that biases the coin and leads it to the first path, and when it should be delivered to the secondary path, deviates from the path and directs the coin to the secondary path 1 without biasing the coin. It has a coin-biased surface arranged in a similar manner.

Similarly, or alternatively, the gate is preferably pivoted for movement between a first and a second position and is arranged such that the pivot axis is upstream of the coin deflection surface.

The common actuator is preferably such that when de-energized, all gates
It is constructed and arranged so that it is in a position where coins can be delivered to the secondary route.

All containers have gates operated by a common actuator, or a series of containers have gates operated by a common actuator and one or more other containers have gates operated by a common actuator.
It is possible to have gates actuated by one or more other actuators.

By arranging the gates as described above, the advantages of using a common actuator for several gates can be achieved without reducing the speed of coins passing through the coin handling device. In an alternative embodiment, the apparatus can be configured to limit the rate of coin redemption to such an extent that the common actuator can actuate for each coin in the correct manner without interfering with the path of subsequent coins. However, in many cases, it is essential to increase the coin processing speed as much as possible, so the above configuration is provided.

The second embodiment of the present invention relates to increasing the coin processing speed. According to this embodiment, the coin processing device has a sorting means for guiding different types of coins to respective destinations,
After the classification means receives the preceding coin, the subsequent coin cannot be sent until a predetermined time period determined by the type of the preceding coin and/or the type of the subsequent coin has elapsed.

In such a configuration, the maximum coin processing speed varies depending on the type of coin to be processed. Therefore, the processing speed can be optimized depending on the physical structure of the classification means.

For example, the device can be configured so that a series of coins of the same denomination passing through the sorting means in the same manner can be sent to the sorting means faster than a series of coins of different denomination passing through the different manner, for example, which requires a long time to operate the gate. Can be configured.

If a subsequent coin is received within a predetermined time period for sending out the preceding coin to the sorting means, the maximum sending speed can be controlled by refusing to send out the coin. Also, instead of this,
It is also possible to delay sending subsequent coins until a predetermined period of time has elapsed before sending them to the sorting means.

To do this successfully, each time a coin is sent out, a prohibition signal is generated having a time period that determines the maximum coin processing speed, such that coins received during that time cannot pass through the sorting means.

After the above-mentioned time has elapsed, a second predetermined period is provided during which only one or more types of coins selected according to the types of coins sent out earlier are delivered. In order to determine the quality of coin sending within this period, each coin allocation code ("block seed") is provided. This is determined according to the path taken by the coins through the sorting means, and the code indicates which coins can be dispensed within the second period.

After the second period, any coin can be sent.

This embodiment is particularly useful for coin handling devices incorporating means for storing different denominations of coins.

According to a third embodiment of the invention, the coin handling device comprises control means for enabling the biasing means to selectively guide the coin to the first destination or to the alternative destination, depending on the presence or absence of a predetermined condition. , in which case the control means is configured such that the series of coins
The coin operates to reach the biasing means at intervals equal to or longer than the predetermined period, and another coin does not move toward the biasing means for a second longer predetermined period in response to the presence or absence of the predetermined condition. This gives the biasing means leeway to choose conditions for orienting subsequent coins to their destinations as appropriate.

The first destination is preferably a coin storage means and the predetermined condition can be a signal indicating that a predetermined amount of coins in the storage means has been exceeded, ie the storage means is full or nearly full. This is done by the level sensor. Preferably, the introduction of further coins into the biasing means is prevented in response to a level sensor indicating that the storage means is no longer full or nearly full.

By delaying or preferably denying the issuance of the coin, it may be ensured that the coin cannot reach the biasing means within the second predetermined period. In the preferred embodiment, the L coins are rejected to allow time for the biasing means to appropriately dispatch subsequent coins to their destinations.

The biasing means is preferably a gate arranged as described above to prevent jamming during movement. Therefore, coins can be delivered to the deflecting means at extremely high speeds and the flow of coins can be switched between the two output beams without jamming. Jams are avoided because when the flow is switched the control means have enough margin to switch before another coin reaches the biasing means, and even if the flow were switched in another way, the structure of the cage prevents jams. does not occur.

This is particularly beneficial when replenishing the storage means by repeatedly and rapidly inserting coins of the same denomination. In such a situation, if a coin passes close to the level sensor, there is a risk that the sensor will erroneously issue a detection signal indicating that the storage means is full or nearly full.

As a result, subsequent coins are directed to alternative destinations. understanding that when a coin in the storage means passes the detection means, the control means should direct another coin to the storage means;
This creates a need to quickly guide coins to alternative destinations and storage means, which is met by the L configuration.

Instead of configuring the gate as described above, the control means may be configured and arranged so as not to send coins to the biasing means for a predetermined period regardless of the presence or absence of a detection signal, but this is preferable since it slightly reduces the coin processing speed. do not have.

According to a fourth embodiment of the invention, the coin handling device is operative to accept the coil and direct it to one or more destinations unless any of a number of predetermined conditions exist, in which case the coin handling device 6. Further including means operative to generate a data signal indicative of the existence of any predetermined condition each time the coin is not delivered to the appropriate destination due to the existence of any predetermined condition.

A data signal may be generated in providing an output to a device for processing and/or storing the signal. A coin processing device provides a means for storing signals of this type, preferably a plurality of signals.

Although the signal indicates why the coin was not delivered to the correct destination, this embodiment may be particularly useful in devices that reject more coins in a row than usual.

For example, if a prohibition signal is generated due to insufficient power being supplied to the gate operating solenoid, a sensor detects that the coin is stuck, or the host machine generates a prohibition signal for some reason, the coin will be removed. The device can be configured to deny this. For example, if a signal indicating rejection is repeatedly issued due to condition No. 1, the entire range of failure occurrence is notified immediately, making diagnosis easier.

Although the embodiments described above can be used separately as desired, preferred embodiment 1 (combined) forms a particularly advantageous coin handling device.

The present invention will now be described in detail with reference to the accompanying drawings.

As shown in FIGS. 1 and 2, coin processing device 100 includes a verifier 102, a classifier 104, and a coin storage assembly 106. As shown in FIGS.

The verifier receives the coins via hopper 108 and tests their validity using a coil at testing station 110 . In this example, the device can handle five different types of coins, namely A, B, C,
D and F are assumed to be processed, of which type B is a coin-like substitute.

When the inserted coin is found to be an acceptable coin, the acceptance gate 112 opens and the coin enters the main entry path 114 of the classifier 104. The coins are routed to the classifier 104 as described in detail below and then delivered to the appropriate one of the seven entrances to the coin storage assembly 106. Conversely, when the verifier 102 confirms the unsuitability of the inserted coin, the receiving cage 112 is opened and the rejected coin is delivered via the passageway 116 to yet another entrance 1c of the coin storage assembly 106. The routes followed by each of the coins A to E and the rejected coin F are shown in FIGS. 1 and 2.

3 and 4 are detailed views of the coin storage assembly 106.

Coins to be stored in 7t tank 1J106 are classified by classifier 1.
04 via each supply path 4.

The assembly 106 of this embodiment is composed of a plurality of (four in this case) storage units 6. Each unit 6 has a storage space for receiving a pile of fc ml in from the supply channel 4, an auxiliary channel 12 for receiving cones from the supply channel 4, and an additional channel 14.

The coins piled up in the storage space 81 are paid out one by one by a payment mechanism generally indicated by the reference numeral 16.

Coins from the supply path 4 are normally delivered to the storage space 8, but if it is full, they are delivered to the sub-path 12 leading to the iron box. In the preferred embodiment, a secondary channel 12 leads to each iron box. The gate 18 determines the destination (storage space 8 or secondary channel 12) of the coins received from the supply channel 4.

Additional path 14 receives coins from path 20 of each classifier. These coins are not of the desired unit, but of the additional path 1
4 to each iron box or common iron box. The access path 14 of a certain unit 6 is for this purpose, i.e.
It is used to send the coin F rejected in 02 to the exit hole and have the user retrieve it.

Sorting channel 20 thus corresponds to channel 116 in FIG.

Each unit 6 is divided into two in the longitudinal direction.

FIG. 4 shows the left half. Each half is formed by injection molding.

The storage space 8 is cylindrical and has a diameter slightly longer than the coins to be stacked.

The coins reach the storage space 8 from the supply path 4 through the inlet 22. The entrance 22 is defined by a narrow space 24 between the wall 26 of the classifier 104 and a shelf 28 at the top of the storage unit inner wall 30. The space 24 has such a shape and dimensions that a coin can pass through only when traveling toward the edge.

When the stack 10 of coins reaches a certain level (depending on the diameter of the coins) (see Figure 4), the next coin 50il"i to be delivered through the entrance 22, the upper edge of which is
It comes into contact with the top of the mountain while being supported by the mountain.

Coin 50 is almost vertical, but its center of gravity is mountain 10.
It is supported in an inclined state throughout. The flat upper edge 54 of the storage unit outer wall 56 slopes inwardly so that the coin 50
It plays the role of guiding the molecule to the orientation state shown in 2. The induction sensor 52 is installed near the coin 50 side in the classifier and detects the presence or absence of the coin 50, which indicates that the storage space 8 is full. It is reliable because the position is predetermined by the shape of the inlet 22 in cooperation with the peak 10.

When a coin is dispensed from the pile 10 and the top of the pile descends a distance corresponding to the thickness of the coin, the upper edge of the coin 50 is no longer supported by the trough 28 and falls face down toward the top of the pile. .

Therefore, the senna 52 indicates that the space 81 is empty.

As shown in Figure 3, four storage units 60 gates 18
are mechanically connected and are essentially integrally formed. The gates have a common actuator (solenoid 60).

The gates pivot about a common axis 62' near the top edge. When the solenoid 60 is deenergized, the gate 18 is in the position shown in phantom in FIG.
The coin falls on the road 12.

When the solenoid 60 is energized, the gate moves to the position shown by the solid line in FIG. 4, so that the coin is biased toward the entrance of the storage space 80.

This device operates in such a way that the coins that should originally have entered the storage space 8 reach the gate 18 while the cage leaves the position shown by the solid line in FIG.

Depending on the exact time when the coin reaches the gate, it can be deflected from the entrance of the storage space 8 or entered into the secondary channel 12. Alternatively, it can be brought into contact with the top of the shelf 28 on the wall 30, but in this case, when the solenoid 6o is next energized, the gate 18 will knock the coin and direct it toward the storage space 8 (the original destination of the coin). Ru. This prevents jamming or overcrowding in the storage space 8.

As shown in FIGS. 1 and 2, the coins A to E and the rejected coin F follow various paths.

As described above, the coins A through EH pass through the acceptance gate 112 and reach the main entry path 114 of the classifier 104. At that time, the timing was determined by the coin output. ``post gate st'ro page post gate st'ro
bu ) J passes through a detector 120 .

Classifier 104 has a path gate 122 that remains closed if the incoming coin is type A or B. These coins therefore roll onto the lower ramp 124 of the classifier 104. Since the ramp 124 has a slot through which only coin B passes, coins A and B are classified.
It is sent to each storage unit 6.

Each coin A and B enters the storage space 8 or the side channel 12 depending on the position of each gate 18.

Gate 122 if the incoming coin is type C, D or E.
opens so that the coin falls onto the lower ramp 126. The windows on the side of the ramp and the slots on the bottom hold coins C, D and E.
to classify. Coins D and E that are not needed for payment are led to an additional path 14 in each unit 6 and delivered to one or more iron boxes. The coin C is guided to the gate 18 above the storage unit 6 and sent to the storage space 8 or the side path 12.

The rejected coin F is added to the additional path 1 of the unnecessary coin storage unit 6.
Sent on 4th.

FIG. 5 is a schematic circuit diagram of the coin processing device. The circuit includes a control device 200 and a coin confirmation circuit 202. The control device 200 includes a microprocessor 204, such as a mask-programmed Intel 8048, which is connected to an interface device 212 via an input/output bus 206. The interface 212 receives from the confirmation circuit 202 via line 214 an authorization signal Acc indicating that a valid coin has been received and a signal indicating whether the coin is A to E, and confirms via line 216. circuit 202
In addition, if the permission signal Acc is being transmitted, a mask prohibition signal M1 is sent to terminate the transmission, so that the permission signal Ace cannot be transmitted.

Interface 212 receives signals from postgate strobe detector 120 and payment sensor 218.

Each payment sensor is connected to the payment mechanism 16 of the coin storage unit 6.
It is attached below the coin to detect when the coin is paid.

Interface 212 is connected via line 220 to 22
A strobe signal is sent to energize each sensor 52, collectively indicated at 2, and an output signal is received via line 224 indicating the state of each energized sensor.

Interface 212 also sends a signal via line 226 to solenoid 60 of gate 18, which is used to actuate path gate 122. These solenoids are designated collectively at 228.

In this particular embodiment, interface 212 also serves to energize solenoid 230 of gate 112 in response to enable signal Acc.

The coin processing device is installed in a host machine (in this case, a game machine) to which a circuit is connected via an output line 232 and an input line 234. Output line 232 sends various information to the host machine, including information indicating the type of coins accepted by the device, which can be used to accumulate the user's credit count. Furthermore, "diagnosis" information is also included, which will be described later.

The input line 234 sends a signal that prohibits the acceptance of any one of the five types of coins A to E.

Such host machine prohibition is desirable in certain situations. For example, if there is a shortage of low-value coins for lifting irons, 1 can be configured to prohibit the acceptance of high-value coins.

The operation of the circuit will be explained. The techniques discussed here are examples of various techniques that can be readily implemented by those familiar with microprocessor control circuits. Also, instead of a general-purpose microprocessor programmed for this specific application, a hard-wired logic circuit or a specially designed LSI can be used.

6 and 7 are the main program loop and timing chart of microprocessor 204, respectively.

FIG. 7 shows the overall operation of the circuit when valid coins are accepted. However, this chart applies when a single coin passes through the processing device and when the coin requires actuation of path gate 122 and bias gate 18.

The verification circuit 202 is similar to that described in DE 2093620 and emits a power-up signal P[J in response to the arrival of a coin. The power amplifier signal ends when the coin leaves the inspection station 110. At this time, the verifier determines that the coin is valid as a result of the inspection and issues an acceptance signal Ace.

The acceptance signal energizes the solenoid 230- and operates the acceptance gate 112, causing the coin to fall past the detector 120, resulting in the output of the strobe signal STB.

As shown in FIG. 6, in this embodiment, the microprocessor 2
04 is activated after entry, executes the initialization routine 250, and cycles through the main program loop 252 repeatedly.

During loop 252, the program executes step 254.2.
58 and 262, "state 1", "state 2" and "state 3"
'' flags are checked sequentially, and if one is set, program routine 256, 260 or 264 is executed. Routine 266 is then executed before program loop 252 is re-entered.

If no coins have been inserted, no flags are set and therefore neither routine 256, 260 or 264 is executed.

As explained below, when delivering an accepted coin to the classifier, the interrupt routine starts an "accept" timer, sets various registers depending on the coin's desired path, and sets the state 17 lug. Responsive to signal Acc. Setting the flag causes routine 256 to be executed each time main loop 252 is executed.

During this program section 256 the microprocessor receives the strobe signal STB sent from the detector 120.
is checked, and if it is found that the coin is adjacent to the detector 120, the state 1 flag is reset and the state 2 flag is set. Therefore, during execution of the next main program loop, program section 256 is not entered.

Assuming a failure occurs when program section 256 determines the "accept" timer times out before signal sTn indicates the presence of a coin.1. The rejection routine is executed. This routine clears the status 1 flag and issues a mask prohibition signal M1 that prevents the validator from accepting other coins for the time being. Similarly, microprocessor 204 delivers a code to the host machine over line 232 indicating that a rejection occurred due to an acceptance timer timeout.

Once the coin reaches detector 120 and the state 2 flag is set, program section 260 is entered each time the main loop is executed. In this section, the Kayo mask prohibition signal M1 is issued, so the acceptance signal Acc is terminated.
We will no longer accept coins for the time being. Program section 260 additionally monitors a strobe signal STB. During execution of this section, if strobe signal STB indicates that the coin is not adjacent to detector 120V, the state 2 flag is cleared and the state 3 flag is cleared. Flag is set.

As the main program loop is executed in sequential iterations, state 3 program section 264 is executed. During this section, timers are checked for full control of diameter m gate 122 and bias gate 18. ma7j t crayon 2
At 64, a coin output signal indicating the type of accepted coin is sent to the host machine for a predetermined period of time, and a "block signal" is issued only for a predetermined block period.

Additionally, the state 3 program section operates to clear the state 3 flag after a predetermined period of time. Therefore, when the main program loop is subsequently executed, it will be found that all status flags have been cleared and the program will proceed to step 266 before recirculating.

The various time periods monitored during the State 3 program section are shown in FIG. 7 as T2 through T7.

Step 266 checks certain timers, including a timer that, upon timeout after period T1, stops the mask inhibit signal M1 and, if the incoming coin is appropriate, a timer that times out after period P1 and activates the path gate 122. At the same time, various [
Preparation (housekeeping) J Performed for the purpose of completing a task.

The operation of the microprocessor is periodically interrupted at regular intervals so that program flow temporarily switches to an interrupt routine, as shown in FIG. 8, before returning to the main program loop.

This interrupt is performed by a timer within microprocessor 204.

The main purpose of the interrupt routine is to
4, and checking the sensor 218 and executing the coin acceptance program routine if an acceptance signal Acc_f is received from the validation circuit 202.

In step 300, at the beginning of the interrupt routine, various timers are updated and only one sensor 52 is checked. The sensors 52 are sequentially checked one by one each time the interrupt routine is executed.

In step 301, the program checks for the presence of the Acc signal, and if it is absent, ends the interrupt routine. In other cases, proceed to step 302 and check all status flags. If the flag is not set, the coin acceptance routine begins at step 303.

In step 303, the coin data indicating the type of accepted coin sent from the confirmer is checked and the type of coin is displayed.

After that, steps 304 and 305 are performed sequentially.

Proceeding to steps 306 and 308, various conditions are checked at each step, and the main rejector, intrusion into the in-path 310, is determined accordingly.

For example, in step 304, the microprocessor checks to see if a coin is detected by the detector 120. This does not occur with a normally working knife, so if a coin is detected, it is assumed that a fault has occurred. The determination is made and the process proceeds to the rejection path 310 to prevent the coin from being accepted.

In steps 305 and 306, the program receives external inhibit signals from the host machine or internally generated 1. The presence or absence of a prohibition signal is checked, and if a signal exists, the rejection route 310
Proceed to.

In step 308, the data representing the coin type is compared with the previously stored block code, which is done by logically combining the code representing the coin type and the block code. Depending on the result of the logical comparison, the program enters a reject path 310 or proceeds to block 312. The details of step 308 are described below.

At block 312, the program starts an acceptance timer.

The program then proceeds to step 314 where it is fully determined whether the incoming coin is type D or type E. These coins were sent to the additional path 14'VC of the coin storage unit 6. If your coin is one of these types, step 3
161 (proceeds) and stores a signal indicating that it is not necessary to activate the normally open path gate 122 and deflection gate 18, stores all coin data codes representing the type of coin, and stores the coin-related "block code" in the table. ” and store it for use in subsequent executions of step 308, i.e., when validation circuit 202 accepts another coin. As shown in FIG. It will be cleared by.

If the coin is not of type D, td, or E, step 314
The process proceeds to step 318 and the coin (A, B or C
It is determined whether the storage space 8 of the coin (type) is full or not, and if it is full, the process proceeds to step 320.In step 320, the route gate 122 is operated depending on whether the coin is type C or not. This is similar to step 316. If it is not type C, the gate 122 must be activated and the program starts a timer that clocks the period P1 shown in FIG.

If the tube is not full, as indicated by the output of each sensor 52, the process proceeds from step 318 to step 3221c.

In step 322, it is determined whether the A, B or C type coin is routed to the iron box based on the data code of the previously accepted coin. As mentioned above, this code is automatically cleared after a certain period of time, so a reliable answer can only be obtained if the subsequent coin arrives within the specified period in which the preceding coin is guided into the iron box.

A, By! If the preceding coin of type C is not correctly routed to each secondary path 12, the process proceeds to step 324v. Step 3
24 is similar to step 320 except that it is desirable to direct the incoming coins to the coin storage space 8 accordingly, so that the program stores a code indicating the activation of the gate 18.

On the other hand, if it is determined that the A, B or C type coin is correctly routed to the iron box, the program proceeds from steps 322 to 326 to determine whether the preceding coin is of the same type as the arriving coin.

That is, the process proceeds to step 326 under either of the following two conditions.

(1) If the preceding coin is of the same type as the succeeding coin, this means that the preceding coin was delivered to the side route even though there is space in the storage space 8. This is Sen V5
This may occur when the previous coin passing through the storage space 8 gives a temporary erroneous indication that the storage space 8 is full, and in such a situation, the subsequent coin is naturally delivered to the storage space 8.

However, when the last coin arrives during the predetermined period of the preceding coin, there is no longer enough time to move each bias gate 18 from the second position to the first position, as shown by the solid line in FIG. The program therefore proceeds from step 326 to a reject path 310 to reject the coin and ensure sufficient time for the bias gate to move.

(2) If the last coin is different from the coins routed to the iron box, the program proceeds from step 326 to 320 and delivers the last coin to the iron box via the secondary route 12. Although there is space in the storage space 8 for the coin, it is necessary to operate the bias gate 18 in order to deliver the coin to the storage space, and as a result, as described above, the path of the preceding coin that should go to the secondary path 12 is obstructed. This is because there is fear. To avoid this, give priority to the Iron Box route.

After leaving steps 316, 320 or 324, the program proceeds to step 330, clearing the state 1 flag and setting the state 2 flag. Clearing the state 1 flag means that the coin acceptance routine begins at step 303 until another coin generates a new acceptance signal Acc.

The program proceeds from the rejection path 310 to step 334, which causes the microprocessor to issue a mask prohibition signal for a predetermined period of time to prevent the acceptance of coins, to confirm gate activation, and to set the coin code and block code. The stored register is cleared, and a code indicating the reason for rejection is output on line 232. To this end, an appropriate code is stored in a register before reaching the main rejection route 310, and this is done in any of steps R1 to R5 depending on the reason for rejection.

As shown in FIG. 7, the confirmation circuit 202 is configured not to accept any other coins until the leading edge of the strobe signal 5TBO after confirming acceptance of the incoming coin. The control device 200 prevents the circuit from inspecting coins on the side during the period of the mask prohibition signal M1.

After that, there continues a period Bl from the end of the prohibition signal M1 to the end of the block period signal, during which coins are not accepted.
It becomes possible. Therefore, during period Bl, another acceptance signal Ac
c may occur, resulting in further transition to state 1, state B2 and state 3 periods.

Once a coin is accepted and available for use until the end of the block period, microprocessor 204 stores the block code and coin data code for that particular coin.

The coin data code is a 5-bit code with 7 pits that corresponds to the type of coin. For example, an A type coin is represented by the coin code 00001, and a B type coin is represented by oooio.

The block code is also 5 bits and represents a specific coin type. The block code is determined for a fixed coin according to the configuration of the classifier. Once the coins are accepted, the classifier processes the coins very quickly, and the bits in the block code corresponding to these coins are reset and the remaining bits are set.

For example, the data code of a type C coin is 00100, but type C coins are processed by the classifier 104, and type B or C coins are processed much faster. This is because neither requires activation of gate 122 or gate 18. Therefore, the block code of coin C is oooii, indicating that after processing the fin, all coins except types A and B can be processed quickly.

The block code of the previously accepted coin in step 308 of the State 1 routine is ANDed with the coin code of the newly arrived coin, and the result is zero (e.g., if coin C is followed by coin C, D, or E) ), the process proceeds to step 312, and if it is not zero (-, indicating that the subsequent coin is not of a type that can be quickly processed), the process proceeds to the main rejection path 310.

At the end of period B1, the block code is cleared to zero (C) and the process proceeds to step 308, and since the AND operation results in an opening, the process proceeds to step 312.

That is, no other coins can be accepted before period B1.

During period B1, only coins selected according to the type of coins already accepted are delivered to the classifier, and during period B1
After that, any coin will be accepted and delivered to the classifier.

Once the coins are delivered to the classifier during one period Bl, the blocking period lasts, so long as the coins are delivered quickly and sequentially.

If the period B1 is sufficiently long compared to the period before which delivery to the classifier is completely blocked, there is a possibility that the third coin will be delivered during the period B1 set by the first coin. That is, the period B1 set by the first coin may be so long that a second coin arrives and sets its own period Bl before it has elapsed, and a third coin arrives and is delivered to the classifier. .

In such a case, a problem arises because the path of the third coin interferes with the path of the first coin passing through the classifier.It is desirable to avoid these problems.
is started earlier, increasing the maximum coin processing speed. In this embodiment, all of the above problems are avoided by configuring the block code to be stored and ORed with the currently stored block code.

Therefore, in the above situation, the block codes of the first coin and the second coin are ORed and compared with the coin gater code of the third coin in step 30B. In this way, the third coin can be delivered to the classifier only when the path of the third coin does not completely block the paths of the first and second coins.

In the above configuration, step 266 of FIG. 6 is executed repeatedly before and during states 1, 2, and 3, so that the decisions made during these program sections are excluded from the main program loop. Can be changed during subsequent runs. This is particularly important in that the coin path can be changed immediately in response to changes in the current state of the device. For example,
Program step 266 includes a function that checks the status of sensor 52. If the storage space 8 receives all the specific coins that would cause it to become full) 7, and has just received a coin of the same type, the initial decision to deliver the coin to the storage space is made in the coin all iron box. You can change it to be delivered.

[Brief explanation of the drawing]

FIG. 1 is a schematic front view of a coin processing device according to the present invention. Figure 2 (I'i, is a schematic cross-sectional view taken along line 7It in Figure 1. Figure 3 is a schematic perspective view of the coin storage assembly of the device. Figure 4 is a schematic cross-sectional view taken along line 7It in Figure 1. Figure 5 is a longitudinal side view of the coin storage assembly unit; Figure 5 is a block diagram of the coin handling device circuit; Figures 6 and 7 respectively show the main program executed on the circuit microprocessor; FIG. 8 is a flowchart and a timing diagram explaining a loop. FIG. 8 is a flowchart explaining an interrupt routine executed by a microprocessor. [Explanation of symbols of main parts] 4. Supply path, 6.-Storage unit. , 12... - side road, 14 - follow-up road, 18... gate, 52... -
Sen No. 60...-Solenoid, 100 Coin processing device, 102 Verifier, 104 Classifier, 1
06... Coin storage assembly, 112... Acceptance gate, 116... Rejection route, 120... Detector, 200... Control device, 202...-Coin confirmation circuit, 204... Microprocessor. Engraving of drawings (no changes in content) FIG, 5 FIG, 6 Continuation of page 1 Priority claim @ December 20, 1983 ■ United Kingdom (
GB)■8333857 0 Inventor Kim Thomas United Kingdom Berkshire Slow Circle by Close 51 Procedural amendment; 14: Showa 59'+ April 1o1] Table 71 of Kazuo Wakasugi, Commissioner of the Patent Office, 'I': Showa 1959 Patent Application No. 20115
No. 2 Name of the invention Coin processing device Name to be amended 1 Relationship with 1 Patent applicant/1 representative (1) Representative in paragraph 4 of the application filed on February 8, 1980 We will submit one application for correction that includes basic P, D, G, and RIGHT. (2) As attached, one power of attorney and one translation thereof
We will submit a notification. (3) As shown in the attached sheet, we will submit one printable copy of the full statement. (4) As shown in the attached sheet, we will submit one official drawing. As I have submitted the original handwritten specification for the second application,
I would like to request that you replace it with a type-printed statement.

Claims (1)

[Claims] 1. A gate that supplies coins to the first or second path and delivers the coins to the first or second path depending on whether the coins are in the first position or the Vi second position. multiple supply channels,
a common actuator of the gates having a first state in which all said gates are in respective first positions and a second state in which they are in respective second positions; Coin processing comprising control means for determining the state of the actuator and controlling the actuator in such a manner that the actuator is in the state 1 (1) for at least a predetermined period of time long enough to ensure that the coin can enter the first or second path 1c. An apparatus, wherein the apparatus comprises a first and a second
The coin is configured such that the coin can reach the IC gate within a period shorter than the predetermined period, and the control means is of a type such that the first or second coin causes the actuator to take the second state "Ll" in the situation. On the other hand, the coin processing device is configured such that the state can be maintained reliably for at least the predetermined period regardless of the type of coin. 2. The device according to claim 1. If the control means is of such a type that the first coin causes the actuator to adopt the second state, the control means controls the control means for a period sufficient for each of the first and second coins to enter the second path. A coin processing device characterized in that it is configured to maintain the second state. 3. The device according to claim 1 or 2, wherein the control means is configured to maintain the second state. 1゜If the second coin is of a type that causes the actuator to adopt the first and second states, respectively, N 4. A coin processing device configured to be changeable. 4. The device according to claim 3, wherein each of the coins moves to a second position upon arrival of a first coin. 5. A coin processing device characterized by having a coin lff1 (on) surface configured with 1 so that the first coin can pass through without jamming. 5. The device according to claim 4. and when the coin biasing surface is in the first position, each first
6. A coin handling device characterized in that the coin is deflected and the coin is deflected when the gate is in the second position. 6. Claim 4 or 5 A coin processing device characterized in that each of the gates is pivotally mounted so as to be movable between the positions about an axis upstream of a coin biasing surface. 7. The device according to any one of claims 1 to 6, further comprising a plurality of coin storage means each configured to receive coins from each first path. Coin handling equipment. 84? The coin processing device according to claim 7, characterized in that each storage means has a π sensor that outputs a signal indicating whether the coins in the means exceed a predetermined amount. ChiH1 device. 9. The device according to claim 8, wherein the control means determines the sequential state that the actuator should take in accordance with bτ, the type of coin, and the signal from the sensor when accepting coins one after another. % to operate so that you can determine
A coin processing device with a special feature. 10 What is in claims 1 to 9? 1″L
2. The apparatus according to claim 1, wherein the control means operates to cause the actuator to adopt the second state in response to the presence of a predetermined condition and processes the coin in response to the absence of the predetermined condition. A coin processing device that operates by temporarily reducing the maximum speed to ensure sufficient time for the gate to move to a first position before a subsequent coin arrives at the gate. 11. The apparatus according to claim 10, wherein the control means operates to temporarily reduce the maximum coin processing speed by delivering coins to an alternative route of the coin. A coin processing device featuring: 12. The apparatus according to any one of claims 1 to 11, further comprising a sorting means for delivering coins to each supply route according to the type of coin, and the control means , the classification means is configured to prevent delivery of subsequent coins until a predetermined period of time has elapsed after receiving the preceding coin, and the said period differs depending on the type of the preceding coin and/or the subsequent coin. Coin handling equipment. 134? The apparatus according to any one of claims 1 to 12, further comprising a rejection path for orienting the coin in response to the existence of one of a plurality of predetermined conditions, and wherein the control means , each time a coin is delivered to the rejected route,
A coin processing device comprising means for emitting a data signal indicating the existence of the predetermined condition. 14. The device according to claim 13,
1C. A coin processing device further comprising means for storing the data signal. 15. A sorting means for delivering different types of coins to each destination, and controlling the delivery of coins to the sorting means, and after the sorting means receives the preceding coin, a sorting means according to the type of the preceding coin and/or the subsequent coin. A coin processing device comprising a control means configured to not deliver subsequent coins until a predetermined period of time has elapsed. 1G, the device according to claim 15,
The control means prevents the sending of previous coins to the sorting means (during the subsequent first prohibition period, the sending out of another coin, and
A coin processing device, characterized in that it operates so as to send out only one or more selected types of coins during a second prohibition period following the first prohibition period. 17. The device according to claim 16,
The control means logically compares a block code representing the type of the preceding coin and a block code representing the type of the subsequent coin to determine whether or not to send the subsequent coin to the classification means during the second prohibition period. It is characterized by operating as follows. 18, the biasing means causes the coin to move to the first position in response to the existence of a predetermined condition;
A coin handling device comprising control means for selectively directing subsequent coins to a destination or an alternative destination, the control means directing subsequent coins to the biasing means at intervals equal to or longer than a first predetermined period of time. The biasing means moves the subsequent coins to the appropriate destination by blocking the delivery of the coin to the biasing means for a longer second predetermined period in response to the presence or absence of the predetermined condition. A coin processing device characterized by securing time to be ready for delivery. 19. The device according to claim 18,
The first destination is a storage means having a sensor indicating whether the stored coin exceeds a predetermined amount, and the biasing means replaces the coin in response to the sensor indicating that the storage means is full. What is claimed is: 1. A coin handling device which is operable to orient the coin to its destination, and which prevents delivery of coins to the biasing means for the second predetermined period in response to a sensor indicating a space in the storage means. 1% allowance The device according to claim 18 or 19, wherein the control means delivers the coin to the rejection route over the second predetermined period, so that the coin is not affected by the biasing method. A coin processing device characterized by operating in such a way that the coin cannot reach the stage. 21. A coin processing device that operates to accept coins and deliver them to one or more destinations when none of a number of predetermined conditions exist, the coins being delivered to the destinations as appropriate depending on the presence of the predetermined conditions. A coin processing device characterized by comprising means for emitting a data signal indicating the existence of the predetermined condition each time the predetermined condition is not met. 2. A coin processing device according to claim 21, further comprising means for storing the data signal. B, any one of claims 1 to 14 (1) (a device described in which the cage is configured to move integrally without any relative movement between them; A coin processing device characterized by: 2. The device according to any one of claims '14 to 23, wherein the gate is configured to move around a common pivot axis. Z5. The coin processing device according to claim 1.14.23 or 24, characterized in that the gate is integrally formed. .