Multiposition search

Patent metadata

Field	Value
Publication number	US-12596985-B2
Application number	US-202118001524-A
Country	US
Kind code	B2
Filing date	Jun 23, 2021
Priority date	Jun 25, 2020
Publication date	Apr 7, 2026
Grant date	Apr 7, 2026

Abstract

A system for allocating jobs and/or targets to robots in an automated storage and retrieval system includes a plurality of robots and a framework structure forming a three-dimensional storage grid structure for storing containers. Each robot has wheels configured to move along two perpendicular horizontal directions on the grid. A central computer system manages robot movement and task allocation via a warehouse management system comprising an assigner and a router. The assigner generates lists of job and target options for each robot, which are made accessible to the router. The router assigns jobs and targets using a multi-position search algorithm based on each robot's location and the route required to reach the assigned job and target. This coordinated approach enables efficient task and path assignment within the storage system.

First claim

The invention claimed is:

1 . A system for allocating jobs and/or targets to robots in an automated storage and retrieval system, comprising:
a plurality of robots, and a framework structure forming a three-dimensional storage grid structure for storing storage containers for storing items, wherein the framework structure comprises a rail system, the rail system providing available routes for the plurality of robots handling and transferring the storage containers to and from storage columns, wherein at least one robot comprises a first set of wheels configured to move the robot along a first horizontal direction of a grid-based rail system and a second set of wheels configured to move the robot along a second horizontal direction of the grid-based rail system, the second horizontal direction being perpendicular to the first horizontal direction, wherein a movement of the plurality of robots is controlled by a central computer system comprising a warehouse management system that comprises a router and an assigner, wherein the router decides which routes the robots travel, and the assigner controls over which jobs are to be done and which targets to reach, wherein the assigner is configured to create a list of job options of jobs to be done and a list of target options of targets to be reached by each robot, which lists of job options and target options are made accessible to the router, and wherein the router is configured to decide which job and target to be assigned to the robot using a multi-position search algorithm, a decision being based on a location of the robot in question and a route the robot in question has to travel to reach the job and the target.

2 . The system according to claim 1 , wherein each job and each target is given a penalty score in order to calculate cost of deciding the robot to do that particular job and target.

3 . The system according to claim 2 , wherein the router decides the job and the target the robot is assigned based on the lowest combined penalty score.

4 . The system according to claim 2 , wherein the penalty score of the job is dependent on a distance and/or complexity of the route the robot must travel in order to reach the job.

5 . The system according to claim 2 , wherein the penalty score of the target is dependent on a distance and/or complexity of the route the robot must travel from the job to the target.

6 . The system according to claim 1 , wherein complexity of the route comprises at least one of an amount of time required to reach the job and the target, a distance required to be travelled, a count of wheel changes, and an amount of time required to wait for gaps in traffic.

7 . A method for allocating jobs and/or targets to robots in an automated storage and retrieval system;
wherein the system comprises: a plurality of robots, and a framework structure forming a three-dimensional storage grid structure for storing storage containers for storing items, wherein the framework structure comprises a rail system, the rail system providing available routes for the plurality of robots handling and transferring the storage containers to and from storage columns, wherein at least one robot comprises a first set of wheels configured to move the robot along a first horizontal direction of a grid-based rail system and a second set of wheels configured to move the robot along a second horizontal direction of the grid-based rail system, the second horizontal direction being perpendicular to the first horizontal direction, wherein a movement of the plurality of robots are controlled by a central computer system comprising a warehouse management system that comprises a router and an assigner, wherein the router decides which routes the plurality of robots travel, and the assigner controls over which jobs to be done and which targets to reach, and wherein the method comprises: creating a list of job options in the assigner of jobs to be finished by the plurality of robots, the assigner sharing the list of job options to be finished with the router, deciding in the router which job a robot should be assigned based upon the route that the robot is to take from a position of the robot in relation to a position of the job, transmitting the job that has been assigned to the robot and the route that has been decided for the robot to reach the job, creating a list of target options in the assigner of targets to be reached by the plurality of robots, the assigner sharing the list of target options to be reached with the router, deciding in the router which target a robot should be assigned based upon the route that the robot is to take from the position of the robot in relation to a position of the target, and transmitting the target that has been assigned to the robot and the route that has been decided for the robot to take in order to reach the target.

8 . The method according to claim 7 , further comprises giving each job a penalty score in order to calculate cost of allocating the robot to that particular job.

9 . The method according to claim 8 , further comprises giving each target a penalty score in order to calculate the cost of allocating the robot to that particular target.

10 . The method according to claim 8 , further comprises allocating the robot to the job and the target with the lowest combined penalty score.

11 . The method according to claim 8 , wherein the penalty score of the job is dependent on a distance and/or complexity of the route the robot must travel in order to reach the job.

12 . The method according to claim 8 , wherein the penalty score of the target is dependent on a distance and/or complexity of the route the robot must travel from the job to the target.

13 . The method according to claim 7 , wherein allocating a new job and target to the robot when the robot has finished a current target and job.

14 . A computer program product stored on non-transitory computer-readable medium, when executed on a computer, causes the computer to perform a method for allocating jobs and/or targets to robots in an automated storage and retrieval system;
wherein the system comprises: a plurality of robots, and a framework structure forming a three-dimensional storage grid structure for storing storage containers for storing items, wherein the framework structure comprises a rail system, the rail system providing available routes for the plurality of robots handling and transferring the storage containers to and from storage columns, wherein at least one robot comprises a first set of wheels configured to move the robot along a first horizontal direction of a grid-based rail system and a second set of wheels configured to move the robot along a second horizontal direction of the grid-based rail system, the second horizontal direction being perpendicular to the first horizontal direction, wherein a movement of the plurality of robots are controlled by a central computer system comprising a warehouse management system that comprises a router and an assigner, wherein the router decides which routes the plurality of robots travel, and the assigner controls over which jobs to be done and which targets to reach, and wherein the method comprises: creating a list of job options in the assigner of jobs to be finished by the plurality of robots, the assigner sharing the list of job options to be finished with the router, deciding in the router which job a robot should be assigned based upon the route that the robot is to take from a position of the robot in relation to a position of the job, transmitting the job that has been assigned to

Assignees

• Autostore Tech As

Inventors

• Hatteland Karl
• Stuhaug Ragnar
• Berge Nessa Kristian

Classifications

• B65G1/0464

  with access from above · CPC title

• G06Q10/08 Primary

  Logistics, e.g. warehousing, loading or distribution; Inventory or stock management · CPC title

• G05B19/0426 Primary

  Programming the control sequence · CPC title

• G06Q10/063

  Operations research, analysis or management · CPC title

• G06Q10/047 Primary

  Optimisation of routes or paths, e.g. travelling salesman problem · CPC title