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.

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.

Collision detection useful in motion planning for robotics advantageously represents planned motions of each of a plurality of robots as obstacles when performing motion planning for any given robot in the plurality of robots that operate in a shared workspace, including taking into account the planned motions during collision assessment. Edges of a motion planning graph are assigned cost values, based at least in part on the collision assessment. Obstacles may be pruned as corresponding motions are completed. Motion planning requests may be queued, and some robots skipped, for example in response to an error or blocked condition.

A social networking application provides for automated link and/or content recommendation to users of a social media platform by automated social graph refinement that augments a baseline social graph with predicted links and inferred labels by iteratively (a) propagating attribute labels through optimizing attribute label similarity between user nodes constrained by closeness of links between the users, and (b) predicting links between users through optimizing link closeness constrained by label similarity. Each label inference iteration is based on predicted labels generated in and immediately prior link prediction iteration, and each link prediction iteration is based on inferred labels generated in and immediately prior label inference iteration.

Specialized robot motion planning hardware and methods of making and using same are provided. A robot-specific hardware can be designed using a tool that receives a robot description comprising a collision geometry of a robot, degrees of freedom for each joint of the robot, and joint limits of the robot; receives a scenario description; generates a probabilistic roadmap (PRM) using the robot description and the scenario description; and for each edge of PRM, produces a collision detection unit comprising a circuit indicating all parts of obstacles that collide with that edge. The hardware is implemented as parallel collision detection units that provide collision detection results used to remove edges from the PRM that is searched to find a path to a goal position.

A trajectory generation device which generates a trajectory of a robot includes: a trajectory exploration graph generation unit which is configured to generate a trajectory exploration graph composed of a plurality of nodes for generating the trajectory; an acceleration upper limit value acquisition unit which is configured to acquire a first acceleration upper limit value based on orientations and an acceleration direction of the robot at a current node; a velocity and acceleration setting unit which is configured to set a first velocity representing a velocity when moving from the current node to a next node adjacent to the current node based on the acquired first acceleration upper limit value, and an acceleration; and a node cost calculation unit which is configured to calculate a moving time by using the set first velocity and the acceleration as cost from the current node to the next node.

Systems and a method for determining a sequence of kinematic chains of a multiple robot along a sequence of locations. Inputs on the locations to be reached by a robot tool are received. Each chain is considered separately by setting one chain in use and determining, for each chain in use, available configurations for each location. The available configurations are represented as nodes of a graph representing available robotic paths for reaching with a tool the locations, while allowing the switching among different chains within the same robotic path. Valid connectors are determined by simulating collision free robot trajectories while taking into account working modality constraints of the locations. Weight factors are assigned to connectors to represent robot efforts in moving between subsequent configurations. The shortest robotic path among valid paths is determined by taking into account the weight factors. The sequence of chains is determined from the shortest path.

Systems and a method for determining a sequence of kinematic chains of a multiple robot along a sequence of locations. Inputs on the locations to be reached by a robot tool are received. Each chain is considered separately by setting one chain in use and determining, for each chain in use, available configurations for each location. The available configurations are represented as nodes of a graph representing available robotic paths for reaching with a tool the locations, while allowing the switching among different chains within the same robotic path. Valid connectors are determined by simulating collision free robot trajectories while taking into account working modality constraints of the locations. Weight factors are assigned to connectors to represent robot efforts in moving between subsequent configurations. The shortest robotic path among valid paths is determined by taking into account the weight factors. The sequence of chains is determined from the shortest path.

This document describes a simulation system that simulates robots and other actors performing tasks in an area. In one aspect, a method includes obtaining a graph representing a physical area. The graph includes area nodes that represent regions of the area that are traversed by a set of actors that perform tasks in the area and terminal nodes that represent regions of the facility where the actors perform the tasks. A set of agents that each include a model corresponding to an actor is identified. At least a portion of the agents includes models for robots that perform tasks in the area. The model of an agent represents durations of time for traversing area nodes and performing tasks are terminal nodes during simulations. A sequence of tasks being performed in the area is simulated using the graph and the set of agents.

Methods, systems, and platforms for automatic setup planning for a robot. The method includes sampling multiple poses in multiple dimensions within a robotic workspace. The method includes generating one or more candidate configurations based on the multiple poses. The method includes determining a score for each candidate configuration of the one or more candidate configurations. The score represents area coverage of a region of interest and at least one of an amount of setup time of the candidate configuration or an amount of energy used. The method includes determining a set of candidate configurations that has an overall area coverage that covers the region of interest based on the score for each candidate configuration. The method includes controlling a position and an orientation of the object based on the set of candidate configurations.