[go: up one dir, main page]

WO2024250054A1 - Appareil de commande et procédé de système de transport - Google Patents

Appareil de commande et procédé de système de transport Download PDF

Info

Publication number
WO2024250054A1
WO2024250054A1 PCT/AU2023/050504 AU2023050504W WO2024250054A1 WO 2024250054 A1 WO2024250054 A1 WO 2024250054A1 AU 2023050504 W AU2023050504 W AU 2023050504W WO 2024250054 A1 WO2024250054 A1 WO 2024250054A1
Authority
WO
WIPO (PCT)
Prior art keywords
tray
lane
cost
empty
transport
Prior art date
Application number
PCT/AU2023/050504
Other languages
English (en)
Inventor
Thibaut Jacques Olivier CAPLAIN
Jimmy Shih-Sung LIN
Malliyawadu Vipul Priyantha GUNASEKARA
Sebastien Christophe Jean-Pierre MAHE
Original Assignee
Daifuku Oceania Limited
Daifuku Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Daifuku Oceania Limited, Daifuku Co., Ltd. filed Critical Daifuku Oceania Limited
Priority to PCT/AU2023/050504 priority Critical patent/WO2024250054A1/fr
Publication of WO2024250054A1 publication Critical patent/WO2024250054A1/fr

Links

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B64—AIRCRAFT; AVIATION; COSMONAUTICS
    • B64F—GROUND OR AIRCRAFT-CARRIER-DECK INSTALLATIONS SPECIALLY ADAPTED FOR USE IN CONNECTION WITH AIRCRAFT; DESIGNING, MANUFACTURING, ASSEMBLING, CLEANING, MAINTAINING OR REPAIRING AIRCRAFT, NOT OTHERWISE PROVIDED FOR; HANDLING, TRANSPORTING, TESTING OR INSPECTING AIRCRAFT COMPONENTS, NOT OTHERWISE PROVIDED FOR
    • B64F1/00—Ground or aircraft-carrier-deck installations
    • B64F1/36—Other airport installations
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B64—AIRCRAFT; AVIATION; COSMONAUTICS
    • B64F—GROUND OR AIRCRAFT-CARRIER-DECK INSTALLATIONS SPECIALLY ADAPTED FOR USE IN CONNECTION WITH AIRCRAFT; DESIGNING, MANUFACTURING, ASSEMBLING, CLEANING, MAINTAINING OR REPAIRING AIRCRAFT, NOT OTHERWISE PROVIDED FOR; HANDLING, TRANSPORTING, TESTING OR INSPECTING AIRCRAFT COMPONENTS, NOT OTHERWISE PROVIDED FOR
    • B64F1/00—Ground or aircraft-carrier-deck installations
    • B64F1/36—Other airport installations
    • B64F1/368—Arrangements or installations for routing, distributing or loading baggage
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G37/00—Combinations of mechanical conveyors of the same kind, or of different kinds, of interest apart from their application in particular machines or use in particular manufacturing processes
    • B65G37/02—Flow-sheets for conveyor combinations in warehouses, magazines or workshops
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G43/00—Control devices, e.g. for safety, warning or fault-correcting
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G47/00—Article or material-handling devices associated with conveyors; Methods employing such devices
    • B65G47/22—Devices influencing the relative position or the attitude of articles during transit by conveyors
    • B65G47/26—Devices influencing the relative position or the attitude of articles during transit by conveyors arranging the articles, e.g. varying spacing between individual articles
    • B65G47/261—Accumulating articles
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G47/00—Article or material-handling devices associated with conveyors; Methods employing such devices
    • B65G47/22—Devices influencing the relative position or the attitude of articles during transit by conveyors
    • B65G47/26—Devices influencing the relative position or the attitude of articles during transit by conveyors arranging the articles, e.g. varying spacing between individual articles
    • B65G47/30—Devices influencing the relative position or the attitude of articles during transit by conveyors arranging the articles, e.g. varying spacing between individual articles during transit by a series of conveyors
    • B65G47/32—Applications of transfer devices
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G47/00—Article or material-handling devices associated with conveyors; Methods employing such devices
    • B65G47/34—Devices for discharging articles or materials from conveyor 
    • B65G47/46—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points
    • B65G47/51—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points according to unprogrammed signals, e.g. influenced by supply situation at destination
    • B65G47/5104—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points according to unprogrammed signals, e.g. influenced by supply situation at destination for articles
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B07—SEPARATING SOLIDS FROM SOLIDS; SORTING
    • B07C—POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING
    • B07C3/00—Sorting according to destination
    • B07C3/02—Apparatus characterised by the means used for distribution
    • B07C3/08—Apparatus characterised by the means used for distribution using arrangements of conveyors
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2201/00—Indexing codes relating to handling devices, e.g. conveyors, characterised by the type of product or load being conveyed or handled
    • B65G2201/02—Articles
    • B65G2201/0235—Containers
    • B65G2201/0258—Trays, totes or bins
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2201/00—Indexing codes relating to handling devices, e.g. conveyors, characterised by the type of product or load being conveyed or handled
    • B65G2201/02—Articles
    • B65G2201/0264—Luggage
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2201/00—Indexing codes relating to handling devices, e.g. conveyors, characterised by the type of product or load being conveyed or handled
    • B65G2201/02—Articles
    • B65G2201/0285—Postal items, e.g. letters, parcels
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2203/00—Indexing code relating to control or detection of the articles or the load carriers during conveying
    • B65G2203/02—Control or detection
    • B65G2203/0208—Control or detection relating to the transported articles
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2203/00—Indexing code relating to control or detection of the articles or the load carriers during conveying
    • B65G2203/02—Control or detection
    • B65G2203/0266—Control or detection relating to the load carrier(s)
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2203/00—Indexing code relating to control or detection of the articles or the load carriers during conveying
    • B65G2203/04—Detection means
    • B65G2203/041—Camera
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2203/00—Indexing code relating to control or detection of the articles or the load carriers during conveying
    • B65G2203/04—Detection means
    • B65G2203/042—Sensors
    • B65G2203/044—Optical
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2203/00—Indexing code relating to control or detection of the articles or the load carriers during conveying
    • B65G2203/04—Detection means
    • B65G2203/042—Sensors
    • B65G2203/046—RFID
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G47/00—Article or material-handling devices associated with conveyors; Methods employing such devices
    • B65G47/22—Devices influencing the relative position or the attitude of articles during transit by conveyors
    • B65G47/26—Devices influencing the relative position or the attitude of articles during transit by conveyors arranging the articles, e.g. varying spacing between individual articles
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G47/00—Article or material-handling devices associated with conveyors; Methods employing such devices
    • B65G47/34—Devices for discharging articles or materials from conveyor 
    • B65G47/46—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points
    • B65G47/51—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points according to unprogrammed signals, e.g. influenced by supply situation at destination
    • B65G47/5104—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points according to unprogrammed signals, e.g. influenced by supply situation at destination for articles
    • B65G47/5109—Devices for discharging articles or materials from conveyor  and distributing, e.g. automatically, to desired points according to unprogrammed signals, e.g. influenced by supply situation at destination for articles first In - First Out systems: FIFO
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G65/00—Loading or unloading

Definitions

  • An object of the present invention is provide a control apparatus and a control method of a conveyance system to improve operational efficiency of conveyance systems.
  • a control apparatus of a conveyance system having a plurality of lanes, through which a conveyance element travels comprises: a candidate finder for setting a plurality of prospective routes each including a plurality of segments of the lanes through which the conveyance element may travel to a destination; a cost estimator for calculating a possible cost of each lane segment of the prospective routes; a route decider for setting a conclusive route, which has a combination of the lane segments, by designating one of the prospective routes based on the possible cost calculated by the cost estimator; and a conveyor controller for controlling the conveyor system to dispatch the conveyance element to the destination along the lanes corresponding to the conclusive route set by the route decider, wherein the cost estimator includes, a static-cost calculator for calculating a static cost which is an effort value related to a static-required time if the conveyance element travels to the destination through the respective lane segments, a status-cost calculator for calculating a status cost which
  • the prospective routes include, a basic route having a basic combination of the lane segments through which the conveyance element may travel to the destination, and a plurality of alternative routes, which are defined in a route list, each having an alternative combination of the lane segments, which is different to the basic combination, through which the conveyance element may travel to the destination.
  • the cost estimator calculates the possible cost of the lane segments of each of the basic and alternative routes.
  • the route decider sets the conclusive route by designating one of the basic route and the alternative routes based on the possible cost calculated by the cost estimator. [0008]
  • the route decider sets the conclusive route by designating one of the prospective routes which has the lowest possible cost.
  • a gridlock preventer restricts additional entry of the conveyance element into a congestion area, which is an area defined in the conveyance system, if an existing number of the conveyance element in the congestion area has reached a congestion capacity of the congestion area.
  • a divergent-blockage preventer prevents a divergent-point blockage at a divergent point from which the plurality of lanes are branched. The divergent-blockage preventer controls the conveyor system, irrespective of the conclusive route set by the route decider, to divert the conveyance element to an available lane of the branch lanes, if the divergent- blockage preventer predicts that the conveyance element stops at the divergent point for entering into a blocked lane of the branch lanes.
  • the conveyor system is a tray-conveyor system including a tray- conveyor network in which a tray travels for carrying a transport object on the tray.
  • the static-cost calculator calculates the static cost based on a length of the respective lane segments and a forwarding speed of the respective lane segments.
  • the dynamic factor is based on element status of the conveyance element. The element status is related to at least one of: tray state of the tray; tray type of the tray; transport-object state of the transport object put on the tray; and transport-object type of the transport object put on the tray.
  • An empty-tray managing module manages each empty tray in the tray- conveyor network.
  • the empty-tray control module includes an empty-tray dispatcher.
  • the empty-tray dispatcher carries out an empty-tray-allocation control for dispatching each of the empty trays to either a tray-demand area or a tray- supply area. [0016]
  • the empty-tray dispatcher carries out the empty-tray-allocation control for the tray-demand area in accordance with an empty-tray priority calculated based on at least one of: a receivable capacity related to a number of available slots in which the empty trays can be accommodated in the tray-demand area; a waiting number of the transport objects lining up for being placed onto the respective empty trays in the tray-demand area; an in-stock number of the empty trays lining up for receiving the transport objects in the tray-demand area; and an under-way number of the empty trays travelling towards the tray-demand area.
  • a loading controller controls both a loading unit and a buffer lane.
  • the tray-conveyor system further includes, the loading unit for respectively placing each of the plurality of transport objects onto each of the plurality of empty trays, and the buffer lane for keeping the empty trays on standby for receiving the transport objects fed from the loading unit.
  • the loading controller controls the loading unit and the buffer lane by carrying out an empty-tray-synchronising control so as to synchronise each empty tray at a loading point, which is adjacent to the loading unit in the buffer lane, with each of the transport objects fed from the loading unit.
  • a tray releaser prevents a buffer-lane blockage at a buffer-lane inlet from which the plurality of lanes including the buffer lane are branched.
  • a history recorder records a tray history of each of the trays.
  • a due-tray dispatcher dispatches a due tray to a maintenance lane in which maintenance work is performed on the due tray.
  • the due tray is an empty tray of which the tray history satisfies a maintenance condition.
  • the conveyor system is a belt conveyor system including a belt- conveyor network having a plurality of belt-conveyor lanes by which a transport object is carried.
  • the static-cost calculator calculates the static cost based on a length of the respective lane segments and a forwarding speed of the respective lane segments of the belt-conveyor network.
  • the dynamic factor is based on element status of the conveyance element. The element status is related to at least one of: transport-object state of the transport object; and transport-object type of the transport object put on the tray.
  • the dynamic factor is based on time status. The time status is related to at least one of: time ranges of a day; days of a week; and type of a touristic season.
  • the conveyance system is installed in a transport facility.
  • the dynamic factor is based on transport status.
  • the transport status is related to at least one of: a departure time of public transport; and a number of operations of the public transport in a time window.
  • a element-history analyser analyses an element history of the conveyance element; and An analysis concierge explains a result of the element-history analysis carried out by the element-history analyser to a questioner.
  • a control method of a conveyance system having a plurality of lanes, through which a conveyance element travels comprises steps of: setting a plurality of prospective routes each including a plurality of segments of the lanes through which the conveyance element may travel to a destination; calculating a possible cost of each lane segment of the prospective routes; setting a conclusive route, which has a combination of the lane segments, by designating one of the prospective routes based on the possible cost calculated by the cost estimator; and controlling the conveyor system to dispatch the conveyance element to the destination along the lanes corresponding to the conclusive route set by the route decider, wherein the possible-cost-calculating step includes steps of, calculating a static cost which is an effort value related to a static- required time if the conveyance element travels to the destination through the respective lane segments, calculating a status cost which is an effort value related to lane status of the respective lane segments, calculating a dynamic cost which is an effort value in accordance with a dynamic factor, and
  • the prospective routes includes, a basic route having a basic combination of the lane segments through which the conveyance element may travel to the destination, and a plurality of alternative routes, which are defined in a route list, each having an alternative combination of the lane segments, which is different to the basic combination, through which the conveyance element may travel to the destination.
  • the step possible-cost calculating step calculates the possible cost of the lane segments of each of the basic and alternative routes.
  • the conclusive-route setting step sets the conclusive route by designating one of the basic route and the alternative routes based on the possible cost calculated by the possible-cost calculating step. [0028]
  • the conclusive-route setting step sets the conclusive route by designating one of the prospective routes which has the lowest possible cost.
  • a gridlock preventing step restricts additional entry of the conveyance element into a congestion area, which is an area defined in the conveyance system, if an existing number of the conveyance element in the congestion area has reached a congestion capacity of the congestion area.
  • a divergent-blockage preventing step prevents a divergent blockage at a divergent point from which the plurality of lanes are branched. The divergent-blockage preventing step controls the conveyor system, irrespective of the conclusive route set by the route decider, to divert the conveyance element to an available lane of the branch lanes, if the conveyance element is predicted to stop at the divergent point for entering into a blocked lane of the branch lanes.
  • the conveyor system is a tray-conveyor system including a tray- conveyor network in which a tray travels for carrying a transport object on the tray.
  • the static-cost calculating step calculates the static cost based on a length of the respective lane segments and a forwarding speed of the respective lane segments.
  • the dynamic factor is based on element status of the conveyance element. The element status is related to at least one of: tray state of the tray; tray type of the tray; transport-object status of the transport object put on the tray; and transport-object type of the transport object put on the tray.
  • An empty-tray managing step manages each empty tray in the tray- conveyor network.
  • the empty-tray managing step includes a step of carrying out an empty-tray-allocation control that dispatches each of the empty trays to either a tray-demand area or a tray-supply area.
  • the empty-tray dispatching step carries out the empty-tray-allocation control for the tray-demand area in accordance with an empty-tray priority calculated based on at least one of: a receivable capacity related to a number of available slots in which the empty trays can be accommodated in the tray-demand area; a waiting number of the transport objects lining up for being placed onto the respective empty trays in the tray-demand area; an in-stock number of the empty trays lining up for receiving the transport objects in the tray-demand area; and an under-way number of the empty trays travelling towards the tray-demand area.
  • a load controlling step controls both a loading unit and a buffer lane.
  • the tray-conveyor system further includes, the loading unit for respectively placing each of the plurality of transport objects onto each of the plurality of empty trays, and the buffer lane for keeping the empty trays on standby for receiving the transport objects fed from the loading unit.
  • the load controlling step controls the loading unit and the buffer lane by carrying out an empty-tray synchronising control so as to synchronise each empty tray at a loading point, which is adjacent to the loading unit in the buffer lane, with each of the transport objects fed from the loading unit.
  • a buffer-lane blockage preventing step prevents a buffer-lane blockage at a buffer-lane inlet from which the plurality of lanes including the buffer lane are branched by such a manner that if another empty tray, which is approaching to the buffer lane, is predicted to stop at the buffering-lane inlet to enter the buffer lane, then forcibly releasing at least one of the empty trays kept in the buffer lane towards a downstream and permits the approaching empty tray entering into the buffer lane.
  • a tray-history recording step records a tray history of each of the trays.
  • a due-tray dispatching step dispatches a due tray to a maintenance lane in which maintenance work is performed on the due tray.
  • the due tray is an empty tray of which the tray history satisfies a maintenance-required condition.
  • the conveyor system is a belt conveyor system including a belt- conveyor network having a plurality of belt-conveyor lanes by which a transport object is carried.
  • the static-cost calculating step calculates the static cost based on a length of the respective lane segments and a forwarding speed of the respective lane segments of the belt-conveyor network.
  • the dynamic factor is based on element status of the conveyance element. The element status is related to at least one of: transport-object state of the transport object; and transport-object type of the transport object put on the tray.
  • the dynamic factor is based on time status.
  • the time status is related to at least one of: time ranges of a day; days of a week; and type of a touristic season.
  • the conveyance system is installed in a transport facility.
  • the dynamic factor is based on transport status.
  • the transport status is related to at least one of: a departure time of public transport; and a number of operations of the public transport in a time window.
  • An element-history analysing step analyses an element-history of the conveyance element.
  • An analysis explaining step explains a result of the analysis carried out by the element-history analysis step to a questioner.
  • FIG 1 is a schematic block diagram showing a conveyance-system control apparatus according to an embodiment of the present invention.
  • FIG 2 is a schematic view showing a part of a baggage tray system which is managed by the conveyance-system control apparatus.
  • FIG 3 is a schematic diagram of a tray-conveyor network of the baggage tray system which is managed by the conveyance-system control apparatus.
  • FIG 4 is an enlarged schematic diagram showing a part of the tray- conveyor network shown in FIG 3.
  • FIG 5(A) is a schematic diagram showing the results of a route search based only on a static cost in the tray-conveyor network shown in FIG 4.
  • FIG 5(B) is a schematic diagram showing the results of a route search based on the static cost and a status cost in the tray-conveyor network shown in FIG 5(A).
  • FIG 5(C) is a schematic diagram showing lane segments of the tray- conveyor network shown in FIG 5(B) to which a dynamic cost is applied.
  • FIG 6(A) is a schematic diagram showing a conclusive route set for a standard tray in a loaded state in the tray-conveyor network shown in FIG 5(C).
  • FIG 6(B) is a schematic diagram showing the conclusive route set for a long tray in a loaded state in an empty state in the tray-conveyor network shown in FIG 5(C).
  • FIG 7 is an enlarged schematic diagram showing a part of the tray- conveyor network shown in FIG 3.
  • FIG 8(A) is a schematic diagram showing a case where two trays exist in a congestion area in the tray-conveyor network shown in FIG 7.
  • FIG 8(B) is a schematic diagram showing a case where three trays exist in the congestion area in the tray-conveyor network shown in FIG 7.
  • FIG 9(A) is a schematic diagram showing a case where four trays exist in the congestion area in the tray-conveyor network shown in FIG 7.
  • FIG 9(B) is a schematic diagram showing a case where entry of a new tray into the congestion area is temporarily prohibited in the tray-conveyor network shown in FIG 7.
  • FIG 10(A) is a schematic diagram showing a case where entry of the new tray into the congestion area is permitted in the tray-conveyor network shown in FIG 7.
  • FIG 10(B) is a schematic diagram showing a case where the new tray has entered the congestion area in the tray-conveyor network shown in FIG 7.
  • FIG 11(A) is an enlarged schematic diagram showing a part of the tray- conveyor network shown in FIG 3.
  • FIG 11(B) is a schematic diagram showing a case where branch point blockage occurs in the tray transport network shown in FIG 11(A).
  • FIG 12(A) is a schematic diagram showing a case where a tray is detoured to an available lane in the tray-conveyor network shown in FIG 11(A).
  • FIG 12(B) is a schematic diagram showing a case where a subsequent tray was not hindered from travelling in the tray-conveyor network shown in FIG 12(A).
  • FIG 13 is an enlarged schematic diagram showing a part of the tray- conveyor network shown in FIG 3.
  • FIG 14 is a schematic diagram showing a case where a buffer-lane blockage occurs in tray-conveyor network shown in FIG 13.
  • FIG 15 is a schematic diagram showing a case where a waiting tray is forcibly released in the tray transport network shown in FIG 14.
  • FIG 16 is a schematic diagram showing a case where a new tray has entered a buffer lane in the tray-conveyor network shown in FIG 15.
  • FIG 17 is a main flow chart schematically showing operation of the conveyance-system control apparatus and the conveyance-system control method according to the embodiment of the present invention.
  • FIG 18 is a sub-flowchart, relating to empty-tray management, schematically showing operation of the conveyance-system control apparatus and the conveyance according to the embodiment of the present invention.
  • FIG 19 is a sub-flowchart, relating to override control, schematically showing operation of the conveyance-system control apparatus and the conveyance according to the embodiment of the present invention. Description of the Preferred Embodiments [0064] An embodiment of the present invention will now be described with reference to FIGs 1 to 19.
  • the conveyance-system control apparatus in this embodiment is configured as a flow-control server 1 of a baggage tray system (BTS) 2 installed at an airport.
  • This baggage tray system 2 is mainly composed of a BTS controller 3 and a BTS network (tray-conveyor network) 4.
  • the BTS controller 3 is a control device including a plurality of Programmable Logic Controller (PLC) units.
  • PLC Programmable Logic Controller
  • the BTS controller 3 is connected to electric devices of the BTS network 4 so that these electric devices can be individually or integrally controlled.
  • the BTS controller 3 is also connected to the flow-control server 1 so as to be able to communicate with each other.
  • the flow- control server 1 can always monitor the operational status of the BTS network 4 and control the BTS network 4 via the BTS controller 3.
  • the baggage tray system 2 unlike a general belt conveyor system, conveys transport objects (e.g., soft bags (not shown), suitcases 6002-6004, parcels (not shown), etc.).
  • transport objects e.g., soft bags (not shown), suitcases 6002-6004, parcels (not shown), etc.
  • Each of transport objects is individually mounted on the trays 6005-6007 travelling in a lane 6001 and transported.
  • Each of the trays 6005-6007 is driven by an electric motor (not shown) provided in the lane 6001 so that each of the trays 6005-6007 can individually travel within the BTS network 4.
  • Tray types include standard size and long size.
  • a tray of a standard size is called a standard tray, and a tray of a long size is called a long tray.
  • standard trays are used in principle, but long trays can also be used depending on the situation.
  • Each tray is assigned an individual identification ID (tray ID).
  • An RFID tag (not shown) is attached to each tray.
  • each lane of the BTS network 4 is provided with a plurality of RFID sensors (not shown).
  • the BTS network 4 is provided with a plurality of photoelectric sensors (not shown).
  • the flow-control server based on the detection results of various sensors including these RFID sensors and photoelectric sensors, constantly monitors a tray state including, but not limited to, position, travel speed, loaded/empty with regard to each tray in the BTS network 4.
  • a tray loaded with a transport object is called a 'loaded tray'
  • a tray loaded with nothing is called an 'empty tray'.
  • the name 'conveying element(s)' may be used as a generic name for the transport object(s) the tray(s).
  • the BTS network 4 has multiple lanes. Each lane is assigned an individual identification number. However, in this embodiment, in order to make the description clearer, only the lanes shown below are labelled.
  • A-lane group 24 lanes 101-110
  • B-lane group 25 lanes 201-206
  • C-lane group 26 lanes 301-303
  • D-lane group 27 lanes 401-404 [0070]
  • the flow-control server 1 is equipped with application software as follows.
  • the flow control server 1 includes hardware devices (not shown) such as a central processing unit (CPU), a storage device, a communication device, and a power supply device.
  • the conveyor controller 5 is a program module that controls the baggage tray system 2 via the BTS controller 3 so as to dispatch the trays to the destination along the lanes corresponding to the conclusive route set by the route decider 14.
  • the control executed by the conveyor controller 5 is called 'conveyor control'.
  • the conveyor controller 5 may, exceptionally, dispatch the trays according to another route that takes precedence over the conclusive route as described further below.
  • the destination of each tray is set by the loaded-tray dispatcher 7 or the empty-tray dispatcher 17. These features are also described further below.
  • the status monitor 6 is a program module that monitors the operational status of the baggage tray system 2 via the BTS controller 3. In other words, the status monitor 6 obtains various kinds of information in the baggage tray system 2 such as the status of each lane (lane status), the position of each tray (tray position), the actual travelling speed of each tray (tray speed), the loaded/empty state of each tray, and the type of each tray (standard/long).
  • the loaded-tray dispatcher 7 is a program module for setting the destination of each loaded tray in the BTS network 4. For example, if a passenger's suitcase is loaded on a tray, in order to be able to deliver the suitcase to a destination in the BTS network 4 corresponding with the aircraft this passenger is to board, the loaded-tray dispatcher 7 sets a lane segment, which corresponds to the place of delivery to this airplane, as the destination of this loaded tray.
  • the candidate finder 8 is a program module for searching and setting a plurality of prospective routes each of which includes a plurality of segments of the lanes through which a tray will travel to reach its destination. The control executed by the candidate finder 8 is called 'prospective- route setting control'.
  • the prospective route includes a basic route and multiple alternative routes.
  • the candidate finder 8 can calculate a possible cost for each of the lane segments of the basic route and the alternative route.
  • the basic route is a route composed of a basic combination of the lane segments along which the tray will travel to its destination.
  • Each alternative route which is defined in a route list, is a route configured in accordance with an alternative combination of the lane segments through which the tray will travel to the destination.
  • Each alternate combination of each alternate route is different from the base combination.
  • the cost estimator 9 is a program module that calculates the prospective cost of each lane segment included in each prospective route. More specifically, the cost estimator 9 calculates the prospective cost for each lane segment included in the basic combination.
  • the cost estimator 9 also calculates the prospective cost for each lane segment included in each alternative combination. That is, the cost estimator 9 individually calculates the prospective cost for each lane segment included in the basic route and each alternative route.
  • the cost estimator 9 has submodules such as a static-cost calculator 10, a status-cost calculator 11, a dynamic-cost calculator 12, and a total-cost calculator 13.
  • the static-cost calculator 10 is a program module that calculates a static cost, which is an effort value related to the time (static-required time) required for a tray to travel to its destination through the corresponding lane segments.
  • the status-cost calculator 11 is a program module that calculates a status cost, which is an effort value related to the lane status of the corresponding lane segment.
  • the dynamic-cost calculator 12 is a program module that calculates a dynamic cost, which is an effort value related to dynamic factors.
  • the static-cost calculator 10, the status-cost calculator 11, and the dynamic-cost calculator 12 will be described in more detail later.
  • the total-cost calculator 13 is a program module that sums the static-, status- and dynamic-costs calculated by the static-cost calculator 10, the static-cost calculator 11 and the dynamic-cost calculator 12 respectively to set the possible cost for each lane segment.
  • the route decider 14 is a program module that designates one of the prospective routes based on the possible cost calculated by the cost estimator 9 and sets the conclusive route consisting of a combination of lane segments. The control executed by the route decider 14 is called 'route-decision control'.
  • the route decider 14 sets the conclusive route by designating one of the plurality of prospective routes with the lowest possible cost.
  • the static-cost calculator 10 is a program module that calculates the static cost of each lane segment based on the length of each lane segment and the forwarding speed of each lane segment.
  • the static-cost calculator 10 will be described by taking ten lanes 101- 110 forming the A-lane group 24 shown in FIG 4 as an example. In this example, a tray is going from the lane 101 to the lane 105. [0080] Hence, in this example, the candidate finder 8 sets all prospective routes that the tray will take from starting from the lane 101 to arriving at the lane 105.
  • the candidate finder 8 sets up five predicted routes as shown in the list below.
  • First prospective route Lane 101 ⁇ Lane 106 ⁇ Lane 107 ⁇ Lane 108 ⁇ Lane 105
  • Second prospective route Lane 101 ⁇ Lane 106 ⁇ Lane 109 ⁇ Lane 103 ⁇ Lane 110 ⁇ Lane 108 ⁇ Lane 105
  • Third prospective route Lane 101 ⁇ Lane 106 ⁇ Lane 109 ⁇ Lane 103 ⁇ Lane 104 ⁇ Lane 105
  • Fourth prospective route Lane 101 ⁇ Lane 102 ⁇ Lane 103 ⁇ Lane 110 ⁇ Lane 108 ⁇ Lane 105
  • Fifth prospective route Lane 101 ⁇ Lane 102 ⁇ Lane 103 ⁇ Lane 104 ⁇ Lane 105
  • the static-cost calculator 10 based on the length (lane-segment length) of each lane segment corresponding to each prospective route set by the candidate finder 8 and the forwarding speed of each lane, calculates the time (static-required time) required for the tray to complete travelling through each prospective route.
  • the static-cost calculator 10 sets an effort value corresponding to the static-required time as the static cost of each prospective route.
  • the control executed by the static-cost calculator 10 is called 'static-cost calculation control'.
  • the candidate finder 8 recognises the one with the lowest static cost among the prospective routes as the basic route.
  • the candidate finder 8 recognises each prospective route, other than the basic route, as the alternative route.
  • the one with the lowest static cost is the route indicated by the bold arrow in FIG 5A, that is, the fifth prospective route.
  • the status of each lane is always changing.
  • the status-cost calculator 11 sets an effort value, according to the degree of failure status (e.g., jam, emergency stop, offline, etc.) of the lane 104, as the status cost of the lane segment related to this lane 104.
  • the control executed by the status-cost calculator 11 is called 'status- cost calculation control'.
  • the one with the smallest sum of the static cost and the status cost is the route indicated by the bold arrow in FIG 5B, that is, the fourth predicted route.
  • the lane status is not the only situation that can fluctuate.
  • the dynamic-cost calculator 12 in this embodiment considers 'element status' as a dynamic factor with respect to the baggage tray system 2.
  • the control executed by the dynamic-cost calculator 12 is called 'dynamic-cost calculation control'.
  • the element status includes tray status and tray type.
  • the tray status is a factor indicating the current status of each tray.
  • a factor relating to the loaded/empty state of each tray i.e. whether the tray is loaded or empty
  • the tray type is a factor that indicates the type of each tray.
  • the factor of class of each tray i.e. standard tray or long tray
  • the dynamic-cost calculator 12 sets the dynamic cost of the lane 103 as the maximum value of the calculation range.
  • the dynamic-cost calculator 12 sets the dynamic cost of the lane 103 to the minimum value of the computational range, that is, zero.
  • the dynamic-cost calculator 12 sets the dynamic cost of lane 107 as the maximum value of the calculation range.
  • the dynamic-cost calculator 12 sets the dynamic cost of the lane 107 to the minimum value of the computational range (i.e. zero).
  • the tray is a standard tray in the loaded state
  • the one with the smallest sum of the static cost, the status cost, and the dynamic cost among the prospective routes is the one indicated by the thick arrow shown in FIG 6(A), that is, the first prospect route.
  • the tray is an empty long tray
  • the one with the smallest sum of the static cost, the status cost, and the dynamic cost among the prospective routes is the one indicated by the thick arrow shown in FIG 6(B), that is, the fourth prospect route.
  • the gridlock preventer 15 of the flow-control server 1 is a program module that executes gridlock-prevention control to restrict further entry of new trays into a congestion area when the existing number of trays in the congestion area reaches the congestion capacity of the congestion area.
  • the gridlock preventer 15 determines that the existing number of trays in the circular-lane segment 6008 has reached the congestion capacity, and executes the gridlock-prevention control. Then, as shown in FIG 9(B), while the gridlock-prevention control is being executed, the gridlock preventer 15 does not allow a new tray 2005 traveling from the lane 206 toward the circular-lane segment 6008 to enter the lane 201. [0091] Then, as shown in FIG 10(A), consider the case where the tray 2001 exits the lane 202 and enters the lane 205.
  • the divergent-blockage preventer 16 of the flow-control server 1 is a program module that prevents a divergent-point blockage at a divergent point where a plurality of lanes branch. Note that the control executed by the divergent-blockage preventer 16 is called 'divergent-blockage-prevention control'.
  • each lane extended from the divergent point is called a branch lane.
  • the divergent-blockage preventer 16 will be described with reference to FIGs 11(A) and (B) and FIGs 12(A) and (B), taking three lanes 301-306 forming the C-lane group 26 as an example.
  • the lanes 302 and 303 branch from the divergent point 28.
  • each of the lanes 302 and the lane 303 is the branch lane.
  • a tray 3004 that blocks the divergent point 28 is the divergent-point blockage.
  • the lane 302 is congested and no new tray can enter (i.e. in a blockage state).
  • the lane 302 in the blockage state is called a blocked lane.
  • the lane 303 is not congested, and therefore a new tray can be entered without any problem (that is, in an available state).
  • the lane 303 in the available state is called an available lane.
  • the divergent-blockage preventer 16 predicts a situation where the tray 3004, which is about to enter the blocked lane 302, stops at the divergent point 28 (see FIG 11(B)). At this time, as shown in FIG 12(A), the divergent-blockage preventer 16 sets a route (detour route) for detouring the tray 3004 to the available lane 303 instead of the lane 302 which is the original route. In other words, when the divergent-blockage preventer 16 predicts the situation shown in FIG 11(B), then the divergent-blockage preventer 16 locally sets the detour route which has a higher priority than the conclusive route set by the route decider 14.
  • the empty-tray dispatcher 17 is a program module that manages each empty tray within the BTS network 4. That is, the empty-tray dispatcher 17 sets the destination of each empty tray in the BTS network 4 and dispatches the empty trays to respective destinations. In addition, the empty-tray dispatcher 17 executes 'empty-tray- allocation control'.
  • the empty-tray-allocation control is control for setting, as the destination of empty trays, either a tray-demand area or a tray-supply area.
  • the tray-demand area is an area within the BTS network 4 where the empty trays to be loaded. In this embodiment, a buffer lane 402 and an in- line buffer (not shown) correspond to the tray-demand area.
  • the tray supply area is an area within the BTS network 4 where the empty trays are stored.
  • a tray stacker (not shown), a storage line (not shown), and an in-line buffer (not shown) correspond to the tray supply area.
  • the empty-tray dispatcher 17 executes the empty-tray- allocation control according to an empty-tray priority.
  • the empty-tray priority is calculated based on at least one of the following four factors.
  • the receivable capacity is a capacity related to the number of slots that can accommodate empty trays (available-slot number) in the tray-demand area.
  • the waiting number is the number of transport objects waiting in line to be loaded on a corresponding empty tray in the tray-demand area.
  • the in-stock number is the number of empty trays lined up for receiving transport objects to be conveyed in the tray-demand area.
  • the under-way number is the number of empty trays that are traveling toward the tray-demand area.
  • the baggage tray system 2 in this embodiment has a top-loader (loading unit) 601 and a buffer lane 402.
  • Top-loader 601 is a belt conveyor. In an example shown in FIG 13, this top-loader 601 loads a plurality of suitcases 5001-5005 to the corresponding empty trays 4001-4005, respectively.
  • the buffer lane 402 is a lane that holds a plurality of empty trays 4001- 4006 for receiving a plurality of suitcases 5001-5005 (transport objects) supplied from the top loader 601.
  • the loading controller 18 of the flow-control server 1 is a program module that controls both the top-loader 601 and buffer lane 402.
  • the loading controller 18 executes 'empty-tray-synchronising control'.
  • This empty-tray-synchronising control will be described with reference to FIG 13.
  • the empty-tray-synchronising control is a control that controls both the buffer lane 402 and the top-loader 601 so that the empty trays 4001-4006 and the suitcases 5001-5005 supplied from the top loader 601 are synchronized at a loading point 29.
  • the loading point 29 is a space which is provided on the buffer lane 402 and is directly below an end of the top loader 601.
  • the tray releaser 19 of the flow-control server 1 is a program module that executes 'tray-release control'.
  • the lane 402 is provided downstream of the lane 401, and the lane 403 is provided downstream of the lane 402.
  • the lane 402 is the buffer lane for storing up to six empty trays. Further, the lane 402 and the lane 404 are branched from the entrance (buffer-lane inlet 30) of the buffer lane 402. [0102]
  • the tray-release control prevents the occurrence of a blockage (buffer- lane blockage) which would obstruct entry into the buffer lane 402 at the buffer-lane inlet 30.
  • an empty tray 4017' indicated by the dotted line in FIG 14 is the buffer-lane blockage in this example.
  • the tray releaser 19 predicts that the empty tray 4017 approaching (see an arrow A4017 in FIG 14) the buffer lane 402 will stop at the buffer-lane inlet to enter the buffer lane 402, as shown in FIG 15, the tray releaser 19 forcibly releases at least one of the empty trays 4011-4016 held in the buffer lane 402 toward the downstream lane 403. In the example shown in FIG 15, only the tray 4011 was waiting at the loading point 29 is released. [0103] As a result, as shown in FIG 16, each of the trays 4012-4016 remaining in the buffer lane 402 is then sequentially moved downstream.
  • the history recorder 20 of the flow-control server 1 is a program module that records a tray history of each of the trays used in the BTS network 4.
  • the tray history includes information about each tray, such as travel distance, maintenance history, and loading history.
  • each tray is determined that its maintenance- required condition is satisfied and undergoes a maintenance check whenever its travel distance reaches a predetermined distance threshold (e.g., 5000 km) or the cumulative number of times the tray has loaded transport objects (i.e., loading number) reaches a predetermined loading-number threshold (e.g., 500 times).
  • This maintenance check is carried out in a maintenance lane (not shown) provided in the BTS network 4.
  • the due-tray dispatcher 21 of the flow-control server 1 is a program module that dispatches due trays to the maintenance lane.
  • the due tray is an empty tray whose tray history satisfies the distance threshold. In other words, the due-tray dispatcher 21 always monitors the tray history of each tray.
  • the due-tray dispatcher 21 finds that the travel distance of a tray has reached the distance threshold since its previous maintenance check, and the tray is empty, then the due-tray dispatcher 21 recognises this tray as a due tray. [0106] At this time, the due-tray dispatcher 21 executes 'maintenance control' for setting the destination of the tray recognized as a due tray to the maintenance lane.
  • the destination set by the due-tray dispatcher 21 i.e. the maintenance lane
  • the empty-tray dispatcher 17 i.e. the tray-demand area or the tray-supply area.
  • the element-history analyser 22 of the flow-control server 1 is a program module that analyses an element history of each transport element (that is, each transport object and each tray).
  • the analysis concierge 23 (i.e., explaining module) of the flow-control server 1 is a program module that explains the result of the analysis by the element-history analyser 22 to a questioner (e.g., external systems, operators, etc.).
  • the element-history analyser 22 and the analysis concierge 23 are implemented in the flow-control server 1 as artificial intelligence (AI) modules.
  • AI artificial intelligence
  • the conveyance-system control apparatus operates as follows and provides the following advantages.
  • the flow-control server 1 operates according to a main flowchart shown in FIG 17. First, when a transport object is loaded on a tray (Yes in step S1), the loaded-tray dispatcher 7 of the flow-control server 1 sets the destination of the loaded tray according to the loaded transport object (step S2). On the other hand, if no transport object is loaded on this tray (No in step S1), a subroutine program relating to empty-tray management control is executed (step S3), and the destination of this empty tray is set. This empty- tray management control will be described later with reference to FIG 18.
  • step S4 the candidate finder 8 of the flow-control server 1 executes the prospective-route setting control. Thereby, a plurality of prospective routes through which this tray can reach its destination are set.
  • step S5 the static-cost calculator 10 executes the static-cost calculation control for each lane segment of each prospective route set in step S4. In the example described above with reference to FIG 5(A), the prospective route with the smallest total static cost is indicated by the thick arrow in FIG 5(A).
  • step S6 the status-cost calculator 11 executes the status-cost calculation control for each lane segment of each prospective route.
  • the status-cost calculator 11 sets the effort value according to the degree of the lane failure status (e.g., jam, emergency stop, offline, etc.) as the status cost of each lane segment included in each prospective lane.
  • the total-cost calculator 13 sums the static cost obtained by the static-cost calculation control and the status cost obtained by the status-cost calculation control.
  • the prospective route with the smallest total value of the static cost and the status cost is indicated by the thick arrow in FIG 5(B).
  • the dynamic-cost calculator 12 executes the dynamic-cost calculation control for each lane segment of each prospective route.
  • the dynamic-cost calculator 12 sets the dynamic cost of each lane segment according to the loaded/empty state of the tray and the class of the tray.
  • the total-cost calculator 13 sums the static cost obtained by the static-cost calculation control, the status cost obtained by the static- cost calculation control, and the dynamic cost obtained by the dynamic-cost calculation control.
  • the prospective route with the smallest sum of the static cost, the status cost and the dynamic cost is indicated by the thick arrows in each of FIGs 6(A) and (B).
  • the route decider 14 executes the route-decision control.
  • the route decider 14 designates one of the prospective routes reflecting the static cost, the status cost and the dynamic cost, and sets the designated route as the conclusive route. Accordingly, as described above, in the A-lane group 24, if the tray departing from the lane 101 and arriving at the lane 105 is a standard tray with the loaded state, the route indicated by the thick arrows in FIG 6(A), that is, the first predicted route is set as the conclusive route. On the other hand, if this tray is an empty long tray, the route indicated by the thick arrows in FIG 6(B), that is, the fourth predicted route is set as the conclusive route.
  • the conveyor controller 5 executes the conveyor control in step S11. That is, the conveyor controller 5 controls the baggage tray system 2 via the BTS controller 3 so as to dispatch the tray to the destination along the lanes corresponding to the conclusive route set in step S8.
  • the destination (lane-segment destination) of this loaded tray has been set in step S2.
  • the destination (lane-segment destination) of this empty tray has been set in step S14 or step S16 shown in FIG 18.
  • step S10 If it is necessary to execute another control with priority (i.e., Yes in step S9), a subroutine program relating to override control is executed (step S10). Note that this override control will be described later with reference to FIG 19. [0117]
  • the empty-tray management control is executed according to the flowchart shown in FIG 18.
  • step S13 the due-tray dispatcher 21 determines whether or not a tray is a due tray. That is, the due-tray dispatcher 21 determines whether or not the tray is empty, and either the travel distance of the tray has reached the distance threshold or the cumulative loading number of transport objects reaches a predetermined loading-number threshold.
  • step S13 If the determination result in step S13 is affirmative (i.e., Yes in step 013), the due-tray dispatcher 21 executes the maintenance control in step S14. That is, in step S14, the due-tray dispatcher 21 sets the destination of this tray recognised as a due tray to the maintenance lane. [0119] On the other hand, if the determination result in step S13 is negative (i.e., No in step 013), the empty-tray dispatcher 17 executes the empty-tray- allocation control in steps S15 and S16.
  • step S15 the empty-tray dispatcher 17 calculates the empty- tray priority based on at least one of the four factors: (a) the receivable capacity of empty trays, (b) the waiting number of transport objects, (c) the in-stock number of empty trays, and (d) the under-way number of empty trays. [0120] Thereafter, in step S16, the empty-tray dispatcher 17 sets either the tray-demand area or the tray-supply area as the destination of the empty tray based on the empty-tray priority calculated in step S15. [0121] The override control is executed according to the flowchart shown in FIG 19.
  • step S17 the divergent-blockage preventer 16 determines whether a divergent-point blockage (see the tray 3004 in FIG 11B) occurs.
  • the divergent-blockage preventer 16 predicts that a divergent-point blockage will occur (i.e., Yes in step S17)
  • step S18 the divergent-blockage preventer 16 judges whether or not there is an available lane at this divergent point.
  • the divergent-blockage preventer 16 determines that there is an available lane (i.e., Yes in step S18)
  • the divergent-blockage preventer 16 sets the detour route for detouring the tray to the available lane instead of an original lane that was part of the original route (step S19).
  • step S17 when the divergent-blockage preventer 16 predicts that the divergent-point blockage due to this tray will not occur (i.e., No in step S17) and this tray is headed to a congestion area (step S20 Yes), then the gridlock preventer 15 executes the gridlock-prevention control (steps S21 and S22).
  • the congestion capacity of the circular-lane segment 6008 i.e., congestion area
  • step S21 the gridlock preventer 15 determines whether four or more trays are present in the congestion area.
  • the gridlock preventer 15 determines that four or more trays exist in the congestion area (i.e., Yes in step S21).
  • the gridlock preventer 15 prevents this tray from entering the congestion area (step S22).
  • the tray releaser 19 executes the tray-release control depending on the situation (steps S24 and S25). That is, as indicated by the dotted line in FIG 14, the empty tray 4017', in step S24, the tray releaser 19 predicts whether or not a buffer-lane blockage will occur.
  • the tray releaser 19 predicts that a buffer-lane blockage will occur (Yes in step S24), the tray releaser 19 forcibly forces at least one of the empty trays 4011-4016 held in the buffer lane 402 (only the tray 4011 is waiting at the loading point in the example shown in FIG 15) toward the downstream lane 403 (step S25).
  • the conveyance system is the baggage tray system, but it is not limited to this configuration.
  • the control apparatus and control method according to the present invention can also be applied to various types of tray-conveyor systems that are not specialised for baggage transportation.
  • the transport objects to be conveyed is not limited to being placed on the trays.
  • forwarding-cases e.g., trays, pallets, tubs, foldable containers, non-foldable containers, and so on
  • the control apparatus and control method according to the present invention to a number of belt conveyor systems.
  • control apparatus and control method according to the present invention can be applied to belt conveyor systems in which the forwarding- cases containing transport objects are forwarded by its belt conveyors.
  • the present invention is not limited to this arrangement.
  • two or more types of the trays may be used.
  • one type of the trays may also be used.
  • the flow-control server 1 constantly monitors the tray state based on the detection results obtained from the RFID sensors and photoelectric sensors provided in the BTS network 4.
  • the present invention is not limited to this arrangement.
  • the conveying elements i.e., the transport objects and/or trays
  • the state of the conveying elements may be always monitored by analysing the captured image.
  • the case where the circular-lane segment 6008 of the B-lane group 25 is set as the congestion area has been described as an example, but the present invention is not limited to this configuration.
  • An area where congestion should be avoided may be defined as the congestion area.
  • the dynamic-cost calculator 12 considers the element status as the dynamic factor has been described, but the present invention is not limited to this configuration.
  • the dynamic cost calculator may consider not only the element status, but also the time status and/or the transport status as dynamic factors.
  • the element status includes the tray state and the tray type, but it is not limited to this configuration.
  • the element status may further include the transport- object state and the transport-object type.
  • the 'transport-object state' is a factor indicating the current state of a transport object. For example, factors such as "completion/non-completion of an explosive-check for a transport object" and/or "whether operator assistance is required for a transport object" correspond to the transport-object state.
  • the transport-object type is a factor that indicates the current status of a transport object.
  • factors such as the size (i.e., height, depth, and width) and class (e.g., soft bag, suitcase, parcel, and etc.) of a transport object correspond to the transported object type.
  • the tray state is not limited to the case described in the above embodiment.
  • factors such as 'loaded with a load error', 'empty but allocated', and 'discharged to be confirmed' may be set as those corresponding to the tray state.
  • the distance threshold is set at 5000 km has been described, but the present invention is not limited to this arrangement.
  • the loading-number threshold is set at 500 times, but the present invention is not limited to this arrangement.
  • the distance and loading-number thresholds can be set depending on various factors such as configurations of baggage tray systems and the durability of trays.
  • the dynamic factor is based on the element status, but it is not limited to this arrangement.
  • the dynamic factor may be set to be based on 'time status'.
  • the time status may relate to at least one of 'time ranges of a day', 'days of a week' and 'type of a touristic season'.
  • the dynamic-cost calculator can calculate different dynamic costs depending on when a condition "Friday, 6:00 pm to 7:00 pm, Christmas period (holiday season)" is met, and when another condition "Monday, 8:00 am to 9:00 am, general period (non-holiday season)" is met.
  • the control apparatus and control method according to the present invention can be applied to conveyance systems in any kind of facilities (e.g., factories, warehouses, postal freight facilities, courier freight facilities, train stations, ports, and etc.).
  • the conveyance system may be installed in transport facilities such as airports, railway stations, bus terminals, and ship ports.
  • the dynamic factor may be set to be based on 'transport status.
  • the transport status may relate to at least one of "a departure time of public transport" (e.g., an airplane's departure time)" and "the number of operations of the public transport in a time window” (e.g., the number of flights in a particular time range).
  • a departure time of public transport e.g., an airplane's departure time
  • the number of operations of the public transport in a time window e.g., the number of flights in a particular time range.
  • the dynamic-cost calculator calculates different dynamic costs depending on the check-in time of the suitcase such as 7:00 am or 9:00 am.
  • the dynamic-cost calculator can individually calculate the dynamic cost for the time range of 2:00 to 3:00 pm and the dynamic cost for the time range of 5:00 to 6:00 pm.
  • the candidate finder 8 sets multiple prospective routes according to the destination of the tray, and the static-cost calculator 10 calculates the static cost for each of these prospective routes.
  • the present invention is not limited to this configuration.
  • the candidate finder may search and register all possible prospective routes from one lane segment to another in advance.
  • the static-cost calculator may calculate and register the static costs of all prospective routes in advance.
  • each of the pre-searched prospective routes and the corresponding static cost may be associated and registered as an XML format file in advance.
  • the static cost can be obtained by a simple arithmetic operation based on the length of each lane segment and the forwarding speed of each lane segment in the baggage tray system.
  • the dynamic cost may be associated with at least one of the tray state, the tray type, the transport-object state, and the transport-object type.
  • each empty tray may be managed individually. This arrangement makes it possible to realise control specific to empty trays. [0148] In addition, it is possible to realise detailed control according to the purpose of 'use' or 'store' of empty trays. [0149] Also, by taking into account the empty-tray priority, it is possible to achieve more efficient allocation of the empty trays. [0150] In addition, by cooperatively controlling the loading unit and the buffer lane, the transport objects can be efficiently and accurately loaded onto each tray.
  • the operational efficiency of the conveyance system can be improved.
  • the static cost can be obtained by simple arithmetic processing based on the length of each lane segment and the forwarding speed of each lane segment in the belt conveyor network.
  • the dynamic cost may be associated with at least one of the transport-object state and the transport-object type.
  • the belt conveyor network can be operated efficiently with reflecting the status of the transport objects in real time.
  • dynamic costs may also reflect time status such as time of day, day of week, and type of tourist season.
  • the dynamic cost may reflect factors specific to transport systems such as airplanes and buses. According to this arrangement, it is possible to realise detailed operation of the conveyance system according to the type of means of transportation.
  • the history regarding the operation of the conveyance system may be analysed, and the analysis result can be output as necessary. As a result, it is possible to increase satisfaction of users of the conveyance system. This arrangement also allows future improvements in the operation of the conveyance system.
  • Reference Signs List 1 flow-control server (conveyance-system control apparatus/ control apparatus) 2 baggage tray system (tray-conveyor system/ baggage handling system/ conveyance system) 3 BTS controller 4 BTS network (tray-conveyor network) 5 conveyor controller 6 status monitor 7 loaded-tray dispatcher 8 candidate finder 9 cost estimator 10 static-cost calculator 11 status-cost calculator 12 dynamic-cost calculator 13 total-cost calculator 14 route decider 15 gridlock preventer 16 divergent-blockage preventer 17 empty-tray dispatcher 18 loading controller 20 history recorder 21 due-tray dispatcher 22 element-history analyser 23 analysis concierge 24 A-lane group 25 B-lane group 26 C-lane group 27 D-lane group 28 divergent point 29 loading point 6008 circular-lane segment (congestion area)

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Mechanical Engineering (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Game Theory and Decision Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • Control Of Conveyors (AREA)

Abstract

La présente invention concerne un appareil de commande et un procédé de commande pour des systèmes de transport. L'appareil de commande de système de transport comprend un viseur candidat (8), un estimateur de coût (9), un décideur d'itinéraire (14) et un dispositif de commande de transporteur (5). L'estimateur de coût (9) comprend un calculateur de coût statique (10), un calculateur de coût d'état (11), un calculateur de coût dynamique (12) et un estimateur de coût total (13).
PCT/AU2023/050504 2023-06-08 2023-06-08 Appareil de commande et procédé de système de transport WO2024250054A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/AU2023/050504 WO2024250054A1 (fr) 2023-06-08 2023-06-08 Appareil de commande et procédé de système de transport

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/AU2023/050504 WO2024250054A1 (fr) 2023-06-08 2023-06-08 Appareil de commande et procédé de système de transport

Publications (1)

Publication Number Publication Date
WO2024250054A1 true WO2024250054A1 (fr) 2024-12-12

Family

ID=93794729

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/AU2023/050504 WO2024250054A1 (fr) 2023-06-08 2023-06-08 Appareil de commande et procédé de système de transport

Country Status (1)

Country Link
WO (1) WO2024250054A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040158396A1 (en) * 2003-02-10 2004-08-12 Samsung Electronics Co., Ltd. Material control system
US20080156618A1 (en) * 2006-04-18 2008-07-03 Aquest Systems Corporation High capacity delivery with priority handling
US20080172172A1 (en) * 2005-01-19 2008-07-17 Ping-Chung Ng Route planning process
US20100036522A1 (en) * 2005-06-15 2010-02-11 Jochen Stich Airport baggage conveyor system
US20160200527A1 (en) * 2013-08-23 2016-07-14 Siemens Aktiengesellschaft Storage device for stackable containers

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040158396A1 (en) * 2003-02-10 2004-08-12 Samsung Electronics Co., Ltd. Material control system
US20080172172A1 (en) * 2005-01-19 2008-07-17 Ping-Chung Ng Route planning process
US20100036522A1 (en) * 2005-06-15 2010-02-11 Jochen Stich Airport baggage conveyor system
US20080156618A1 (en) * 2006-04-18 2008-07-03 Aquest Systems Corporation High capacity delivery with priority handling
US20160200527A1 (en) * 2013-08-23 2016-07-14 Siemens Aktiengesellschaft Storage device for stackable containers

Similar Documents

Publication Publication Date Title
US5842555A (en) Automated baggage tracking system and method for use in a baggage conveyor system
Vivaldini et al. Comprehensive review of the dispatching, scheduling and routing of AGVs
JP2001048352A (ja) 荷物の自動搬送、自動分類、自動積載方法およびそのシステム
Petersen et al. The pickup and delivery problem with cross-docking opportunity
US20030061085A1 (en) Air travel system with decoupled baggage
EP4037973B1 (fr) Système de tri pour bagages ainsi que procédé de tri de bagages
JP2019104578A (ja) 人工知能を活用した包括的コンテナターミナルシステム及びオペレーション方法
KR102063933B1 (ko) 차량 배정 시스템
TWI402643B (zh) 無人搬送裝置及其搬送路徑決定方法
Le-Anh Intelligent control of vehicle-based internal transport systems
US20050056576A1 (en) Method and apparatus for storing travel luggage
Yang et al. Internet-of-Things-augmented dynamic route planning approach to the airport baggage handling system
TWI225840B (en) Control device for transfer system
US20180229950A1 (en) System and method for handling automobiles at a distribution site
KR101713578B1 (ko) 공항 수하물 처리 시스템 및 방법
JP2024021254A (ja) 運送情報処理システム
KR20110091020A (ko) 주행차 시스템
WO2024250054A1 (fr) Appareil de commande et procédé de système de transport
CN119067408B (zh) 一种天车调度系统
KR101713573B1 (ko) 공항 수하물 분배 시스템 및 방법
KR20090051961A (ko) 차량 운영 관리 시스템 및 그 방법
CN113869819A (zh) 一种智能库房系统以及智能库房管理方法
GB2588108A (en) Receiving and sorting system
KR20220081803A (ko) 공항 수하물 관리 시스템 및 방법
Schaudt et al. Exact approach for last mile delivery with autonomous robots

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23940021

Country of ref document: EP

Kind code of ref document: A1