Intrinsic Innovation LLC

Bot & Dolly, LLC

Jean-Francois Dupuis

Keegan Go

Stoyan Gaydarov

Maryam Bandari

Jeffrey Linnell

Michael Hemmer

Marek Piotr Michalowski

Ryan Butterfoss

Thiago Hersan

Techniques and systems are disclosed for using swept volume profile data cached in association with a PRM to improve various aspects of motion planning for a robot. In some implementations, a first probabilistic road map representing possible paths to be travelled by a robot within a physical area is generated. An initial path for the robot within the first probabilistic road map is determined. Data indicating a second probabilistic road map representing a path to be travelled by a movable object within the physical area is obtained. A potential obstruction associated with one or more edges included in the subset of edges is detected. An adjusted path for the robot within the first probabilistic road map is then determined based on the potential obstruction.

Dynamic probabilistic motion planning

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing robot planning using a process definition graph. The techniques can include receiving a process definition graph having a plurality of task nodes that represent respective tasks to be performed by a respective robot of a plurality of robots, wherein each task node is associated with a location at which the task will be performed; generating, from the process definition graph, an initial modified process definition graph that adds constraints for respective swept volumes occupied by each task represented by the plurality of task nodes; and generating, from the initial modified process definition graph, a refined process definition graph, wherein the refined process definition graph includes respective motion plans for robots moving between tasks, wherein the motion plans define transitions that avoid the swept volumes occupied by each task represented by the plurality of task nodes.

Robot planning from process definition graph

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for planning a path of motion for a robot. In some implementations, a candidate path of movement is determined for each of multiple robots. A swept region, for each of the multiple robots, is determined that the robot would traverse through along its candidate path. At least some of the swept regions for the multiple robots is aggregated to determine amounts of overlap among the swept regions at different locations. Force vectors directed outward from the swept regions are assigned, wherein the force vectors have different magnitudes assigned according to the respective amounts of overlap of the swept regions at the different locations. A path for a particular robot to travel is determined based on the swept regions and the assigned magnitudes of the forces.

Robot motion planning

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating paths for a robot based on optimizing multiple objectives. One of the methods includes: receiving, by a motion planner, request to generate a path for a robot between a start point and an end point in a workcell of the robot, wherein the workcell is associated with one or more soft margin values that define spaces in which the robot should avoid when transitioning between points in the workcell; classifying path segments within the workcell as being inside the soft margin or outside the soft margin; generating a respective cost for each of the plurality of path segments within the workcell; generating a plurality of alternative paths; evaluating the plurality of alternative paths according to the respective costs; and selecting an alternative path based on respective total costs of the plurality of alternative paths.

Multi-objective robot path planning

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for optimizing a plan for one or more robots using a process definition graph. One of the methods includes receiving a process definition graph for a robot, the process definition graph having a plurality of action nodes, and the plurality of action nodes including a plurality of motion nodes that were previously split from a single motion node due to a conflict with a second motion node representing a second motion to be performed by another robot; determining that the conflict with the second motion node no longer exists; and in response to determining that the conflict with the second motion node no longer exists, modifying the process definition graph including combining the plurality of motion nodes into a new single motion node representing all of the motions of the plurality of motion nodes.

Combining transformers for robotics planning

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for planning by work volumes to avoid conflicts. One of the methods includes receiving a process definition graph for a robot that includes action nodes, wherein the action nodes include (1) transition nodes that represent a motion to be taken by the robot from a respective start location to an end location and (2) task nodes that represent a particular task to be performed by the robot at a particular task location. An initial modified process definition graph that ignores one or more conflicts between respective transition nodes as well as one or more conflicts between respective transition nodes and task nodes is generated from the process definition graph. A refined process definition graph that ignores conflicts between transition nodes and recognizes conflicts between transition nodes and task nodes is generated from the initial modified process definition graph.

Planning by work volumes to avoid conflicts

Methods, systems, and computer programs stored on computer storage devices, for coordinating movements of robots are disclosed. One of the methods includes, for each robot in a group of robots, identifying a set of tasks assigned to the robot and generating a plurality of candidate motion plans. The method further includes, for each candidate motion plan: (i) generating a 3D model that represents a volume of space through which the robot would move in executing the sequence of motions represented by the candidate motion plan, and (ii) determining a score for the candidate motion plan. The method further includes determining conflicts between candidate motion plans of different robots, selecting a motion plan from the candidate motion plans based on the score for the selected motion plan and the conflicts, and providing the selected motion plans for execution by the group of robots.

Robot coordination in a shared workspace

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for optimizing a plan for one or more robots using a process definition graph. One of the methods includes receiving a process definition graph for a robot, the process definition graph having a plurality of action nodes. One or more of the action nodes are motion nodes that represent a motion to be taken by the robot from a respective start location to an end location. It is determined that a motion node satisfies one or more splitting criteria, and in response to determining that the motion node satisfies the one or more splitting criteria, the process definition graph is modified. Modifying the process definition graph includes splitting the motion node into two or more separate motion nodes whose respective paths can be scheduled independently.

Splitting transformers for robotics planning

Techniques for controlling a robot are described in this document. In some implementations, a method includes determining a first target position of a first point located at the first end of the first link based on pose data for an end effector of a robot having a wrist offset. A second target position of a first joint connecting the first link to a second link is determined. A third target position of a second joint located at the first end of a third link is determined, including defining a first plane that includes the second target position of the first joint. A position and size of a circle that lies within a second plane is determined. A point on a perimeter of the circle is selected as the third target position. Movement data based on each position of each joint is provided to a control system.

Inverse kinematic solver for wrist offset robots

Example methods and systems for calibrating one or more light sources are described. One example method includes determining a position of at least three photosensors relative to a world frame, controlling an orientation of at least one light source so as to cause the at least one light source to project a light beam across an area encompassing the at least three photosensors, receiving signals indicating a sensing of a light beam directed at one of the photosensors, determining orientations of the at least one light source that cause a signal at one of the photosensors, and based on the position of the at least three photosensors and the orientations of the at least one light source that cause a signal at one of the photosensors, determining a transformation from a local frame of the at least one light source to the world frame.

Growing community of inventors

San Francisco, CA, United States of America

Jean-Francois Dupuis