US20170274531A1 - Robot queueing in order-fulfillment operations - Google Patents
Robot queueing in order-fulfillment operations Download PDFInfo
- Publication number
- US20170274531A1 US20170274531A1 US15/081,124 US201615081124A US2017274531A1 US 20170274531 A1 US20170274531 A1 US 20170274531A1 US 201615081124 A US201615081124 A US 201615081124A US 2017274531 A1 US2017274531 A1 US 2017274531A1
- Authority
- US
- United States
- Prior art keywords
- robot
- location
- queue
- target
- target location
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 claims abstract description 39
- 238000004891 communication Methods 0.000 claims description 6
- 239000003550 marker Substances 0.000 description 21
- 238000007726 management method Methods 0.000 description 14
- 238000013459 approach Methods 0.000 description 8
- 238000013507 mapping Methods 0.000 description 8
- 239000000047 product Substances 0.000 description 7
- 239000013598 vector Substances 0.000 description 5
- 238000012856 packing Methods 0.000 description 4
- 241000282412 Homo Species 0.000 description 3
- 230000000875 corresponding effect Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 1
- 238000007596 consolidation process Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course or altitude of land, water, air, or space vehicles, e.g. automatic pilot
- G05D1/02—Control of position or course in two dimensions
- G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
- G05D1/0287—Control of position or course in two dimensions specially adapted to land vehicles involving a plurality of land vehicles, e.g. fleet or convoy travelling
- G05D1/0291—Fleet control
- G05D1/0297—Fleet control by controlling means in a control room
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
- B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
- B25J9/00—Programme-controlled manipulators
- B25J9/16—Programme controls
- B25J9/1656—Programme controls characterised by programming, planning systems for manipulators
- B25J9/1664—Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning
- B25J9/1666—Avoiding collision or forbidden zones
-
- 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/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/39—Robotics, robotics to robotics hand
- G05B2219/39082—Collision, real time collision avoidance
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/40—Robotics, robotics mapping to robotics vision
- G05B2219/40317—For collision avoidance and detection
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S901/00—Robots
- Y10S901/01—Mobile robot
Definitions
- This invention relates to robot-assisted product order-fulfillment systems and methods and more particularly to queueing of robots destined for a common location.
- Ordering products over the internet for home delivery is an extremely popular way of shopping. Fulfilling such orders in a timely, accurate and efficient manner is logistically challenging to say the least. Clicking the “check out” button in a virtual shopping cart creates an “order.”
- the order includes a listing of items that are to be shipped to a particular address.
- the process of “fulfillment” involves physically taking or “picking” these items from a large warehouse, packing them, and shipping them to the designated address. An important goal of the order-fulfillment process is thus to ship as many items in as short a time as possible.
- the order-fulfillment process typically takes place in a large warehouse that contains many products, including those listed in the order. Among the tasks of order fulfillment is therefore that of traversing the warehouse to find and collect the various items listed in an order. In addition, the products that will ultimately be shipped first need to be received in the warehouse and stored or “placed” in storage bins in an orderly fashion throughout the warehouse so they can be readily retrieved for shipping.
- the goods that are being delivered and ordered can be stored in the warehouse very far apart from each other and dispersed among a great number of other goods.
- With an order-fulfillment process using only human operators to place and pick the goods requires the operators to do a great deal of walking and can be inefficient and time consuming. Since the efficiency of the fulfillment process is a function of the number of items shipped per unit time, increasing time reduces efficiency.
- robots may be used to perform functions of humans or they may be used to supplement the humans' activities.
- robots may be assigned to “place” a number of items in various locations dispersed throughout the warehouse or to “pick” items from various locations for packing and shipping.
- the picking and placing may be done by the robot alone or with the assistance of human operators. For example, in the case of a pick operation, the human operator would pick items from shelves and place them on the robots or, in the case of a place operation, the human operator would pick items from the robot and place them on the shelves.
- Race conditions are when two robots are attempting to get to the same place and become processor bound as they attempt to reconcile the changing external environment. Race conditions are very undesirable and can result the robots being unable to perform further operations until the condition is resolved.
- the invention features a method for queuing robots destined for a target location in an environment.
- the method includes determining if a first robot occupies the target location and if it is determined that the first robot occupies the target location, determining if a second robot destined for the target location has entered a predefined target zone proximate the target location. If it is determined that the second robot has entered the predefined target zone, the method includes navigating the second robot to a first queue location and causing the second robot to wait at the first queue location until the first robot no longer occupies the target location. The method also includes navigating the second robot to the target location after the first robot leaves the target location.
- the environment may be a warehouse space containing items for customer order fulfillment.
- the first queue location may be offset from the target location by a predetermined distance.
- the target location may be defined by a target pose and the first queue location may be defined by a first queue pose.
- the second robot may navigate to the first queue location by navigating to the first queue pose.
- the method may further include determining if a third robot destined for the target location has entered the predefined target zone when the first robot occupies the target location and the second robot occupies the first queue location.
- the method may include navigating the third robot to a second queue location and causing the third robot to wait at the second queue location until the first robot no longer occupies the target location.
- the second queue location may be offset from the first queue location by a predetermined distance.
- the second queue location may be defined by a second queue pose and the second robot may navigate to the second queue location by navigating to the second queue pose.
- the method may further include determining if the first robot continues to occupy the target location and if it does not, navigating the second robot to the target location, navigating the third robot to the first queue location, and causing the third robot to wait at the first queue location until the second robot no longer occupies the target location.
- Navigating the second robot to the target location may include navigating the second robot to the target pose and navigating the third robot to the first queue location may include navigating the second robot to the first queue pose.
- Another aspect the invention features a system for queuing robots destined for a target location.
- the management system is configured to communicate with the at least first and second robots and to determine if the first robot occupies the target location. If it is determined that the first robot occupies the target location, then it is determined if a second robot has entered a predefined target zone proximate the target location. If it is determined that the second robot has entered the predefined target zone, the management system navigates the second robot to a queue location and causes the second robot to wait at the predefined queue location until the first robot no longer occupies the target location. The management system then navigates the second robot to the target location after the first robot leaves the target location.
- the environment may be a warehouse space containing items for customer order fulfillment.
- the first queue location may be offset from the target location by a predetermined distance and the target location may be defined by a target pose.
- the first queue location may be defined by a first queue pose; and the second robot may navigate to the first queue location by navigating to the first queue pose.
- the management system may be configured to determine if the third robot has entered the predefined target zone when the first robot occupies the target location and the second robot occupies the first queue location.
- the system may direct the third robot to navigate to a second queue location and causes the third robot to wait at the second queue location until the first robot no longer occupies the target location.
- the second queue location may be offset from the first queue location by a predetermined distance and the second queue location may be defined by a second queue pose.
- the second robot may navigate to the second queue location by navigating to the second queue pose.
- the management system may be further configured to determine if the first robot continues to occupy the target location and if it does not, the system may direct the second robot to navigate to the target location.
- the system may also direct the third robot to navigate to the first queue location and causes the third robot to wait at the first queue location until the second robot no longer occupies the target location.
- the management system may further configured to direct the second robot to the target location by navigating it to the target pose and it may direct the third robot to the first queue location by navigating it to the first queue pose.
- a further aspect of the invention features a robot capable of navigating to predefined locations in an environment containing at least one additional robot.
- the robot and the at least one additional robot are capable of interacting with a management system.
- the robot includes a mobile base, a communication device enabling communication between the robot and the management system, and a processor, responsive to communications with the management system.
- the processor is configured to navigate the robot to a target location in the environment and determine if the at least one additional robot occupies the target location. If it is determined that the at least one additional robot occupies the target location, determine if the robot has entered a predefined target zone proximate the target location.
- the processor is configured to navigate the robot to a queue location and cause the robot to wait at the predefined queue location until the at least one additional robot no longer occupies the target location.
- the processor is configured to then navigate the robot to the target location after the at least one additional robot leaves the target location.
- FIG. 1 is a top plan view of an order-fulfillment warehouse
- FIG. 2 is a perspective view of a base of one of the robots used in the warehouse shown in FIG. 1 ;
- FIG. 3 is a perspective view of the robot in FIG. 2 outfitted with an armature and parked in front of a shelf shown in FIG. 1 ;
- FIG. 4 is a partial map of the warehouse of FIG. 1 created using laser radar on the robot;
- FIG. 5 is a flow chart depicting the process for locating fiducial markers dispersed throughout the warehouse and storing fiducial marker poses
- FIG. 6 is a table of the fiducial identification to pose mapping
- FIG. 7 is a table of the bin location to fiducial identification mapping
- FIG. 8 is a flow chart depicting product SKU to pose mapping process
- FIG. 9 is schematic view of the target and queue locations used in the queuing process according to this invention.
- FIG. 10 is a flow chart depicting the robot queuing process according to this invention.
- a typical order-fulfillment warehouse 10 includes shelves 12 filled with the various items that could be included in an order 16 .
- the order 16 from warehouse management server 15 arrives at an order-server 14 .
- the order-server 14 communicates the order 16 to a robot 18 selected from a plurality of robots that roam the warehouse 10 .
- a robot 18 shown in FIG. 2 , includes an autonomous wheeled base 20 having a laser-radar 22 .
- the base 20 also features a transceiver 24 that enables the robot 18 to receive instructions from the order-server 14 , and a camera 26 .
- the base 20 also features a processor 32 that receives data from the laser-radar 22 and the camera 26 to capture information representative of the robot's environment and a memory 34 that cooperate to carry out various tasks associated with navigation within the warehouse 10 , as well as to navigate to fiducial marker 30 placed on shelves 12 , as shown in FIG. 3 .
- Fiducial marker 30 (e.g. a two-dimensional bar code) corresponds to bin/location of an item ordered. The navigation approach of this invention is described in detail below with respect to FIGS. 4-8 .
- While the initial description provided herein is focused on picking items from bin locations in the warehouse to fulfill an order for shipment to a customer, the system is equally applicable to the storage or placing of items received into the warehouse in bin locations throughout the warehouse for later retrieval and shipment to a customer.
- the invention is also applicable to inventory control tasks associated with such a warehouse system, such as, consolidation, counting, verification, inspection and clean-up of products.
- robots 18 can be utilized to perform multiple tasks of different task types in an interleaved fashion. This means that robot 18 , while executing a single order traveling throughout the warehouse 10 , may be picking items, placing items, and performing inventory control tasks. This kind of interleaved task approach can significantly improve efficiency and performance.
- An upper surface 36 of the base 20 features a coupling 38 that engages any one of a plurality of interchangeable armatures 40 , one of which is shown in FIG. 3 .
- the particular armature 40 in FIG. 3 features a tote-holder 42 for carrying a tote 44 that receives items, and a tablet holder 46 for supporting a tablet 48 .
- the armature 40 supports one or more totes for carrying items.
- the base 20 supports one or more totes for carrying received items.
- tote includes, without limitation, cargo holders, bins, cages, shelves, rods from which items can be hung, caddies, crates, racks, stands, trestle, containers, boxes, canisters, vessels, and repositories.
- a more efficient way of picking items is to use a local operator 50 , which is typically human, to carry out the task of physically removing an ordered item from a shelf 12 and placing it on robot 18 , for example, in tote 44 .
- the robot 18 communicates the order to the local operator 50 via the tablet 48 , which the local operator 50 can read, or by transmitting the order to a handheld device used by the local operator 50 .
- the robot 18 Upon receiving an order 16 from the order server 14 , the robot 18 proceeds to a first warehouse location, e.g. shown in FIG. 3 . It does so based on navigation software stored in the memory 34 and carried out by the processor 32 .
- the navigation software relies on data concerning the environment, as collected by the laser-radar 22 , an internal table in memory 34 that identifies the fiducial identification (“ID”) of fiducial marker 30 that corresponds to a location in the warehouse 10 where a particular item can be found, and the camera 26 to navigate.
- ID fiducial identification
- the robot 18 Upon reaching the correct location, the robot 18 parks itself in front of a shelf 12 on which the item is stored and waits for a local operator 50 to retrieve the item from the shelf 12 and place it in tote 44 . If robot 18 has other items to retrieve it proceeds to those locations. The item(s) retrieved by robot 18 are then delivered to a packing station 100 , FIG. 1 , where they are packed and shipped.
- each robot may be fulfilling one or more orders and each order may consist of one or more items.
- route optimization software would be included to increase efficiency, but this is beyond the scope of this invention and is therefore not described herein.
- a single robot 18 and operator 50 are described.
- a typical fulfillment operation includes many robots and operators working among each other in the warehouse to fill a continuous stream of orders.
- a map of the warehouse 10 must be created and the location of various fiducial markers dispersed throughout the warehouse must be determined.
- one of the robots 18 navigates the warehouse and builds a map 10 a , FIG. 4 , utilizing its laser-radar 22 and simultaneous localization and mapping (SLAM), which is a computational problem of constructing or updating a map of an unknown environment.
- SLAM simultaneous localization and mapping
- Popular SLAM approximate solution methods include the particle filter and extended Kalman filter.
- the SLAM GMapping approach is the preferred approach, but any suitable SLAM approach can be used.
- Robot 18 utilizes its laser-radar 22 to create map 10 a of warehouse 10 as robot 18 travels throughout the space identifying, open space 112 , walls 114 , objects 116 , and other static obstacles, such as shelf 12 , in the space, based on the reflections it receives as the laser-radar scans the environment.
- one or more robots 18 navigates through warehouse 10 using camera 26 to scan the environment to locate fiducial markers (two-dimensional bar codes) dispersed throughout the warehouse on shelves proximate bins, such as 32 and 34 , FIG. 3 , in which items are stored.
- Robots 18 use a known starting point or origin for reference, such as origin 110 .
- origin 110 a known starting point or origin for reference, such as origin 110 .
- vector 120 By the use of wheel encoders and heading sensors, vector 120 , and the robot's position in the warehouse 10 can be determined.
- robot 18 can determine the orientation with respect to and distance from the robot of the fiducial marker/two-dimensional barcode, vector 130 .
- vector 140 With vectors 120 and 130 known, vector 140 , between origin 110 and fiducial marker 30 , can be determined. From vector 140 and the determined orientation of the fiducial marker/two-dimensional barcode relative to robot 18 , the pose (position and orientation) defined by a quaternion (x, y, z, ⁇ ) for fiducial marker 30 can be determined.
- Flow chart 200 describing the fiducial marker location process is described. This is performed in an initial mapping mode and as robot 18 encounters new fiducial markers in the warehouse while performing picking, placing and/or other tasks.
- robot 18 using camera 26 captures an image and in step 204 searches for fiducial markers within the captured images.
- step 206 if a fiducial marker is found in the image (step 204 ) it is determined if the fiducial marker is already stored in fiducial table 300 , FIG. 6 , which is located in memory 34 of robot 18 . If the fiducial information is stored in memory already, the flow chart returns to step 202 to capture another image. If it is not in memory, the pose is determined according to the process described above and in step 208 , it is added to fiducial to pose lookup table 300 .
- look-up table 300 which may be stored in the memory of each robot, there are included for each fiducial marker a fiducial identification, 1, 2, 3, etc, and a pose for the fiducial marker/bar code associated with each fiducial identification.
- the pose consists of the x,y,z coordinates in the warehouse along with the orientation or the quaternion (x,y,z, ⁇ ).
- FIG. 7 which may also be stored in the memory of each robot, is a listing of bin locations (e.g. 402 a - f ) within warehouse 10 , which are correlated to particular fiducial ID's 404 , e.g. number “11”.
- the bin locations in this example, consist of seven alpha-numeric characters. The first six characters (e.g. L01001) pertain to the shelf location within the warehouse and the last character (e.g. A-F) identifies the particular bin at the shelf location. In this example, there are six different bin locations associated with fiducial ID “11”. There may be one or more bins associated with each fiducial ID/marker.
- the alpha-numeric bin locations are understandable to humans, e.g. operator 50 , FIG. 3 , as corresponding to a physical location in the warehouse 10 where items are stored. However, they do not have meaning to robot 18 .
- Robot 18 can determine the pose of the fiducial ID using the information in table 300 , FIG. 6 , and then navigate to the pose as described herein.
- step 502 warehouse management system 15 , FIG. 1 , obtains an order, which may consist of one or more items to be retrieved.
- step 504 the SKU number(s) of the items is/are determined by the warehouse management system 15 , and from the SKU number(s), the bin location(s) is/are determined in step 506 .
- a list of bin locations for the order is then transmitted to robot 18 .
- robot 18 correlates the bin locations to fiducial ID's and from the fiducial ID's, the pose of each fiducial ID is obtained in step 510 .
- step 512 the robot 18 navigates to the pose as shown in FIG. 3 , where an operator can pick the item to be retrieved from the appropriate bin and place it on the robot.
- Item specific information such as SKU number and bin location, obtained by the warehouse management system 15 , can be transmitted to tablet 48 on robot 18 so that the operator 50 can be informed of the particular items to be retrieved when the robot arrives at each fiducial marker location.
- robot 18 can readily navigate to any one of the fiducial ID's using various robot navigation techniques.
- the preferred approach involves setting an initial route to the fiducial marker pose given the knowledge of the open space 112 in the warehouse 10 and the walls 114 , shelves (such as shelf 12 ) and other obstacles 116 .
- the robot begins to traverse the warehouse using its laser radar 26 , it determines if there are any obstacles in its path, either fixed or dynamic, such as other robots 18 and/or operators 50 , and iteratively updates its path to the pose of the fiducial marker.
- the robot re-plans its route about once every 50 milliseconds, constantly searching for the most efficient and effective path while avoiding obstacles.
- robots 18 are able to very efficiently and effectively navigate the warehouse space without having to use more complex navigation approaches typically used which involve grid lines and intermediate fiducial markers to determine location within the warehouse.
- a problem that can arise with multiple robots navigating a space is called a “race condition”, which can occur if one or more robots attempt to navigate to a space occupied by another robot.
- alternative destinations for the robots are created to place them in a queue and avoid race conditions from occuring.
- the process is depicted in FIG. 9 , where robot 600 is shown positioned at a target location/pose 602 .
- Pose 602 could correspond to any location in a warehouse space, for example, a packing or loading station or a position near a particular bin.
- robots 604 , 606 , and 608 are redirected to temporary holding locations, such as locations or queue slots 610 , 612 , and 614 .
- Queue slots 610 , 612 , and 614 are offset from pose 612 .
- queue slot 610 is offset from pose 602 by a distance x, which could be, for example, one (1) meter.
- Queue slot 612 is offset from queue slot 610 by an additional distance x and queue slot 614 is offset another distance x from queue slot 612 . While, in this example, the distances are uniformly spaced along a straight line emanating from pose 602 , this is not a requirement of the invention.
- the locations of the queue slots may be non-uniform and variable given the dynamic environment of the warehouse.
- the queue slots maybe offset according to an queuing algorithm that observes the underlying global map and the existing obstacles and constraints of the local map. The queuing algorithm may also consider the practical limits of queuing in the space proximate the target location/pose to avoid blocking traffic, interfering with other locations, and creating new obstacles.
- the proper queue slotting of robots into the queue must be managed.
- the robot with the first priority to occupy the pose 602 is queued in the first queue slot 610 , while the other robots are queued in the other queue slots based on their respective priorities.
- Priorities are determined by the order of the robots' entry into a zone 618 proximate pose 602 .
- zone 618 is defined by a radius, R, about pose 602 , which in this case is approximately three (3) meters (or 3x).
- the first robot to enter the zone, in this case 604 has the highest priority and is assigned the first queue slot, queue slot 610 .
- robot 606 which is closer to zone 618 than robot 608 , enters zone 618 , assuming that robot 600 is still at pose 602 and robot 604 is located at queue slot 610 , it has the next highest priority and it is therefore assigned queue slot 612 .
- robot 608 enters zone 618 , assuming that robot 600 is still at pose 602 and robots 604 and 606 are still located at queue slots 610 and 612 , respectively, it is assigned to queue slot 614 .
- robot 600 moves from pose 602
- robot 604 moves from queue slot 610 to pose 602
- Robots 606 and 608 move to queue slot positions 610 and 612 , respectively.
- the next robot to enter zone 618 would be positioned in queue slot position 614 .
- additional number of queue slot positions could be included to accommodate expected traffic flows.
- the manner in which the robots are navigated to the queue slots and ultimately the target location is accomplished by temporarily redirecting them from the pose of the target location to the pose(s) of the queue slot(s).
- its target pose is temporarily adjusted to a pose corresponding to the location of the queue slot to which it is assigned.
- the pose is again adjusted temporarily to the pose of the queue slot with the next highest priority until it is able to reach its original target location at which time the pose is reset to the original target pose.
- Flow chart 700 depicts the robot queuing process implemented by WMS 15 for a particular pose (target pose) within the warehouse.
- step 702 it is determined if the target pose is occupied by a robot. If it is not, the process returns to step 702 until there is a robot occupying the target pose.
- the process determines at step 704 if there is another robot in the target zone or if there is a robot in one or more of the queue slots. If it is determined that there is no robot in the target zone or in one or more queue slots, the process returns to step 702 . If it is determined that there is a robot occupying the target pose or if the queue slot(s) is/are occupied, then at step 706 the robots are assigned to the appropriate queue slots.
- the robot in the target zone is directed to occupy the first queue slot, i.e. queue slot 610 , FIG. 9 . If there is a robot in the target zone and a robot (or multiple robots in the queue slots) then the robot in the target zone is slotted into the next available queue slot, as described above. If there is no robot in the target zone but there is/are robot(s) in the queue slot(s), then the slotted robots remain in the same positions.
- the robots in the queue slots are moved up a position, i.e. queue slot 610 to the target pose, queue slot 612 to queue slot 610 and so forth. If the target pose is still occupied, the process returns to step 704 .
Abstract
Description
- This application claims the benefit of the priority date of U.S. application Ser. No. 14/815,246, filed on Jul. 31, 2015, the contents of which are incorporated herein by reference in their entirety.
- This invention relates to robot-assisted product order-fulfillment systems and methods and more particularly to queueing of robots destined for a common location.
- Ordering products over the internet for home delivery is an extremely popular way of shopping. Fulfilling such orders in a timely, accurate and efficient manner is logistically challenging to say the least. Clicking the “check out” button in a virtual shopping cart creates an “order.” The order includes a listing of items that are to be shipped to a particular address. The process of “fulfillment” involves physically taking or “picking” these items from a large warehouse, packing them, and shipping them to the designated address. An important goal of the order-fulfillment process is thus to ship as many items in as short a time as possible.
- The order-fulfillment process typically takes place in a large warehouse that contains many products, including those listed in the order. Among the tasks of order fulfillment is therefore that of traversing the warehouse to find and collect the various items listed in an order. In addition, the products that will ultimately be shipped first need to be received in the warehouse and stored or “placed” in storage bins in an orderly fashion throughout the warehouse so they can be readily retrieved for shipping.
- In a large warehouse, the goods that are being delivered and ordered can be stored in the warehouse very far apart from each other and dispersed among a great number of other goods. With an order-fulfillment process using only human operators to place and pick the goods requires the operators to do a great deal of walking and can be inefficient and time consuming. Since the efficiency of the fulfillment process is a function of the number of items shipped per unit time, increasing time reduces efficiency.
- In order to increase efficiency, robots may be used to perform functions of humans or they may be used to supplement the humans' activities. For example, robots may be assigned to “place” a number of items in various locations dispersed throughout the warehouse or to “pick” items from various locations for packing and shipping. The picking and placing may be done by the robot alone or with the assistance of human operators. For example, in the case of a pick operation, the human operator would pick items from shelves and place them on the robots or, in the case of a place operation, the human operator would pick items from the robot and place them on the shelves.
- With numerous robots navigating a space it is very possible and even likely that robots will attempt to navigate to a position that is occupied by another robot, resulting in a race condition. Race conditions are when two robots are attempting to get to the same place and become processor bound as they attempt to reconcile the changing external environment. Race conditions are very undesirable and can result the robots being unable to perform further operations until the condition is resolved.
- In one aspect the invention features a method for queuing robots destined for a target location in an environment. The method includes determining if a first robot occupies the target location and if it is determined that the first robot occupies the target location, determining if a second robot destined for the target location has entered a predefined target zone proximate the target location. If it is determined that the second robot has entered the predefined target zone, the method includes navigating the second robot to a first queue location and causing the second robot to wait at the first queue location until the first robot no longer occupies the target location. The method also includes navigating the second robot to the target location after the first robot leaves the target location.
- In other aspects of the invention, one or more of the following features may be included. The environment may be a warehouse space containing items for customer order fulfillment. The first queue location may be offset from the target location by a predetermined distance. The target location may be defined by a target pose and the first queue location may be defined by a first queue pose. The second robot may navigate to the first queue location by navigating to the first queue pose. The method may further include determining if a third robot destined for the target location has entered the predefined target zone when the first robot occupies the target location and the second robot occupies the first queue location. If it is determined that the third robot has entered the predefined target zone while the first robot occupies the target location and the second robot occupies the first queue location, the method may include navigating the third robot to a second queue location and causing the third robot to wait at the second queue location until the first robot no longer occupies the target location.
- In further aspects of the invention, the second queue location may be offset from the first queue location by a predetermined distance. The second queue location may be defined by a second queue pose and the second robot may navigate to the second queue location by navigating to the second queue pose. The method may further include determining if the first robot continues to occupy the target location and if it does not, navigating the second robot to the target location, navigating the third robot to the first queue location, and causing the third robot to wait at the first queue location until the second robot no longer occupies the target location. Navigating the second robot to the target location may include navigating the second robot to the target pose and navigating the third robot to the first queue location may include navigating the second robot to the first queue pose.
- Another aspect the invention features a system for queuing robots destined for a target location. There is a management system and at least first and second robots destined for a target location. The management system is configured to communicate with the at least first and second robots and to determine if the first robot occupies the target location. If it is determined that the first robot occupies the target location, then it is determined if a second robot has entered a predefined target zone proximate the target location. If it is determined that the second robot has entered the predefined target zone, the management system navigates the second robot to a queue location and causes the second robot to wait at the predefined queue location until the first robot no longer occupies the target location. The management system then navigates the second robot to the target location after the first robot leaves the target location.
- In other aspects of the invention, one or more of the following features may be included. The environment may be a warehouse space containing items for customer order fulfillment. The first queue location may be offset from the target location by a predetermined distance and the target location may be defined by a target pose. The first queue location may be defined by a first queue pose; and the second robot may navigate to the first queue location by navigating to the first queue pose. If a third robot destined for the target location, the management system may be configured to determine if the third robot has entered the predefined target zone when the first robot occupies the target location and the second robot occupies the first queue location. If it is determined that the third robot has entered the predefined target zone while the first robot occupies the target location and the second robot occupies the first queue location, the system may direct the third robot to navigate to a second queue location and causes the third robot to wait at the second queue location until the first robot no longer occupies the target location.
- In further aspects of the invention, the second queue location may be offset from the first queue location by a predetermined distance and the second queue location may be defined by a second queue pose. The second robot may navigate to the second queue location by navigating to the second queue pose. The management system may be further configured to determine if the first robot continues to occupy the target location and if it does not, the system may direct the second robot to navigate to the target location. The system may also direct the third robot to navigate to the first queue location and causes the third robot to wait at the first queue location until the second robot no longer occupies the target location. The management system may further configured to direct the second robot to the target location by navigating it to the target pose and it may direct the third robot to the first queue location by navigating it to the first queue pose.
- A further aspect of the invention features a robot capable of navigating to predefined locations in an environment containing at least one additional robot. The robot and the at least one additional robot are capable of interacting with a management system. The robot includes a mobile base, a communication device enabling communication between the robot and the management system, and a processor, responsive to communications with the management system. The processor is configured to navigate the robot to a target location in the environment and determine if the at least one additional robot occupies the target location. If it is determined that the at least one additional robot occupies the target location, determine if the robot has entered a predefined target zone proximate the target location. If it is determined that the robot has entered the predefined target zone, the processor is configured to navigate the robot to a queue location and cause the robot to wait at the predefined queue location until the at least one additional robot no longer occupies the target location. The processor is configured to then navigate the robot to the target location after the at least one additional robot leaves the target location.
- These and other features of the invention will be apparent from the following detailed description and the accompanying figures, in which:
-
FIG. 1 is a top plan view of an order-fulfillment warehouse; -
FIG. 2 is a perspective view of a base of one of the robots used in the warehouse shown inFIG. 1 ; -
FIG. 3 is a perspective view of the robot inFIG. 2 outfitted with an armature and parked in front of a shelf shown inFIG. 1 ; -
FIG. 4 is a partial map of the warehouse ofFIG. 1 created using laser radar on the robot; -
FIG. 5 is a flow chart depicting the process for locating fiducial markers dispersed throughout the warehouse and storing fiducial marker poses; -
FIG. 6 is a table of the fiducial identification to pose mapping; -
FIG. 7 is a table of the bin location to fiducial identification mapping; -
FIG. 8 is a flow chart depicting product SKU to pose mapping process; -
FIG. 9 is schematic view of the target and queue locations used in the queuing process according to this invention; and -
FIG. 10 is a flow chart depicting the robot queuing process according to this invention. - Referring to
FIG. 1 , a typical order-fulfillment warehouse 10 includesshelves 12 filled with the various items that could be included in anorder 16. In operation, theorder 16 fromwarehouse management server 15 arrives at an order-server 14. The order-server 14 communicates theorder 16 to arobot 18 selected from a plurality of robots that roam thewarehouse 10. - In a preferred embodiment, a
robot 18, shown inFIG. 2 , includes an autonomouswheeled base 20 having a laser-radar 22. The base 20 also features atransceiver 24 that enables therobot 18 to receive instructions from the order-server 14, and acamera 26. The base 20 also features aprocessor 32 that receives data from the laser-radar 22 and thecamera 26 to capture information representative of the robot's environment and amemory 34 that cooperate to carry out various tasks associated with navigation within thewarehouse 10, as well as to navigate tofiducial marker 30 placed onshelves 12, as shown inFIG. 3 . Fiducial marker 30 (e.g. a two-dimensional bar code) corresponds to bin/location of an item ordered. The navigation approach of this invention is described in detail below with respect toFIGS. 4-8 . - While the initial description provided herein is focused on picking items from bin locations in the warehouse to fulfill an order for shipment to a customer, the system is equally applicable to the storage or placing of items received into the warehouse in bin locations throughout the warehouse for later retrieval and shipment to a customer. The invention is also applicable to inventory control tasks associated with such a warehouse system, such as, consolidation, counting, verification, inspection and clean-up of products.
- As described in more detail below,
robots 18 can be utilized to perform multiple tasks of different task types in an interleaved fashion. This means thatrobot 18, while executing a single order traveling throughout thewarehouse 10, may be picking items, placing items, and performing inventory control tasks. This kind of interleaved task approach can significantly improve efficiency and performance. - Referring again to
FIG. 2 , Anupper surface 36 of the base 20 features acoupling 38 that engages any one of a plurality ofinterchangeable armatures 40, one of which is shown inFIG. 3 . Theparticular armature 40 inFIG. 3 features a tote-holder 42 for carrying atote 44 that receives items, and atablet holder 46 for supporting atablet 48. In some embodiments, thearmature 40 supports one or more totes for carrying items. In other embodiments, thebase 20 supports one or more totes for carrying received items. As used herein, the term “tote” includes, without limitation, cargo holders, bins, cages, shelves, rods from which items can be hung, caddies, crates, racks, stands, trestle, containers, boxes, canisters, vessels, and repositories. - Although a
robot 18 excels at moving around thewarehouse 10, with current robot technology, it is not very good at quickly and efficiently picking items from a shelf and placing them on thetote 44 due to the technical difficulties associated with robotic manipulation of objects. A more efficient way of picking items is to use alocal operator 50, which is typically human, to carry out the task of physically removing an ordered item from ashelf 12 and placing it onrobot 18, for example, intote 44. Therobot 18 communicates the order to thelocal operator 50 via thetablet 48, which thelocal operator 50 can read, or by transmitting the order to a handheld device used by thelocal operator 50. - Upon receiving an
order 16 from theorder server 14, therobot 18 proceeds to a first warehouse location, e.g. shown inFIG. 3 . It does so based on navigation software stored in thememory 34 and carried out by theprocessor 32. The navigation software relies on data concerning the environment, as collected by the laser-radar 22, an internal table inmemory 34 that identifies the fiducial identification (“ID”) offiducial marker 30 that corresponds to a location in thewarehouse 10 where a particular item can be found, and thecamera 26 to navigate. - Upon reaching the correct location, the
robot 18 parks itself in front of ashelf 12 on which the item is stored and waits for alocal operator 50 to retrieve the item from theshelf 12 and place it intote 44. Ifrobot 18 has other items to retrieve it proceeds to those locations. The item(s) retrieved byrobot 18 are then delivered to apacking station 100,FIG. 1 , where they are packed and shipped. - It will be understood by those skilled in the art that each robot may be fulfilling one or more orders and each order may consist of one or more items. Typically, some form of route optimization software would be included to increase efficiency, but this is beyond the scope of this invention and is therefore not described herein.
- In order to simplify the description of the invention, a
single robot 18 andoperator 50 are described. However, as is evident fromFIG. 1 , a typical fulfillment operation includes many robots and operators working among each other in the warehouse to fill a continuous stream of orders. - The navigation approach of this invention, as well as the semantic mapping of a SKU of an item to be retrieved to a fiducial ID/pose associated with a fiducial marker in the warehouse where the item is located, is described in detail below with respect to
FIGS. 4-8 . - Using one or
more robots 18, a map of thewarehouse 10 must be created and the location of various fiducial markers dispersed throughout the warehouse must be determined. To do this, one of therobots 18 navigates the warehouse and builds amap 10 a,FIG. 4 , utilizing its laser-radar 22 and simultaneous localization and mapping (SLAM), which is a computational problem of constructing or updating a map of an unknown environment. Popular SLAM approximate solution methods include the particle filter and extended Kalman filter. The SLAM GMapping approach is the preferred approach, but any suitable SLAM approach can be used. -
Robot 18 utilizes its laser-radar 22 to createmap 10 a ofwarehouse 10 asrobot 18 travels throughout the space identifying,open space 112,walls 114, objects 116, and other static obstacles, such asshelf 12, in the space, based on the reflections it receives as the laser-radar scans the environment. - While constructing the
map 10 a or thereafter, one ormore robots 18 navigates throughwarehouse 10 usingcamera 26 to scan the environment to locate fiducial markers (two-dimensional bar codes) dispersed throughout the warehouse on shelves proximate bins, such as 32 and 34,FIG. 3 , in which items are stored.Robots 18 use a known starting point or origin for reference, such asorigin 110. When a fiducial marker, such asfiducial marker 30,FIGS. 3 and 4 , is located byrobot 18 using itscamera 26, the location in the warehouse relative toorigin 110 is determined. - By the use of wheel encoders and heading sensors,
vector 120, and the robot's position in thewarehouse 10 can be determined. Using the captured image of a fiducial marker/two-dimensional barcode and its known size,robot 18 can determine the orientation with respect to and distance from the robot of the fiducial marker/two-dimensional barcode,vector 130. Withvectors vector 140, betweenorigin 110 andfiducial marker 30, can be determined. Fromvector 140 and the determined orientation of the fiducial marker/two-dimensional barcode relative torobot 18, the pose (position and orientation) defined by a quaternion (x, y, z, ω) forfiducial marker 30 can be determined. -
Flow chart 200,FIG. 5 , describing the fiducial marker location process is described. This is performed in an initial mapping mode and asrobot 18 encounters new fiducial markers in the warehouse while performing picking, placing and/or other tasks. Instep 202,robot 18 usingcamera 26 captures an image and instep 204 searches for fiducial markers within the captured images. Instep 206, if a fiducial marker is found in the image (step 204) it is determined if the fiducial marker is already stored in fiducial table 300,FIG. 6 , which is located inmemory 34 ofrobot 18. If the fiducial information is stored in memory already, the flow chart returns to step 202 to capture another image. If it is not in memory, the pose is determined according to the process described above and instep 208, it is added to fiducial to pose lookup table 300. - In look-up table 300, which may be stored in the memory of each robot, there are included for each fiducial marker a fiducial identification, 1, 2, 3, etc, and a pose for the fiducial marker/bar code associated with each fiducial identification. The pose consists of the x,y,z coordinates in the warehouse along with the orientation or the quaternion (x,y,z, ω).
- In another look-up Table 400,
FIG. 7 , which may also be stored in the memory of each robot, is a listing of bin locations (e.g. 402 a-f) withinwarehouse 10, which are correlated to particular fiducial ID's 404, e.g. number “11”. The bin locations, in this example, consist of seven alpha-numeric characters. The first six characters (e.g. L01001) pertain to the shelf location within the warehouse and the last character (e.g. A-F) identifies the particular bin at the shelf location. In this example, there are six different bin locations associated with fiducial ID “11”. There may be one or more bins associated with each fiducial ID/marker. - The alpha-numeric bin locations are understandable to humans,
e.g. operator 50,FIG. 3 , as corresponding to a physical location in thewarehouse 10 where items are stored. However, they do not have meaning torobot 18. By mapping the locations to fiducial ID's,Robot 18 can determine the pose of the fiducial ID using the information in table 300,FIG. 6 , and then navigate to the pose as described herein. - The order fulfillment process according to this invention is depicted in
flow chart 500,FIG. 8 . Instep 502,warehouse management system 15,FIG. 1 , obtains an order, which may consist of one or more items to be retrieved. Instep 504 the SKU number(s) of the items is/are determined by thewarehouse management system 15, and from the SKU number(s), the bin location(s) is/are determined instep 506. A list of bin locations for the order is then transmitted torobot 18. Instep 508,robot 18 correlates the bin locations to fiducial ID's and from the fiducial ID's, the pose of each fiducial ID is obtained in step 510. Instep 512 therobot 18 navigates to the pose as shown inFIG. 3 , where an operator can pick the item to be retrieved from the appropriate bin and place it on the robot. - Item specific information, such as SKU number and bin location, obtained by the
warehouse management system 15, can be transmitted totablet 48 onrobot 18 so that theoperator 50 can be informed of the particular items to be retrieved when the robot arrives at each fiducial marker location. - With the SLAM map and the pose of the fiducial ID's known,
robot 18 can readily navigate to any one of the fiducial ID's using various robot navigation techniques. The preferred approach involves setting an initial route to the fiducial marker pose given the knowledge of theopen space 112 in thewarehouse 10 and thewalls 114, shelves (such as shelf 12) andother obstacles 116. As the robot begins to traverse the warehouse using itslaser radar 26, it determines if there are any obstacles in its path, either fixed or dynamic, such asother robots 18 and/oroperators 50, and iteratively updates its path to the pose of the fiducial marker. The robot re-plans its route about once every 50 milliseconds, constantly searching for the most efficient and effective path while avoiding obstacles. - With the product SKU/fiducial ID to fiducial pose mapping technique combined with the SLAM navigation technique both described herein,
robots 18 are able to very efficiently and effectively navigate the warehouse space without having to use more complex navigation approaches typically used which involve grid lines and intermediate fiducial markers to determine location within the warehouse. - As described above, a problem that can arise with multiple robots navigating a space is called a “race condition”, which can occur if one or more robots attempt to navigate to a space occupied by another robot. With this invention, alternative destinations for the robots are created to place them in a queue and avoid race conditions from occuring. The process is depicted in
FIG. 9 , whererobot 600 is shown positioned at a target location/pose 602. Pose 602 could correspond to any location in a warehouse space, for example, a packing or loading station or a position near a particular bin. When other robots try to navigate to pose 602, such asrobots queue slots -
Queue slots pose 612. In thisexample queue slot 610 is offset frompose 602 by a distance x, which could be, for example, one (1) meter.Queue slot 612 is offset fromqueue slot 610 by an additional distance x andqueue slot 614 is offset another distance x fromqueue slot 612. While, in this example, the distances are uniformly spaced along a straight line emanating frompose 602, this is not a requirement of the invention. The locations of the queue slots may be non-uniform and variable given the dynamic environment of the warehouse. The queue slots maybe offset according to an queuing algorithm that observes the underlying global map and the existing obstacles and constraints of the local map. The queuing algorithm may also consider the practical limits of queuing in the space proximate the target location/pose to avoid blocking traffic, interfering with other locations, and creating new obstacles. - In addition, the proper queue slotting of robots into the queue must be managed. In the example shown in
FIG. 9 , the robot with the first priority to occupy thepose 602 is queued in thefirst queue slot 610, while the other robots are queued in the other queue slots based on their respective priorities. Priorities are determined by the order of the robots' entry into azone 618proximate pose 602. In this case,zone 618 is defined by a radius, R, aboutpose 602, which in this case is approximately three (3) meters (or 3x). The first robot to enter the zone, in thiscase 604, has the highest priority and is assigned the first queue slot,queue slot 610. Whenrobot 606, which is closer to zone 618 thanrobot 608, enterszone 618, assuming thatrobot 600 is still atpose 602 androbot 604 is located atqueue slot 610, it has the next highest priority and it is therefore assignedqueue slot 612. Whenrobot 608 then enterszone 618, assuming thatrobot 600 is still atpose 602 androbots queue slots queue slot 614. - When
robot 600 moves frompose 602,robot 604 moves fromqueue slot 610 to pose 602.Robots slot positions zone 618 would be positioned inqueue slot position 614. Of course, additional number of queue slot positions could be included to accommodate expected traffic flows. - The manner in which the robots are navigated to the queue slots and ultimately the target location is accomplished by temporarily redirecting them from the pose of the target location to the pose(s) of the queue slot(s). In other words, when it is determined that a robot must be placed in a queue slot, its target pose is temporarily adjusted to a pose corresponding to the location of the queue slot to which it is assigned. As it moves up in position in the queue, the pose is again adjusted temporarily to the pose of the queue slot with the next highest priority until it is able to reach its original target location at which time the pose is reset to the original target pose.
-
Flow chart 700,FIG. 10 , depicts the robot queuing process implemented byWMS 15 for a particular pose (target pose) within the warehouse. Atstep 702, it is determined if the target pose is occupied by a robot. If it is not, the process returns to step 702 until there is a robot occupying the target pose. When a robot is occupying the target pose, the process determines atstep 704 if there is another robot in the target zone or if there is a robot in one or more of the queue slots. If it is determined that there is no robot in the target zone or in one or more queue slots, the process returns to step 702. If it is determined that there is a robot occupying the target pose or if the queue slot(s) is/are occupied, then atstep 706 the robots are assigned to the appropriate queue slots. - If there is a robot in the target zone but no robot in the queue slots, then the robot in the target zone is directed to occupy the first queue slot, i.e.
queue slot 610,FIG. 9 . If there is a robot in the target zone and a robot (or multiple robots in the queue slots) then the robot in the target zone is slotted into the next available queue slot, as described above. If there is no robot in the target zone but there is/are robot(s) in the queue slot(s), then the slotted robots remain in the same positions. Atstep 708, if it is determined that the target pose is not occupied, then the robots in the queue slots are moved up a position, i.e.queue slot 610 to the target pose,queue slot 612 toqueue slot 610 and so forth. If the target pose is still occupied, the process returns to step 704. - Having described the invention, and a preferred embodiment thereof, what is claimed as new and secured by letters patent is:
Claims (15)
Priority Applications (12)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/081,124 US9776324B1 (en) | 2016-03-25 | 2016-03-25 | Robot queueing in order-fulfillment operations |
CA3018911A CA3018911C (en) | 2016-03-25 | 2017-03-25 | Robot queueing in order-fulfillment operations |
BR112018069453-3A BR112018069453B1 (en) | 2016-03-25 | 2017-03-25 | METHOD FOR QUEUING ROBOTS TARGETED FOR A TARGET LOCATION IN AN ENVIRONMENT, SYSTEM FOR QUEUING ROBOTS TARGETED FOR A TARGET LOCATION, AND ROBOT CAPABLE OF NAVIGATION TO PREDEFINED LOCATIONS IN AN ENVIRONMENT CONTAINING AT LEAST ONE ADDITIONAL ROBOT |
ES17719951T ES2863656T3 (en) | 2016-03-25 | 2017-03-25 | Operations of queuing robots for order fulfillment |
EP17719951.0A EP3433690B1 (en) | 2016-03-25 | 2017-03-25 | Robot queueing order-fulfillment operations |
KR1020187030689A KR102360581B1 (en) | 2016-03-25 | 2017-03-25 | Robot queuing in order fulfillment behavior |
JP2018550338A JP6936243B2 (en) | 2016-03-25 | 2017-03-25 | Methods and systems for robots and queue robots in order fulfillment operations |
MX2018011598A MX2018011598A (en) | 2016-03-25 | 2017-03-25 | Robot queueing order-fulfillment operations. |
CN201780026355.XA CN109074080B (en) | 2016-03-25 | 2017-03-25 | Robotic queuing in order fulfillment operations |
PCT/US2017/024194 WO2017165873A1 (en) | 2016-03-25 | 2017-03-25 | Robot queueing order-fulfillment operations |
US15/628,751 US20170282368A1 (en) | 2016-03-25 | 2017-06-21 | Robot queueing in order-fulfillment operations |
US15/697,759 US10513033B2 (en) | 2016-03-25 | 2017-09-07 | Robot queuing in order fulfillment operations |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/081,124 US9776324B1 (en) | 2016-03-25 | 2016-03-25 | Robot queueing in order-fulfillment operations |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/628,751 Continuation US20170282368A1 (en) | 2016-03-25 | 2017-06-21 | Robot queueing in order-fulfillment operations |
US15/697,759 Continuation-In-Part US10513033B2 (en) | 2016-03-25 | 2017-09-07 | Robot queuing in order fulfillment operations |
Publications (2)
Publication Number | Publication Date |
---|---|
US20170274531A1 true US20170274531A1 (en) | 2017-09-28 |
US9776324B1 US9776324B1 (en) | 2017-10-03 |
Family
ID=58639037
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/081,124 Active US9776324B1 (en) | 2016-03-25 | 2016-03-25 | Robot queueing in order-fulfillment operations |
US15/628,751 Abandoned US20170282368A1 (en) | 2016-03-25 | 2017-06-21 | Robot queueing in order-fulfillment operations |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/628,751 Abandoned US20170282368A1 (en) | 2016-03-25 | 2017-06-21 | Robot queueing in order-fulfillment operations |
Country Status (10)
Country | Link |
---|---|
US (2) | US9776324B1 (en) |
EP (1) | EP3433690B1 (en) |
JP (1) | JP6936243B2 (en) |
KR (1) | KR102360581B1 (en) |
CN (1) | CN109074080B (en) |
BR (1) | BR112018069453B1 (en) |
CA (1) | CA3018911C (en) |
ES (1) | ES2863656T3 (en) |
MX (1) | MX2018011598A (en) |
WO (1) | WO2017165873A1 (en) |
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110119861A (en) * | 2018-02-07 | 2019-08-13 | 北京京东尚科信息技术有限公司 | Dispatch the method, apparatus and computer readable storage medium of unmanned vehicle |
CN111950818A (en) * | 2019-05-14 | 2020-11-17 | 北京京东尚科信息技术有限公司 | Unmanned vehicle dispatching method and device |
CN112256010A (en) * | 2019-07-04 | 2021-01-22 | 北京京东乾石科技有限公司 | Dispatching method and device for automatic guided vehicle and storage medium |
US20210139243A1 (en) * | 2017-08-15 | 2021-05-13 | Tompkins Robotics, Inc. | Mobile sorter platforms and method for sorting articles |
CN113190020A (en) * | 2021-05-31 | 2021-07-30 | 山东建筑大学 | Mobile robot queue system and path planning and following method |
JP2021522618A (en) * | 2018-06-21 | 2021-08-30 | 北京極智嘉科技股▲ふん▼有限公司Beijing Geekplus Technology Co.,Ltd. | Robot scheduling, robot routing methods, servers and storage media |
CN113673887A (en) * | 2021-08-25 | 2021-11-19 | 深圳市库宝软件有限公司 | Task allocation method, device, server and storage medium |
EP3989029A1 (en) * | 2020-10-22 | 2022-04-27 | Audi AG | Driverless transport system with a waiting position |
US11479414B2 (en) * | 2020-09-11 | 2022-10-25 | Locus Robotics Corp. | Dynamic item putaway management using mobile robots |
US11551185B2 (en) * | 2020-08-19 | 2023-01-10 | Walmart Apollo, Llc | Automated food selection using hyperspectral sensing |
US11724883B2 (en) | 2020-09-11 | 2023-08-15 | Locus Robotics Corp. | Presort system for executing robot-assisted putaway tasks |
Families Citing this family (31)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11348066B2 (en) | 2013-07-25 | 2022-05-31 | IAM Robotics, LLC | System and method for piece picking or put-away with a mobile manipulation robot |
US10513033B2 (en) * | 2016-03-25 | 2019-12-24 | Locus Robotics Corp. | Robot queuing in order fulfillment operations |
CN106355345A (en) * | 2016-09-08 | 2017-01-25 | 京东方科技集团股份有限公司 | Intelligent dispatching system and method of automatic vending robots |
US10913604B2 (en) | 2017-06-21 | 2021-02-09 | Locus Robotics Corp. | System and method for queuing robots destined for one or more processing stations |
CN109901569A (en) * | 2017-12-11 | 2019-06-18 | 菜鸟智能物流控股有限公司 | Mobile device navigation method and related equipment |
US10558214B2 (en) | 2018-02-05 | 2020-02-11 | Locus Robotics Corp. | Manual control modes for an autonomous mobile robot |
JP7113634B2 (en) * | 2018-03-06 | 2022-08-05 | 株式会社オカムラ | Work system and control method by work system |
CN110274604B (en) * | 2018-11-06 | 2021-11-02 | 北京京东乾石科技有限公司 | Method and apparatus for generating path information |
FR3091592B1 (en) | 2019-01-04 | 2021-01-29 | Balyo | Method for the control by a supervision server of the movement of a fleet of autonomous guided vehicles |
US10793357B2 (en) * | 2019-01-30 | 2020-10-06 | Locus Robotics Corp. | Robot dwell time minimization in warehouse order fulfillment operations |
US11078019B2 (en) | 2019-01-30 | 2021-08-03 | Locus Robotics Corp. | Tote induction in warehouse order fulfillment operations |
US11034027B2 (en) | 2019-02-01 | 2021-06-15 | Locus Robotics Corp. | Robot assisted personnel routing |
US11724395B2 (en) | 2019-02-01 | 2023-08-15 | Locus Robotics Corp. | Robot congestion management |
US11150647B2 (en) * | 2019-03-27 | 2021-10-19 | Rapyuta Robotics Co., Ltd. | Congestion avoidance and common resource access management for multiple robots |
USD892188S1 (en) | 2019-04-05 | 2020-08-04 | IAM Robotics, LLC | Autonomous mobile robot |
CA3136143A1 (en) | 2019-04-05 | 2020-10-08 | IAM Robotics, LLC | Autonomous mobile robotic systems and methods for picking and put-away |
CN110286673A (en) * | 2019-05-23 | 2019-09-27 | 北京京东尚科信息技术有限公司 | Storage task processing method, device, warehousing system and storage medium |
CN112978190B (en) * | 2019-06-29 | 2023-07-25 | 深圳市海柔创新科技有限公司 | Goods taking task distribution method and goods sorting system thereof |
CN110363695B (en) * | 2019-07-01 | 2023-03-31 | 深圳勇艺达机器人有限公司 | Robot-based crowd queue control method and device |
US11961027B2 (en) * | 2020-03-06 | 2024-04-16 | Caterpillar Inc. | Methods and systems for effective utilization of autonomous machines |
CN112099491A (en) * | 2020-08-20 | 2020-12-18 | 上海姜歌机器人有限公司 | Robot queuing method, robot and computer readable storage medium |
US11741564B2 (en) | 2020-09-11 | 2023-08-29 | Locus Robotics Corp. | Sequence adjustment for executing functions on hems in an order |
CN113581713B (en) * | 2020-10-10 | 2023-03-28 | 深圳市海柔创新科技有限公司 | Warehousing system, cargo carrying method, control terminal, robot and storage medium |
CN112114587B (en) * | 2020-11-23 | 2021-02-05 | 炬星科技(深圳)有限公司 | Distributed congestion control method and robot |
JP7468338B2 (en) | 2020-12-24 | 2024-04-16 | トヨタ自動車株式会社 | AUTONOMOUS MOBILITY SYSTEM, AUTONOMOUS MOBILITY METHOD, AND AUTONOMOUS MOBILITY PROGRAM |
JP2022115296A (en) * | 2021-01-28 | 2022-08-09 | トヨタ自動車株式会社 | Autonomous mobile system, autonomous mobile method and autonomous mobile program |
KR102462491B1 (en) * | 2021-05-06 | 2022-11-03 | 네이버랩스 주식회사 | Method and system for controlling multiple robots drving specific area |
CN113387099B (en) * | 2021-06-30 | 2023-01-10 | 深圳市海柔创新科技有限公司 | Map construction method, map construction device, map construction equipment, warehousing system and storage medium |
CN113844811B (en) * | 2021-09-16 | 2023-06-30 | 国网浙江省电力有限公司湖州供电公司 | Unmanned on duty material warehouse of quick access thing |
AT525514A2 (en) | 2021-09-30 | 2023-04-15 | Tgw Logistics Group Gmbh | Method and transport system for transporting cargo from a source position to a destination area |
CN113978993B (en) * | 2021-11-19 | 2023-09-08 | 深圳市库宝软件有限公司 | Material box scheduling method, device, scheduling equipment, warehouse system and storage medium |
Family Cites Families (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS57204911A (en) | 1981-06-12 | 1982-12-15 | Hitachi Ltd | Operaion control method for plural cooperating robots |
FR2624633B1 (en) | 1987-12-14 | 1992-09-11 | Sgs Thomson Microelectronics | ROBOT PROGRAMMING SYSTEM |
JPH0452808A (en) * | 1990-06-15 | 1992-02-20 | Hitachi Ltd | Method for controlling unmanned truck |
US5586030A (en) * | 1994-10-24 | 1996-12-17 | Caterpillar Inc. | System and method for managing access to a resource in an autonomous vehicle system |
JP2000250627A (en) * | 1999-02-26 | 2000-09-14 | Matsushita Electric Ind Co Ltd | Traveling control method for automated guided vehicle |
US6526373B1 (en) | 1999-10-08 | 2003-02-25 | Dassault Systemes | Optimization tool for robot placement |
JP3768957B2 (en) * | 2002-12-27 | 2006-04-19 | 本田技研工業株式会社 | Mobile robot path setting method |
US7894933B2 (en) | 2005-07-19 | 2011-02-22 | Kiva Systems, Inc. | Method and system for retrieving inventory items |
CN1924910A (en) | 2005-09-02 | 2007-03-07 | 艾岩 | Method for realizing client reservation and queuing-reservation quenching robot |
JP4577247B2 (en) * | 2006-03-22 | 2010-11-10 | トヨタ自動車株式会社 | Mobile body and control method thereof |
JP2007299055A (en) * | 2006-04-27 | 2007-11-15 | Sharp Corp | Control apparatus for automated guided vehicle transportation system |
US8220710B2 (en) | 2006-06-19 | 2012-07-17 | Kiva Systems, Inc. | System and method for positioning a mobile drive unit |
CN101131784A (en) * | 2007-09-14 | 2008-02-27 | 哈尔滨飞云实业有限公司 | Archive and storage article access method based on database administration |
JP2010076006A (en) * | 2008-09-24 | 2010-04-08 | Mitsubishi Heavy Ind Ltd | Processing line module and processing plant |
JP5326491B2 (en) * | 2008-10-24 | 2013-10-30 | 村田機械株式会社 | Transport vehicle system |
CN101956564B (en) | 2010-07-27 | 2012-04-04 | 上海中为智能机器人有限公司 | Autonomous intelligent detection multi-robot system for mine |
US9020636B2 (en) * | 2010-12-16 | 2015-04-28 | Saied Tadayon | Robot for solar farms |
KR101286815B1 (en) * | 2012-01-31 | 2013-07-17 | 부산대학교 산학협력단 | Traffic control system and operating method of automated lifiting vehicles |
US9665688B2 (en) * | 2012-05-15 | 2017-05-30 | Tension International Inc. | Product dispensing system and method with redundant container induction |
CA2816752C (en) * | 2012-05-28 | 2022-07-05 | Well.Ca Inc. | Order processing systems using picking robots |
US9009072B2 (en) | 2012-10-04 | 2015-04-14 | Amazon Technologies, Inc. | Filling an order at an inventory pier |
CN102915465B (en) | 2012-10-24 | 2015-01-21 | 河海大学常州校区 | Multi-robot combined team-organizing method based on mobile biostimulation nerve network |
WO2014116947A1 (en) * | 2013-01-28 | 2014-07-31 | Amazon Technologies, Inc. | Inventory system with connectable inventory holders |
WO2014138472A2 (en) * | 2013-03-06 | 2014-09-12 | Robotex Inc. | System and method for collecting and processing data and for utilizing robotic and/or human resources |
CN103217979B (en) | 2013-03-29 | 2015-04-15 | 无锡普智联科高新技术有限公司 | Method for solving multiple mobile robot path conflict based on buffer area |
US9785911B2 (en) * | 2013-07-25 | 2017-10-10 | I AM Robotics, LLC | System and method for piece-picking or put-away with a mobile manipulation robot |
CN103593748A (en) * | 2013-11-25 | 2014-02-19 | 天津市市政工程设计研究院 | Method for optimization design and traffic organization micro-simulation of container terminal gate buffer area |
CN104950684B (en) | 2015-06-30 | 2016-07-06 | 西安交通大学 | A kind of group robot cooperative scheduling investigating method and system platform |
-
2016
- 2016-03-25 US US15/081,124 patent/US9776324B1/en active Active
-
2017
- 2017-03-25 ES ES17719951T patent/ES2863656T3/en active Active
- 2017-03-25 WO PCT/US2017/024194 patent/WO2017165873A1/en active Application Filing
- 2017-03-25 JP JP2018550338A patent/JP6936243B2/en active Active
- 2017-03-25 BR BR112018069453-3A patent/BR112018069453B1/en active IP Right Grant
- 2017-03-25 CA CA3018911A patent/CA3018911C/en active Active
- 2017-03-25 CN CN201780026355.XA patent/CN109074080B/en active Active
- 2017-03-25 EP EP17719951.0A patent/EP3433690B1/en active Active
- 2017-03-25 KR KR1020187030689A patent/KR102360581B1/en active IP Right Grant
- 2017-03-25 MX MX2018011598A patent/MX2018011598A/en active IP Right Grant
- 2017-06-21 US US15/628,751 patent/US20170282368A1/en not_active Abandoned
Cited By (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20210139243A1 (en) * | 2017-08-15 | 2021-05-13 | Tompkins Robotics, Inc. | Mobile sorter platforms and method for sorting articles |
US11745946B2 (en) * | 2017-08-15 | 2023-09-05 | Tompkins Robotics, Inc. | Mobile sorter platforms and method for sorting articles |
US11572233B2 (en) * | 2017-08-15 | 2023-02-07 | Tompkins Robotics, Inc. | Mobile sorter platforms and method for sorting articles |
CN110119861A (en) * | 2018-02-07 | 2019-08-13 | 北京京东尚科信息技术有限公司 | Dispatch the method, apparatus and computer readable storage medium of unmanned vehicle |
JP2021522618A (en) * | 2018-06-21 | 2021-08-30 | 北京極智嘉科技股▲ふん▼有限公司Beijing Geekplus Technology Co.,Ltd. | Robot scheduling, robot routing methods, servers and storage media |
JP7005794B2 (en) | 2018-06-21 | 2022-01-24 | 北京極智嘉科技股▲ふん▼有限公司 | Robot scheduling, robot routing methods, servers and storage media |
CN111950818A (en) * | 2019-05-14 | 2020-11-17 | 北京京东尚科信息技术有限公司 | Unmanned vehicle dispatching method and device |
CN112256010A (en) * | 2019-07-04 | 2021-01-22 | 北京京东乾石科技有限公司 | Dispatching method and device for automatic guided vehicle and storage medium |
US11551185B2 (en) * | 2020-08-19 | 2023-01-10 | Walmart Apollo, Llc | Automated food selection using hyperspectral sensing |
US11853965B2 (en) | 2020-08-19 | 2023-12-26 | Walmart Apollo, Llc | Automated food selection using hyperspectral sensing |
US11479414B2 (en) * | 2020-09-11 | 2022-10-25 | Locus Robotics Corp. | Dynamic item putaway management using mobile robots |
US11724883B2 (en) | 2020-09-11 | 2023-08-15 | Locus Robotics Corp. | Presort system for executing robot-assisted putaway tasks |
EP3989029A1 (en) * | 2020-10-22 | 2022-04-27 | Audi AG | Driverless transport system with a waiting position |
CN113190020A (en) * | 2021-05-31 | 2021-07-30 | 山东建筑大学 | Mobile robot queue system and path planning and following method |
CN113673887A (en) * | 2021-08-25 | 2021-11-19 | 深圳市库宝软件有限公司 | Task allocation method, device, server and storage medium |
Also Published As
Publication number | Publication date |
---|---|
US20170282368A1 (en) | 2017-10-05 |
WO2017165873A1 (en) | 2017-09-28 |
BR112018069453B1 (en) | 2023-02-28 |
ES2863656T3 (en) | 2021-10-11 |
EP3433690B1 (en) | 2020-12-16 |
CA3018911C (en) | 2020-12-22 |
CA3018911A1 (en) | 2017-09-28 |
CN109074080A (en) | 2018-12-21 |
US9776324B1 (en) | 2017-10-03 |
BR112018069453A2 (en) | 2019-02-05 |
JP2019516169A (en) | 2019-06-13 |
MX2018011598A (en) | 2019-03-14 |
JP6936243B2 (en) | 2021-09-15 |
KR102360581B1 (en) | 2022-02-08 |
EP3433690A1 (en) | 2019-01-30 |
KR20180127443A (en) | 2018-11-28 |
CN109074080B (en) | 2021-10-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA3018911C (en) | Robot queueing in order-fulfillment operations | |
US10513033B2 (en) | Robot queuing in order fulfillment operations | |
US10019015B2 (en) | Robotic navigation utilizing semantic mapping | |
CA3050254C (en) | Display for improved efficiency in robot assisted order-fulfillment operations | |
CA3067636C (en) | Robot queuing in order fulfillment operations | |
US20170278047A1 (en) | Dynamic task interleaving in robot assisted order-fulfillment operations |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: LOCUS ROBOTICS CORPORATION, MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:JOHNSON, MIKE;JOHNSON, SEAN;POWERS, BRADLEY;AND OTHERS;REEL/FRAME:039475/0486 Effective date: 20160803 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2551); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY Year of fee payment: 4 |
|
AS | Assignment |
Owner name: SILICON VALLEY BANK, MASSACHUSETTS Free format text: SECURITY INTEREST;ASSIGNOR:LOCUS ROBOTIC CORP.;REEL/FRAME:060402/0874 Effective date: 20220621 Owner name: SILICON VALLEY BANK, MASSACHUSETTS Free format text: SECURITY INTEREST;ASSIGNOR:LOCUS ROBOTIC CORP.;REEL/FRAME:060402/0854 Effective date: 20220621 |