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 optimizing energy savings and reducing cycle time for mutating an industrial robotic path when a collision is detected. A method includes initializing a plurality of clone paths where a collision was detected, wherein a clone path is a clone of the initial path and the initial path comprises a source location, a plurality of intermediate locations, and a target location; for each clone path, determining a candidate path to store in a population, determining an optimal breed comprising the candidate path with an optimal rating, wherein the optimal rating is determined by the lowest breed rating in the population, and returning the optimal breed.

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 improving efficiency of industrial robotic energy consumption and cycle time by handling location orientation. A method includes receiving a complex operation including a plurality of task locations, generating a plurality of joint configurations of a simulated robot for each one of the plurality of task locations, wherein each of the plurality of joint configurations contains a plurality of candidate orientations, determining an optimal joint configuration for each task location that provides a lowest summation of the movement ratings for the complex operation, wherein the movement ratings incorporate an energy consumption and a cycle time for each of a plurality of robotic movements for the complex operation, determining an optimal candidate orientation for each of the optimal joint configurations at each task location that provides a lowest summation of the movement ratings for the complex operation, returning the optimal candidate orientations for each of the optimal joint configurations.

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 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 optimizing energy savings and reducing cycle time for mutating an industrial robotic path when a collision is detected. A method includes initializing a plurality of clone paths where a collision was detected, wherein a clone path is a clone of the initial path and the initial path comprises a source location, a plurality of intermediate locations, and a target location; for each clone path, determining a candidate path to store in a population, determining an optimal breed comprising the candidate path with an optimal rating, wherein the optimal rating is determined by the lowest breed rating in the population, and returning the optimal breed.

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