DE102007054331A1 - Method for dynamic determination and control of routes for transport of luggage units in luggage transport network, involves guiding luggage units at multiple feeding points of luggage transport network - Google Patents

Abstract

The method involves guiding the luggage units (GE) at multiple feeding points of the luggage transport network. The luggage units are taken out at multiple release points of the luggage transport network. The different routes of transportation are utilized for transport of the luggage units between the feeding point and the release point. The route (R) for the transport of the luggage units is determined in dependence of utilization and transport capacity (K-K) of the routes of transportation. An independent claim is included for a device for dynamic regulation and control of routes for transport of luggage units in a luggage transport network.

Description

The The invention relates to a method and a device for dynamic Determination and management of routes for the carriage of Baggage units in a baggage handling network.

Lots Transport systems, such. B. luggage conveyor systems in airports, must be transported units in a short time through an often complex Transport network with a variety of alternative transport routes transport to a predetermined destination. Further criteria, which often go into objective functions are one possible balanced distribution of a load in the transport system and / or a prioritization of selected units to be transported.

Often are called so-called shortest-path method, such. B. a Distance vector routing or link state routing, applied, the appropriate routes of the unit to be transported in the transport network to calculate. However, routes become more source-destination relationships not considered, which is usually not optimal Condition of the transport system leads.

From the DE 198 58 477 B4 and the DE 102 62 074 B4 Dynamic route selection methods are known, which consider a traffic network or a communication network as a recurrent neural network (= simulation network) and realize by means of a construction of a second linear recurrent network (= error propagation network) an optimal route distribution with respect to predetermined target functions, which is tracked at adjustable time intervals. In this case, the simulation network is divided into individual layers, each of which models partial flows of traffic that lead to exactly one destination at a time.

It However, there is a possibility that at the top said baggage handling systems of the given Destination or output point of several luggage units to be transported during the carriage changes, where it is not possible with those mentioned in the prior art Methods and networks Transport systems, such. B. baggage handling systems, optimally to control and operate.

Of the The invention is therefore based on the object, an improved method and a device for dynamic determination and control of routes for carrying luggage indicate in a baggage transport network which in particular overcomes the disadvantages indicated in the prior art and is easy and inexpensive to carry out.

Regarding of the method according to the invention by the features specified in claim 1 solved. Regarding The device according to the invention by the task the features specified in claim 11 solved.

advantageous Embodiments of the invention are the subject of the dependent claims.

at the inventive method for dynamic Determination and management of routes for the carriage of Baggage units in a baggage handling network can the luggage units at several posting points fed to the baggage transport network and at several delivery points to the baggage handling network be removed. Here are between a task point and a Issuing point different transport routes to a carriage used the luggage units, wherein each luggage unit at least one output point is assigned. The route to the carriage The luggage units will depend on one Capacity utilization and a transport capacity of Transport routes determined.

The Transport capacity of transport routes is based on a distribution of luggage units controlled on these, being at a high utilization of a transport route on the determined Route during transportation of the luggage units an alternative route is determined so that one or more Luggage units diverted to different transport routes become.

By the determination and control of the route for carriage the luggage units taking into account the Utilization and transport capacity of transport routes will be a fast and reliable transportation the luggage units ensured so that waiting times can be minimized to a lesser degree.

In one embodiment of the invention, there is the possibility that the transport of selected luggage units is prioritized. Thus, a promotion of prioritized luggage units with particularly klur zen throughput times of the luggage unit can be achieved.

In a development of the invention, the baggage transport network mapped to a recurrent neural simulation network which over has several layers, with one layer one or contains several transport routes to exactly one output point. In addition, a recurrent linear error propagation network, which includes objective functions, to the determination and control the routes used by means of the error propagation network the simulation network is controlled. This results in the advantage that the baggage transport network by means of a model-based technical solution is replicable and thus an optimization the carriage of luggage units easy and is economically feasible.

• – "Verfahren zum Ermitteln von Verkehrsinformationen", welches in der DE 198 58 477 B4 beschrieben ist, insbesondere in den Absätzen [0030] bis [0133]; und
• – "Adaptives verteiltes Verfahren zur Berechnung system-optimaler Routen in paketvermittelnden Kommunikationsnetzen", welches in der DE 102 62 074 B4 beschrieben ist, insbesondere in den Absätzen [0009] bis [0045];

und welche hiermit durch Verweis derart aufgenommen sind, dass alle Gegenstände der DE 198 58 477 B4 und DE 102 62 074 B4 Gegenstände dieser Anmeldung sind.The method according to the invention is based on the following known methods:

• - "Method for determining traffic information", which in the DE 198 58 477 B4 in particular in paragraphs [0030] to [0133]; and
• - "Adaptive distributed method for the calculation of system-optimal routes in packet-switched communication networks", which in the DE 102 62 074 B4 in particular in paragraphs [0009] to [0045];

and which are hereby incorporated by reference so that all objects of the DE 198 58 477 B4 and DE 102 62 074 B4 Subjects of this application are.

The inventive method provides a further development the known method, so that the known methods capable an assignment of a new issue point to a baggage unit model to take into account and process.

In Another embodiment of the invention by means of the target functions of the fault propagation network, a turnaround time of the baggage units and the transport capacity of transport routes to the issue point in the determination of the route to the carriage the luggage units are taken into account so that always a short transport time of the luggage units is ensured.

A Baggage unit is assigned to a different assignment Issuing point on a transport route during transportation assigned to a new layer of the simulation network, wherein the new layer any layer except an original one Layer can be. This makes it possible in an advantageous manner also target changes or changes of the output point from a time of change in the objective functions of the error propagation network and thus to optimally determine and control a route to the issue point.

In In a further development of the invention, each layer becomes a state variable associated with, by means of the state variables, a number of to be transported luggage units on a transport route is described in one shift at a time. Thus, can determined at any time a utilization of a transport route be, so that always the best possible distribution of Luggage units on the different transport routes and optimal calculation and control of the routes is achieved.

geändert. Bei der Zuordnung der Gepäckeinheit zu einer neuen Schicht wird die Zustandsvariable der neuen Schicht gemäß

geändert. Damit werden die Auslastungen und die Beförderungskapazitäten der einzelnen Schichten im Simulationsnetz angepasst und die veränderten Zustandsgrößen können in den Zielfunktionen des Fehlerpropagierungsnetzes für eine weitere Ermittlung und Steuerung der Routen berücksichtigt werden. Weiterhin bleibt bei der Zuordnung der Gepäckeinheit zu einer neuen Schicht eine Summe der zu befördernden Gepäckeinheiten gemäß

über alle Schichten konstant.When assigning the baggage unit to a new layer, the state variable of the original layer is determined according to

changed. When assigning the baggage unit to a new layer, the state variable of the new layer according to

changed. This adjusts the utilization and the transport capacities of the individual layers in the simulation network and the changed state variables can be taken into account in the target functions of the error propagation network for a further determination and control of the routes. Furthermore, when allocating the baggage unit to a new shift, a sum of the baggage units to be transported remains in accordance with

constant over all layers.

By means of the method according to the invention, it is advantageously by extension of the patents DE 198 58 477 B4 and DE 102 62 074 B4 It is possible by means of the recurrent neural simulation network and the recurring linear error propagation network to model the baggage transport network in such a way that a determination and control of routes for transporting baggage units is achieved.

Especially the possible consideration of the allocation of a deviating issue point during carriage The luggage units represents the evolution of the known Procedure, taking into account the enlargement the state variable is reached.

The inventive device for implementation a procedure in a baggage handling network comprises a control unit for controlling the routes of passengers to be transported Luggage units, means of collection and localization the respective baggage unit and means of determination capacity and capacity of transport Transport routes. As a result, an implementation of the invention Procedure allows for optimal dynamic Management and determination of routes for the transport of Luggage units leads.

embodiments The invention will be described below with reference to a drawing explained.

there shows:

1 schematically a baggage transport network depicted on a recurrent multi-layered neural simulation network.

The single figure represents several layers d ₁ to d _{n of} a recurrent neural simulation network 1 on the recurrent neural simulation network 1 is an unillustrated baggage transport network (in the DE 198 58 477 B4 : Transport network; in the DE 102 62 074 B4 : Communication network). This baggage transport network can be used, for example, in airport baggage handling systems.

In the baggage transport network baggage units GE at several points of delivery a ₁ to a _X (in the DE 198 58 477 B4 : Source Q; in the DE 102 62 074 B4 : Data source Q), z. B. at various check-in counters in an airport, the baggage transport network supplied. The baggage units GE are then from the task points a ₁ to a _X to one or more output points z ₁ to z _n (in the DE 198 58 477 B4 : Goal Z; in the DE 102 62 074 B4 : Data destination Z), where they are taken from the baggage transport network.

Between a pickup point a ₁ to a _X and an output point z ₁ to z _n, there are a plurality of transport paths k, via which the baggage units GE are transported from the picking points a ₁ to a _X to one or more delivery points z ₁ to z _n . In this case, a route R is determined as a function of a load k _A and a transport capacity k _{K of} the transport paths k. In the case of a high utilization of a transport path k on an already determined route R, an alternative route R is also determined during the transport of the luggage units GE in order to avoid overloading of the transport routes k.

In this case, the baggage units GE are diverted to transport routes k deviating from the originally calculated route R, an optimum transit time of the baggage units GE always being achieved from a delivery point a ₁ to a _X until reaching an exit point z ₁ to z _n . This makes it possible on the basis of the utilization k _A and the transport capacity k _K always to achieve optimum determination and control of the routes R and avoiding overloading of a transport path k or a portion of a transport path k based on a diversion of luggage units GE.

It is also possible that the transport of selected luggage units GE is prioritized. This may be, for example, to baggage units GE, which must be promoted as quickly as possible from a task point a ₁ to a _X to an output point z ₁ to z _n , as these z. B. were abandoned just before a departure time. In this case, the prioritized luggage units GE are, for example, transported on separate transport paths k to the delivery points z ₁ to z _{n in} order to achieve the shortest possible throughput time.

Furthermore, each luggage unit GE is assigned at least one output point z ₁ to z _n . It is however, it is also possible for a baggage unit GE to be assigned a plurality of delivery points z ₁ to z _n in the baggage transport network since, for example, a customs check of the baggage units GE is carried out before the baggage transport network finally removes the baggage units GE.

For a model determination, control and monitoring of the routes R for transporting the baggage units GE, the baggage transport network becomes the recurrent neural simulation network 1 displayed. The recurrent neural simulation network 1 In this case, it has several layers d ₁ to d _n , wherein a layer d ₁ to d _{n contains} one or more transport paths k from one or more delivery points a ₁ to a _X at exactly one delivery point z ₁ to z _n .

In addition to the recurrent neural simulation network 1 are in a recurrent linear error propagation network 2 Target functions ZF are stored, which take into account the throughput time and the transport capacity k _{K of} the transport routes k. By means of the target functions ZF and the detection of current conditions of the baggage transport network, z. As the capacity k _{A of} the transport routes k or an amount of to be transported luggage units GE, the simulation network 1 controlled.

In the baggage transport network, it is possible for one or more baggage units GE to have a different delivery point z ₁ to z _n during transport to an issue point a ₁ to a _X , e.g. B. in the context of a random inspection of a baggage unit GE assigned.

In this case, the baggage unit GE is in an assignment of a different output point z ₁ to z _n on a transport path k during the transport of a new layer d ₁ to d _{n of} the simulation network 1 wherein the new layer d ₁ to d _{n may} be any layer d ₁ to d _n excluding an original layer d ₁ to d _n .

zugeordnet, mittels welcher eine Anzahl x der zu befördernden Gepäckeinheiten GE auf einem Transportweg k in einer Schicht d₁ bis d_n zu einem Zeitpunkt t beschrieben wird.Each layer d ₁ to d _n becomes a state variable

assigned, by means of which a number x of the luggage units GE to be transported on a transport path k in a layer d ₁ to d _n at a time t is described.

der ursprünglichen Schicht d₁ bis d_n gemäß

geändert. Bei der Zuordnung der Gepäckeinheit GE zu einer neuen Schicht d₁ bis d_n wird die Zustandsvariable

der neuen Schicht d₁ bis d_n gemäß

geändert.In the assignment of the baggage unit GE to a new layer d ₁ to d _n , the state variable

the original layer d ₁ to d _n according to

changed. In the assignment of the baggage unit GE to a new layer d ₁ to d _n , the state variable

the new layer d ₁ to d _n according to

changed.

If a luggage unit GE is transported, for example, from the delivery point a ₁ to the delivery point z ₁ , the luggage unit GE is located in the first layer d _{1 of} the simulation network 1 , If a delivery point z ₂ deviating from the delivery point z ₁ is assigned during the transport of the baggage unit GE at a time t on a transport path k, the baggage unit GE becomes in the simulation network 1 model transferred to the layer d ₂ .

der ersten Schicht d₁ gemäß

geändert.When the luggage unit GE is transferred to the second layer d ₂ , the state variable is transferred

the first layer d ₁ according to

changed.

der zweiten Schicht d₂ gemäß

geändert.At the same time the state variable becomes

the second layer d ₂ according to

changed.

über alle Schichten d₁ bis d_n konstant.In the assignment of one or more luggage units GE to new layers d ₁ to d _n remains the Sum of the baggage units GE to be transported at a time t in the on the simulation network 1 pictured baggage transport law according to

over all layers d ₁ to d _n constant.

zu jeder Schicht d₁ bis d_n kann zu jedem Zeitpunkt t die Auslastung k_A der Transportwege k ermittelt werden, so dass stets eine bestmögliche Verteilung der Gepäckeinheiten GE auf den verschiedenen Transportwegen k und eine optimale Berechnung und Steuerung der Routen R erzielt wird. Weiterhin werden die Auslastungen k_A und die Beförderungskapazitäten k_K der einzelnen Schichten d₁ bis d_n im Simulationsnetz 1 angepasst und die veränderten Zustandsgrößen können in den Zielfunktionen ZF des Fehlerpropagierungsnetzes 2 für eine weitere Ermittlung und Steuerung der Routen R berücksichtigt werden.Based on the assignment of the state variable

For each layer d ₁ to d _n , the load k _{A of} the transport paths k can be determined at each time t, so that the best possible distribution of the luggage units GE on the different transport paths k and optimal calculation and control of the routes R is achieved. Furthermore, the loadings k _A and the transport capacities k _{K of} the individual layers d ₁ to d _n in the simulation network 1 adapted and the changed state variables can in the target functions ZF of the error propagation network 2 be considered for a further determination and control of the routes R.

In summary, it is by means of the method according to the invention in an advantageous manner by extension of the patents DE 198 58 477 B4 and DE 102 62 074 B4 described method by means of the recurrent neural simulation network 1 and the recurrent linear error propagation network 2 to model the baggage transport network in such a way that a determination and control of routes R for the carriage of baggage units GE is achieved.

erreicht wird.In particular, the possible consideration of the assignment of a different output point d ₁ to d _n during the transport of the luggage units GE represents the further development of the known methods, wherein the consideration by the extension of the state variables

is reached.

QUOTES INCLUDE IN THE DESCRIPTION

This list The documents listed by the applicant have been automated generated and is solely for better information recorded by the reader. The list is not part of the German Patent or utility model application. The DPMA takes over no liability for any errors or omissions.

Cited patent literature

• - DE 19858477 B4 [0004, 0014, 0014, 0020, 0026, 0027, 0027, 0043]
• - DE 10262074 B4 [0004, 0014, 0014, 0020, 0026, 0027, 0027, 0043]

Claims (11)

Method for the dynamic determination and control of routes (R) for transporting baggage units (GE) in a baggage transport network, wherein: - the baggage units (GE) are fed to the baggage transport network at a plurality of delivery points (a ₁ to a _X ) and at several delivery points (z ₁ to z _n ) are taken from the baggage transport network; - each luggage unit (GE) is assigned at least one output point (z ₁ to z _n ); - between a pick-up point (a ₁ to a _X ) and an output point (z ₁ to z _n ) different transport routes (k) are used to transport the luggage units (GE); The route (R) for transporting the luggage units (GE) is determined as a function of a load (k _A ) and a transport capacity (k ₄ ) of the transport routes (k); - the load (k _A ) of the transport routes (k) is controlled by a distribution of the baggage units (GE) on these; - At a high load (k _A ) of a transport route (k) on the determined route (R) during the transport of the luggage units (GE) an alternative route (R) is determined, so that one or more luggage units (GE) on different routes (k) be redirected. Method according to Claim 1, characterized in that the baggage transport network is based on a recurrent neural simulation network ( 1 Which (over several layers d ₁ wherein a layer (d ₁ to d _n) is shown), to d _n) has one or more transport paths (k) to accurately (an output point z ₁ to z comprises _n) and a recurrent linear Error Propagation Network ( 2 ), which includes target functions (IF), is used to determine and control the routes (R) by means of the error propagation network (FIG. 2 ) the simulation network ( 1 ) is controlled. Method according to claim 2, characterized in that by means of the target functions (ZF) of the error propagation network ( 2 ) a transit time of the baggage units (GE) and the transport capacity (k _K ) of the transport routes (k) to the delivery point (z ₁ to z _n ) are taken into account in determining the route (R) for transporting the baggage units (GE). A method according to claim 2 or 3, characterized in that a luggage unit (GE) at an assignment of a different output point (z ₁ to z _n ) during transport on a transport path (k) a new layer (d ₁ to d _n ) of the simulation network 1 wherein the new layer (d ₁ to d _n ) is any layer (d ₁ to d _n ) excluding an original layer (d ₁ to d _n ). A method according to claim 4, characterized in that each layer (d ₁ to d _n ) is a state variable

is assigned. Method according to claim 5, characterized in that by means of the state variable

a number (x) of the baggage units (GE) to be transported on a transport path (k) in a layer (d ₁ to d _n ) at a time (t) is described. A method according to claim 5 or 6, characterized in that in the assignment of the baggage unit (GE) to a new layer (d ₁ to d _n ), the state variable

the original layer (d ₁ to d _n ) according to

will be changed. Method according to one of claims 5 to 7, characterized in that in the assignment of the baggage unit (GE) to the new layer (d ₁ to d _n ), the state variable

the new layer (d ₁ to d _n ) according to

will be changed. Method according to one of claims 5 to 8, characterized in that in the assignment of the baggage unit (GE) to a new layer (d ₁ to d _n ) a sum of the luggage units to be transported (GE) according to

remains constant over all layers (d ₁ to d _n ). Method according to one of claims 1 to 9, characterized in that the transport selected Luggage units (GE) is prioritized. Apparatus for carrying out a method according to claims 1 to 10 in a baggage transport network, comprising a control unit for controlling the routes (R) of luggage units (GE) to be transported, means for detecting and locating the respective baggage unit (GE) and means for determining the utilization (k _A ) and the transport capacity (k _K ) of the transport routes (k).