Abstract: A system includes a robot with a robot arm having multiple joints and an end effector to carry a substrate. A processing device is to build, with respect to a joint space for the multiple joints and the end effector, a graph of reachable positions and sub-paths between the reachable positions, wherein the reachable positions and the sub-paths satisfy Cartesian limits within the joint space. The processing device is to determine, by executing a graph optimization algorithm on the graph, multiple paths, each made up of a group of the sub-paths and having one of a shortest distance or a lowest cost between a start point and an end point of the end effector. The processing device is to select a path, of the multiple paths, through the graph that minimizes a move time of the end effector between the start point and the end point.

Abstract: A system includes a robot with a robot arm having multiple joints and an end effector to carry a substrate. A processing device is to build, with respect to a joint space for the multiple joints and the end effector, a graph of reachable positions and sub-paths between the reachable positions, wherein the reachable positions and the sub-paths satisfy Cartesian limits within the joint space. The processing device is to determine, by executing a graph optimization algorithm on the graph, multiple paths, each made up of a group of the sub-paths and having one of a shortest distance or a lowest cost between a start point and an end point of the end effector. The processing device is to select a path, of the multiple paths, through the graph that minimizes a move time of the end effector between the start point and the end point.

Abstract: A system includes a robot arm with multiple joints and one or more end effector to carry a substrate. A processing device determines, within joint space of the robot arm, start/end points of the one or more end effector for a complete movement. The processing device builds, in joint space for the multiple joints and the one or more end effector, a graph of reachable positions and sub-paths between the reachable positions that satisfy Cartesian limits. The reachable positions are identified at a granularity that divides the complete movement into multiple sub-movements. The processing device executes a graph optimization algorithm on the graph to determine multiple paths, each a group of the sub-paths, that have one of shortest distances or lowest costs between the start/end points, and selects a path thereof that minimizes move time of the one or more end effector between the start/end points.

Abstract: A system includes a robot arm with multiple joints and one or more end effector to carry a substrate. A processing device determines, within joint space of the robot arm, start/end points of the one or more end effector for a complete movement. The processing device builds, in joint space for the multiple joints and the one or more end effector, a graph of reachable positions and sub-paths between the reachable positions that satisfy Cartesian limits. The reachable positions are identified at a granularity that divides the complete movement into multiple sub-movements. The processing device executes a graph optimization algorithm on the graph to determine multiple paths, each a group of the sub-paths, that have one of shortest distances or lowest costs between the start/end points, and selects a path thereof that minimizes move time of the one or more end effector between the start/end points.