Intrinsic Innovation LLC

X Development LLC

Google Inc.

Electronic Arts Inc.

Ryan Butterfoss

David Andre

Stoyan Gaydarov

Rebecca Radkoff

John Michael Stivoric

Kendra Byrne

Michael Beardsworth

Marek Piotr Michalowski

Jean-Francois Dupuis

Eli Reekmans

Keegan Go

Grace Taixi Brentano

Nisarg Vyas

Timothy Robert Kelch

Shengyong Li

Ytai Ben-Tsvi

Chuan Ye

Jayendra Parmar

Daniel Aaron Windrem

Lam Thanh Nguyen

Salil Vijaykumar Pradhan

Salil Pradhan

Falak Shah

Lin Yan

Zhaoquan Zheng

Marek Michalowski

This specification is generally directed to techniques for generating interfacing source code between computing components based on natural language input. In various implementations, a natural language input that requests generation of interfacing source code to logically couple a first computing component with a second computing component may be processed to generate an interface request semantic embedding. The interface request semantic embedding may be processed based on one or more domain models associated with the first and second computing components to generate a pool(s) of candidate code snippets for logically coupling with first and second computing components. A plurality of candidate instances of interfacing source code may be generated between the first and second computing components. Each candidate software interface may include a different permutation of candidate code snippets from the pool(s) of candidate code snippets.

Generating interfacing source code

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 performing robot planning using a process definition graph. One of the methods includes receiving an initial underconstrained process definition graph for one or more robots, wherein the process definition graph is a directed acyclic graph having constraint nodes and action nodes. A plurality of transformers are repeatedly applied to the initial process definition graph, wherein each application of a transformer generates a respective modified process definition graph according to the constraint nodes of the process definition graph, wherein applying the plurality of transformers generates a schedule that specifies which of the one or more robots are to perform which of one or more actions represented by actions nodes according to constraints imposed by the constraint nodes in the process definition graph.

Robot planning from process definition graph

Implementations are directed to improving network anti-fragility. In some aspects, a method includes receiving parameter data from a network of nodes, the parameter data comprising attributes, policies, and action spaces for each node in the network of nodes; configuring one or more interruptive events on one or more nodes included in the network of nodes; determining a first action of each node in the network of nodes in response to the one or more interruptive events; determining a first performance metric, for each node, that corresponds to the first action, wherein the first performance matric is determined based on at least a first reward value associated with the first action; continuously updating the first action in an iterative process to obtain a final action, wherein a performance metric corresponding to the final action satisfies a performance threshold, and transmitting the final action for each node to the network of nodes.

Anti-fragile network

Systems, methods, devices, and other techniques are described for planning motions of one or more robots to perform at least one specified task. In some implementations, a task to execute with a robotic system using a tool is identified. A partially constrained pose is identified for the tool that is to apply during execution of the task. A set of possible constraints for the unconstrained pose parameter are selected for each unconstrained pose parameter. The sets of possible constraints are evaluated for the unconstrained pose parameters with respect to one or more task execution criteria. A nominal pose is determined for the tool based on a result of evaluating the sets of possible constraints for the unconstrained pose parameters with respect to the one or more task execution criteria. The robotic system is then directed to execute the task, including positioning the tool according to the nominal pose.

Robotic motion planning

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying a process definition to ensure accuracy, timeliness, or both of workcell measurement. One of the methods includes receiving an initial process definition for a process to be performed by a robot, wherein the process definition defines a sequence of actions to be performed in a workcell, and wherein a first action in the sequence of actions has an associated measurement tolerance; computing a predicted accumulated measurement variance for each of one or more actions that occur before the first action in the sequence; determining that the predicted accumulated measurement variance for the one or more actions that occur before the first action in the sequence exceeds a threshold; and in response, generating a modified process definition that inserts a measurement action at a location in the sequence before the first action.

Task planning for measurement variances

Disclosed herein is a worksite automation process that involves: generating a first sequence of tasks to build the product according to a model. The process further involves causing one or more robotic devices to build the product by beginning to execute the first sequence of tasks. Further, during the execution of the first sequence of tasks, performing a buildability analysis to determine a feasibility of completing the product by executing the first sequence of tasks. Based on the analysis, determining that it is not feasible to complete the product by executing the first sequence of tasks, and in response, generating a second sequence of tasks to complete the product according to the model. Then, causing the one or more robotic devices to continue building the product by beginning to execute the second sequence of tasks.

Planning and adapting projects based on a buildability analysis

Resource access driven distributed transaction coordination system is described. A method may include receiving a request to perform a migration of user data from a first user account to a second user account and restricting access to a distributed resource as a result of receiving the request. When a distributed process requests access to a distributed resource, and that distributed process doesn't have any pending tasks, account migration may be performed.

Resource access driven distributed transaction coordination system

Growing community of inventors

San Francisco, CA, United States of America

Ryan Butterfoss