Method for merging, within a logistical warehouse, k incoming flows of payloads into one outgoing flow

A method for merging, within a logistical warehouse, k incoming flows of payloads, transported respectively by k conveyors called lanes αi with i∈{1, . . . , k}, into one outgoing flow of payloads, transported by another conveyor called a collector, the logistical warehouse being such that:

• the k lanes are of a “first-in-first-out” type, distributed along the collector and numbered a1 to ak in one sense of movement of the collector, and
• Δi is a time-related distance between the lanes ai and ak expressed in time units each corresponding to one time span of the collector,
• the method being executed at least once by a control system, a given execution being done at an instant Tb and comprising:
• obtaining a set comprising n payloads distributed at the instant Tb on the k lanes and having to be injected into the collector to form an exit sequence σ, each of the n payloads being identified by a single sequence number within the exit sequence σ, each of the k lanes containing an ordered set, in a rising order of sequence numbers, of hi payloads having to be injected one by one into the collector;
• for each lane ai, i∈{1, . . . , k}, obtaining a set Ui of dates not valid for an injection of one of the payloads of the lane ai into the collector because of a non-controlled disturbing load or another obstruction of a time span of the collector;
• in not taking account of the sets Ui, i∈{1, . . . , k}, computing a date t0 at which the first payload σ1 of the exit sequence a passes in front of the lane ak;
• for the first payload σ1 of the exit sequence a, in assuming that the first payload σ1 comes from the lane ai:
• a) initializing t with t0;
• b) if none of the dates t, t−Δk-1, t−Δk-2, . . . , t−Δi belongs respectively to the sets Uk, Uk-1, Uk-2, . . . , Ui, computing a date of injection of the first payload σ1=αi(j);
• into the collector with the following formula:
• T(u)=t−Δi, with u=σ1=αi(j);
• c) if one of the dates t, t−Δk-1, t−Δk-2, . . . , t−Δi belongs respectively to one of the sets Uk, Uk-1, Uk-2, . . . , Ui, incrementing t by one unit and reiterating b) and c) with the new value of t ;
• for each following payload σc of the exit sequence σ, c∈{2, . . . , n}, in assuming that the following payload a comes from the lane a:
• a′) incrementing t by one unit, with t used to compute the date of injection of the preceding payload σc-1;
• b′) if none of the dates t, t−Δk-1, t−Δk-2, . . . , t−Δi belongs respectively to the sets Uk, Uk-1, Uk-2, . . . , Ui, computing a date of injection of the following payload σc into the collector with the following formula:
• T(u)=t−Δi, with u=σc=αi(j);
• c′) if one of the dates t, t−Δk-1, t−Δk-2, . . . , t−Δi belongs respectively to one of the sets Uk, Uk-1, Uk-2, . . . , ui, incrementing t by one unit and reiterating b′) and c′) with the new value of t;
• commanding the collector and the k lanes for an injection of the n payloads into the collector in compliance with the n injection dates T(u),∀u∈L.