Abstract: A method for automatically creating electronic work instructions includes receiving a simulation data structure enabling a simulation of a production process of a product including simulation data and production process information, and automatically collecting, for each step of the production process, step related production process information and temporally tagging the production process information collected for each step in order to create, for each step and from the production process information, an electronic work instruction including temporal data enabling a temporal synchronization of a display of the electronic work instruction with a display of the simulation result. A data processing system and a non-transitory computer-readable medium are also provided.

Abstract: Systems and a method predict a generation of a robotic program for industrial coating. Inputs are received including a virtual representation of a robot, a coating gun, elements of the object surface to be coated and a set of desired coating thickness ranges. Inputs on a coating dispersion object are also received. Training data of a plurality of robotic programs for industrial coating and of their corresponding coating thickness coverage on a plurality of surfaces are received. The training data are processed in x, y tuples so as to learn a mapping function to generate a coating prediction module. Starting with a given selected valid thickness coverage as input parameters, it is proceeded in an iterative manner to predict a robotic program via the coating prediction module. A coating robotic program is generated for each surface element based on the resulting predicted coating programs.

Abstract: Systems and a method for teaching a robot in reaching a given target location. The system and method include receiving inputs on a representation of a given target location to be reached by the robot. A check is made whether the given target location is singular. If the given target location is non-singular, the teaching of the robot is effected by associating with the given target location a selected configuration. If the given target is singular, the teaching of the robot is effected by associating with the given target location an assigned joint-values solution.

Abstract: Systems and a method determine a sequence of joint values of an external axis along a sequence of targets. Inputs are received, including robot representation, tool representation, sequence of targets, kinematics of the axis joints, and/or type of robot-axis motion. For each target, it is generated at least one weight factor table representing, for each available configuration of the axis joint motion, a combined effort of the robot motion and the axis motion depending on the type of combined robot-axis motion. Valid weight factor values of the table are determined by simulating collision free trajectories for reaching the target. The sequence of joint values of the at least one external axis is determined by finding from the weight factor table a sequence of joint values for which the sum of their corresponding weight factors for reaching the target location sequence is minimized.

Abstract: A computing system may include a data access engine and a toolpath adjustment engine. The data access engine may be configured to access a computer-aided design (CAD) model of a part design and a computer-aided manufacturing (CAM) setup for the part design. The CAM setup may include a nominal toolpath specified through the CAD model for performing a finishing operation for the part design. The data access engine may also be configured to obtain 3-dimensional (3D) scan data for a physical part manufactured from the part design. The toolpath adjustment engine may be configured to extract, from the 3D scan data, a manufactured geometry of the physical part manufactured from the part design and generate an adjusted toolpath for the physical part to account for the manufactured geometry extracted from the 3D scan data.

Abstract: Systems and a method are provided for programming a cobot for a plurality of cells of an industrial environment. A physical cobot is provided within a lab cell comprising physical lab objects. A virtual simulation system receives information inputs on a virtual cobot representing the physical cobot, regarding a virtual lab cell comprising virtual lab objects, and on a plurality of virtual industrial cells comprising virtual industrial objects. Inputs are received from the physical cobot's movement during teaching whereby the physical cobot is moved in the lab cell to the desired position(s) while providing, via a user interface, a visualization of the virtual cobot's movement within a meta cell generated by superimposing the plurality of virtual industrial cells with the virtual lab cell, so that collisions with any object are minimized. A robotic program is generated based on the received inputs of the physical cobot's movement.

Abstract: Methods and a system include getting, for each variant, input on a probability of occurring and inputs on a variant assigned workload time for a given resource. For each resource of the line, each variant is represented with a graphic object having a first measurable parameter representing the variant probability and a second measurable parameter representing the variant assigned workload time. At least one resource requiring workload balancing on a specific variant is determined by taking into account a combination of the first measurable parameter and the second measurable parameter of the specific variant.

Abstract: 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.

Abstract: Systems and a method for calculating thickness values of a coating material applied by a coating gun on object surfaces in industrial processes include measuring, on real test surfaces, the thickness values of coating material samples applied by the coating gun on the real test surfaces. The measured thickness values are used to generate 3D virtual objects modeling the coating dispersions of the coating gun at given angles formed between the coating gun and the test surface. The thickness values of the coating material applied on the surface of a simulated object by a simulated gun at a certain angle are calculated by detecting the collision between the 3D virtual object mounted on the simulated coating gun and surface elements of the simulated object surface.

Abstract: Methods for CAD, simulation, and corresponding systems and computer-readable mediums. A method includes receiving inputs including one or more of robot information, operation information, position information, and constraint information. The method includes generating a list of candidate positions of a robot. The method includes, for each candidate position, determining a time value of the candidate position and when the time value of the candidate position does not meet a threshold cycle time value, removing the candidate position. The method includes, for each candidate position, determining an energy consumption value of the candidate position. The method includes, for each candidate position, determining one or more of a rating and a ranking for the candidate position based on the time value and the energy consumption value. The method includes determining the optimal position of the robot based on the ranking of each candidate position.

Abstract: Systems and a method for anti-collision management of two or more robots with at least partially overlapping robotic movements are provided. The systems and method include receiving inputs from two or more single robots performing robotic operations along a trajectory defining for each robot a single swept volume. Discretized subswept volumes are created between robotic path locations for each single robot according to one or more discretization criteria such that the operation of each single robot moving along the known trajectory is controlled to allow synchronized execution of robotic operations. Only overlapping discretized subswept volumes are considered for synchronization. This enables focusing only on the relevant collision-prone areas. Deadlocks may be prevented by a look-ahead behavior. Smart synchronization methodology allows optimizing cycle time.

Abstract: Systems and a method for robotic energy saving tool search. The systems and method include receiving inputs including one or more of robot information, tooling information, operation information, and position information. Using the information received, a list of tooling candidates of a robot required to complete one or more tasks for a complex operation and a task location for each of the one or more tasks in the complex operation is generated. Tooling candidate are then removed from the list of tooling candidates when the robot cannot reach every task location on a path required by the complex task. The path is adjusted to remove one or more collision events. The total energy consumption value for each remaining tooling candidate is calculated, and returning the tooling candidate with the lowest energy consumed.

Abstract: Methods for saving energy and reducing cycle time by using optimal ordering of the industrial robotic path. A method includes receiving inputs including a complex operation, generating a plurality of task groups of the complex operation, calculating a group edge rating for each of a plurality of robotic movement edges between each of the plurality of task groups, calculating a candidate rating for each of a plurality of candidate paths, wherein the candidate rating comprises a summation of the group edge ratings for a candidate path, determining an optimal path comprising the candidate path with an optimal rating, wherein the optimal rating is determined by the lowest candidate rating, and returning the optimal path.

Abstract: Methods for automatic and efficient location generation for cooperative motion. A method includes receiving a cooperative operation comprising a master operation and the slave operation, simulating the slave operation to obtain a slave duration between consecutive slave locations and a trajectory time to perform the slave operation, populating a plurality of potential locations along the master trajectory, generating a plurality of candidate operations in a population, for each of the plurality of candidate operations in the population, simulating a candidate operation with the slave operation to calculate an efficiency factor to perform the candidate operation and removing the candidate operation from the population when the efficiency factor is not better compared to other candidate operations in the population and returning the candidate operation remaining in the population.

Abstract: Methods for saving energy and reducing cycle time of a complex operation by using optimal robotic joint configurations. A method includes receiving inputs including the complex operation, generating a plurality of joint configurations of a simulated robot for each one of a plurality of task locations based on the inputs of the complex operation, calculating an edge rating for each of a plurality of robotic movements, wherein a robotic movement accounts for movement between joint configurations of consecutive task locations, calculating a plurality of candidate ratings for each of a plurality of candidate configuration paths, wherein a candidate rating is a summation of edge ratings of robotic movements for a candidate configuration path, determining an optimal configuration path based the candidate configuration path with an optimal rating, wherein the optimal rating is determined by the lowest candidate rating, and return the optimal configuration path.

Abstract: Methods for producing a robot program for a substantially-symmetric product and corresponding systems and computer-readable mediums. A method includes receiving a first-side robot program. The first-side robot program is a robot program for processing a first side of the substantially-symmetric product. The method includes identifying one or more resources of the first-side robot program by and producing corresponding mirrored resources in a second-side robot program. The method includes identifying one or more robots for the first-side robot program and producing corresponding mirrored robots in the second-side robot program. The method includes processing machine data files of the first-side robot program and updating logic block signal connections from the first-side robot program to the second-side robot program. The method includes replacing references to objects in the second-side robot program and assigning tool mounts to the second-side robot program.

Abstract: Systems and a method for robotic energy saving tool search. The systems and method include receiving inputs including one or more of robot information, tooling information, operation information, and position information. Using the information received, a list of tooling candidates of a robot required to complete one or more tasks for a complex operation and a task location for each of the one or more tasks in the complex operation is generated. Tooling candidate are then removed from the list of tooling candidates when the robot cannot reach every task location on a path required by the complex task. The path is adjusted to remove one or more collision events. The total energy consumption value for each remaining tooling candidate is calculated, and returning the tooling candidate with the lowest energy consumed.

Abstract: Methods for CAD, simulation, and corresponding systems and computer-readable mediums. A method includes receiving inputs including one or more of robot information, operation information, position information, and constraint information. The method includes generating a list of candidate positions of a robot. The method includes, for each candidate position, determining a time value of the candidate position and when the time value of the candidate position does not meet a threshold cycle time value, removing the candidate position. The method includes, for each candidate position, determining an energy consumption value of the candidate position. The method includes, for each candidate position, determining one or more of a rating and a ranking for the candidate position based on the time value and the energy consumption value. The method includes determining the optimal position of the robot based on the ranking of each candidate position.

Abstract: Methods for product simulation systems and computer-readable mediums. A method includes receiving inputs including one or more virtual robots, one or more virtual work objects, and a virtual workspace. The method includes determining a path for each of the virtual robots based on the virtual work objects and the virtual workspace. The method includes generating programs that can be collision-free for one or more actual robots respectively corresponding to the virtual robots based on the paths.

Abstract: Methods for CAD, simulation, and corresponding systems and computer-readable mediums. A method includes receiving inputs including one or more of robot information, operation information, position information, and constraint information. The method includes generating a list of candidate positions of a robot. The method includes, for each candidate position, determining a time value of the candidate position and when the time value of the candidate position does not meet a threshold cycle time value, removing the candidate position. The method includes, for each candidate position, determining an energy consumption value of the candidate position. The method includes, for each candidate position, determining one or more of a rating and a ranking for the candidate position based on the time value and the energy consumption value. The method includes determining the optimal position of the robot based on the ranking of each candidate position.