WO2006012829A1

WO2006012829A1 - Method for outputting balance value sheets

Info

Publication number: WO2006012829A1
Application number: PCT/DE2005/001219
Authority: WO
Inventors: Thomas Zimmerman; Christian Batzner
Original assignee: Scan Coin Industries Ab
Priority date: 2004-08-05
Filing date: 2005-07-06
Publication date: 2006-02-09
Also published as: DE102004038242A1

Abstract

The invention relates to a method for outputting balance value sheets from a device in order to exchange value sheets into bonds. Said device comprises means which are used to count value sheets inserted into an insertion charge which determines means of the total value of all the value sheets inserted by the operator and transfers it to a control device. The control device controls an output unit in order to output value sheets in an approximately maximum amount to the determined total value, whereby balance value sheets, whose total balance value of the difference of the total value of the inserted value sheets amounts to the total value of the outputted bonds, are outputted. The invention is characterised in that a first partial charge of inserted value sheets of an insertion charge is stored in a balance value sheet store such that a second partial charge of inserted value sheets of an insertion charge is stored in a collecting vessel. The control device of the balance value sheet store is controlled in order to output the balance value sheets according to the difference implied in the total value.

Description

Method for issuing residual amount value slices.

Field of the invention.

The invention relates to a method for outputting residual amount value slices from a device for exchanging value slices in securities, the device having means for counting value slices inserted in a throw-in batch, which means determine the total value of all value slices inserted by the operator and to a control device wherein the control means drives an issuing unit to issue securities in a maximum approximated amount to the particular total value and wherein residual amount value slices whose total residual amount is the difference of the total value of the inserted value slices to the total value of the issued securities are ejected, and a device for executing of such a procedure.

Background of the invention and prior art.

In many contexts there is a need to exchange value slices, such as coins, tokens, chips, etc., into securities such as banknotes, notes of value or coupons. This is due to the fact that value slices are typically assigned lower valencies than corresponding securities. For example, coins have graded valences, starting with the lowest denomination, such as the cent, and ending with no more than half the denomination of the least valuable bill, such as the 5 Euro bill. In the case of the euro, the highest value of a coin is 2 euros.

Value slices and securities are typically provided with machine-traceable properties specific to the particular value. Therefore, value slices and securities can be counted and sorted by means of machines, for example.

For example, a person may have come to a large amount of value slices in a casino and, for weight reasons alone, may wish to exchange the equivalent of the entire batch of value slices into securities, such as banknotes. In the banking business too, customers often demand an exchange of large batches of coins in banknotes. However, this is no longer possible in the course of the closure of personal cash registers in most bank branches.

Such exchanges are therefore desirably automated by means of exchange devices, which can be set up without the need for personal monitoring, for example in the vending rooms of a bank branch.

This creates the problem that the total value of an inserted batch is usually not divisible by the lowest value of a security, with the result that the conversion device must pay back remaining values below the lowest value of a security in Wert¬ discs. This problem is based on the fact that an operator with a high amount of value discs can not or does not want to count this, but rather this rather, leaves the device. As a result, the total amount of value slices thrown in will practically never yield a quantity divisible by the lowest value of a security, ie securities can not be exactly "matched", but rather residual amounts remain.

From practice, methods and devices of the initially mentioned type are known. This repayment container are provided, from which after the throw of a Ein¬ litter batch, the count and determination of the total value, and the issue of securities in the specific total amount of maximum approximate amount, the remaining amount is spent. These repayment containers must be filled by hand, which is ^{• time-} consuming. In addition, these repayment containers must have a large storage capacity if it is not possible to comply with very tight filling intervals in terms of time. This is both disturbing.

If a repayment container is empty, a problem arises in any case, since then a precise exchange with as few residual value slices as possible is not possible. An operator will have to handle unnecessarily many value discs after the exchange. This also bothers.

Technical problem of the invention.

The invention is based on the technical problem of specifying a method which allows structurally simple and compact exchange devices and nevertheless always ensures optimum exchange actions for an operator. Broad features of the invention and preferred embodiments.

To solve this technical problem. teaches the Er¬ invention that a first subset of thrown Wert¬ slices a EinwurfCharge is stored in a residual amount-Wertscheibenreservoir, and that a second subset of inserted Wertscheiben a Einwurfcharge is stored in a sump, wherein, the control means the remaining amount- Wertscheibenreservoir for the issue of Remaining amount value slices in the total value of said difference is driving. ^''

In other words, the residual-value-Wertreservoir is not filled separately by hand, but wer¬ the value discs from the stream of inserted value disks as it were branched off and not the collection, but the remaining value-Wertscheibenreservoir supplied. The

Remaining amount-Wertscheibenreservoir is thus filled up automatically with each exchange and it can always be optimally low balances repaid. Not only is the requirement for manual filling avoided, but the residual value reservoir can also be made very small.

As a rule, value slices must be different. Wertig¬ be exchanged speed. It is then recommended that the means for counting comprise a sorting device for sorting value slices of different valence, by means of which the value slips of a throw-in batch are sorted, wherein the sorting device is optional Counting means for counting sorted value slices ver¬ different weights has, by means of which Zählein¬ direction all value slices of a throw-in batch counted by weight are counted.

Instead or in addition, the means for counting may include a sensor for detecting the valences of different value slices. Devices for sorting and counting, for example, coins and determining the total value of a throw-in batch are familiar to the average person skilled in the art and therefore need not be explained in more detail. In this embodiment, the remainder of the value disk reserve may comprise a plurality of dispensing containers, each dispensing container being associated with a weight and being filled by the sorting device with associated sorted value slices of a throw-in batch. The control of the output is then carried out by calculating a total residual amount corresponding set of remaining amount value slices and corresponding control of output elements of the output container.

Particularly small output containers can be realized if the first partial batch is calculated and retained with an algorithm explained in greater detail in the examples. This can be easily controlled with the already existing means, which sort and count the value slices.

The remaining value-value disk reservoir can comprise an additional output container which is filled from a throw-in batch with value disks of only the lowest value. This allows an emergency function, whereby in the absence of remaining money value slices in to a throw-in batch appropriate amounts can be compensated for a shortfall with the ent¬ speaking number of value slices lowest value for emergency.

An exchange takes place, for example, as described in detail below. An operator throws a throw-in batch into the device. The inserted value slices are sorted according to their value and counted. The total value determined in this way can be displayed, for example, by means of a display of the operator. When the throw-in batch is completely inserted, the operator actuates a key or the like, whereupon a control device, in accordance with the total amount transferred to it, drives the dispensing unit to issue securities, namely in a total amount which is at least equal to the total amount inserted at least the lowest weight in the issue unit of available securities. The control unit then determines the remaining balance and controls the remaining amount-value disk reservoir for the issue of this balance, whereby the exchange is ab¬ closed.

The invention also relates to a device for carrying out a method according to the invention, having an insertion opening for value disks, with means connected to the insertion opening for counting value disks inserted in a single charge batch, by means of which the total value of all valuable disks inserted by an operator can be determined Control device to which the determined total value is transferable by the means for counting the value slices, and which is connected to a securities issuing unit, wherein the output unit is controllable by the control device for outputting the securities in a maximum approximated amount, with means connected to the counting means for separating the value slices inserted in a throw-in batch into two partial batches, wherein a first partial batch belongs to a collecting container connected thereto and the second partial flow can be supplied to a residual value reservoir connected thereto, wherein the remaining value reservoir comprises means for output of value slices connected to the control device with a total value of the difference between the total value of the throw-in charge and the total value of issued securities. Further embodiments are described in the subclaims.

In a specific embodiment, the throw-in opening is connected to a counting and sorting path, for example via a turntable on which the value disks fall. In the counting and sorting section, the value slices are separated from the turntable and typically initially passed or advanced past a sensor for determining the value of the value slices, for example based on the diameter, alloy or other value-specific features of the slices beige promotes. This sensor counts the coins in accordance with the respective significance, whereby the total amount of Einwurfcharge can be determined and stored in the control device. The value slices are then conveyed further, for example via sorting openings which are dimensioned specifically for one valence in each case (typically with ascending opening size), whereby the value slices are sorted. To the Sorting the respective Sammelteilbehälter and output containers are connected and connected to the Steuer¬ device steering element steers a Wert¬ slices in accordance with a defined algorithm either in the value assigned Sammenteilteil¬ container or the value assigned output container.

In a particularly simple variant of the invention, a dispensing container is in each case connected to a part of a respective collecting part container or a collecting part container, wherein the dispensing container has an overflow opening, from which value discs fall into the collecting part container, if the dispensing container, which is small in size can, for example, for only. 1 to 100, preferably 1 to 10, but also 1 to 3, ^" value slices, is full., Particularly advantageous here is that the output container in the inventory management must not be subject to separate detection, if when emptying the Vorrich- device reservoirs and Emptying containers are emptied.

The dispensing containers, in turn, have dispensing devices connected to the control device, which are actuated by the control device for dispensing value slices in the residual amount value.

In particular, only a quantity which is necessary for the combination of any desired amount below the lowest value value Wertigkeit must be sorted into each output container in order to dispense as little value slices as possible. ^'The particular amount, for example, the integer part of the quotient of an immediate parent value wheels valence by Value-value of the respective output container, in the case of fractional quotients corresponding to the quotient-1 in the case of integer quotients. This will be illustrated below using the euro. The values are: 1, 2, 5, 10, 20 and 50 cents and 1 and 2 euros. 2/1 = 2, which implies that only 1 cent and 1 euro coin must be present in the respective dispensers. 5/2 = 2.5, which implies that 2 2 cents and 2 2 euro coins must be present in the respective dispensers. The same applies to the other values. The number of 2 Euro coins is 2, since the lowest note value is 5 Euro. You will receive a set consisting of 1x1 cents, 2x2 cents, 1x5 cents, 1x10 cents, 2x20 cents, 1x50 cents, 1x1 euros, 2x2 euros, from which I can put together any amount less than 5 euros. In addition to this quite simple procedure, however, the optimized algorithm can also be used, as described in the following example, whereby optimally small output containers and an optimal output of value slices from an inserted batch are made possible.

Example 1: Calculation of Value Slots or Coins to be Inserted into Output Containers.

Introductory definitions are to be defined.

If m is that of the denominations of the coins of a particular currency, the coins can be described by means of an m-tuple (C ₁ = [c ₀ , C ₁ , C ₂ , ...., C _1n-1 ]). C ₁ is the ith coin value and always a natural number. C ₁ is always smaller than C _{1 + 1} . C ₀ is always greater than or equal to 1. The same applies to banknotes of the currency. The notes can be described by means of an s-tuple (b _j = [b ₀ , b _ir b ₂ , ...., b _s _ _x ]), b., Is the jth ticket value and always a natural number, b _j is always smaller than b _{j + 1} . b ₀ is always greater than C _1n-1 , which _provides the connection to the largest coin denomination.

From the denominations of the coins and the denominations of the notes, the currency of a currency is given as an n-tuple (a _± = [a ₀ , a _x , a ₂ , ...., a _n _J = [c ₀ , C ₁ ,. ... ^c _m -i 'k ₀ , ^ ₁ , • • • • i ^ _s -J) r where a _{± is} always a natural number, n = m + s, a _{i + 1} > a _A and a ₀ : > 1 is.

When analyzing a means of payment set, the separability properties of the weights are rele vant. The value a _± divides the nearest value a _ό k-fold if k * a _± = a ^, where k is a natural number and j> i The value a _± divides another value (f * a ^ k-fold, ie

k * a, = f * a, formula 1

if f is the smallest possible factor, where k * a _x = f * β _j , j> i, and k and f are natural numbers.

By means of the definition according to formula 1 triangular matrices, namely a divisor matrix T _nn [k _{i; j} ] and a multiple matrix V _nn [f _{i; j} ] can be constructed, where k _{i; j} and f _{13 are} zero for all j> i. For the algorithm according to the invention, the row vectors t _n of T _nn and v _n of V _{nn are} relevant, which are called the divider vector and the multiple vector. In detail ^' are only the coins associated with the first m Divisor or multiple vectors relevant because it is about the calculation of the required coins.

The algorithm according to the invention then proceeds as follows.

First, the divider matrix T _nn and the multiple matrix V _{nn are} calculated.

The minimum vector min = (min ₀ , min _x , ...., min _m _ _x ) is formed, which represents the permanently necessary value to be canceled for each coin value. The i-th element of the minimum vector is calculated from the minima of the nonzero elements of the i-th divider vector t _L according to FIG

IrUn ₁ = min (t _ij , t _{ij + 1} , ...., t _in ) - 1 Formula 2

where j> i.

Then the "still to be held" vector neb = (neb ₀ , neb _x , ..., neb _{m-1 is} initialized with the maximum values The i-th maximum value is calculated from the minima of the mth to nth elements of the ith divisor relating to the divisibility of the notes, in accordance with

neb _t = min (t _ijr t _{ij + 1} , ...., t _in ) - 1, formula 3

where j> i and j> m. These maximum values are optimized for the number of coins still to be withheld by means of the algorithm according to the invention, and as coins continue to accumulate, these values will converge to the corresponding values of the minimum vector. During the coin intake, a number of coins (first partial charge) currently retained will be represented. The is-vector is = (is 0 _n ', is; _x , ...., ISt _1n-1 ) which is initially 0 is initialized, updated for each additional coin according to the following criteria:

Criterion A: if neb _x = 0, then the coins can pass and be led into the collection bin and _x remains unchanged,

Criterion B: if _x > 0, the coin is retained or assigned to the first partial lot; _{n (new} = _{X / old} + 1 and neb _{X / neu} = neb _{x, old} - 1 are set, and the row vectors of the beginning of the coin taking as 0 initialized residual matrix R _111n = [r _{i, j],} ^success' end residual vectors r _± = ^r i0 '-il' ^r i _m -i), obtained according to the following criteria C and D a mark,

Criterion C: a recalculation is carried out for all i <x, whereby in the case of r _ix + 1 = v _ix ne

^ i, new ¹ ^ kJ., old ^ -ix as long as t _ix > neb _{1 / Blt} ; in this case, the mark r _ix is reset to 0,

Criterion D: a recomputation is carried out for all i <x, and in the case of r _ix + 1 <v _ix r _ix = ^r ix, old + 1 and nebi remain unchanged.

Due to its initializations and the criteria C and D of the iteration, it is ensured that the is vector, which represents the coins to be dispensed, belongs to each one Time assumes a defined state. Due to the calculation of nebi in connection with criterion B, the coins still to be withheld or the first partial batch to be allocated decrease monotonically and the criteria A and C and D determine the convergence of the iteration. As a result, at any point in time of the coin taking, the minimum number of remaining payment of required coins is allocated to the first partial lot and directed to the remaining coin bank.

Example 2: schematic representation of a device according to the invention.

FIG. 1 shows schematically a device according to the invention. In the illustration Steuerleitun¬ conditions and the like are shown as dashed lines. Paths of value slices and / or securities are shown as solid lines.

It can be seen at first that the device has a receiving opening 1 for value disks and means 2 connected to the insertion opening 1 for counting value disks inserted in a charging charge. The means 2 for counting determines the total value of all value slices inserted by an operator. This is done in the usual way with known counting and detection sensors.

Furthermore, a control device 3 is set up, to which the specific total value can be transmitted by the means 2 for counting the value slices. The control device 3 is in turn connected to an output unit 4 for Securities is connected, wherein the output unit 4 of the control device 3 for issuing the securities in a the minimum total value of the inserted Wert¬ discs minimally below total value of securities issued is controllable. In the case of the currency Euro, this value is the so-called integer of the quotient of certain total value by 5 (the smallest apparent value). The difference of the product of the integer with 5 to the total value is then the total residual value. The staggering of disbursed bills can be controlled in bank ATMs usual way and the bills are the pseudo-removal opening 5 supplied.

To the means 2 for counting means 6 for separating the thrown in a Einwercharge Wertsσheiben in two partial batches are connected, with value slices in accordance with the control of the means 6 for separation, which are connected to the control device 3, in a first part of a charge connected thereto residual amount - Value disk reservoir 7 and a second part of charge connected to a collecting container 8 can be fed.

The remainder amount value disk reservoir 7 in turn has means 9, connected to the control device 3, for issuing value slices with an overall value of the difference between the total value of the throw-in charge and the total value of issued securities. Value discs to be dispensed are supplied in accordance with the activation of a value mark removal opening 10.

A sorting device 11 is connected to the means 2 for counting for different value disks of different valence. Specifically, the remaining amount Value disk reservoir 7 and the collecting container 8 are connected to sorting outlets, not shown, of the sorting device 11, wherein the collecting container 8 each has a wer¬ tigkeitsfach 12 for value discs of a valence has, which are connected to each associated Sotierauslässe and the remaining amount- Wertscheibenreservoir 7 more, respectively a value assigned output value container 13, which are connected to each associated sorting outlets. The sorting can be carried out in a customary manner, for example by means of a sorting plate or rail.

Finally, one recognizes a special container 14, which can output value marks "into the discharge opening 10 via an output unit 16 which is controlled by the control unit 3. By means of the switch 15 also controlled by the control unit 3, value slices of the lowest value are obtained The special container 14 is actuated (exceptionally) for dispensing value slices if the residual value slab 7 does not contain the required value slices for disbursement of the remaining portion It is therefore an (optional) emergency function.

The control device contains an operating program which codes, inter alia, for an algorithm according to Example 1, whereby within a throw-in batch the optimum (lowest possible) quantity of value slices is always passed to the remaining value slab reservoir 7 for paying out a balance. As a result, the residual amount-value disk reservoir 7 can become very small build and require no regular filling and / or emptying by persons. It is understood that the value of the number of slices in the respective valency compartments can be balanced and stored in the control device 3. In this way, possible coins remaining from a payment process in the residual value disk reservoir 7 can easily be taken into account in the new calculation according to example 1 in the context of a subse- quent batch, so that any undesired accumulation is avoided.

Claims

claims:

1. Method for issuing residual value slices from a device for exchanging value slices in securities,

the apparatus having means for counting value slices inserted in a throw-in tray, said means determining the total value of all value slices inserted by the operator and transmitting them to a control device,

wherein the control device controls an output unit for issuing securities in a total value of securities issued that minimally goes below the value slices inserted into the specific total value,

whereby residual value slices, the total residual carrying value of which is the difference between the total value of the scored value slices and the total value of the issued securities, are ejected,

characterized,

a first partial batch of inserted value slices of a throw-in batch is stored in a residual value slab reservoir,

that a second sub-batch of inserted value slices of a throw-in batch is stored in a collecting container, wherein the control means drives the remainder value disk reservoir for the issue of remainder value slices in the total value of said difference.

The method of claim 1, wherein the value slices and / or residual amount value slices are coins or tokens of value.

3. The method of claim 1 or 2, wherein the securities are bills, tokens or vouchers.

4. The method according to any one of claims 1 to 3, wherein the

Counting means comprise a sorting device for sorting value slices of different significance, by means of which the value slices of a throw-in batch are sorted, the sorting device optionally having counting means for counting sorted value slices of different weights, by means of which counting means all value slices of a throw-in batch are counted according to value.

5. The method according to any one of claims 1 to 4, wherein the means for counting has a sensor for detecting the wer¬ activities of different value discs.

A method according to any one of claims 4 to 5, wherein the remainder value disk reservoir comprises a plurality of dispensing containers, each dispensing container having a weight is assigned and filled by the sorting device with associated sorted value discs of a EinwerCharge.

7. The method according to any one of claims 1 to 6, wherein the first partial charge is calculated by means of an algorithm according to Example 1.

8. The method according to any one of claims 1 to 7, wherein the remaining amount-Wertscheibenreservoir is emptied into the collecting container after the issue of the balance amount value slices.

9. Apparatus for carrying out a method according to one of claims 1 to 8,

with a slot for value discs,

with means connected to the throw-in opening for counting value slices thrown in a throw-in batch, by means of which the total value of all value slices inserted by an operator can be determined,

with a control device to which the determined total value is transferable by the means for counting the value slices, and which is connected to a securities issuing unit, the issuing unit being issued by the control device for issuing the securities in a value entered in the particular total value Value slices is minimally lower than the total value of given securities,

with means connected to the counting means for separating the slices inserted in a throw-in batch into two partial batches, a first partial batch being able to be fed to a remaining amount-value reservoir connected thereto and a second partial batch being able to be fed to a collecting container connected thereto;

wherein the remainder-value-disk reservoir has means connected to the control device for issuing value slices with a total value of the difference between the total value of the throw-in charge and the total value of issued securities. • ■

10. Apparatus according to claim 9, wherein the means for

Counting a sorting device for different value discs of different valence include and the remaining value-Wertscheibenreservoir and / or Sammel¬ container is connected to sorting outlets of the sorting device, wherein the collecting container each having a valency compartment for value discs of a valence, which are connected to each associated Sotierauslässe and or wherein the remainder of the value disk reservoir has a plurality of output value containers, each associated with a value, which are connected to respectively assigned sorting outlets.

11. The device according to claim 9 or 10, wherein the Steuer¬ device includes a Betriebsprograπun which codes for a method according to one of claims 1 to 8.