A method for merging, in a logistics warehouse, k incoming flows of payloads, transported respectively by k conveyors called aisles a i with i ∈ {1,..., k}, in one outgoing flow of payloads, transported by another conveyor called collector, the logistics warehouse being such that: - the k aisles are of the "first-in first-out" type, distributed along the collector and numbered from a 1 to a k in a direction of displacement of the collector, and - Δ i is a time distance between the aisles a i and a k expressed in time units each corresponding to a time step of the collector, the method being executed at least once by a drive system, a given execution being performed at a time Tb and comprising: - obtaining a set L comprising n payloads distributed at the time Tb over the k aisles and to be injected onto the collector to form an output sequence σ, each of the n payloads being identified by a unique sequence number within the output sequence σ, each of the k aisles containing an ordered set, according to an increasing sense of the sequence number, of h i payloads to be injected one by one onto the collector; the method being characterised in that it comprises the following steps - calculating a date to on which the first payload σ 1, of the output sequence σ passes in front of the aisle a k; - calculating a date of injection onto the collector for each of the n payloads of the set L, according to the following formula: T ( u) = t 0 + σ ( u) - 1 - Δ i, with: * u = a i ( j) ∈ L, a payload of the set L and originating from the coming from the j th position in the aisle a i, i ∈ {1,..., k}, j ∈ {1,..., h i}, * σ ( u) the sequence number of the payload u in the output sequence σ; - controlling the collector of the k aisles, for an injection of the n payloads onto the collector in accordance with the n injection dates T(u), Vu E L. the logistics warehouse being such that: - the k aisles are of the "first-in first-out" type, distributed along the collector and numbered from a 1 to a k in a direction of displacement of the collector, and - Δ i is a time distance between the aisles a i and a k expressed in time units each corresponding to a time step of the collector, - the k aisles are of the "first-in first-out" type, distributed along the collector and numbered from a 1 to a k in a direction of displacement of the collector, and - Δ i is a time distance between the aisles a i and a k expressed in time units each corresponding to a time step of the collector, the method being executed at least once by a drive system, a given execution being performed at a time Tb and comprising: - obtaining a set L comprising n payloads distributed at the time Tb over the k aisles and to be injected onto the collector to form an output sequence σ, each of the n payloads being identified by a unique sequence number within the output sequence σ, each of the k aisles containing an ordered set, according to an increasing sense of the sequence number, of h i payloads to be injected one by one onto the collector; - obtaining a set L comprising n payloads distributed at the time Tb over the k aisles and to be injected onto the collector to form an output sequence σ, each of the n payloads being identified by a unique sequence number within the output sequence σ, each of the k aisles containing an ordered set, according to an increasing sense of the sequence number, of h i payloads to be injected one by one onto the collector; the method being characterised in that it comprises the following steps - calculating a date to on which the first payload σ 1, of the output sequence σ passes in front of the aisle a k; - calculating a date of injection onto the collector for each of the n payloads of the set L, according to the following formula: T ( u) = t 0 + σ ( u) - 1 - Δ i, with: * u = a i ( j) ∈ L, a payload of the set L and originating from the coming from the j th position in the aisle a i, i ∈ {1,..., k}, j ∈ {1,..., h i}, * σ ( u) the sequence number of the payload u in the output sequence σ; - controlling the collector of the k aisles, for an injection of the n payloads onto the collector in accordance with the n injection dates T(u), Vu E L. - calculating a date to on which the first payload σ 1, of the output sequence σ passes in front of the aisle a k; - calculating a date of injection onto the collector for each of the n payloads of the set L, according to the following formula: T ( u) = t 0 + σ ( u) - 1 - Δ i, with: * u = a i ( j) ∈ L, a payload of the set L and originating from the coming from the j th position in the aisle a i, i ∈ {1,..., k}, j ∈ {1,..., h i}, * σ ( u) the sequence number of the payload u in the output sequence σ; * u = a i ( j) ∈ L, a payload of the set L and originating from the coming from the j th position in the aisle a i, i ∈ {1,..., k}, j ∈ {1,..., h i}, * σ ( u) the sequence number of the payload u in the output sequence σ; - controlling the collector of the k aisles, for an injection of the n payloads onto the collector in accordance with the n injection dates T(u), Vu E L.