SYSTEMS AND METHODS FOR DYNAMIC PROCESSING OF OBJECTS

Abstract

A method of processing objects is disclosed using a programmable motion device. The method includes the steps of acquiring an object from a plurality of mixed objects at an input area, perceiving identifying indicia in connection with the object, assigning an intermediate station to a destination location for the object responsive to the identifying indicia in connection with the object, and moving the acquired object toward the intermediate station.

Description

BACKGROUND

The invention generally relates to automated sortation and other processing systems, and relates in certain embodiments to robotic systems for sorting objects (e.g., parcels, packages, articles etc.).

Current distribution center sorting systems, for example, generally assume an inflexible sequence of operations whereby a disorganized stream of input objects is first singulated by human workers into a single stream of isolated objects presented one at a time to a human worker with a scanner that identifies the object. The objects are then loaded onto a conveyor, and the conveyor then transports the objects to the desired destination, which may be a bin, a chute, a bag or a destination conveyor.

In typical parcel sortation systems, human workers typically retrieve parcels in an arrival order, and sort each parcel or object into a collection bin based on a given heuristic. For instance, all objects of like type might go to a collection bin, or all objects in a single customer order, or all objects destined for the same shipping destination, etc. The human workers are required to receive objects and to move each to their assigned collection bin. If the number of different types of input (received) objects is large, a large number of collection bins is required.

Such a system has inherent inefficiencies as well as inflexibilities since the desired goal is to match incoming objects to assigned collection bins. Such systems may require a large number of collection bins (and therefore a large amount of physical space, large capital costs, and large operating costs) in part, because sorting all objects in unison is not always most efficient.

Current state of the art sortation systems rely on human labor. Most solutions rely on a worker that is performing sortation, by scanning an object from an induction area (chute, table, etc.) and placing the object in a staging location, or collection bin. When a bin is full or the controlling software system decides that it needs to be emptied, another worker empties the bin into a bag, box, or other container, and sends that container on to the next processing step. Such a system has limits on throughput (i.e., how fast can human workers sort to or empty bins in this fashion) and on number of diverts (i.e., for a given bin size, only so many bins may be arranged to be within efficient reach of human workers).

Partially automated means of solving this problem are lacking in key areas. Such approaches typically involve tilt-tray or bomb-bay style recirculating conveyors. These conveyors have discrete trays that can be loaded with an object. The trays and objects then pass through scan tunnels that scan the object and associate it with the tray in which it is riding; when the tray passes the correct bin, a trigger mechanism causes the tray to dump the object into the bin. A drawback of such systems is that every divert requires an actuator, which increases the mechanical complexity and the cost per divert can be very high. For applications requiring hundreds of diverts, the large cost of such a system does not achieve a good return on investment.

An alternative is to use human labor to increase the number of diverts, or collection bins, available in the system. This decreases system installation costs, but increases the operating costs. Manual sortation cells are staffed by a team of workers, which avoids the large cost per divert. Multiple cells can then work in parallel, effectively multiplying throughput linearly while keeping the number of expensive automated diverts at a minimum (equal to the number of parallel sortation cells, not the total number of system bins needed). This approach involves objects for sortation being supplied to each cell, which can be done manually but is easily done via means of a conveyor with sweep arms or other dumb diverts to each work cell. Such diverts do not identify an object and cannot divert it to a particular spot; rather they work with beam breaks or other simple sensors to seek to make sure that indiscriminate bunches of objects get diverted to each cell. The lower cost of the unsophisticated diverts coupled with the low number of diverts keeps the overall system divert cost low.

Unfortunately however, these systems don't address the limitations to total number of system bins. The system is simply diverting an equal share of the total objects to each parallel manual cell. Each parallel sortation cell must therefore have all the same collection bins designations; otherwise an object might be delivered to a cell that does not have a bin to which that object is mapped. There remains a need for a more efficient and more cost effective object sortation system that sorts objects into appropriate collection bins, yet is more efficient in operation.

SUMMARY

In accordance with an embodiment, the invention provides a method of processing objects using a programmable motion device. The method includes the steps of acquiring an object from a plurality of mixed objects at an input area, perceiving identifying indicia in connection with the object, assigning an intermediate station to a destination location for the object responsive to the identifying indicia in connection with the object, and moving the acquired object toward the intermediate station.

In accordance with another embodiment, the invention provides an object processing system that includes at least one programmable motion device for acquiring an object to be processed from an input station, and a processor for dynamically assigning an intermediate location for the object, the intermediate location being dynamically associated with a destination location.

In accordance with a further embodiment, the invention provides a method of processing objects that includes the steps of acquiring an object to be sorted from an input station, identifying the object to determine indicia associated with the object, assigning an intermediate station to the object responsive to the indicia, and moving the object using a first automated carriage toward the intermediate station, wherein the intermediate station is associated with a destination location.

BRIEF DESCRIPTION OF THE DRAWINGS

The following description may be further understood with reference to the accompanying drawings in which:

FIG. 1 shows an illustrative diagrammatic view of a system in accordance with an embodiment of the present invention including input and output conveyors;

FIG. 2 shows an illustrative diagrammatic view of a system in accordance with another embodiment of the present invention including a circulating input conveyor;

FIG. 3 shows an illustrative diagrammatic view of a system in accordance with a further embodiment of the present invention including multiple input conveyors and multiple output conveyors;

FIG. 4 shows an illustrative diagrammatic view of a perception system for use in connection with the system of FIG. 3;

FIG. 5 shows an illustrative diagrammatic view of an object assignment relationship in a conventional sortation system;

FIG. 6 shows an illustrative diagrammatic view of an object assignment relationship in accordance with certain embodiments of the present invention;

FIG. 7 shows an illustrative diagrammatic view of an object assignment system of FIG. 5;

FIGS. 8A-8I show illustrative diagrammatic views of object assignment steps in system in accordance with certain embodiments of the present invention;

FIG. 9 shows an illustrative flowchart of a process in accordance with an embodiment of the present invention;

FIG. 10 shows an illustrative diagrammatic view of an object processing system in accordance with a further embodiment of the present invention including a large number of sorting stations as well as an automated input via a cleated conveyor;

FIG. 11 shows an illustrative diagrammatic view of a portion of a system in accordance with a further embodiment of the present invention involving individual input bins;

FIG. 12 shows an illustrative diagrammatic view of a portion of a system in accordance with a further embodiment of the present invention involving input bins provided on an input conveyor;

FIG. 13 shows an illustrative diagrammatic view of a portion of a system in accordance with a further embodiment of the present invention involving output carriages provided on an output track;

FIG. 14 shows an illustrative diagrammatic view of a portion of a system in accordance with a further embodiment of the present invention involving bagging objects at the sortation stations;

FIG. 15 shows an illustrative flowchart of an overall method of providing dynamic processing of objects;

FIG. 16 shows an illustrative diagrammatic view of a system in accordance with a further embodiment of the present invention that includes shuttle wing sortation stations;

FIG. 17 shows an illustrative diagrammatic front isometric view of the perception system of the system of FIG. 16;

FIG. 18 shows an illustrative diagrammatic back view of the perception system of the system of FIG. 16;

FIGS. 19A-19C show illustrative diagrammatic views of carriage movement in a shuttle wing sortation station of FIG. 16 without the guide walls for clarity;

FIG. 20 shows an enlarged view of a shuttle wing sortation station of FIG. 16;

FIG. 21 shows an illustrative diagrammatic view of a system in accordance with a further embodiment of the present invention that includes four shuttle wing sortation stations; and

FIG. 22 shows an illustrative diagrammatic view of a system in accordance with a further embodiment of the present invention that includes eight shuttle wing sortation stations.

The drawings are shown for illustrative purposes only.

DETAILED DESCRIPTION

In accordance with various embodiments, the invention provides an inherently more flexible object sortation system in which objects may be selected in a most advantageous order, and the sortation of those objects may take advantage of dynamically varying correspondence between the sorter outputs and the ultimate object destinations.

Applicants have discovered that when automating sortation of objects, there are certain objectives to consider: 1) the overall system throughput (parcels sorted per hour), 2) the number of diverts (i.e., number of discrete locations to which an object may be routed), 3) the total area of sortation system (square feet), and 4) the annual costs to run the system (man-hours, electrical costs, cost of disposable components).

Systems and methods of the present invention are well suited to applications in current sortation systems that receive objects in a disorganized stream and are required to sort the objects into sorted streams. Such systems recognize that reading information on an object may sometimes be challenging; once an object is scanned therefore, it is important to keep the information associated with the object. The acquisition of objects from disorganized jumbles is also challenging, and once an object is acquired, it is important to keep the object separated from other objects. Further, conventional transport and conveying systems have limited flexibility, typically following a single track that passes every possible destination.

In accordance with certain embodiments, the invention provides systems and methods that upend basic assumptions of current sortation systems, with improvements in each of the challenges identified above. The systems, in some embodiments, provide improved scanning and perception systems, and reduce the challenge of scanning an object, and further, by perceiving the entire object's shape and disposition, reduces or eliminates the need to keep the object separate from others. The systems, in certain embodiments, provide improved end effectors, and the use of robotic manipulators to improve the reliability and economy of acquiring objects, even when in a jumble with other objects, reducing the need to maintain separation of objects. The systems, in further embodiments, provide improved transport and conveyor systems, and provide programmable robotic manipulators in particular, that allow dynamically changing patterns of object handling, with resulting efficiencies in the sortation process, lower space requirements, lower demand for manual operations, and as a consequence, lower capital and operating costs for the entire system.

FIG. 1, for example, shows a system 10 in accordance with an embodiment of the present invention that includes a first sorting station 12 and a second sorting station 14 that are each fed by a common input conveyor 16. An output conveyor 18 carries output bins 50 to downstream processing stations. The first sorting station 12 includes programmable motion device, e.g., a robotic system, 20 as well as collection bins 22, 24, 26 and 28. The second sorting station 14 includes a programmable motion device, e.g., robotic system, 30 as well as collection bins 32, 34, 36 and 38. The first sorting station 12 may also include a stack of additional collection bins 40 and the second sorting station may include a stack of additional collection bins 42. A central controller 44 communicates with the robotic systems 20 and 30 to provide input regarding the assignment of objects to a bin as discussed in more detail below. Perception units 46 and 47 (e.g., cameras or scanners) may be employed to provide the sorting stations 12, 14 with identification information (idicia data) regarding objects 48, 49 that are being provided on the input conveyor 16.

During use, each sorting station 12, 14 may either select an object and then identify the selected object by a detection device on the articulated arm (e.g., in a system as shown in FIG. 3 discussed below), or may first identify an object prior to selection (e.g., using scanners 46, 47), and then grasp the identified object. For each object grasped, the system will place the object in an assigned destination station if a destination station has been assigned to the object. For each new object grasped, the system assigns a new bin to the object if a new bin is available. Otherwise the object is returned to the input conveyor 16. What is significant, is that the sorting station is not pre-assigned a large set of collection bins assigned to all possible objects that may appear in the input path.

Further, the central controller may employ a wide variety of heuristics that may further shape the process of dynamically assigning objects to collection bins as discussed in more detail below. Once bins are either filled or otherwise completed, the completed bins (e.g., 50) are placed onto the destination conveyor 18 as shown, where they are then routed to one or more next processing stations. The system 10 may include any number of sorting stations, and the central controller 44 may manage the assignment of destination stations (e.g., bins) to provide an efficient assignment of objects to destination stations. If any objects cannot be sorted by the time that they reach an end of the input conveyor 16, the objects may fall into a non-identified object bin 52 so that they may either be scanned and placed by a human worker, or replaced back into the input path in the event that a destination station simply was not assigned for the object.

In accordance with another embodiment, and with reference to FIG. 2, a system 60 of the invention may include an input loop conveyor 62 on which objects 64 are provided that pass by multiple sorting stations, as well as an output conveyor 64 on which full or otherwise completed bins 66 may be placed by any of a robotic system or other programmable motion system at a sorting station. Similar to the system 10 of FIG. 1, the system 60 may also include a central controller 68 that communicates with robotic systems 70 and 80, as well as perception units (e.g., 63) to provide input regarding the assignment of objects to a bin as discussed in more detail below. The robotic system 70 provides objects to bins 72, 74, 76 and 78, and the robotic system 80 provides objects to bin 82, 84, 86 and 88. The robotic system 70 may select new bins from the stack of bins 90 and the robotic system 80 may select new bins from the stack of bins 92. Again, the assignment of bins to objects is driven by the objects selected by the robotic systems (as may be directed by or based on input from the control system 68).

The invention provides, therefore, examples of sortation and other distribution systems that involve moving infeed objects directly to a buffer, without human intervention. The buffer holds the objects, possibly in a disorganized jumble, where they may be accessed by one of several sorters. One example would involve a circulating conveyor (as shown in FIG. 2), with integrated perception. The perception system may read labels when they are visible, but may also use more general machine vision algorithms to identify object class and shape, and to track objects as they are circulated. The sorters acquire objects from the buffer. If needed, they use their own perception systems to read labels not previously read. They may move objects to any of several outputs, including the possibility of placing an object back on the buffer, either for later handling or for handling by a different sorter.

In accordance with a further embodiment shown in FIG. 3, a system 100 of the invention may include a plurality of input conveyors 93, 94 on which input objects 134, 136 to be sorted are provided. The sorted objects may be provided (e.g., in completed bins 97, 102) on one of a plurality of output conveyors 96, 98. As discussed above, the system may also include a central controller 104 that communicates with perception units 106 and 108, as well as with robotic systems 110 and 120 to provide input regarding the assignment of objects to a bin as discussed in more detail below. With further reference to FIG. 4, each perception unit may include lights 105 and cameras 107, and the robotic system (e.g., 110, 120) may be used to hold one object at time in the associated perception unit (106, 108) so that the system may identify the held object. Similar to the system discussed above, the robotic system 110 provides objects to bins 112, 114, 116 and 118, and the robotic system 120 provides objects to bin 122, 124, 126 and 128. The robotic system 110 may select new bins from the stack of bins 130 and the robotic system 120 may select new bins from the stack of bins 132. Again, the assignment of objects to collection bins is driven by the objects selected by the robotic systems (as may be directed by or based on input from the control system 104). In accordance with further embodiments, the input buffer may also include designated input areas at the sorting stations into which human workers may also provide objects to be sorted. The robotic systems 110 and 120 of FIG. 3 may include perception units over the conveyors as discussed above, and/or perception units 111 and 121 mounted on the robotics that facilitate the selection and grasping of objects from the input conveyors 93 and 94.

A switch may also be used in certain embodiments that correlates sorter outputs with collection bins in a dynamic manner. For example, a system may involve the collection of objects to be bagged by a human worker who then puts them on a conveyor toward a truck-loading area, but with a dynamically generated label indicating the desired destination.

In a sortation system, the relationship between objects and their intended destinations are known, and may be provided, in a manifest. For example, an object bearing a label addressed to Boston, Mass., will be associated with the destination of Boston, Mass. With reference to FIG. 5, this fixed relationship between an object 140 and a destination 142 is a fixed relationship. In conventional sortation systems, an intermediate container 144 is assigned a fixed relationship with the destination, and this relationship dictates the assignment of the object 140 to the intermediate container 144. This is shown in FIG. 7, where each destination 164, 166, 1687, 170, 172 is associated with an intermediate container 154, 156, 158, 160, 162. As objects 152 are processed, they are simply routed to the appropriate intermediate containers as directed by the fixed relationship.

In accordance with embodiments of the present invention on the other hand, the relationships between intermediate containers and destinations is not fixed, and changes dynamically during sortation. FIG. 6, for example, shows that while the relationship between an object 146 and its destination 148 is fixed, the assignment of an intermediate container 150 (e.g., a collection bin), is dynamically chosen based on a variety of heuristics. Once assigned, it remains in place until the collection bin is emptied. As shown in FIG. 6, the assignment of a collection bin (intermediate container 150) for an object 146 is determined by the object destination and the intermediate container to destination mapping, and the destination mapping (between the intermediate container 150 and the destination 148) is re-assigned dynamically during operation.

With reference to FIG. 8A, at the beginning of a sortation process, there may be no assigned relationships between intermediate containers 176, 178, 180, 182, 184 and objects 174, or between intermediate containers 176, 178, 180, 182, 184 and destinations 186, 188, 190, 192, 194. As shown in FIG. 8B, when an object's indicia is detected, an intermediate container 176 is assigned to the object, and the object's destination 188 is assigned to the intermediate container as well. Additional objects that are processed and are also associated with the destination 188 are also provided in intermediate container 176. With reference to FIG. 8C, when a different object's indicia is detected that is associated with a different destination 192, a new intermediate container 178 is assigned to the object, and the object's destination 192 is assigned to the intermediate container as well. As noted above, when an object is selected that is associated with a destination, e.g., 188, that already has an intermediate container 176 associated with it, the object may be placed in the same intermediate container 176. In accordance with certain embodiments of the invention however, and with reference to FIG. 8E, the system may elect to assign a new intermediate container 180 to the destination 188, for example, if it is known that many of the objects are likely to be associated with the destination 188. With reference to FIG. 8F, when another object's indicia is detected that is associated with another destination 186, an new intermediate container 184 is assigned to the object, and the object's destination 186 is assigned to the intermediate container 184.

When an intermediate container becomes full or is determined to be otherwise ready for further processing (e.g., if the system determines that it is unlikely to see another object associated with the destination), the intermediate container is emptied and the contents are forwarded for further processing. For example, and with reference to FIG. 8F, when the system determines that intermediate container 176 is full, the contents are emptied, and the intermediate container 176 is then again unassigned to a destination as shown in FIG. 8H. The intermediate container 176 may then later be reused and associated with a new destination 190 as shown in FIG. 8I.

As shown in FIG. 9, a sortation process of the invention at a sorting station may begin (step 200) and the articulated arm, or another object reception device, receives a new object (step 202). The system identifies the new object (step 204) by any of an overhead scanner, or a scanner system, or by a drop scanner as discussed herein, etc. The system then determines whether any location at the station has yet been assigned to the new object (step 206). If so, the system then places the object at that location (step 218). If not, the system then determines whether a next location is available (Step 208). If not, the system may (either with or without input from a human) determine whether to retry identifying the object (step 210). If so, then the system would return the object to the input stream (step 212) to be again received at a later time (step 202). If not, the system would place the object in a manual sorting area for sortation by a human (step 214). If a next location is available (step 208), the system then assigns a next location to the object (step 216), and the object is then placed in that location (step 218). If a location had already been assigned to the object (step 206), the object is placed in that location (step 218). The number of objects at the location is then updated (step 220), and if the location is then full (step 222), the system identifies that the location is ready for further processing (step 226). If not, the system then determines whether (based on prior knowledge and/or heuristics), whether the location is likely to receive a further object (step 224). If so, the system identifies that the location is ready for further processing (step 226). If not, the system returns to receiving a new object (step 202). The further processing may, for example include collecting the items at the location in a single bag for transport to a shipping location.

In accordance with a further embodiment of the present invention, and with reference to FIG. 10, a system 230 includes multiple sorting stations 240, each of which includes a robot system 242, a perception unit 244, a plurality of destination locations (e.g., bins) 246, and a stack of additional bins 248 that may be used as bins 246 are moved or identified as being ready for further processing. In particular, input objects 236 are provided in an input hopper 232, and a cleated conveyor 234 draws the objects 236 up onto an input conveyor 238. Once on the conveyor 238, each of the robot systems 242 selects certain objects from the conveyor, again using any of perception units above the input conveyor (such as perception units 46, 47 and 63 of FIGS. 1 and 2), or perception units 111 and 121 of FIG. 3 that are mounted on the robots themselves, which facilitate the selection and grasping of the objects. Once any bins are full or otherwise considered to be completed, the bins 250 are loaded onto an output conveyor 252 for further processing, where the system knows the identity of each bin 252 as well as its contents as assigned by the central processor 256.

In accordance with further embodiments, the input to each sorting station 12 may be provided in a movable hopper 260 that may be positioned by a human worker near to the robotic system 20 as shown in FIG. 11. The sorting system 12 of FIG. 11 may use a perception system 262 to identify objects (as well as any of perception units 46, 47, 63, 111, 121 discussed above), may fill bins 22, 24, 26, 28 with objects, and may provide filled or otherwise completed bins 264 onto the output conveyor 266. In accordance with a further embodiment, the input to each sorting station 12 may be provided in a hopper 268 that is one of a plurality of hoppers 268, 270 that are provided on an input conveyor 272 near to the robotic system 20 as shown in FIG. 8. The sorting system 12 of FIG. 12 may use a perception system 274 to identify objects (as well as any of perception units 46, 47, 63, 111, 121 discussed above), may fill bins 22, 24, 26, 28 with objects, and may provide filled or otherwise completed bins 276 onto the output conveyor 278.

In accordance with a further embodiment, the input to each sorting station 12 may be provided by an input conveyor as discussed above with reference to FIG. 1, that is provided on an input conveyor 280 near to the robotic system 20 as shown in FIG. 13. The sorting system 12 of FIG. 13 may use a perception system 282 to identify objects (as well as any of perception units 46, 47, 63, 111, 121 discussed above), may fill bins 22, 24, 26, 28 with objects, and may provide filled or otherwise completed bins 24 onto an output carriage 284 that is mounted on an output track 286. In accordance with a further embodiment, the input to each sorting station 12 may be provided by an input conveyor as discussed above with reference to FIG. 1, that is provided on an input conveyor 288 near to the robotic system 20 as shown in FIG. 14. The sorting system 12 of FIG. 14 may use a perception system 290 to identify objects (as well as any of perception units 46, 47, 63, 111, 121 discussed above), may fill bins 22, 24, 26, 28 with objects, and may provide filled or otherwise completed bins 26 to a bagging station for bagging by human workers to provide sets of sorted objects in bags 292 for further processing by human workers.

A process of the overall control system is shown, for example, in FIG. 15. The overall control system may begin (step 300) by permitting a new collection bin at each station to be assigned to a group of objects based on overall system parameters (step 302) as discussed in more detail below. The system then identifies assigned bins correlated with objects at each station (step 304), and updates the number of objects at each bin at each station (step 306). The system then determines that when a bin is either full or the system expects that the associated sorting station is unlikely to see another object associated with the bin, the associated sorting station robotic system will then place the completed bin onto an output conveyor, or signal a human worker to come and empty the bin (step 308), and then return to step 302.

Systems of various embodiments provide numerous advantages because of the inherent dynamic flexibility. The flexible correspondence between sorter outputs and destinations provides that there may be fewer sorter outputs than destinations, so the entire system may require less space. The flexible correspondence between sorter outputs and destinations also provides that the system may choose the most efficient order in which to handle objects, in a way that varies with the particular mix of objects and downstream demand. The system is also easily scalable, by adding sorters, and more robust since the failure of a single sorter might be handled dynamically without even stopping the system. It should be possible for sorters to exercise discretion in the order of objects, favoring objects that need to be handled quickly, or favoring objects for which the given sorter may have a specialized gripper.

In accordance with certain embodiments, therefore, the system provides a sortation system that employs a buffer at the infeed stage enabling scalable and flexible induction of objects into the system. The buffer may include a single conveyor, a circulating conveyor or multiple conveyors, possibly to separate disorganized objects from organized objects. In further embodiments, the invention provides a sortation system employing a plurality of sorters flexibly connected to both upstream and downstream processes. The system may also employ a flexible destination stage, including a process for dynamically changing the correspondence of sorter outputs and system destinations using a switch based on heuristics from the sortation process. The system may dynamically map sorter outputs to system destinations based on long-term historical usage trends and statistics, or items already processed, or current contents of other dynamically allocated sorter outputs, or average, minimum or maximum time-to-sort associated with each sorter output, or physical characteristics of the items sorted, or a priori information, or known future deliveries, or location within a facility, including the physical location relative to other allocated sorter outputs (e.g., above, beside, on or nearby), or incoming shipments, as well as knowing what items are currently upstream of the sortation process and combinations of the above. Further, systems of embodiments of the invention provide that information regarding correspondence between sorter outputs to system destinations may be provided to an automated system for sorting.

By making use of heuristics, the mapping of sorter outputs to system destinations can be improved substantially over traditional fixed allocation. Destinations may be assigned on the fly, reducing wasted space from unused sorter outputs and decreasing the time it takes to process incoming objects. Long-term historic trends may be used to allocate sorter outputs when the next incoming group of objects is either in-part or entirely unknown. Historical usage patterns provide insight into when objects bound for certain destinations can be expected to arrive, the number of objects bound for each destination expected for any given time, and the probable physical properties of these incoming objects.

In addition to trends pertaining to incoming objects, historical trends provide information on the speed at which objects can be sorted into outputs, and the rate at which outputs are transferred to system destinations. These factors allow sorter outputs to be allocated probabilistically until a deterministic understanding of incoming objects is achieved.

In addition to historic trends, an understanding of the current state of the system is used to ensure that there is an appropriate amount of space allocated for those objects that are expected to arrive. When combined with the knowledge of those objects that have already been sorted, the correspondence of sorter outputs to system destinations can typically be allocated deterministically. A knowledge of those objects already processed and the contents of current sorter outputs allows the system to optionally remap the sorter outputs once they have been emptied of their contents. In the case that there aren't enough sorter outputs, this knowledge also allows the system to specify which sorter outputs should be emptied such that they can quickly be reallocated to new system destinations.

A further consideration when dynamically allocating sorter outputs is to take into account the physical characteristics of the packages and the facility. If a certain destination is expected to receive larger, unwieldy objects, then an appropriately-sized sorter output can be allocated. If a particular system destination will require more than a single sorter output, then two adjacent outputs can be allocated with the same destination in order to facilitate human intervention.

A method is also presented for displaying the sorter output—system destination correspondence information next to the destinations. This allows human workers interacting with the system to understand how and when to properly empty the destinations. In addition, critical to autonomous sortation is the ability to send these destination allocations to a sortation system without human intervention. This allows for the construction of fully-streamlined sortation system software.

In accordance with further embodiments, systems of the invention may employ carriages that shuttle back and forth along shuttle directions. Such systems may rely on a pre-sortation step, where an object is sorted first to the correct sortation cell, and once there it is sorted into the proper collection bin. In this fashion, different cells can have different collection bin mappings, allowing the total number of system bins to be multiplied by the number of parallel cells operating. Such pre-sortation steps however, must be either complicated and expensive automated systems, or must rely on yet more human work; either way adds cost which raises the overall cost per divert of the system to unacceptably high levels.

In accordance with a further embodiment therefore, the invention provides a new approach to object sortation that yields a large (and very flexible) number of total collection bins, very low divert costs per bin, throughput as high as that of a manual system, and a far smaller need for manual labor to operate.

FIG. 16, for example, shows a system 310 that includes an articulated arm 312 with an end effector 314, an input area 316 in which objects are presented for sortation, a primary camera 318 for identifying objects to be sorted, and a receiving conveyor 320 for receiving objects to be sorted from any of a human worker, another conveyor, or an input pan. The system also includes a non-sortable output chute 322 that leads to a non-sortable output bin 324 for providing objects that the system either could not identify or could not sort for any other reason (e.g., could not grasp or pick up).

In addition to the primary camera 318, the system also includes a drop camera unit 326, which includes an open top (340 as shown in FIGS. 17 and 18) and an open bottom (358 as shown in FIGS. 13 and 14) of the structure 338, and a plurality of cameras (344 as shown in FIGS. 17 and 18) positioned within the unit 326 that are aimed at the top, mid and lower central regions of the interior of the unit 326. In particular, and as further shown in FIGS. 17 and 18, the plurality of cameras 344 take images of an object when it is dropped by the end effector through the unit 326. The unit 326 also includes a plurality of sets of lights 342 that may become illuminated when certain of the cameras are activated, and the unit 326 may also include one or more sensors (e.g., laser sensors) at the top of the unit 216 that detect when an object is dropped into the unit 216 (as well as optional sensors to detect when the object has left the unit). The plurality of cameras 344 are designed to collect a plurality of images of each object from multiple views to aid in identifying or confirming the identity of the dropped object. Mounting hardware including rings 352 on brackets 354 may also facilitate the positioning of the unit 326 in the robotic environment.

With reference again to FIG. 16, an object dropped through the perception unit 326 then falls into a first carriage 328 that is provided on a track 330 on which the carriage 328 may be reciprocally moved automatically between a first sortation stage 332 and a second sortation stage 334 on either side of the area in which the object was dropped. At each of the first sortation stage 232 and the second sortation stage 324, the content of the carriage 328 may be dropped into a further carriage 338 of either of two shuttle wing sorter sections 336. At each of the shuttle wing sorter sections 336, the carriage 338 reciprocally moves along a track 340 between sortation bins 342 that may optionally include associated side walls 344. As further shown in FIGS. 19A-19C, the carriage may move an object to be adjacent a designated sortation bin 342 (FIG. 19B), and may then be actuated to dump the object 346 from the carriage 338 onto the assigned destination bin (FIG. 19C). The movement of each carriage 328 and 338 (as well as the tipping of each carriage) may be effected by electrical power or pneumatics in various embodiments.

FIG. 20 shows a shuttle wing sorter section 336 that includes the carriage 338 on the track 338 between destination bins 342 within walls 344. As further shown in FIG. 20, the collection bins may be removed in pairs by sliding an associated drawer 346 that contains a pair of the collection bins (358, 360) in a direction transverse to the movement of the carriage 338. The drawer 346 may also include lights 362 that indicate whether either of the contained bins, e.g., 358, 360) is full or otherwise ready for further processing, e.g., by placing into a bag. A hand-held scanner/printer 364 may also be provided so that coded adhesive-backed labels 366 may be provided directly to a bag that contains the processed objects.

The system of FIG. 16 shows a system with two shuttle wings sections 336. When an object is picked from the infeed conveyor, it is dropped onto the first shuttle sorter 328. That shuttle sorter carries the object to one of two wings, drops the object in the carrier for that wing, and then moves back to home. Due to the limited travel, this back and forth operation may be performed in the time it takes the articulated arm to pick another object (assuming the articulated arm is picking objects at approximately a human rate of throughput).

The shuttle sort wing therefore includes an object carriage on a motorized linear slide that travels above a double row of bins. The carriage is loaded with an object and then moves down the wing along the linear slide until it has reached the collection bin where the object belongs; it then uses rotational actuation to eject the object to one side or the other, where it falls into one of the two cubbies at that location. The carrier then returns to the home position to await another object.

In the concept as shown, each wing is limited to 8 collection bins long, for 16 total collection bins per wing. The length of collection bins traveled by the linear carriage should be balanced with other throughput factors in the system. Given achievable speeds for belt driven linear actuators, distances, and picking speed of the articulated arm, this length of 8 collection bins is a reasonable length that does not adversely limit system throughput (i.e., the articulated arm does not have to wait for a wing shuttle sorter to return to home before picking another object). At this 8×2 or 16 collection bin count, each wing has a divert cost in the hundreds of dollars, as opposed to the thousands of dollars, per intelligent divert for currently fielded solutions, as discussed above.

Systems in the prior art also do not use back and forth style sortation because the shuttle can only handle one item at a time, and the shuttle needs to return to its home position after each sort. In accordance with certain embodiments of the present invention, this concern is alleviated in three ways: 1) multiple wings are used in parallel, 2) frequent destinations are assigned to collection bins closer to the shuttle's home position, thereby reducing the average cycle time of the shuttle, and 3) mapping of objects to collection bins is dynamic and under the control of the system as discussed above.

FIG. 21 shows a system 400 in accordance with a further embodiment of the present invention that includes an articulated arm 402 with an end effector 404, an input area 406 in which objects are presented for sortation, a primary camera 308 for identifying objects to be sorted, and a receiving conveyor 410 for receiving objects to be sorted from any of a human worker, another conveyor, or an input pan. The system also includes a non-sortable output chute 412 that leads to a non-sortable output bin 414 for providing objects that the system either could not identify or could not sort of any other reason (e.g., could not grasp or pick up).

The system also includes a drop camera unit 416, which includes an open top and an open bottom, as well as a plurality of cameras positioned within the unit 416 that are aimed at the top, mid and lower central regions of the interior of the unit 416 as discussed above with reference to FIGS. 16-20. The dropped object then falls into a first carriage 418 that is provided on a track 420 on which the carriage 418 may be moved automatically between a first sortation stage 422, a second sorting station 424, a third sorting station 426 and a fourth sorting station 428. The first sortation station 422 includes a second carriage 338 that may receive objects from the first carriage 418, and which travels along a track 340 between two rows of collection bins 432. The second sortation station 324 (as well as each of the stations 326 and 328) each includes a carriage 338 that may receive objects from the first carriage 418, and which travels along a track 340 between two rows of collection bins 336. Again, the collection bins may be removed in pairs by sliding a pair of the collection bins in a direction transverse to the movement of the associated carriage as discussed above with reference to FIG. 20.

The system 400 therefore includes 64 total collection bins. This system may be further scaled to add more collection bins. The first shuttle sorter (that transfers objects from the picking robot to the wings) may also be lengthened to accommodate 4 shuttle sort wings before system throughput is adversely affected. In particular, the system may be further expanded by again doubling the number of wings. This requires the addition of another shuttle sorter that takes the object from the picking robot and delivers it to one of the 4 wing systems. This keeps the shuttle sort back and forth travel time from adversely effecting overall system throughput.

Such a system is shown here in FIG. 22. In particular, FIG. 22 shows a system 500 that includes two independent articulated arms 552 having an end effector 554 in an input area 506, a primary carriage 520 on a track 522, as well as eight sortation stations 524, 526, 528, 530, 532. 564, 536 and 538. In each of these sortation stations, a carriage 338 is able to travel along its track 340 so as to access bins 342 as discussed above. The carriage 520 may be permitted to travel in a direction far enough to reach both the input conveyor 534 as well as the non-sortable output chute 512, which provides that the system may elect to send an object in the first carriage to either the input conveyor to be re-processed, or to the non-sortable output chute if the object is not sortable.

The systems 400 and 500 also provides, in each embodiment, dynamic collection bin allocation as discussed above. In typical human manned systems, collection bins are statically associated (to destinations, next stop facilities, customers, etc.) and don't change frequently; this is so that efficiency benefits, may be gained by humans learning the association and cubby locations. In the systems of the invention, no such constraints exist, since the system is placing all of the objects in collection bins, and it always has comprehensive knowledge of which objects are in the system, which are in each bin, etc. The system also has knowledge of all historical sortation activity, meaning that historical trends can be used to make even smarter choices about collection bin allocation.

In the simplest example, and with reference again to the two wing system shown in FIG. 10, if the historical data suggests that two of the collection bins in this system get the most objects in each sort cycle, then the system will allocate one of these bins to the first wing, and one to the second, thus ensuring that all the high volume bins are not on one wing creating a bottleneck. The system may also allocate bins close to the beginning of the wing, thereby ensuring minimum cycle times for the busiest collection bins. Lastly, if the system needs an empty bin, it can signal to a human operator to come and empty a given bin, allowing that bin to be used as soon as it is emptied. These strategies ensure that the cycle time of the shuttle sort wings does not impact overall system throughput.

Finally, the system may also allocate and group objects so as to maximize any other arbitrary cost function. Such a sortation system is typically a small part of a large system, usually extending across multiple facilities around the state, country, or world. As a part of such a large network, the performance of this system inevitably has impacts on costs elsewhere in the network. By understanding these impacts, the system presented herein may allocate objects to collection bins in order to minimize cost impact elsewhere in the macro network.

In this system concept, additional articulated arms (robots) may also be added to each of the concepts to scale throughput for the system. Typically, the number of robots R must be less than or equal to HALF of the number of wings W for the wing shuttle cycle time to not be the limiter to system throughput. Below this number of robots, throughput scales linearly. By adding robots and shuttle sort wings, and tuning shuttle sorter speeds and robot picking/scanning speeds, a wide range of overall system throughputs and cubby counts are possible using the same basic architecture.

For further scaling eight wings fed by one pick/scan station is the practical maximum. To scale max bins and max throughput beyond this, multiple of these stations can be parallelized and fed by manual or automated means, just as manual sort cells are fed in concepts discussed in the prior art. This allows for continued linear scaling of throughput, as well as for greater numbers of collection bins, since the system can now dynamically allocate between all the bins in all the wings in all of the parallel cells.

Those skilled in the art will appreciate that numerous modifications and variations may be made to the above disclosed embodiments without departing from the spirit and scope of the present invention.

Claims

1.-40. (canceled)

41. A method of processing objects using a programmable motion device, said method comprising: providing a plurality of intermediate containers, each of which is unassigned to any destination;acquiring with the programmable motion device an acquired object from a plurality of mixed objects at an input area;perceiving with a perception system first identifying indicia in connection with the acquired object;associating the first identifying indicia with a first weight value and assigning a relative weight value to the acquired object;assigning, using a computer processing system, assignment data representative of a first intermediate container among the plurality of intermediate containers to a first destination for the acquired object responsive to the first identifying indicia in connection with the acquired object responsive to the relative weight value assigned to the acquired object; andmoving the acquired object to the first intermediate container of a plurality of intermediate containers responsive to the assignment data, the first intermediate container being closer to the programmable motion device where the relative weight value is relatively high.

42. The method as claimed in claim 41, wherein the method further includes dynamically assigning additional intermediate containers to additional destinations for additional objects responsive to identifying indicia in connection with each of the additional objects.

43. The method as claimed in claim 41, wherein said method further includes changing a status of an intermediate container to finished when the intermediate container is full.

44. The method as claimed in claim 41, wherein said method further includes generating a signal to empty the first intermediate container before the container is full and identifying the emptied first intermediate container as available for re-assignment, by the computer processing system, when the number of objects expected to arrive indicates that the first intermediate container is not expected to receive another object bound for the first destination currently assigned to the first intermediate container within a given time.

45. The method as claimed in claim 41, wherein said method further includes assigning a second intermediate container to the destination location.

46. The method as claimed in claim 41, wherein each intermediate container is not assigned to a destination until an object is processed that becomes associated with the destination.

47. The method as claimed in claim 41, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on long-term historical usage trends and statistics.

48. The method as claimed in claim 41, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on future delivery requirements or sortation processes.

49. The method as claimed in claim 41, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on perception data regarding objects that are upstream of the input area.

50. The method as claimed in claim 41, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on data regarding objects that have already been processed and each assigned to a specific one of the plurality of intermediate containers.

51. The method as claimed in claim 41, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on objects currently being sorted by a plurality of programmable motion devices.

52. The method as claimed in claim 41, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on time-to-sort information.

53. The method as claimed in claim 41, wherein said method further includes using the programmable motion device to acquire a new intermediate container to replace a completed intermediate container.

54. A method of processing objects using a programmable motion device, said method comprising: providing a plurality of intermediate containers, each of which is unassigned to any destination;acquiring with the programmable motion device an acquired object from a plurality of mixed objects at an input area;perceiving with a perception system first identifying indicia in connection with the acquired object;associating the first identifying indicia with a first frequency value and assigning a relative frequency value to the acquired object;assigning, using a computer processing system, assignment data representative of a first intermediate container among the plurality of intermediate containers to a first destination for the acquired object responsive to the first identifying indicia in connection with the acquired object responsive to the relative frequency value assigned to the acquired object; andmoving the acquired object to the first intermediate container of a plurality of intermediate containers responsive to the assignment data, the first intermediate container being closer to the programmable motion device where the relative frequency value is relatively high.

55. The method as claimed in claim 54, wherein the method further includes dynamically assigning additional intermediate containers to additional destinations for additional objects responsive to identifying indicia in connection with each of the additional objects.

56. The method as claimed in claim 54, wherein said method further includes changing a status of an intermediate container to finished when the intermediate container is full.

57. The method as claimed in claim 54, wherein said method further includes generating a signal to empty the first intermediate container before the container is full and identifying the emptied first intermediate container as available for re-assignment, by the computer processing system, when the number of objects expected to arrive indicates that the first intermediate container is not expected to receive another object bound for the first destination currently assigned to the first intermediate container within a given time.

58. The method as claimed in claim 54, wherein said method further includes assigning a second intermediate container to the destination location.

59. The method as claimed in claim 54, wherein each intermediate container is not assigned to a destination until an object is processed that becomes associated with the destination.

60. The method as claimed in claim 54, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on long-term historical usage trends and statistics.

61. The method as claimed in claim 54, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on future delivery requirements or sortation processes.

62. The method as claimed in claim 54, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on perception data regarding objects that are upstream of the input area.

63. The method as claimed in claim 54, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on data regarding objects that have already been processed and each assigned to a specific one of the plurality of intermediate containers.

64. The method as claimed in claim 54, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on objects currently being sorted by a plurality of programmable motion devices.

65. The method as claimed in claim 54, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on time-to-sort information.

66. The method as claimed in claim 54, wherein said method further includes using the programmable motion device to acquire a new intermediate container to replace a completed intermediate container.

67. A method of processing objects using a programmable motion device, said method comprising: providing a plurality of intermediate containers, each of which is unassigned to any destination;acquiring with the programmable motion device an acquired object from a plurality of mixed objects at an input area;perceiving with a perception system first identifying indicia in connection with the acquired object;associating the first identifying indicia with a first frequency value and assigning a relative frequency value to the acquired object;assigning, using a computer processing system, assignment data representative of a first intermediate container among the plurality of intermediate containers to a first destination for the acquired object responsive to the first identifying indicia in connection with the acquired object responsive to the relative frequency value assigned to the acquired object; andmoving the acquired object to the first intermediate container of a plurality of intermediate containers responsive to the assignment data, the first intermediate container being farther to the programmable motion device where the relative frequency value is relatively low.

68. The method as claimed in claim 67, wherein the method further includes dynamically assigning additional intermediate containers to additional destinations for additional objects responsive to identifying indicia in connection with each of the additional objects.

69. The method as claimed in claim 67, wherein said method further includes changing a status of an intermediate container to finished when the intermediate container is full.

70. The method as claimed in claim 67, wherein said method further includes generating a signal to empty the first intermediate container before the container is full and identifying the emptied first intermediate container as available for re-assignment, by the computer processing system, when the number of objects expected to arrive indicates that the first intermediate container is not expected to receive another object bound for the first destination currently assigned to the first intermediate container within a given time.

71. The method as claimed in claim 67, wherein said method further includes assigning a second intermediate container to the destination location.

72. The method as claimed in claim 67, wherein each intermediate container is not assigned to a destination until an object is processed that becomes associated with the destination.

73. The method as claimed in claim 67, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on long-term historical usage trends and statistics.

74. The method as claimed in claim 67, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on future delivery requirements or sortation processes.

75. The method as claimed in claim 67, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on perception data regarding objects that are upstream of the input area.

76. The method as claimed in claim 67, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on data regarding objects that have already been processed and each assigned to a specific one of the plurality of intermediate containers.

77. The method as claimed in claim 67, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on objects currently being sorted by a plurality of programmable motion devices.

78. The method as claimed in claim 67, wherein assigning the first intermediate container among the plurality of intermediate containers to the first destination is further based on time-to-sort information.

79. The method as claimed in claim 67, wherein said method further includes using the programmable motion device to acquire a new intermediate container to replace a completed intermediate container.