IP Library › Patent Application 14226371
Patent Application
App. No. 14/226,371

ENERGY AND CYCLE TIME EFFICIENCY BASED METHOD FOR ROBOT POSITIONING

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
14/226,371
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.

Claims (64)

1 . A method for product data management, the method performed by a data processing system and comprising:

receiving inputs including one or more of robot information, operation information, position information, and constraint information;

generating a list of candidate positions of a robot based on the robot information and the position information;

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 from the list of candidate positions;

for each candidate position, determining an energy consumption value of the candidate position;

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; and

determining the optimal position of the robot based on the ranking of each candidate position.

2 . The method of claim 1 , further comprising:

for each candidate position, when the energy consumption value of the candidate position does not meet a threshold, removing the candidate position from the list of candidate positions.

3 . The method of claim 1 , further comprising:

for each candidate position, determining whether the robot can reach all required locations from the candidate position and removing the candidate position from the list of candidate positions when the robot cannot reach all the required locations from the candidate position.

4 . The method of claim 1 , further comprising:

for each candidate position, running a simulation to determine if the simulation at the candidate position includes a collision and one of:

removing the candidate position from the list of candidate positions if the simulation at the candidate position includes a collision; and

removing the collision from the candidate position via one or more of adding one or more flyby locations, changing an orientation of a location, and changing a configuration of the robot.

5 . The method of claim 1 , further comprising:

for each candidate position, determining an energy consumption weight (EW) and a time weight (TW) based on the time value and the energy consumption value.

6 . The method of claim 5 , further comprising:

for each candidate position, determining an energy rating (ER) and a time rating (TR) based on the EW, the TW, the time value, and the energy consumption value.

7 . The method of claim 6 , further comprising:

for each candidate position, determining a rating based on one or more of the ER, the TR, the EW, the TW, the energy consumption value, and time value.

8 . A data processing system comprising:

a processor; and

an accessible memory, the data processing system particularly configured to:

receive inputs including one or more of robot information, operation information, position information, and constraint information;

generate a list of candidate positions of a robot based on the robot information and the position information;

for each candidate position, determine a time value of the candidate position and when the time value of the candidate position does not meet a threshold cycle time value, remove the candidate position from the list of candidate positions;

for each candidate position, determine an energy consumption value of the candidate position;

for each candidate position, determine one or more of a rating and a ranking for the candidate position based on the time value and the energy consumption value; and

determine the optimal position of the robot based on the ranking of each candidate position.

9 . The data processing system of claim 8 , wherein the data processing system is further configured to:

for each candidate position, when the energy consumption value of the candidate position does not meet a threshold, remove the candidate position from the list of candidate positions.

10 . The data processing system of claim 8 , wherein the data processing system is further configured to:

for each candidate position, determine whether the robot can reach all required locations from the candidate position and remove the candidate position from the list of candidate positions when the robot cannot reach all the required locations from the candidate position.

11 . The data processing system of claim 8 , wherein the data processing system is further configured to:

for each candidate position, run a simulation to determine if the simulation at the candidate position includes a collision and one of:

remove the candidate position from the list of candidate positions if the simulation at the candidate position includes a collision; and

remove the collision from the candidate position via one or more of adding one or more flyby locations, changing an orientation of a location, and changing a configuration of the robot.

12 . The data processing system of claim 8 , wherein the data processing system is further configured to:

for each candidate position, determine an energy consumption weight (EW) and a time weight (TW) based on the time value and the energy consumption value.

13 . The data processing system of claim 12 , wherein the data processing system is further configured to:

for each candidate position, determine an energy rating (ER) and a time rating (TR) based on the EW, the TW, the time value, and the energy consumption value.

14 . The data processing system of claim 13 , wherein the data processing system is further configured to:

for each candidate position, determine a rating based on one or more of the ER, the TR, the EW, the TW, the energy consumption value, and time value.

15 . A non-transitory computer-readable medium encoded with executable instructions that, when executed, cause one or more data processing systems to:

receive inputs including one or more of robot information, operation information, position information, and constraint information;

generate a list of candidate positions of a robot based on the robot information and the position information;

for each candidate position, determine a time value of the candidate position and when the time value of the candidate position does not meet a threshold cycle time value, remove the candidate position from the list of candidate positions;

for each candidate position, determine an energy consumption value of the candidate position;

for each candidate position, determine one or more of a rating and a ranking for the candidate position based on the time value and the energy consumption value; and

determine the optimal position of the robot based on the ranking of each candidate position.

16 . The computer-readable medium of claim 15 , wherein the executable instructions, when executed, further cause the one or more data processing systems to:

for each candidate position, when the energy consumption value of the candidate position does not meet a threshold, remove the candidate position from the list of candidate positions.

17 . The computer-readable medium of claim 15 , wherein the executable instructions, when executed, further cause the one or more data processing systems to:

for each candidate position, determine whether the robot can reach all required locations from the candidate position and remove the candidate position from the list of candidate positions when the robot cannot reach all the required locations from the candidate position.

18 . The computer-readable medium of claim 15 , wherein the executable instructions, when executed, further cause the one or more data processing systems to:

for each candidate position, run a simulation to determine if the simulation at the candidate position includes a collision and one of:

remove the candidate position from the list of candidate positions if the simulation at the candidate position includes a collision; and

remove the collision from the candidate position via one or more of adding one or more flyby locations, changing an orientation of a location, and changing a configuration of the robot.

19 . The computer-readable medium of claim 15 , wherein the executable instructions, when executed, further cause the one or more data processing systems to:

for each candidate position, determine an energy consumption weight (EW) and a time weight (TW) based on the time value and the energy consumption value.

20 . The computer-readable medium of claim 15 , wherein the executable instructions, when executed, further cause the one or more data processing systems to:

for each candidate position, determine an energy rating (ER) and a time rating (TR) based on the EW, the TW, the time value, and the energy consumption value; and

for each candidate position, determine a rating based on one or more of the ER, the TR, the EW, the TW, the energy consumption value, and time value.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 25, 2014
From: HAZAN, MOSHE; EMBON, LISANDRO; MADVIL, RAHAV
To: SIEMENS INDUSTRY SOFTWARE LTD.
Reel/Frame 032754/0290 →