Abstract: A robot interference checking motion planning technique using point sets. The technique uses CAD models of robot arms and obstacles and converts the CAD models to 3D point sets. The 3D point set coordinates are updated at each time step based on robot and obstacle motion. The 3D points are then converted to 3D grid space indices indicating space occupied by any point on any part. The 3D grid space indices are converted to 1D indices and the 1D indices are stored as sets per object and per time step. Interference checking is performed by computing an intersection of the 1D index sets for a given time step. Swept volumes are created by computing a union of the 1D index sets across multiple time steps. The 1D indices are converted back to 3D coordinates to define the 3D shapes of the swept volumes and the 3D locations of any interferences.

Abstract: A method and system for robot motion control using a model predictive control (MPC) technique including torque rate control and suppression of end tooling oscillation. An MPC module includes a robot dynamics model which inherently reflects response nonlinearities associated with changes in robot configuration, and an optimization solver having an objective function with a torque rate term and inequality constraints defining bounds on both torque and torque rate. The torque rate control in the MPC module provides an effective means of controlling jerk in robot joints, while accurately modeling robot dynamics as the robot changes configuration during a motion program. End tooling oscillation dynamics may also be included in the MPC objective function and constraints in order to automatically control end tooling vibration in the calculations of the MPC module.

Abstract: A method for tuning the force control parameters for a general robotic assembly operation. The method uses numerical optimization to evaluate different combinations of the parameters for a robot force controller in a simulation environment that is built based on a real-world robotic setup. This method performs autonomous tuning for assembly tasks based on closed loop force control simulation, where random samples from a distribution of force control parameter values are evaluated, and the optimization routine iteratively redefines the parameter distribution to find optimal values of the parameters. Each simulated assembly is evaluated using multiple simulations including random part positioning uncertainties. The performance of each simulated assembly is evaluated by the average of the simulation results, thus ensuring that the selected control parameters will perform well in most possible conditions.

Abstract: A robot interference checking motion planning technique using point sets. The technique uses CAD models of robot arms and obstacles and converts the CAD models to 3D point sets. The 3D point set coordinates are updated at each time step based on robot and obstacle motion. The 3D points are then converted to 3D grid space indices indicating space occupied by any point on any part. The 3D grid space indices are converted to 1D indices and the 1D indices are stored as sets per object and per time step. Interference checking is performed by computing an intersection of the 1D index sets for a given time step. Swept volumes are created by computing a union of the 1D index sets across multiple time steps. The 1D indices are converted back to 3D coordinates to define the 3D shapes of the swept volumes and the 3D locations of any interferences.

Abstract: A method and system for dynamic collision avoidance motion planning for industrial robots. An obstacle avoidance motion optimization routine receives a planned path and obstacle detection data as inputs, and computes a commanded robot path which avoids any detected obstacles. Robot joint motions to follow the tool center point path are used by a robot controller to command robot motion. The planning and optimization calculations are performed in a feedback loop which is decoupled from the controller feedback loop which computes robot commands based on actual robot position. The two feedback loops perform planning, command and control calculations in real time, including responding to dynamic obstacles which may be present in the robot workspace. The optimization calculations include a safety function which efficiently incorporates both relative position and relative velocity of the obstacles with respect to the robot.

Abstract: A press brake is provided with a hydraulic cylinder configured to move an upper table and a lower table relative to each other in a vertical direction, and a control unit configured to control a hydraulic circuit of the hydraulic cylinder, in which the control unit manages a predictor of an occurrence of an abnormality in the hydraulic circuit including a first pressure control valve configured to control a back pressure of hydraulic oil on a first port side of the hydraulic cylinder.

Abstract: A system and method for identifying an object to be picked up by a robot. The method includes obtaining a 2D red-green-blue (RGB) color image and a 2D depth map image of the objects using a 3D camera, where pixels in the depth map image are assigned a value identifying the distance from the camera to the objects. The method generates a segmentation image of the objects using a deep learning convolutional neural network that performs an image segmentation process that extracts features from the RGB image, assigns a label to the pixels so that objects in the segmentation image have the same label and rotates the object using the orientation of the object in the segmented image. The method then identifies a location for picking up the object using the segmentation image and the depth map image and rotates the object when it is picked up.

Abstract: A method for teaching a robot to perform an operation based on human demonstration with images from a camera. The method includes a teaching phase where a 2D or 3D camera detects a human hand grasping and moving a workpiece, and images of the hand and workpiece are analyzed to determine a robot gripper pose and positions which equate to the pose and positions of the hand and corresponding pose and positions of the workpiece. Robot programming commands are then generated from the computed gripper pose and position relative to the workpiece pose and position. In a replay phase, the camera identifies workpiece pose and position, and the programming commands cause the robot to move the gripper to pick, move and place the workpiece as demonstrated. A teleoperation mode is also disclosed, where camera images of a human hand are used to control movement of the robot in real time.

Abstract: A robot collision avoidance motion planning technique using a worst state search and optimization. The motion planning technique begins with a geometric definition of obstacles, start and goal points, and an initial set of waypoints which may be sparsely spaced. Given an inter-point interpolation method such as linear or spline, a continuous trajectory can be described as a function of the waypoints and an arc length parameter. A worst state search is then performed which finds a location between each adjacent pair of waypoints having a worst state of distance to obstacle, considering all parts of the robot and tool. A collision avoidance constraint is defined using the worst state locations, and an optimization of the waypoint locations is then performed to improve the worst states until all collisions are eliminated and an obstacle avoidance minimum distance criteria is met.

Abstract: A robot motion planning technique for component assembly operations. Inputs to the motion planning technique include geometric models of the components being assembled, and initial and target configurations. The method begins at a tightly-constrained target or final configuration and plans in the direction of a loosely-constrained initial configuration. A randomly-sampled waypoint configuration is proposed, followed by a local search for feasible configurations which generates nodes that extend a path toward the initial configuration while sliding through the tightly-constrained region. The local search can be repeated multiple times for a given randomly-sampled configuration. When a completed path is found, the action sequence is trimmed to eliminate unnecessary extraneous motions in the loosely-constrained region. The disclosed method dramatically reduces the number of unproductive configurations evaluated and finds assembly solutions much faster in comparison to known tree-based motion planning methods.

Abstract: A method and system for motion planning for robots with a redundant degree of freedom. The technique computes a collision avoidance motion plan for a robot with a redundant degree of freedom, without artificially constraining the extra degree of freedom. The motion planning is formulated as a quadratic programming optimization calculation having a multi-component objective function and a collision avoidance constraint function. The formulation is efficient enough to compute the motion plan in real time at every robot control cycle. The collision avoidance constraint ensures clearance of all parts of the robot from both static and dynamic obstacles. Objective function terms include minimizing path deviation, joint velocity regularization and robot configuration or pose regularization. Weighting factors on the terms of the objective function are changeable for each control cycle calculation based on obstacle proximity conditions at the time.

Abstract: A robot interference checking motion planning technique using swept volume deformation. A rapidly-exploring random tree (RRT) algorithm generates random sample nodes between a start point and a goal point. Each sample node is evaluated by checking for robot-obstacle interference along a path segment to the node. If an interference exists along the path segment, a swept volume of the segment is used to identify a critical posture where the interference is greatest, and obstacle interference points are used to define a virtual force applied to the robot links to modify the path segment to alleviate the interference condition. A swept volume of the modified path segment is computed and evaluated. If the modified swept volume is collision-free and the modified path segment motion plan meets robot joint range criteria, the modified path segment and the sample node are added to the overall robot motion program.

Abstract: A region-based robotic grasp generation technique for machine tending or bin picking applications. Part and gripper geometry are provided as inputs, typically from CAD files, along with gripper kinematics. A human user defines one or more target grasp regions on the part, using a graphical user interface displaying the part geometry. The target grasp regions are identified by the user based on the user's knowledge of how the part may be grasped to ensure that the part can be subsequently placed in a proper destination pose. For each of the target grasp regions, an optimization solver is used to compute a plurality of quality grasps with stable surface contact between the part and the gripper, and no part-gripper interference. The computed grasps for each target grasp region are placed in a grasp database which is used by a robot in actual bin picking operations.

Abstract: A robot collision avoidance motion optimization technique using a distance field constraint function. CAD or sensor data depicting obstacles in a robot workspace are converted to voxels, and a three-dimensional binary matrix of voxel occupancy is created. A corresponding distance map matrix is then computed, where each cell in the distance map matrix contains a distance to a nearest occupied cell. The distance map matrix is used as a constraint function in a motion planning optimization problem, where the optimization problem is convexified and then iteratively solved to yield a robot motion profile which avoids the obstacles and minimizes an objective function such as distance traveled. The distance field optimization technique is quickly computed and has a computation time which is independent of the number of obstacles. The disclosed optimization technique is easy to set up, as it requires no creation of geometry primitives to approximate robot and obstacle shapes.

Abstract: A method for identifying inaccurately depicted boxes in an image, such as miss detected boxes and partially detected boxes. The method obtains a 2D RGB image of the boxes and a 2D depth map image of the boxes using a 3D camera, where pixels in the depth map image are assigned a value identifying the distance from the camera to the boxes. The method generates a segmentation image of the boxes using a neural network by performing an image segmentation process that extracts features from the RGB image and segments the boxes by assigning a label to pixels in the RGB image so that each box in the segmentation image has the same label and different boxes in the segmentation image have different labels. The method analyzes the segmentation image to determine if the image segmentation process has failed to accurately segment the boxes in the segmentation image.

Abstract: A method for dual hand detection in robot teaching from human demonstration. A camera image of the demonstrator's hands and workpieces is provided to a first neural network which determines the identity of the left and right hand of the human demonstrator from the image, and also provides cropped sub-images of the identified hands. The first neural network is trained using images in which the left and right hands are pre-identified. The cropped sub-images are then provided to a second neural network which detects the pose of both the left and right hand from the images, where the sub-image for the left hand is horizontally flipped before and after the hand pose detection if second neural network is trained with right hand images. The hand pose data is converted to robot gripper pose data and used for teaching a robot to perform an operation through human demonstration.

Abstract: A robot optimization motion planning technique using a refined initial reference path. When a new path is to be computed using motion optimization, a candidate reference path is selected from storage which was previously computed and which has similar start and goal points and collision avoidance environment constraints to the new path. The candidate reference path is adjusted at all state points along its length to account for the difference between the start and goal points of the new path compared to those of the previously-computed path, to create the initial reference path. The initial reference path, adjusted to fit the start and goal points, is then used as a starting state for the motion optimization computation. By using an initial reference path which is similar to the final converged new path, the optimization computation converges more quickly than if a naïve initial reference path is used.

Abstract: An adaptive robot grasp planning technique for bin picking. Workpieces in a bin having random positions and poses are to be grasped by a robot and placed in a goal position and pose. The workpiece shape is analyzed to identify a plurality of robust grasp options, each grasp option having a position and orientation. The workpiece shape is also analyzed to determine a plurality of stable intermediate poses. Each individual workpiece in the bin is evaluated to identity a set of feasible grasps, and the workpiece is moved to the goal pose if such direct movement is possible. If direct movement is not possible, a search problem is formulated, where each stable intermediate pose is a node. The search problem is solved by evaluating the feasibility and optimality of each link between nodes. Feasibility of each link is evaluated in terms of collision avoidance constraints and robot joint motion constraints.

Abstract: A deadlock avoidance motion planning technique for a multi-robot system. The technique includes online calculation of swept volumes for upcoming robot motion segments, and uses the swept volumes to compute one or more overlap zones, which are published to all robot controllers. Swept volume calculation is based on actual upcoming tool path, including adaptive conditions such as jumps and offsets. Robot controllers check at each time step whether an overlap zone will be entered and whether another robot is already in the zone. When a robot determines that it is about to enter a zone that is occupied, the robot holds position until the zone is vacated. Robots publish zone entry and exit for other robots’ awareness. Additional logic is added to establish priority for automatically resolving a deadlock condition, and for prioritizing completion of motion segments for a robot which is performing a continuous processing operation.

Abstract: A robot interference checking motion planning technique using point sets. The technique uses CAD models of robot arms and obstacles and converts the CAD models to 3D point sets. The 3D point set coordinates are updated at each time step based on robot and obstacle motion. The 3D points are then converted to 3D grid space indices indicating space occupied by any point on any part. The 3D grid space indices are converted to 1D indices and the 1D indices are stored as sets per object and per time step. Interference checking is performed by computing an intersection of the 1D index sets for a given time step. Swept volumes are created by computing a union of the 1D index sets across multiple time steps. The 1D indices are converted back to 3D coordinates to define the 3D shapes of the swept volumes and the 3D locations of any interferences.