TECHNICAL FIELD
[0001] The present disclosure is directed, in general, to computer-aided design, visualization,
and manufacturing ("CAD") systems, product lifecycle management ("PLM") systems, product
data management ("PDM") systems, and similar systems, that manage data for products
and other items (collectively, "Product Data Management" systems or PDM systems).
BACKGROUND OF THE DISCLOSURE
[0002] Global trends of decreasing electricity consumption and reducing greenhouse gas emissions
are leading to new standards and legislation. Energy efficient solutions are required
desirable to avoid governmental fines and market disapproval.
[0003] PDM systems can be used for modeling manufacturing systems. Improved systems are
desirable.
SUMMARY OF THE DISCLOSURE
[0004] Various disclosed embodiments include CAD and simulation methods and corresponding
systems and computer-readable mediums. A method includes receiving inputs including
one or more of robot information, operation information, and position information.
The method includes generating a list of tooling candidates of a robot. The method
includes, for each tooling candidate, determining an energy consumption value of the
tooling candidate. The method includes, for each tooling candidate, determining a
ranking for the tooling candidate based on the energy consumption value. The method
includes transmitting the optimal tooling of the robot based on the ranking of each
tooling candidate.
[0005] The foregoing has outlined rather broadly the features and technical advantages of
the present disclosure so that those skilled in the art may better understand the
detailed description that follows. Additional features and advantages of the disclosure
will be described hereinafter that form the subject of the claims. Those skilled in
the art will appreciate that they may readily use the conception and the specific
embodiment disclosed as a basis for modifying or designing other structures for carrying
out the same purposes of the present disclosure. Those skilled in the art will also
realize that such equivalent constructions do not depart from the spirit and scope
of the disclosure in its broadest form.
[0006] Before undertaking the DETAILED DESCRIPTION below, it may be advantageous to set
forth definitions of certain words or phrases used throughout this patent document:
the terms "include" and "comprise," as well as derivatives thereof, mean inclusion
without limitation; the term "or" is inclusive, meaning and/or; the phrases "associated
with" and "associated therewith," as well as derivatives thereof, may mean to include,
be included within, interconnect with, contain, be contained within, connect to or
with, couple to or with, be communicable with, cooperate with, interleave, juxtapose,
be proximate to, be bound to or with, have, have a property of, or the like; and the
term "controller" means any device, system or part thereof that controls at least
one operation, whether such a device is implemented in hardware, firmware, software
or some combination of at least two of the same. It should be noted that the functionality
associated with any particular controller may be centralized or distributed, whether
locally or remotely. Definitions for certain words and phrases are provided throughout
this patent document, and those of ordinary skill in the art will understand that
such definitions apply in many, if not most, instances to prior as well as future
uses of such defined words and phrases. While some terms may include a wide variety
of embodiments, the appended claims may expressly limit these terms to specific embodiments.
BRIEF DESCRIPTION OF THE DRAWINGS
[0007] For a more complete understanding of the present disclosure, and the advantages thereof,
reference is now made to the following descriptions taken in conjunction with the
accompanying drawings, wherein like numbers designate like objects, and in which:
Figure 1 illustrates a block diagram of a data processing system in which an embodiment
can be implemented;
Figure 2 illustrates a robot tooling candidate in accordance with the disclosed embodiments;
Figure 3 illustrates a robot simulation along a path required by the complex operation
in accordance with the disclosed embodiments;
Figure 4 illustrates a flowchart of a process to optimally tool a robot in accordance
with disclosed embodiments; and
DETAILED DESCRIPTION
[0008] FIGURES 1 through 4, discussed below, and the various embodiments used to describe
the principles of the present disclosure in this patent document are by way of illustration
only and should not be construed in any way to limit the scope of the disclosure.
Those skilled in the art will understand that the principles of the present disclosure
may be implemented in any suitably arranged device. The numerous innovative teachings
of the present application will be described with reference to exemplary non-limiting
embodiments.
[0009] Determining the most efficient tooling selection for a complex process requires consideration
of numerous constraints including whether the robot can reach all task locations from
a given robot position, whether any collisions occur with the robot and any objects
within its environment, and calculating the total amount of energy required to perform
the complex task, along with other considerations.
[0010] Robots can be heavy power consumers. Robots work repeatedly on one or more tasks
for long hours and have complex powertrains that can include engines, transmissions,
and so on. In a typical production line, there can be many robots, which further amplify
these issues.
[0011] Applying this approach on every robot in a production line reduces the energy consumption
resulting in reduced production costs. The reduced production costs come from finding
optimal tooling for each robot in the production line to reduce overall energy consumption.
[0012] Figure 1 illustrates a block diagram of a data processing system in which an embodiment
can be implemented, for example as a PDM system particularly configured by software
or otherwise to perform the processes as described herein, and in particular as each
one of a plurality of interconnected and communicating systems as described herein.
The data processing system illustrated can include a processor 102 connected to a
level two cache/bridge 104, which is connected in turn to a local system bus 106.
Local system bus 106 may be, for example, a peripheral component interconnect (PCI)
architecture bus. Also connected to local system bus in the illustrated example are
a main memory 108 and a graphics adapter 110. The graphics adapter 110 may be connected
to display 111.
[0013] Other peripherals, such as local area network (LAN) / Wide Area Network / Wireless
(e.g. WiFi) adapter 112, may also be connected to local system bus 106. Expansion
bus interface 114 connects local system bus 106 to input/output (I/O) bus 116. I/O
bus 116 is connected to keyboard/mouse adapter 118, disk controller 120, and I/O adapter
122. Disk controller 120 can be connected to a storage 126, which can be any suitable
machine usable or machine readable storage medium, including but not limited to nonvolatile,
hard-coded type mediums such as read only memories (ROMs) or erasable, electrically
programmable read only memories (EEPROMs), magnetic tape storage, and user-recordable
type mediums such as floppy disks, hard disk drives and compact disk read only memories
(CD-ROMs) or digital versatile disks (DVDs), and other known optical, electrical,
or magnetic storage devices. The storage 126 stores the energy consumption values
150, the simulation program 152, the robot information 154, the tooling information
156, the operation information 158, the position information 160, and so on, which
are described below.
[0014] Also connected to I/O bus 116 in the example shown is audio adapter 124, to which
speakers (not shown) may be connected for playing sounds. Keyboard/mouse adapter 118
provides a connection for a pointing device (not shown), such as a mouse, trackball,
trackpointer, touchscreen, etc.
[0015] Those of ordinary skill in the art will appreciate that the hardware illustrated
in Figure 1 may vary for particular implementations. For example, other peripheral
devices, such as an optical disk drive and the like, also may be used in addition
or in place of the hardware illustrated. The illustrated example is provided for the
purpose of explanation only and is not meant to imply architectural limitations with
respect to the present disclosure.
[0016] A data processing system in accordance with an embodiment of the present disclosure
can include an operating system employing a graphical user interface. The operating
system permits multiple display windows to be presented in the graphical user interface
simultaneously, with each display window providing an interface to a different application
or to a different instance of the same application. A cursor in the graphical user
interface may be manipulated by a user through the pointing device. The position of
the cursor may be changed and/or an event, such as clicking a mouse button, generated
to actuate a desired response.
[0017] One of various commercial operating systems, such as a version of Microsoft Windows™,
a product of Microsoft Corporation located in Redmond, Wash. may be employed if suitably
modified. The operating system is modified or created in accordance with the present
disclosure as described.
[0018] LAN/ WAN/Wireless adapter 112 can be connected to a network 130 (not a part of data
processing system 100), which can be any public or private data processing system
network or combination of networks, as known to those of skill in the art, including
the Internet. Data processing system 100 can communicate over network 130 with server
system 140, which is also not part of data processing system 100, but can be implemented,
for example, as a separate data processing system 100.
[0019] Figure 2 illustrates a robot simulation in accordance with the disclosed embodiments.
The simulated robot 200 depicted in FIGURE 2 consists of a robotic arm 210 fixed at
the base 250 to a position in a three-dimensional (3D) complex operation field. The
robotic arm 210 moves and orients the tooling candidate 230 by rotating at multiple
joints. The tooling candidates 230 connect to the robotic arm 210 at a connection
point 220. The connection point 220 and method of connection may be different for
each tooling candidate 230, possibly requiring a different fixed position in the 3D
field and different adjustments of the robotic arm 210 in order to perform the tasks
of the complex operation. FIGURE 2 depicts the tooling candidate 230 as a welding
unit, but the tooling candidate 230 can be a welding unit, riveting unit, soldering
unit, cutting unit, or any other suitable tooling unit required for completing a complex
operation.
[0020] Figure 3 illustrates a robot simulation along a path required by the complex operation
in accordance with the disclosed embodiments. The simulated robot 200 in FIGURE 2
has the tooling candidate 230 located at the initial location 310 in the path 340
of the complex operation that also includes multiple intermediate task locations 320
and a final location 330. Based on a simulation, a tooling candidate 230 is set to
perform a complex operation. The complex operation requires the tooling candidate
to move along a path 340 starting at the initial location 320 and ending at the final
location 330. The initial location and final location are depicted as different locations,
but they could also be the same location. The initial location and final location
might also be a task location or could just be a location not interfering with the
insertion or removal of the product. Along the path are intermediate task locations
320, in which the tooling candidate 230 is required to perform additional tasks. The
task locations along the path require the tooling candidates 230 to be oriented in
a suitable manner to complete the task.
[0021] Figure 4 illustrates a flowchart of a process for optimally tooling a robot in accordance
with disclosed embodiments. The energy consumption of the robot is realistic and accurate
based on a realistic robot simulation (RRS) performed by a data processing system,
such as the data processing system 100 of Figure 1. The RRS interface is known to
those of skill in the art, and is described at time of filing, for example, at realistic-robot-simulation.org.
The system uses RRS simulation to accumulate the energy consumption for each one of
the candidate tools and to find the collisions within the robot environment.
[0022] The system receives inputs including one or more of robot information 154, tooling
information 156, operation information 158, and position information 160 (step 402).
The robot information can include a model of the robot that allows for simulation
of the movements of the robot. The robot information 154 also can include information
related to the geometry or environment of the robot, the robot's surroundings, and
any objects pertinent to the placement or location of the robot. The tooling information
156 can include a list of tooling candidates and specific information about each tooling
candidate 230 including tooling orientation 240, connections, tooling weight, tool
energy consumption values, and any other information concerning the different toolings
required for the complex operation. The operation information 158 can include information
on the complex operation that the robot is to perform, the initial position 310, a
set of task locations 320 for the robot to reach to perform the complex operation,
the final location 330, location orientation information, and any other operation
related information. The position information 160 contains the robot's position. One
or more of the processor 102, the memory 108, and the simulation program 152 running
on the processor 102 receive the inputs via one or more of the local system bus 106,
the adapter 112, the network 130, the server 140, the interface 114, the I/O bus 116,
the disk controller 120, the storage 126, and so on. Receiving, as used herein, can
include retrieving from storage 126, receiving from another device or process, receiving
via an interaction with a user, or otherwise.
[0023] The system then generates a list of tooling candidates of the robot 200 comprising
tooling candidates 230 from the tooling information 156 (step 404). The tooling candidates
which are capable of performing the function required to complete the tasks of the
complex operation are added to the list of tooling candidates.
[0024] The system then creates the 3D complex operation field for running simulations of
the robot with different tooling candidates 230. The location orientation information,
including desired task orientation, the task orientation tolerance, and any other
information required for reaching the task location, is added to the 3D complex operation
field. The system generates a task location in the 3D complex operation field for
each of the one or more task in the complex operation.
[0025] For each tooling candidate in the list of tooling candidates, the system runs an
RRS simulation. The simulation uses the robot information 154, tooling information
156, the operation information 158, and the position information 160 to simulate performance
of the complex operation by the robot with the tooling candidate 230. When running
the simulation, the system removes each tooling candidate generated in the 3D complex
operation space where the robot is not long enough or is otherwise unable to reach
a task location on a path required to perform the complex operation when using that
tooling candidate (step 406). In order for a tooling candidate to reach a task location,
the tooling candidate 230 must not only extend to the location, but also must match
a task location orientation of the tooling candidate for each task location. The correct
tooling orientation 240 of the tooling candidate requires the tooling orientation
240 of the tooling candidate to be within the tolerance of the task orientation range.
The tooling orientation 240 is based on the orientation of the tooling candidate mounted
on the robot. The path can be adjusted for each tooling candidate based on a tooling
orientation 240 of each tooling candidate connected to the robot.
[0026] While running the simulation for each tooling candidate 230, the system also determines
if the simulation with the tooling candidate includes a collision and adjusts the
path to remove one or more collision events (step 408). If the system cannot adjust
the path to remove the one or more collision events, then the system removes the tooling
candidate from the list of tooling candidates. In certain embodiments, the collision
is removed by one or more of adding one or more flyby or additional non-task locations,
changing the orientation of the task location, changing the configuration of the robot,
and so on. Flyby locations are described, for example, in
U.S. Patent Publication 2011/0153080 A1, which is hereby incorporated by reference.
[0027] The system calculates the energy consumption value by running a simulation with each
tooling candidate attached to the robot arm (step 410). The energy consumption calculation
may include the energy of the robot consumes to move the tooling to the task location
as well as the energy consumption of the tooling. The energy consumption value indicates
the amount of energy consumed by the robot in order to complete the complex operation
with the tooling candidates attached to the robot arm for which the simulation was
run. In certain embodiments, for each tooling candidate remaining in the list of tooling
candidates, when the energy consumption value of the tooling candidate does not meet
a threshold, the system removes the tooling candidate from the list of tooling candidates.
[0028] The system determines the optimal tooling of the robot based on best energy consumption,
which generally is the lowest total energy consumption. Once an optimal tooling is
determined, the optimal tooling is returned to the user (step 412).
[0029] Of course, those of skill in the art will recognize that, unless specifically indicated
or required by the sequence of operations, certain steps in the processes described
above may be omitted, performed concurrently or sequentially, or performed in a different
order.
[0030] Those skilled in the art will recognize that, for simplicity and clarity, the full
structure and operation of all data processing systems suitable for use with the present
disclosure is not being illustrated or described herein. Instead, only so much of
a data processing system as is unique to the present disclosure or necessary for an
understanding of the present disclosure is illustrated and described. The remainder
of the construction and operation of data processing system 100 may conform to any
of the various current implementations and practices known in the art.
[0031] It is important to note that while the disclosure includes a description in the context
of a fully functional system, those skilled in the art will appreciate that at least
portions of the mechanism of the present disclosure are capable of being distributed
in the form of instructions contained within a machine-usable, computer-usable, or
computer-readable medium in any of a variety of forms, and that the present disclosure
applies equally regardless of the particular type of instruction or signal bearing
medium or storage medium utilized to actually carry out the distribution. Examples
of machine usable/readable or computer usable/readable mediums include: nonvolatile,
hard-coded type mediums such as read only memories (ROMs) or erasable, electrically
programmable read only memories (EEPROMs), and user-recordable type mediums such as
floppy disks, hard disk drives and compact disk read only memories (CD-ROMs) or digital
versatile disks (DVDs).
[0032] Although an exemplary embodiment of the present disclosure has been described in
detail, those skilled in the art will understand that various changes, substitutions,
variations, and improvements disclosed herein may be made without departing from the
spirit and scope of the disclosure in its broadest form.
[0033] None of the description in the present application should be read as implying that
any particular element, step, or function is an essential element which must be included
in the claim scope: the scope of patented subject matter is defined only by the allowed
claims. Moreover, none of these claims are intended to invoke paragraph six of 35
USC §112 unless the exact words "means for" are followed by a participle.
FURTHER EMBODIMENTS
[0034]
- 1. A method for product data management, the method performed by a data processing
system (100) and comprising:
receiving inputs including one or more of robot information (154), tooling information
(156), operation information (158), and position information (160);
generating a list of tooling candidates for a robot (200) 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;
removing a tooling candidate (230) from the list of tooling candidates when the robot
(200) cannot reach every task location on a path (340) required by the complex task
when using that tooling candidate (230);
adjusting the path (340) to remove one or more collision events;
calculating a total energy consumption value for each remaining tooling candidate
(230); and
returning an optimal tooling of the robot (200) based on the tooling candidate (230)
with the lowest energy consumption.
- 2. The method for product data management of embodiment 1, wherein the tooling information
(156) includes a tooling orientation (240) based on an orientation of the tooling
candidate (230) mounted on the robot (200).
- 3. The method for product data management of embodiment 2, wherein reaching a task
location requires the tooling orientation (240) to match a task location orientation
of the tooling candidate (230) for each task location.
- 4. The method for product data management of embodiment 2, further comprising:
adjusting the path (340) for each tooling candidate (230) based on a tooling orientation
of each tooling candidate (230) connected to the robot (200).
- 5. The method for product data management of embodiment 4, wherein adjusting the path
(340) is based on determining the path (340) with the lowest total energy consumption.
- 6. The method for product data management of embodiment 1, wherein the total energy
consumption includes an energy consumption of the robot (200) and an energy consumption
of the tooling candidate (230).
- 7. The method for product data management of embodiment 1, further comprising:
removing a tooling candidate (230) from the list of tooling candidates when the one
or more collision events cannot be removed by adjusting the path (340).
- 8. A data processing system (100) comprising:
a processor (102); and
an accessible memory (108), the data processing system particularly configured to:
receive inputs including one or more of robot information (154), tooling information
(156), operation information (158), and position information (160);
generate a list of tooling candidates of a robot (200) 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;
remove a tooling candidate (230) from the list of tooling candidates when the robot
(200) cannot reach every task location on a path (340) required by the complex task
when using that tooling candidate (230);
adjust the path (340) to remove one or more collision events;
calculate a total energy consumption value for each remaining tooling candidate (230);
return an optimal tooling of the robot (200) based on the tooling candidate (230)
with the lowest energy consumption.
- 9. The data processing system of embodiment 8, wherein the tooling information (156)
includes a tooling orientation (240) based on an orientation of the tooling candidate
(230) mounted on the robot (200).
- 10. The data processing system of embodiment 9, wherein reaching a task location requires
the tooling orientation (240) to match a task location orientation of the tooling
candidate (23) for each task location.
- 11. The data processing system of embodiment 9, further comprising:
adjust the path (340) for each tooling candidate (230) based on a tooling orientation
of each tooling candidate (230) connected to the robot (200).
- 12. The data processing system of embodiment 11, wherein to adjust the path (340)
is based on determining the path (340) with the lowest total energy consumption.
- 13. The data processing system of embodiment 8, wherein the total energy consumption
includes an energy consumption of the robot (200) and an energy consumption of the
tooling candidate (230).
- 14. The data processing system of embodiment 13, wherein the data processing system
is further configured to:
remove a tooling candidate (230) from the tooling list when the one or more collision
events cannot be removed by adjusting the path (340).
- 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 (154), tooling information
(156), operation information (158), and position information (160);
generate a list of tooling candidates of a robot (200) 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;
remove a tooling candidate (230) from the list of tooling candidates when the robot
(200) cannot reach every task location on a path (340) required by the complex task
when using that tooling candidate (230);
adjust the path (340) to remove one or more collision events;
calculate a total energy consumption value for each remaining tooling candidate (230);
and
return an optimal tooling of the robot (200) based on the tooling candidate (230)
with the lowest energy consumption.
- 16. The non-transitory computer-readable medium of embodiment 15, wherein the tooling
information (156) includes a tooling orientation (240) based on an orientation of
the tooling candidate (230) mounted on the robot (200).
- 17. The non-transitory computer-readable medium of embodiment 16, wherein reaching
a task location requires the tooling orientation (240) to match a task location orientation
of the tooling candidate (230) for each location.
- 18. The non-transitory computer-readable medium of embodiment 16, wherein the executable
instructions, when executed, further cause the one or more data processing systems
to:
adjust the path (340) for each tooling candidate (230) based on a tooling orientation
of each tooling candidate (230) connected to the robot (200).
- 19. The non-transitory computer-readable medium of embodiment 18, wherein to adjust
the path (340) is based on determining the path (340) with the lowest total energy
consumption.
- 20. The non-transitory computer-readable medium of embodiment 15, wherein the total
energy consumption includes an energy consumption of the robot (200) and an energy
consumption of the tooling candidate (230).
1. A method for product data management, the method performed by a data processing system
(100) and comprising:
receiving inputs including one or more of robot information (154), tooling information
(156), operation information (158), and position information (160);
generating a list of tooling candidates for a robot (200) 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;
removing a tooling candidate (230) from the list of tooling candidates when the robot
(200) cannot reach every task location on a path (340) required by the complex task
when using that tooling candidate (230);
adjusting the path (340) to remove one or more collision events;
calculating a total energy consumption value for each remaining tooling candidate
(230); and
returning an optimal tooling of the robot (200) based on the tooling candidate (230)
with the lowest energy consumption.
2. The method of claim 1, wherein the tooling information (156) includes a tooling orientation
(240) based on an orientation of the tooling candidate (230) mounted on the robot
(200).
3. The method according to any of the preceding claims, wherein reaching a task location
requires the tooling orientation (240) to match a task location orientation of the
tooling candidate (230) for each task location.
4. The method according to any of the preceding claims, further comprising:
adjusting the path (340) for each tooling candidate (230) based on a tooling orientation
of each tooling candidate (230) connected to the robot (200).
5. The method according to any of the preceding claims, wherein adjusting the path (340)
is based on determining the path (340) with the lowest total energy consumption.
6. The method according to any of the preceding claims, wherein the total energy consumption
includes an energy consumption of the robot (200) and an energy consumption of the
tooling candidate (230).
7. The method according to any of the preceding claims, further comprising:
removing a tooling candidate (230) from the list of tooling candidates when the one
or more collision events cannot be removed by adjusting the path (340).
8. A data processing system (100) comprising:
a processor (102); and
an accessible memory (108), the data processing system particularly configured to:
receive inputs including one or more of robot information (154), tooling information
(156), operation information (158), and position information (160);
generate a list of tooling candidates of a robot (200) 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;
remove a tooling candidate (230) from the list of tooling candidates when the robot
(200) cannot reach every task location on a path (340) required by the complex task
when using that tooling candidate (230);
adjust the path (340) to remove one or more collision events;
calculate a total energy consumption value for each remaining tooling candidate (230);
return an optimal tooling of the robot (200) based on the tooling candidate (230)
with the lowest energy consumption.
9. The data processing system of claim 8, wherein the tooling information (156) includes
a tooling orientation (240) based on an orientation of the tooling candidate (230)
mounted on the robot (200).
10. The data processing system according to any of the preceding system claims, wherein
reaching a task location requires the tooling orientation (240) to match a task location
orientation of the tooling candidate (23) for each task location.
11. The data processing system according to any of the preceding system claims, further
comprising:
adjust the path (340) for each tooling candidate (230) based on a tooling orientation
of each tooling candidate (230) connected to the robot (200).
12. The data processing system according to any of the preceding system claims, wherein
to adjust the path (340) is based on determining the path (340) with the lowest total
energy consumption.
13. The data processing system according to any of the preceding system claims, wherein
the total energy consumption includes an energy consumption of the robot (200) and
an energy consumption of the tooling candidate (230).
14. The data processing system according to any of the preceding system claims, wherein
the data processing system is further configured to:
remove a tooling candidate (230) from the tooling list when the one or more collision
events cannot be removed by adjusting the path (340).
15. A non-transitory computer-readable medium encoded with executable instructions that,
when executed, cause one or more data processing systems to perform a method according
to any of the claims 1 to 7.