|Publication number||US5790406 A|
|Application number||US 08/546,364|
|Publication date||Aug 4, 1998|
|Filing date||Oct 20, 1995|
|Priority date||Oct 20, 1995|
|Publication number||08546364, 546364, US 5790406 A, US 5790406A, US-A-5790406, US5790406 A, US5790406A|
|Inventors||John P. Dunn, David A. Lewis|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (9), Referenced by (10), Classifications (8), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The invention is directed to a system and method for control of an apparatus, in particular, an apparatus for performing manufacturing operations on a work piece. The system has a hierarchical series of functional operations which are grouped to provide control of the apparatus, in particular a methodology for easy modification of tool control functions.
Historically, software control of manufacturing equipment has been relatively simple and straightforward. Today, however, as manufacturing equipment becomes more costly with tighter process tolerances, the software has become substantially more complex. This is further complicated by growing trend towards "cluster tools" in which more than one process station is incorporated into a single "tool", where all of the detailed control segments of which station fall under the control of one high level algorithm, which for example controls a robot taking parts from one or more input stations and delivering them to one or more process stations in a predetermined order, finally delivering the part to an output station (which may in fact also be the input station, essentially returning the processed part to the same place it was taken).
This code can include complex scheduling code to determine which process station should be served next by the robot in addition to the detailed control code required by the robot and each station to function. In a standard application, this can result in tens to hundreds of thousands of lines of code, of which some must run quickly, while other parts are less speed critical. For example, the overall scheduling part of the code must run quickly to determine which operations should be undertaken next, while considering which current operations are near completion and which operations are throughput limiting, to ensure that the tool is running at peak efficiency for the maximum time.
These speed requirements for part of the code typically result in all of the code being compiled for maximum efficiency and result in very long and complex control programs. The greatest difficulties with the current situation arises if the sequence needs to be modified, or a single component needs to be upgraded and is not compatible with either the existing sequence or the control codes are not compatible. The result in either of these situations is the need to examine the control code, modify the appropriate parts, recompile, reinstall and requalify the code on the tool, requiring an experienced programmer who (i) understands the software language; (ii) understands the modifications to be made to the tool sequence; (iii) understands the specific hardware calls to each station and for each operation; (iv) understands the tool requirements and (v) is aware of "bugs" in the tool hardware and software. To fulfill these requirements, a programmer must have substantial experience with the tool, usually gained over an extended period of time. In addition, whenever a change is required, the programmer must understand the change and detailed process characteristics, become reacquainted with the software and find and understand those parts of the code that need modification.
What would be useful and is not available, is a tool control code which could be relatively easily modified by a tool maintenance engineer of station owner without the specialized aid of other professionals, including programmers.
It is an object of the present invention to provide an improved system for control of an apparatus.
It is another object of the present invention to provide a system which can be modified without requiring source code revision.
It is another object of the present invention to provide an improved system which provides for modification of the system function by selection of options.
It is another object of the present invention to provide a system which is modified by selecting options from a set of menus on a display screen.
A broad aspect of the present invention is a system and method for control of an apparatus. The system has a hierarchical series of levels of functional operations. The hierarchical series has a highest level and a series of lower levels. There is a means for initiating an instruction in the highest level which results in execution of instructions in the series of lower levels until an instruction is executed to control the apparatus.
In a more specific aspect of the systems and methods according to the present invention, a functional operator of a level corresponds to a grouping of functional operators of a lower level.
In another more specific aspect of the systems and methods according to the present invention, each level of the hierarchy of levels is in a sequential order wherein a higher level contains groups of functional operations of the next succeeding lower level.
In another more specific aspect of the systems and methods according to the present invention, a process of the system and method for control of the apparatus is specified by selection of groups of functional operations at each level without requiring recoding of the system and method, or recompilation of the modified system and method.
In another more specific aspect of the apparatus and method according to the present invention, group of functional operations for each level are selected from a menu or series displayed on a display device.
Further objects, features, and advantages of the present invention will become apparent from a consideration of the following detailed description of the invention when read in conjunction with the drawings in which:
FIG. 1 schematically shows an embodiment of an apparatus which is controlled by the system and method according to the present invention.
FIG. 2 schematically shows an N level system according to the present invention which is applicable to any operation which is being controlled. Level 1 has M functional operations. Fi, i=1 to M. Level 2 has K functional operations Fi, i=1 to K.
Level N-1 has Q functional operations FN-1, i=1 to Q
Level N has R functional operations FN, i=1 to R.
Each functional operation F1 of Level 1 includes a group of F2 of the functional operations of Level 2, wherein j is a set of values selected from 1 to Q, each of which can occur more than once.
Each functional operation F.sup.(N-1) of Level n-1 includes a group wherein J is a set of values selected from 1 to R, each of which can occur more than once. If level N corresponds to the lowest level, then each FN corresponds to an operation interacting with the apparatus being controlled. Any of the levels 1 to N can have a functional operation which operates directly on the apparatus being controlled.
FIG. 3 is an example of a specific embodiment of the system schematically shown in FIG. 2. The embodiment of FIG. 3 has four levels: a process level, a task level, a sequence level and an operation level, each of which will be defined in detail below. Similarly to FIG. 2, each Pi for i=1 to N, is a process wherein each Pi contains a group of tasks T9 ! which is any combination of the set of M tasks Tm where m=1 to M from the Task Level. Each
Task Tm contains a group of sequences Sq! which is any combination of the set of Q sequences Sq where q=1 to Q. Each sequence Sq contains a group of operations Or ! where r=1 to R from the Operation Level. Any of the process, task and sequence level can have a functional operation which operates directly on the apparatus under control.
FIG. 4 shows a specific example of the generic system shown in FIG. 3.
To overcome these shortcomings, we have invented a simple-language, hierarchical structure of lists of commands which are read, interpreted and executed to control the operation of a tool.
A manufacturing process occurs within a cell, a self-contained entity that has an input station, an output station and at least one station where a part undergoes some transformation. Although the invention will be described with reference to an embodiment directed to a manufacturing operation, it is not limited thereto. The operation being controlled, can be any operation having a group of subparts which must be scheduled into a sequence to satisfy a particular end objective, such as a securities operation, an inventory control operation, etc.
Using a hierarchy that we have invented consisting of PROCESS's, TASK's, SEQUENCE's and OPERATION's, all written as simple language files which are fully editable and modifiable by the users, the operations of a manufacturing cell are controlled, including the steps to take when process exceptions occur. Due to the way in which this invention in implemented, it enables on-line tool diagnostics and simulations that can predict the effects of proposed process changes, thereby reducing the time normally required to make alterations to a process.
For the purposes of this Invention, the definition of a cell is shown in FIG. 1 and includes an input station 2, a mounting station/alignment station 4, curing stations 6 and 8, a pick-up station 10, an output station 12 and a robot 14, which is responsible for all movement of parts. There may be multiple positions at some of these stations, eg. two input trays for parts coming into the cell (cluster tool).
A cell also possesses a transport mechanism that moves parts between stations. All of these are resources, which can be allocated and freed. A cell has a controller, software that coordinates the cell's activities.
A hierarchical list of detailed process steps has been invented, defined as:
______________________________________Operation The lowest level command issued by the cell controller. Operations are station or device specific. Examples include but are not limited to transport mechanism commands, all commands transmitted to the stations and sensor I/O operations. These commands are typically written specifically for the device to be controlled in "machine language" understood by that tool. Although the lowest level understood by the cell controller, if the Operation in question is a command to a station, the actions. performed by the receiving station may be quite complex. The model is not affected by the stations' intelligence. An example of this would be to initiate a complex process profile, which itself is controlled by a PC acting as a tool controller.Sequence A series of one or more Operations. Each resource type should have a corresponding Sequence type. There are three kinds of sequences:Transport This takes the transport mechanism from one defined point to another. The transport mechanism may or may not be transporting a part.Process This accomplishes a change in a part's state.Input/ For input, this brings a part to a point where it can beOutput presented to the transport mechanism. For output, this prepares the output station to receive a part.Task A series of one or more Sequences, which do not have to be the same kinds of sequences. A task "seizes" a resource. A particular resource will sometimes have to go through several sequences before it can be freed for other work, hence the Task level. How many Sequences to assign to a particular Task is an implementation issue, and all that the model and experience suggest is that a resource never be seized for any longer than is necessary. During normal operation, a Task is uninterruptible, a condi- tion which follows from the fact that a Task seizes a resource.Process A series of one or more Tasks that accomplish a cell goal. Cell goals include cell initialization, reset and runout, and part transformation.______________________________________
The main advantages of this invention are that
Users are able to ignore the software that drives their manufacturing tools, properly concerning themselves only with the tool itself.
The users are free to modify what the tool does without a programmer's assistance.
The level of expertise necessary to change the operation of the tool depends on the type of modifications necessary and doesn't require highly trained personnel to make routine adjustments.
Neither the design nor the model are wed to any particular environment. For example, the system could be implemented using Cellworks, a cell control software package developed and marketed by Fastech Integration.
The cell is run by the scheduling program reading the process file, which is a series of task names, similar to that above, written in simple language, an example of which is shown in Table 1 and which will appear in an editor in a form which is as readable as that shown in TABLE 1.
The first entry in that file, corresponding to the TASK, "Cure13 a13 Part" in TABLE 1, is then executed by reading the file "Cure-- a-- part.TSK which can contain one or more SEQUENCES names as shown in TABLE 2. The SEQUENCE file for the first entry, is then opened (Table 3) and the OPERATIONs in that file are then executed, as shown in Table 4. It is important to note that ONLY the execution of an OPERATION results in a change in the status of the CELL by moving the robot, initiating a curing sequence, etc.
After the OPERATION is completed, the next OPERATION in the SEQUENCE is read and executed. When all of the OPERATIONS in the SEQUENCE file have been completed, the next SEQUENCE in the TASK file is then read, and so on. It is important to note that a SEQUENCE can consist of only one OPERATION, a TASK of only one SEQUENCE and a PROCESS of only one TASK.
The hierarchical nature of these files means that changes can be made to the order in which lower level files are read and acted on, without modification of those files, or knowledge of how those files work. For example, the order in which stations receive a part can easily be changed simply by changing the order of the TASK's in the relevant PROCESS file. No knowledge or modification of the SEQUENCE's or OPERATION's involved is necessary. In a conventional tool-control application, a change of this magnitude could require extensive changes to the compiled code by an experienced programmer.
It is also important to note that this hierarchical structure separates the equipment-specific codes and controls from the main body of the program and allows quick and simple editing. Thus, if a robot should be updated with a more advanced version, the only files to be modified are those SEQUENCE's that contain robot operations.
There is an inherent capability to pass parameters from TASK's, and SEQUENCE's to the OPERATION by allowing variables in the OPERATION's. For example, this results in only one SEQUENCE list which is read to service both process stations. This is accomplished, by passing the station number to be serviced as a <variable> from the TASK. This results in only one file which needs to be modified in case changes are required to both stations. If the stations become substantially different, requiring very different OPERATIONS, the process stations are defined with separate SEQUENCES.
A second model of a cell would be an assembly point in a manufacturing line for the manufacture of a complex object. In this case, a partially assembled object is delivered to the input station, a robot adds a series of subassemblies to the object and it is delivered to the output station for transport to the next assembly point. The hierarchical approach described in this patent can be used to control the activities of each assembly point in addition to the control of objects to various assembly stations. An example of the hierarchical order is shown in FIG. 4 which could apply to an automotive plant assembly process sequence.
For different objects, the order in which the subassemblies are added to the structure may be desirable to be changed. By altering the order in the hierarchical system described, the process is simple and inexpensive to modify.
The preferred embodiment of this invention is implemented in four handlers, each dealing with only one layer of the hierarchy. It is important to point out that:
There is no logic imbedded in any of the files handled by the layers of the hierarchy.
The handlers themselves are concerned only with whether or not the last action initiated completed successfully. Exceptions to normal processing are handled by the exception handler, described below, while normal processing is handled by the scheduler, also described below.
All operations are ASCII strings, fully editable and modifiable by the users. Sequences are simply lists of these strings, and sequence names are simply file names, as are task and process names.
Each operation has a field that specifies what string signifies a successful operation, and the operations handler will look for that when a completion message is received from the device handler. If the return code is good, the operations handler signals the sequence handler that the operation has completed successfully. If it has not, the exception handler is apprised of this fact. If the exception handler determines that recovery is not possible, it notifies the operations handler of that fact, and the operations handler in turn informs the sequence handler. If recovery can be attempted--for example, a timeout for a sensor reading might be increased on the fly--and is successful--then events proceed normally.
To enable this invention to be more user-friendly a graphical interface is implemented that allows the user to control the tool in a natural and comfortable way.
All OPERATION's, SEQUENCE's, TASK's and PROCESS's are under the user's control and can be added, edited and deleted as the user chooses. For example, when the user wants to add another operation to an existing sequence, a list of existing sequences will be displayed. After the sequence is chosen and displayed, the user will be able to display a list of available operations, and choose the operation desired. If the operation is not yet available, the user can add an operation to a list of available operations. The same holds true for each of the subsequent levels in the hierarchy.
If a device that is the target of an operation has its own operation set, the format of the operation is likely to be cryptic. For example, the command to start a process cycle may contain a large number of parameters which define the process cycle to be undertaken for that part or set of parts. This command could be 2 or more lines long due to these parameters. These operations will be presented to the user in a readable, understandable format. In an additional example, assume that a robot operation consists of a two-letter representation followed by some optional character string. As presented to the user, the two-letter representation will be expanded into a meaningful string, and the data string will be presented as individual, labelled fields. Then, when the user saves the work, one of two paths can be followed:
The individual operations can be compressed into their device-readable format when the file is saved. Obviously, this means that anytime the file is selected for editing, it will have to be "uncompressed" for the user.
The individual operations can be compressed into their device-readable formats just before they are transmitted to the target device.
Users will also be able to easily modify parameters required for the system to perform. For example, the users will be able to specify addresses for target devices and associate the physical address with a symbolic one. Then, if the physical address changes, all the user has to do is to edit the file and change the physical address. The software, which looks for the symbolic address, and then uses the equivalent physical address, will not have to be changed.
Because multiple processes can be executing simultaneously, the system requires a flexible scheduler, the function of which is to allocate cell resources so as to maximize tool throughput: it will work in conjunction with the process handler. The reader will recall that a PROCESS consists of one or more TASK's, and that a TASK seizes a resource. When the process handler retrieves a TASK from the process file, it will pass that TASK name to the scheduler. The scheduler will know what resource is required for that TASK, and will either seize it immediately for that TASK or, if the resource is already seized, will wait until that resource is made available. It will then tell the process handler to initiate that TASK.
When the process handler learns that a TASK has completed, it will convey that information to the scheduler, which will then free the seized resource associated with that TASK and, if another TASK is waiting on that resource, seize it and tell the process handler that the waiting TASK can now be initiated.
An important part of the preferred embodiment is the way in which the software handles errors or unexpected situations which arise during the operation of the tool. For example, a part is dropped during transport or a part is not present at the input station when expected (i.e, there are only 19 parts in a 20 part cassette or parts are not in consecutive slots).
The exception handler will handle all non-normal events in the system. It will have available to it a list of all exception messages, and each exception message will be associated with a recovery process.
The exception handler will also log all exception events, and this information will be used by the diagnostic system, described below.
The diagnostic system will have two main features:
The diagnostic system will have access to the exception logs maintained by the exception handler, and can be used to generate exception reports for review by tool users.
In conjunction with a case-based expert system--with cases built up over time as experience with the tool increases--these same exception logs will be used to analyze exception events and provide diagnostic and preventive maintenance advice to the tool users.
On-line event logging
An on-line event logger will be available to tool users. We expect this to have two major uses:
1. Users will be able to make notes about logged exceptions that they are investigating. This way, everyone working on the same problem has access to all the work done up to that point.
2. Because the exception handler will not see every possible exception event, the on-line logger will allow users to make note of these events, and also to make note of any circumstances associated with the event.
The simulation system will allow users to predict the results of tool changes. Using system files that contain records of times associated with all operations, sequences, and tasks, the module will be able to accurately predict the effects of such changes as the addition of new operations to existing sequences, different task priority schemes, and changes in transport mechanism.
Cure-- a-- Part
Robot-- Home to CoRex
Transport collar from Collar-Cooling Station to Pickup-- Stand
PuRex to IRex
Transport part from Input Station to Pickup-- Stand
Mate collar to part
Transport part from Pickup-- Stand to Curing Station
CuRex to CoRex
Transport collar from Collar-Cooling Station to Pickup-- Stand
PuRex to IRex
Transport part from Input Station to Pickup-- Stand
Mate collar to part
Transport part from Pickup-- Stand to Curing Station
Robot-- home to CoREX
Retrieve collar from Collar-Cooling Station
CoRex to Purex
Place collar on Pickup-- Stand
TABLE 4______________________________________Retrieve Collar From Collar Cooling StationCodes Remarks______________________________________WS00 (wafer status) part status (robot empty)MOC move to location CWM wait until movement completeGOC01 get item from slot 01 at location CWM wait until movement completeWS01 part status (robot loaded)MOB move to location BWM wait until completePOB01 put part at slot 01 of location BWS00 completed successfully______________________________________
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4901225 *||Apr 8, 1985||Feb 13, 1990||Kabushiki Kaisha Toshiba||Processing apparatus with hierarchical structure for implementing a machine instruction|
|US5111388 *||Nov 13, 1989||May 5, 1992||Kabushiki Kaisha Toshiba||Processing apparatus with functional hierarchical structure using corresponding hierarchical machine instruction fields|
|US5146404 *||Sep 19, 1986||Sep 8, 1992||Westinghouse Electric Corporation||Electronic maintenance support work station|
|US5159689 *||Nov 13, 1989||Oct 27, 1992||Kabushiki Kaisha Toshiba||Processing apparatus with functional hierarchical structure including selective operation of lower level units by higher level units|
|US5197011 *||May 15, 1990||Mar 23, 1993||U.S. Philips Corporation||Work station controller module|
|US5210686 *||Oct 19, 1990||May 11, 1993||International Business Machines Corporation||Multilevel bill of material processing|
|US5216612 *||Jul 16, 1990||Jun 1, 1993||R. J. Reynolds Tobacco Company||Intelligent computer integrated maintenance system and method|
|US5280614 *||Aug 21, 1990||Jan 18, 1994||International Business Machines Corporation||Apparatus and method for controlling access to data using domains|
|US5442746 *||Aug 28, 1992||Aug 15, 1995||Hughes Aircraft Company||Procedural user interface|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US5960421 *||Aug 20, 1997||Sep 28, 1999||Bea Systems, Inc.||Service interface repository internationalization|
|US6415193||Jul 8, 1999||Jul 2, 2002||Fabcentric, Inc.||Recipe editor for editing and creating process recipes with parameter-level semiconductor-manufacturing equipment|
|US6424878 *||Apr 28, 1998||Jul 23, 2002||International Business Machines Corporation||Method and apparatus for implementing custom business logic|
|US6662066 *||Apr 23, 2002||Dec 9, 2003||Taiwan Semiconductor Manufacturing Company||Dynamic adjustment and auto generation of water per hour (WPH) in capacity check system (CCS) by tool performance tracking platform (TP2)|
|US6944824||Jan 18, 2002||Sep 13, 2005||G.D Societa′ per Azioni||Method and unit for changing the configuration of an automatic machine|
|US7245980 *||Jun 25, 2001||Jul 17, 2007||Wright Williams & Kelly, Inc.||Method and apparatus for calculation of production quantities|
|US20020118228 *||Jan 18, 2002||Aug 29, 2002||G.D Societa' Per Azioni||Method and unit for changing the configuration of an automatic machine|
|US20070294662 *||May 12, 2005||Dec 20, 2007||Korea Institute Of Industrial Technology||Integrated Service Method of Distribution Software for Robot Development Based on Open Internet Network|
|EP1225491A1 *||Jan 22, 2002||Jul 24, 2002||G.D Societa' Per Azioni||Method and unit for changing the configuration of an automatic machine|
|EP1273985A2 *||Jun 27, 2002||Jan 8, 2003||Siemens Aktiengesellschaft||Method and apparatus for executing the program functions of an automation system|
|U.S. Classification||700/169, 700/103, 700/117|
|Cooperative Classification||Y02P90/26, G05B19/41835, Y02P90/12|
|Oct 20, 1995||AS||Assignment|
Owner name: IBM CORPORATION, NEW YORK
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DUNN, JOHN P.;LEWIS, DAVID A.;REEL/FRAME:007717/0197
Effective date: 19951020
|Dec 14, 2001||FPAY||Fee payment|
Year of fee payment: 4
|Feb 22, 2006||REMI||Maintenance fee reminder mailed|
|Aug 4, 2006||LAPS||Lapse for failure to pay maintenance fees|
|Oct 3, 2006||FP||Expired due to failure to pay maintenance fee|
Effective date: 20060804