# US 2017/0285648 A1 · Navigation using planned robot travel paths

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0285648 A1
- Document ID: US20170285648A1
- Status: Published application
- Kind: A1
- Application number: 15/088,474
- Filed: 2016-04-01
- Published: 2017-10-05
- Earliest claimed: 2016-04-01
- Assignees: Locus Robotics Corp.
- Applicants: Locus Robotics Corporation
- Inventors: Bruce Welty; Bradley Powers; Eric Tappan
- Web page: https://patentgrep.com/patent/US20170285648A1

## CPC

- G05D 1/0246: {using a video camera in combination with image processing means}
- B25J 5/007: {mounted on wheels}
- B25J 11/008: {Manipulators for service tasks}
- G05D 1/0236: {in combination with a laser (lasers per se H01S)}
- G05D 1/0248: {in combination with a laser (lasers per se H01S)}
- G05D 1/0274: {using mapping information stored in a memory device (navigation using map-matching G01C21/30)}
- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q 10/08743: {using optimisation of routes}
- G06V 20/10: Terrestrial scenes (scenes under surveillance with static cameras G06V20/52; scenes perceived from the exterior of a vehicle G06V20/56; scenes perceived from the interior of a vehicle G06V20/59)
- Y10S 901/01: Mobile robot
- G05D: SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- B25J: MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES ({manipulators specially adapted for use in surgery A61B34/70; manipulators used in cleaning hollow articles B08B9/04}; manipulators associated with rolling mills B21B39/20; manipulators associated with forging machines B21J13/10; {manipulators associated with picking-up and placing mechanisms B23P19/007}; means for holding wheels or parts thereof B60B30/00; {vehicles with ground-engaging propulsion means, e.g. walking members B62D57/02, B62D57/032; devices for picking-up and depositing articles or materials between conveyors B65G47/90, B65G47/91; manipulators with gripping or holding means for transferring packages B65H67/065}; cranes B66C; {manipulators used in the protection or supervision of pipe-line installations F17D5/00; walking equipment adapted for nuclear steam-generators F22B37/006}; manipulators specially adapted for, or associated with, nuclear reactors G21C; {apparatus used for handling wafers during manufacture or treatment of semiconductor H10P72/50})
- 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
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A method for generating a navigation map of an environment in which a plurality of robots will navigate, includes obtaining an image of the environment defined by a plurality of pixels, each having a cost value. The environment includes an image of a fixed object having a set of pixels corresponding to its location and having a first defined cost value. The method includes obtaining a planned path image for the robots, which include a first set of pixels corresponding to the location of each robot in the environment and a second set of pixels adjacent to the first set of pixels and extending along a planned path of travel toward a destination. The first set of pixels of each robot having the first defined cost value and the second set of pixels having a second defined cost value. The second defined cost value is less than the first defined cost value.

## Claims

### Claim 1

A method for generating a navigation map of an environment in which a plurality of robots will navigate, the method comprising:
Obtaining an image of the environment, the image defined by a plurality of pixels, each pixel having a cost value associated with it; wherein the image of the environment includes an image of at least one fixed object comprising a set of pixels corresponding to the location of the at least one fixed object in the environment, the set of pixels corresponding to the location of the at least one fixed object having a first defined cost value; and
Obtaining a planned path image for each of the plurality of robots in the environment, the planned path image including for each robot a first set of pixels corresponding to the location of each robot in the environment and a second set of pixels adjacent to the first set of pixels and extending along a planned path of travel of each robot toward a destination; the pixels in the first set of pixels of each robot having the first defined cost value and the second set of pixels of each robot comprising pixels having a second defined cost value; wherein the second defined cost value is less than the first defined cost value.

### Claim 2 (depends on 1)

The method of claim 1, wherein the image of the environment including the image of at least one fixed object is stored locally with each of the plurality of robots.

### Claim 3 (depends on 2)

The method of claim 2, wherein each of the plurality of robots produces its own planned path and communicates its own planned path to the other of the plurality of robots.

### Claim 4 (depends on 3)

The method of claim 3, wherein each robot combines the image of the environment including the image of at least one fixed object with images representing the planned paths received from other of the plurality of robots to form a navigation map.

### Claim 5 (depends on 4)

The method of claim 4, wherein each robot uses the navigation map to plan a path from its current location to its destination.

### Claim 6 (depends on 5)

The method of claim 5, wherein each of the plurality of robots produces its own updated planned path at regular time intervals as each robot traverses its path to its destination and communicates its own updated planned path to the other of the plurality of robots at such regular intervals; and wherein each robot uses the updated planned path of the other of the plurality of robots to produce an updated navigation map and updates its planned path to its destination using the updated navigation map.

### Claim 7 (depends on 1)

The method of claim 1 wherein the second set of pixels of each robot comprises pixels having plurality of cost values less than the first cost value, and wherein the cost values of the pixels decrease proportionally in value as they extend from adjacent to the first set of pixels out along the planned path of travel of each robot toward a destination.

### Claim 8 (depends on 7)

The method of claim 7 wherein the second set of pixels of each robot is formed by producing a plurality of regions along the planned path of travel of each robot toward a destination and wherein each region successively comprises pixels having pixel values less than the preceding region.

### Claim 9 (depends on 8)

The method of claim 8 wherein the regions are circular in shape and the regions have a radius corresponding to the size of the robots.

### Claim 10 (depends on 1)

The method of claim 1 wherein the environment is a warehouse.

### Claim 11

A method for navigating a robot in an environment from a current location to a destination, the environment including at least one fixed object and at least one other robot, the method comprising:
Obtaining an image of the environment, the image defined by a plurality of pixels, each pixel having a cost value associated with it; wherein the image of the environment includes an image of the at least one fixed object comprising a set of pixels corresponding to the location of the at least one fixed object in the environment, the set of pixels corresponding to the location of the at least one fixed object having a first defined cost value;
Obtaining an image of the at least one other robot in the environment, the image of the at least one other robot including a first set of pixels corresponding to the location of the at least one other robot in the environment and a second set of pixels adjacent to the first set of pixels and extending along a planned path of travel of the at least one other robot toward a destination; the pixels in the first set of pixels of the at least one other robot having the first defined cost value and the second set of pixels of the at least one other robot comprising pixels having a second defined cost value; wherein the second defined cost value is less than the first defined cost value; and
Planning a path from the current location of the robot to the destination of the robot based on the image of the at least one fixed object and the image of the at least one other robot.

### Claim 12 (depends on 11)

The method of claim 11, wherein the image of the environment including the image of at least one fixed object is stored locally within the robot.

### Claim 13 (depends on 12)

The method of claim 12, wherein the at least one other robot produces its own planned path from a current location to a destination and communicates its own planned path to the robot.

### Claim 14 (depends on 13)

The method of claim 13, wherein the robot combines the image of the environment including the image of at least one fixed object with an image of the planned path received from the at least one other robot to form a navigation map.

### Claim 15 (depends on 14)

The method of claim 14, wherein the robot uses the navigation map to plan a path from its current location to its destination.

### Claim 16 (depends on 15)

The method of claim 15, wherein the at least one other robot produces its own updated planned path at regular time intervals as it traverses its path to its destination and communicates its own updated planned path to the robot at such regular intervals; and wherein the robot uses the updated planned path of the at least one other robot to produce an updated navigation map and updates its planned path to its destination using the updated navigation map.

### Claim 17 (depends on 11)

The method of claim 11 wherein the second set of pixels of the at least one other robot comprises pixels having plurality of cost values less than the first cost value, and wherein the cost values of the pixels decrease proportionally in value as they extend from adjacent to the first set of pixels out along the planned path of travel of the at least one other robot toward its destination.

### Claim 18 (depends on 17)

The method of claim 17 wherein the second set of pixels of the at least one other robot is formed by producing a plurality of regions along the planned path of travel of the at least one other robot toward its destination and wherein each region successively comprises pixels having pixel values less than the preceding region.

### Claim 19 (depends on 18)

The method of claim 18 wherein the regions are circular in shape and the regions have a radius corresponding to the size of the robots.

### Claim 20 (depends on 11)

The method of claim 11 wherein the environment is a warehouse.

### Claim 21

A robot configured to navigate an environment, the environment including at least one fixed object and a plurality of other robots, the robot comprising:
A mobile base for propelling the robot throughout the environment;
A communication device enabling communication between the robot and the plurality of other robots; and
A processor, in communication with the communication device, configured to:
Obtain an image of the environment, the image defined by a plurality of pixels, each pixel having a cost value associated with it; wherein the image of the environment includes an image of the at least one fixed object comprising a set of pixels corresponding to the location of the at least one fixed object in the environment, the set of pixels corresponding to the location of the at least one fixed object having a first defined cost value;
Obtaining an image of the plurality of other robots in the environment, the image including for each robot a first set of pixels corresponding to the location of each robot in the environment and a second set of pixels adjacent to the first set of pixels and extending along a planned path of travel of each other robot toward a destination; the pixels in the first set of pixels of each other robot having the first defined cost value and the second set of pixels of each other robot comprising pixels having a second defined cost value; wherein the second defined cost value is less than the first defined cost value; and
Planning a path from the current location of the robot to the destination of the robot based on the image of the at least one fixed object and the images of the plurality of other robots.

### Claim 22 (depends on 21)

The robot of claim 21, wherein the image of the environment including the image of at least one fixed object is stored locally with each of the plurality of robots.

### Claim 23 (depends on 22)

The robot of claim 22, wherein each of the plurality of other robots is configured to produce its own planned path and communicate its own planned path using its communications device to the other of the plurality of robots.

### Claim 24 (depends on 23)

The robot of claim 23, wherein the processor is configured to combine the image of the environment including the image of at least one fixed object with images of the planned paths received from the other of the plurality of robots to form a navigation map.

### Claim 25 (depends on 24)

The robot of claim 24, wherein the processor is configured to use the navigation map to plan a path from its current location to its destination.

### Claim 26 (depends on 25)

The robot of claim 25, wherein the processor is configured to receive from each of the plurality of other robots an updated planned path at regular time intervals as each other robot traverses its path to its destination; and wherein the processor is configured to use the updated planned path of the other of the plurality of robots to produce an updated navigation map and update its planned path to its destination using the updated navigation map.

### Claim 27 (depends on 21)

The robot of claim 21 wherein the second set of pixels of each of the plurality of other robots comprises pixels having a plurality of cost values less than the first cost value, and wherein the cost values of the pixels decrease proportionally in value as they extend from adjacent to the first set of pixels out along the planned path of travel of each robot toward a destination.

### Claim 28 (depends on 27)

The robot of claim 27 wherein the second set of pixels of each of the plurality of other robots is formed by producing a plurality of regions along the planned path of travel of each robot toward a destination and wherein each region successively comprises pixels having pixel values less than the preceding region.

### Claim 29 (depends on 28)

The robot of claim 28 wherein the regions are circular in shape and the regions have a radius corresponding to the size of the robots.

### Claim 30 (depends on 21)

The robot of claim 21 wherein the environment is a warehouse.
