Information processing method, information processing apparatus, manufacturing system, and article manufacturing method
By acquiring the equipment operation content and defining the subordinate relationships, the information processing device automatically generates a time map, which solves the problem of heavy user burden in the existing technology and achieves the effect of efficient automatic adjustment of the time map.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-03-16
- Publication Date
- 2026-03-27
AI Technical Summary
Existing technologies place a heavy burden on users when preparing and editing time maps, especially when considering the subordinate relationships of equipment operations and changes in operating procedures, making it difficult to efficiently and automatically adjust time maps.
By acquiring the content of equipment operations and defining time dependencies, a time map can be automatically generated using an information processing device, reducing manual editing steps and improving the degree of automation.
It enables automatic adjustment of the time map when considering changes in equipment operation subordination and operating procedures, reducing user burden and improving work efficiency.
Smart Images

Figure CN113496340B_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to an information processing apparatus. BACKGROUND
[0002] Hitherto, a sequence program is utilized to control devices disposed in a production line or the like. As such a sequence program, for example, a ladder program is known, and such a sequence program is executed by a controller called a PLC and a sequencer. When developing or tuning such a sequence program, a time chart is prepared to verify the operation timing and cycle time of the operation of the scheduled devices.
[0003] Such a time chart adopts a pattern indicating each operation of a device by aligning graphically on a time base, and in the case where there is context or dependency between respective operations in terms of operation start timing, the pattern used to indicate each operation is indicated by connection with a line or an arrow. Note that the following dependency in which the operation timing of one device between a plurality of devices is determined depending on the operation timing of another device will be referred to as a dependency.
[0004] In the case where such a dependency exists between a plurality of operations, the time chart is prepared while adjusting the position of the pattern by taking into account the operation of a plurality of devices. Therefore, its work becomes cumbersome. Then, a method of easily preparing and editing such a time chart is proposed. For example, Japanese Patent Application Publication No. 2004-227051 deploys patterns indicating operations on a time base, and then when a user connects the patterns to each other by an arrow, deploys the patterns at the end point side so that the operation start timing of the pattern at the end point side coincides with the operation completion timing of the pattern at the start point side.
[0005] Sometimes, work such as implementing a sequence program is performed while referring to a time chart. In this case, it is desired to be able to easily prepare and edit such a time chart while taking into account and changing the operation specification of a device, to be able to promptly advance such work.
[0006] In preparing and editing a time chart, sometimes an application such as a time chart editor is used on a screen by a GUI. In the case where a time chart is manually edited by such an application, when a preceding operation in an operation having a dependency is edited, it is still necessary to manually edit the start timing or the like of a subsequent operation thereof.
[0007] Japanese Patent Application Publication No. 2004-227051 is arranged to automatically adjust the positions of graphics when arrows indicating the hierarchical relationship are connected to each other. However, Japanese Patent Application Publication No. 2004-227051 does not consider editing the positions of graphics having a hierarchical relationship and already deployed. Therefore, in the case of editing graphics other than graphics having a hierarchical relationship indicated by arrows, for example, in the case of moving or expanding / contracting a main graphic having subordinate graphics on a time base, it is necessary to manually perform adjustment work such as movement of the subordinate graphics.
[0008] As for a sequence diagram, it is desirable to be able to reduce the burden on the user by, for example, automatically performing part of the preparation and editing work of a time diagram in accordance with not only the hierarchical relationship of graphics but also changes in all operation specifications. SUMMARY
[0009] A first aspect of the present application is an information processing method including: in response to input from a user, acquiring content of operations of a device and definition information defining a time hierarchical relationship of the operations; and generating a time diagram of the operations based on the content and the definition information.
[0010] A second aspect of the present application is an information processing apparatus including: an acquisition section configured to acquire, in response to input from a user, content of operations of a device and definition information defining a time hierarchical relationship of the operations; and a generation section configured to generate a time diagram of the operations based on the content and the definition information.
[0011] A third aspect of the present application is an interface unit configured to set definition information used for generating a time diagram related to operations of a device, in which, in response to input from a user through the interface unit, a time hierarchical relationship of the operations and the content of the operations of the device are set as the definition information.
[0012] Other features of the present application will become apparent from the following description of exemplary embodiments with reference to the drawings. BRIEF DESCRIPTION OF DRAWINGS
[0013] Figure 1 is a block diagram illustrating a configuration of a time diagram generation apparatus according to the present exemplary embodiment.
[0014] Figure 2 A sequence diagram sample according to the present exemplary embodiment of the present disclosure is illustrated.
[0015] Figure 3 A time diagram sample according to the present exemplary embodiment of the present disclosure is illustrated.
[0016] Figure 4 is a flowchart illustrating an exemplary process of an operation information acquisition processor according to the present exemplary embodiment of the present disclosure.
[0017] Figure 5 is a flowchart illustrating an example of an operation start time acquisition processor according to the present exemplary embodiment of the present disclosure.
[0018] Figure 6 is a flowchart illustrating an example of an exemplary process of an operation step information alignment processor according to the present exemplary embodiment of the present disclosure.
[0019] Figure 7 is a flowchart illustrating an example of a time chart information generation processor according to the present exemplary embodiment of the present disclosure.
[0020] Figure 8 is a diagram of a time chart according to the present exemplary embodiment of the present disclosure.
[0021] Figure 9 is a diagram of a sequence chart according to the present exemplary embodiment of the present disclosure.
[0022] Figure 10 is a table indicating operation step information according to the present exemplary embodiment of the present disclosure.
[0023] Figure 11 is a table indicating dependency information according to the present exemplary embodiment of the present disclosure.
[0024] Figure 12 illustrates a table indicating a selection result of a related operation according to the present exemplary embodiment of the present disclosure.
[0025] Figure 13A is a table indicating a mode 1 of another related operation according to the present exemplary embodiment of the present disclosure.
[0026] Figure 13B is a table indicating a mode 2 of another other related operation according to the present exemplary embodiment of the present disclosure.
[0027] Figure 14 is a table indicating operation step information in which an operation start time is added according to the present exemplary embodiment of the present disclosure.
[0028] Figure 15 is a table indicating operation step information in which transition source information is stored according to the present exemplary embodiment of the present disclosure.
[0029] Figure 16 is a diagram of a time chart after editing according to the present exemplary embodiment of the present disclosure.
[0030] Figure 17 is a diagram illustrating one example of a workflow in a processing system of a sequence program (ladder program). DETAILED DESCRIPTION
[0031] A mode for implementing the present disclosure will be described with reference to the drawings. Note that the following described configuration is always one example, and the detailed configuration can be appropriately modified by those skilled in the art without departing from the scope of the gist of the present disclosure. Further, the numerical values employed in the present exemplary embodiment are merely examples of reference numerical values.
[0032] In the present exemplary embodiment, the configuration and operation of an information processing apparatus or a specific time chart generation apparatus 100 configured to generate and output a time chart describing the operation of a device will be exemplified. Note that it is assumed that the operation of the device described by the time chart is controlled by a sequence program (e.g., a ladder program). This time chart is used to develop and verify a sequence program (e.g., a ladder program) in a development processing system shown in, for example, Figure 17
[0033] According to the information processing method of the present exemplary embodiment, a time chart that has been manually input or edited by a dedicated editor in the past is automatically generated and output based on definition information in which a time context and a dependency of the operation of the device are prepared and defined by a user. In this case, a time chart indicating the operation of a plurality of devices that are associated with each other is generated based on the time context and the dependency defined in the definition information, and a graphical representation of this time chart is output or displayed, for example.
[0034] The user can prepare and edit the definition information of the present exemplary embodiment in the format of a sequence chart shown in, for example, Figure 2
[0035] Figure 1 is a block diagram exemplifying the configuration of the time chart generation apparatus 100 according to the present exemplary embodiment. The time chart generation apparatus 100 includes a CPU 110, a data storage section 120, a program storage section 130, a display processor 140, a display section 141, and an input processor 150.
[0036] The CPU 110 is a computer that performs various processes including arithmetic processing, data preparation processing, and writing / reading of processes to / from a memory according to a given instruction.
[0037] The data storage section 120 is provided with a storage area for storing sequence diagram information 160, operation information 170, and time chart information 180.
[0038] The programs for causing the CPU 110 to execute the respective processes are stored in the operation information acquisition processor 131, the operation start time acquisition processor 132, the operation step information alignment processor 133, and the time chart information generation processor 134 (i.e., the generation section or generation step) of the program storage section 130. A storage medium such as an EEPROM and a hard disk is used as a storage unit constituting the program storage section 130. A drive of a computer-readable storage medium such as a removable optical disk and various memory devices can also be used for the program storage section 130. By using such a computer-readable storage medium, a control program describing the control process of the present exemplary embodiment to be described later can be installed and updated in the time chart generation apparatus 100. In this case, the computer-readable storage medium constitutes the storage medium of the present disclosure.
[0039] The display processor 140 executes a process for displaying information on a display section 141 (such as an LCD display) constituting a user interface. The input processor 150 executes a process for receiving information from an input unit (such as a keyboard and a mouse) constituting a user interface. The user interface constituted by the CPU 110, the display section 141, the display processor 140, the input processor 150, and the like constitutes a preparation unit that executes a preparation step for preparing a sequence diagram to be described later. Next, the sequence diagram information 160, the operation information 170, and the time chart information 180 stored in the data storage section 120 will be described in detail.
[0040] Figure 2 A sample 200 of a sequence diagram exemplifying the sequence diagram information 160 is shown for reference.
[0041] Figure 2 The sample 200 of a sequence diagram in FIG. 2 is constituted by an operation name setting section 210 and a sequence setting section 220. The sequence setting section 220 includes information on an operation name 211. The operation name 211 includes header information of an operation of a corresponding device constituting a unit. The sequence setting section 220 includes information on an operation step figure 230 and a connector figure 240. The operation step figure 230 indicates an operation of a unit to be controlled, and includes information on a transition destination name 231 and an operation time 232. The transition destination name 231 includes information indicating a state of each device constituting the unit after the device has been operated. The operation time 232 includes information on a time required from the start to the end of an operation of each device constituting the unit. The connector figure 240 includes information on a dependency relationship between respective operations.
[0042] Returning to Figure 1Operation information 170 includes operation step information 171 and subordinate relationship information 172. Operation step information 171 includes operation name information, information about the names of the mobile source and mobile destination related to the change of operation status, and operation time information.
[0043] Subordination information 172 includes operation step information on the starting point side and operation step information on the ending point side.
[0044] For example, with Figure 2 The dependency information corresponding to connector graphic 240 includes operation step information indicating that operation name A has a change destination of a2 and operation step information indicating that operation name B has a change destination of b2. The timing diagram information 180 will now be described in detail below.
[0045] Figure 3 Example 300 shows a timeline of timeline information 180. Figure 3 The time graph sample 300 consists of a setting section 310, a time indication section 320, and a graphic drawing section 330. The setting section 310 includes information about operation names 311 and operation states 312. The operation name 311 includes the name information of the operation of the corresponding device constituting the unit. The operation state 312 includes information indicating the state of the corresponding device constituting the unit before and after operation. The time indication section 320 includes time information 321. The graphic drawing section 330 includes information about a diagonal line 331 indicating that the device is in operation, a horizontal line 332 indicating that the device is in standby mode, and arc arrows 333 indicating the hierarchical relationship between different operations.
[0046] Figure 17 This is a schematic diagram illustrating the workflow of the development and design work of a sequence program (i.e., a ladder program) as an example of an environment using a time diagram as described above. A mechanical designer performing various design tasks related to the hardware of the production unit prepares a time diagram 1901 through a time diagram preparation process 1911. In this exemplary embodiment, techniques for generating and displaying the time diagram 1901 by utilizing a sequence diagram will be described.
[0047] Timeline 1901 describes the operational sequence and dependencies of the corresponding production equipment in the production steps. After receiving the completed timeline 1901, the software designer begins the design work. Here, the software designer performs design document preparation work 1912 to prepare design document 1902, which consists of stepper construction table, IO table, SW allocation table, exception table, controller control module management table, etc.
[0048] Further, a software designer prepares or automatically generates a flowchart 1903 based on a design document 1902 constituted by a stepper configuration table, an IO table, an SW allocation table, an exception table, a controller control module management table, and the like, and based on the time chart 1901. Note that, in a case where the flowchart 1903 is automatically generated from the time chart 1901, there is a case where such processing of automatically describing design information from the design document 1902 into the flowchart 1903 is performed in a manner of adding differences.
[0049] Then, the software designer confirms the prepared flowchart 1903, and corrects the flowchart 1903 in correspondence with a branch condition, a standby condition, a processing content after branching of a branched condition, and the like.
[0050] Next, the software designer describes and edits a ladder program 1904 (i.e., a sequence chart) by referring to the design document 1902 through a dedicated editor or the like. Alternatively, there is also a case where the ladder program 1904 is automatically generated in response to the flowchart 1903 and the design document 1902. Note that, there is also a case where the flowchart 1903 and the design document 1902 on which the ladder program 1904 (i.e., the sequence chart) is based are slightly corrected in response to debugging, preparation, and editing of the ladder program 1904, as indicated by the leftward arrow in Figure 17 Finally, the software designer performs a confirmation work 1917 of the ladder program 1904 and ends the design flow.
[0051] For example, the ladder program 1904 (i.e., the sequence chart) thus prepared is transmitted to an integrated control unit (such as a sequencer (PLC)) of a group of devices deployed in a production line. This integrated control unit controls a plurality of production devices deployed in a production line (e.g., a manufacturing system of articles), and can manufacture an industrial product or a part thereof by conveying, processing, or assembling workpieces by those production devices. In this case, it is also possible to make an arrangement such that a sequence program (i.e., a ladder program) is automatically generated from the time chart and the flowchart generated by the processing of the present exemplary embodiment, and such that the integrated control unit controls the production devices by the sequence program (i.e., the ladder program).
[0052] Each of the parts included in the program storage section 130 in Figure 1 will be described in detail below. Figure 4 is a flowchart exemplifying an exemplary process of the operation information acquisition processor 131.
[0053] First, in step S410, the CPU 110 assigns the corresponding operation ID included in the sequence chart information 160 stored in the data storage section 120.
[0054] In step S420, the CPU 110 acquires operation step information 171 by extracting the operation name, the transition destination name, and the operation time from the sequence chart information 160 in units of IDs.
[0055] In step S430, the CPU 110 acquires the dependency relationship information 172 by extracting the dependency relationship between operations from the sequence chart information 160.
[0056] In step S440, the CPU 110 stores the operation step information 171 and the dependency relationship information 172 thus acquired into the data storage section 120.
[0057] Figure 5 is a flowchart illustrating exemplary processing of the operation start time acquisition processor 132. In step S510, the CPU 110 acquires the dependency relationship information 172 included in the sequence chart information 160 stored in the data storage section 120. Then, the CPU 110 selects, for the relevant operation, the IDs of the dependent relevant operations directly or cascade-linked among the operations executed in advance.
[0058] In step S520, the CPU 110 acquires the total operation time of the operations included in the selected relevant operations (i.e., in steps S521 to S524). In the case where there are multiple relevant operation paths (i.e., YES in step S521), the CPU 110 acquires, in step S523, the relevant operation path in which the total value of the operation times of the operations included in the relevant operation paths is the largest. In the case where there are no multiple relevant operation paths (i.e., NO in step S521), the CPU 110 acquires, in step S524, the total value of the operation times.
[0059] In step S530, the CPU 110 stores the value obtained in step S520 into the operation start time of each operation step information 171.
[0060] Figure 6 is a flowchart illustrating exemplary processing of the operation step information alignment processor 133. In step S610, the CPU 110 rearranges the operation step information 171 for each operation name, and further rearranges under the same operation name in the order of smaller operation start times.
[0061] In step S620, the CPU 110 acquires, for each operation step information 171, the transition source name of the immediately preceding operation step information 171 having the same operation name, and adds it as the transition source name. Note that, as the transition source name of the foremost operation step information 171 with respect to the corresponding operation name, for example, the CPU 110 adds the transition destination name held by the last operation step information 171 of the corresponding operation name.
[0062] Figure 7 is a flowchart exemplifying a control procedure of the time chart information processor 134. In Figure 7 In step S710, the CPU 110 acquires the corresponding operation step information 171 stored in the data storage portion 120.
[0063] In step S720, the CPU 110 acquires the corresponding dependency information 172 stored in the data storage portion 120.
[0064] In step S730, the CPU 110 generates the time chart information 180 based on the corresponding operation step information 171 and the corresponding dependency information 172 thus acquired, and generates and displays display information so that the user can easily observe.
[0065] A procedure of generating and editing a time chart by exemplifying a machining robot as an object to be controlled.
[0066] Figure 8 is a diagram exemplifying a time chart of an object to be processed according to the present exemplary embodiment. For example, the time chart 800 is prepared by the CPU 110 based on the time chart information 180 stored in the data storage portion 120. In Figure 8 In Figure 3 are indicated by using the same reference numerals as the corresponding elements indicated in Figure 3 are described in
[0067] Figure 8 The time chart 800 in In the operation name 311 in
[0068] are indicated four types of operations, i.e., a conveyance operation 810, a positioning operation 820, a first machining operation 830, and a second machining operation. Figure 8
[0069] Figure 8The operation states 312 in the chart drawing section 330 indicate the operation states (i.e., operation steps) that the processing robot can take before and after each operation. That is, the return position and the feed position are indicated for the conveyance operation 810, the release position and the adjustment position are indicated for the positioning operation 820, standby, assembly a and assembly b are indicated for the first processing operation 830, and standby and assembly c are indicated for the second processing operation 840.
[0070] Figure 8 The chart drawing section 330 in the chart drawing section 330 indicates the situation in which the state transitions with the passage of time in each operation by a line graph, and indicates a portion of the inclined line during a period in which the state transition is indicated by an ID with a circled number. Note that, due to a limitation of the character code, in the text below, Figure 8 The circled number in the chart drawing section 330 is represented by a number with parentheses.
[0071] For example, for the conveyance operation 810, in a case in which the conveyance mechanism of the processing robot can take two states of the return position and the feed position, the processing robot moves from the return position to the feed position during 0.2 seconds from 0 seconds of the time base. For example, a line graph drawn to the right and upward during the period of the circled number (1) indicates movement to the feed position, and the operation time required from the start to the end of this time is 0.2 seconds. This circled number (1) indicates the ID assigned to the operation step information that is the basis of the movement operation from the return position to the feed position. Further, the line graph of the conveyance operation from 0.2 seconds to 1.7 seconds is horizontal, indicating that the conveyance mechanism stops at the feed position. Then, during a period from 1.7 seconds to 1.9 seconds, an operation assigned the ID of the circled number (2) is performed, i.e., movement from the feed position to the return position. That is, movement from the feed position to the return position is performed. The line graph drawn to the right and downward during this period indicates that it is movement to the return position. The line graph is horizontal at and after 1.9 seconds, indicating that the conveyance mechanism stops at the return position.
[0072] Further, a circular arc arrow extends from the end time point of the operation of the circled number (1) to the positioning operation, and an operation of the circled number (3) that starts the transition from the release state to the adjustment state in the positioning operation. This indicates the dependent relationship in which the operation of the circled number (2) starts after the completion of the operation of the circled number (1).
[0073] Further, the circled number extends from the end time point of the operation of the circled number (7) of the first processing operation and the end time point of the operation of the circled number (9) of the second processing operation, and the operation of the circled number (3) starts. This indicates that the operation of the circled number (4) starts after the completion of the operations of the circled numbers (7) and (9), i.e., depending on the completion of the operations of the circled numbers (7) and (9).
[0074] Thus, the time chart 800 of the present exemplary embodiment indicates a series of operation sequences, i.e., the workpiece is transported by the processing robot, positioned on the table, released from the positioning after performing two types of processing, and transported to the return position.
[0075] Next, the sequence chart 900 in FIG. 9 will be described. Figure 9 The sequence chart 900 in FIG. 9 indicates the sequence chart information 160 stored in the data storage section 120, and is prepared by the user. The sequence chart 900 includes, in its upper portion, an operation name setting column indicating the types of operations of the processing robot, and in its lower portion, a sequence setting column indicating quadrangles indicating each operation step in each operation and arrows indicating the dependency between the respective operations. Note that, hereinafter, the quadrangles in these drawings will be referred to as "operation step graphics". Figure 8 The user can input and / or edit the sequence chart 900 having such a graphic display through a graphic user interface (GUI) composed of the input processor 150, the display processor 140, the display section 141, and the like.
[0076] Figure 9 In the operation name column in FIG. 8, four types of operations corresponding to the operations 810 to 840 in FIG. 8, i.e., the transport operation 910, the positioning operation 920, the first processing operation 930, and the second processing operation 940 are indicated in the operation name column in FIG. 9.
[0077] In the sequence setting column in FIG. 9, the operations indicated by the quadrangles are indicated, in which the quadrangles include, on their left side, the names of the states after the respective operations, and the values indicating the operation times of each operation name, i.e., 910, 920, 930, and 940.
[0078] In the sequence setting column in FIG. 9, the operations indicated by the quadrangles are indicated, in which the quadrangles include, on their left side, the names of the states after the respective operations, and the values indicating the operation times of each operation name, i.e., 910, 920, 930, and 940. Figure 8 Figure 8 For example, for the transport operation 910, the operation of moving to the feed position in 0.2 seconds and the operation of moving to the return position in 0.2 seconds are indicated. Note that, the circled number (1) indicates the ID assigned to the moving operation to the feed position. Figure 9 Further, the arrow extends from the operation step graphic of the circled number (1) of the transport operation to the positioning operation, and is connected to the operation of the circled number (3) of the transition to the adjustment state. This indicates that the operation of the circled number (3) starts after the completion of the operation of the circled number (1).
[0079] Figure 9 Further, the arrow extends from the operation step graphic of the circled number (1) of the transport operation to the positioning operation, and is connected to the operation of the circled number (3) of the transition to the adjustment state. This indicates that the operation of the circled number (3) starts after the completion of the operation of the circled number (1).
[0080] Further, the arrow extends from the operation step graphic of the circled number (1) of the transport operation to the positioning operation, and is connected to the operation of the circled number (3) of the transition to the adjustment state. This indicates that the operation of the circled number (3) starts after the completion of the operation of the circled number (1).
[0081] Further, the arrow extends from the operation step graphic of the circled number (1) of the transport operation to the positioning operation, and is connected to the operation of the circled number (3) of the transition to the adjustment state. This indicates that the operation of the circled number (3) starts after the completion of the operation of the circled number (1).
[0082] Further, arrows extend from the operation step figure of the circled number (7) of the first processing operation and the operation step figure of the circled number (9) of the second processing operation, and are connected to the operation step figure of the circled number (4). This indicates that the operation of the circled number (4) starts after both the operation of the circled number (7) and the operation of the circled number (9) are completed.
[0083] As described above, the sequence diagram 900 of the present exemplary embodiment indicates the same series of operation sequences as the time diagram 800.
[0084] Next, an example of a time diagram generation operation will be described with reference to Figure 8 and Figure 9
[0085] When an instruction to start generation of a time diagram is input to the input section, the CPU 110 first performs processing to acquire and store various information according to the flowchart in Figure 4
[0086] First, in step S410, when the user indicates that a sequence diagram is to be generated through a user interface, the CPU 110 acquires a sequence diagram that has been prepared by the user in a sequence diagram preparation step. Then, the CPU 110 assigns an ID indicated by the above-described circled number to the respective operation step figures described in the sequence diagram 900 thus obtained.
[0087] In step S420, the CPU 110 acquires operation step information 171 from the sequence diagram 900. The operation step information 171 includes definition information describing aspects of operations, such as operation names and operation times in units of IDs. Figure 10 One example of the operation step information 171 at the time point of step S420 is specifically exemplified. In the example of Figure 10 , the operation step information includes an operation name 1002 of each respective operation indicated by an ID 1001, a transition destination 1003 of a transition of an operation state, and an operation time 1004. Note that, for example, in Figure 10 and Figure 10 after that, the numbers indicated in the ID column correspond to the IDs indicated by the circled numbers in Figure 8
[0088] In step S430, the CPU 110 acquires dependency information 172 including definition information of dependencies between respective operations from the sequence diagram 900. Figure 11 One example of the dependency information 172 is specifically exemplified. The dependency information 172 includes IDs 1101 and 1102 of two operation step information 171 that are mutually dependent.
[0089] In step S440, the CPU 110 stores the operation step information 171 and the dependency information 172 into the operation information 170 of the data storage section 120.
[0090] Next, the CPU 110 acquires the operation start times of the corresponding operations by the processing of the flowchart in Figure 5 and adds them to the operation step information.
[0091] In step S510, the CPU 110 extracts the relevant operations of the corresponding operation included in the dependency information 172 of the operation information 170 included in the data storage section 120 by the dependency operation. Here, the relevant operations refer to operations directly or cascadingly linked among operations executed before the target operation. Here, Figure 12 The case where the relevant preceding operation ID 1203 and the relevant succeeding operation ID 1204 shown on the right side table are extracted and selected by retrieving the relevant operations from the rows of the preceding operation ID 1201 and the succeeding operation ID 1202 on the left side table is exemplified. Here, as Figure 12 The case where a series of relevant operations related to the operation of ID 9 are extracted and selected as shown in the right side table in
[0092] Figure 13A and Figure 13B The case where other relevant operations are selected is exemplified. Figure 13A and 13B The case in Figure 12 is the same as the case in Figure 13A The rows of the original preceding operation ID 1301 and the succeeding operation ID 1302 are exemplified in the left side table, and the rows of the preceding operation ID 1303 and the succeeding operation ID 1304 after selection are exemplified in the right side table. Figure 13B The rows of the original preceding operation ID 1305 and the succeeding operation ID 1306 are also exemplified in the left side table, and the rows of the preceding operation ID 1307 and the succeeding operation ID 1308 after selection are exemplified in the right side table.
[0093] Figure 13A and Figure 13B The case where the relevant operations are selected as a result is specifically exemplified. In this example, there are two rows of paths of the preceding operation to which ID 4 is dependent. That is, the first path of the preceding operation to which ID 4 is dependent is pattern 1 of ID 7, ID 6, ID 5, ID 3, and ID 1 indicated in Figure 13A The second path of the preceding operation to which ID 4 is dependent is pattern 2 of ID 9, ID 8, ID 3, and ID 1 indicated in Figure 13B
[0094] In step S520, CPU 110 obtains the total operation time of the operations included in the selected related operation in steps S522, S523, or S534. If there are multiple related operations (i.e., "yes" in step S521), CPU 110 obtains the operations included in the related operation with the largest total operation time in step S523.
[0095] In step S530, CPU 110 stores the value obtained in step S520 into the operation start time of the corresponding operation step information 171. Figure 14 This is an example table that specifically indicates operation step information 171, where operation step information 171 is added according to each operation indicated by ID 1401, including operation name 1402, transition destination 1403, operation time 1404, and operation start time 1404. By using the start and end times obtained in this way, the graphical shape of the time graph can be determined.
[0096] Next, in step S610, the CPU 110 rearranges the operation step information 171 according to the operation name, aligns it, and obtains information a in step S620. Figure 6 In step S610, the CPU 110 rearranges the corresponding operation step information 171 according to the operation name, and further rearranges them according to the smaller operation start time under the same operation name.
[0097] exist Figure 6 In step S620, the CPU 110 obtains the transformation source name of the preceding operation step information 171 for each operation step information 171 and stores it in the transformation source name. Furthermore, regarding the transformation source name of the preceding operation step information 171 for the corresponding operation name, the CPU 110 obtains and adds the transformation destination name of the last operation step information 171 for the corresponding operation name. Figure 15 The operation step information includes the operation name 1502, the source of the operation state transition 1503, the destination of the operation state transition 1504, the start time 1505, and the operation time 1506 for each operation indicated by ID1001.
[0098] Next, CPU 110 passes through Figure 7 The processing within is used to indicate the timeline. First, in Figure 7 In step S710, CPU 110 obtains operation step information 171 and subordinate relationship information 172 from data storage section 120.
[0099] Next, in Figure 7In step S720, the CPU 110 prepares and instructs generation information of the time chart 800 based on the operation step information 171 and the dependency information 172. Here, the CPU 110 generates information for instructing line graphs in the operation name column, the operation state column, and the graph column in the time chart 800 based on the operation name and the transition destination name in the operation step information 171. Further, the CPU 110 generates information for instructing the circular arc arrow based on the dependency information 172.
[0100] According to the present exemplary embodiment, by preparing a sequence chart as shown in Figure 9 by the above processing, for example, a time chart in Figure 8 can be easily generated based on the sequence chart.
[0101] Because the sequence chart defines the transition of the operation state and the dependency, if a change in the operation specification of the device to be controlled is to be made, a time chart corresponding to the operation after the change can be easily and automatically generated by, for example, editing the sequence chart. For example, the processing of correcting the time chart along with the change in the operation specification of the unit to be controlled can be performed as follows.
[0102] For example, Figure 8 the operation time of the operation of ID 6 in the time chart 800 is changed from 0.7 seconds to 0.4 seconds. In the case of directly correcting the time chart, the right end of the diagonal line indicating the operation of ID 6 is contracted to the position of 1.0 second. Then, as a result, it becomes necessary to also correct the subsequent dependent operations.
[0103] Figure 16 is a chart illustrating the time chart 1000 after the correction in the case of correcting the operation of ID 6. Figure 16 The graph format of the time chart 1000 is the same as the graph format of the above-described Figure 3 and Figure 8 , and the same reference numerals are used for the same or corresponding parts. In the corrected time chart 1000 in Figure 16 , the corrected operations are indicated by dotted lines. In this case, the operation time of ID 6 is changed, and the start time of ID 7 is advanced by 0.3 seconds. Then, because the operation start time of ID 4 depends on the relevant operations including the operation of ID 9, the operation start time of ID 4 and the operation of ID 2 dependent thereon are also changed. Therefore, when the operation time is partially changed, it becomes necessary to correct a plurality of operation start times according to the correction, and if such operations are to be performed manually, the work becomes extremely troublesome.
[0104] However, according to the present exemplary embodiment, by correcting the sequence chart 900, a time chart as shown in Figure 16the corrected time chart 1000 shown in FIG. 10. For example, the operation time of ID 6 of the sequence chart 900 is changed from 0.7 seconds to 0.4 seconds. Next, the user instructs generation of a time chart and display of the corrected time chart 1000 by performing the process shown in FIG. 10. At this time, the user's work is completed only by changing the operation time of ID 6 of the sequence chart 900, and a time chart corresponding to the state of the sequence chart 900 is automatically generated and output as shown in FIG. 10. Figures 4 to 7 the corrected time chart 1000 shown in FIG. 10. For example, the operation time of ID 6 of the sequence chart 900 is changed from 0.7 seconds to 0.4 seconds. Next, the user instructs generation of a time chart and display of the corrected time chart 1000 by performing the process shown in FIG. 10. At this time, the user's work is completed only by changing the operation time of ID 6 of the sequence chart 900, and a time chart corresponding to the state of the sequence chart 900 is automatically generated and output as shown in FIG. 10. Figure 16 the corrected time chart 1000 shown in FIG. 10. For example, the operation time of ID 6 of the sequence chart 900 is changed from 0.7 seconds to 0.4 seconds. Next, the user instructs generation of a time chart and display of the corrected time chart 1000 by performing the process shown in FIG. 10. At this time, the user's work is completed only by changing the operation time of ID 6 of the sequence chart 900, and a time chart corresponding to the state of the sequence chart 900 is automatically generated and output as shown in FIG. 10.
[0105] That is, according to the present exemplary embodiment, the CPU re-executes the corresponding process, acquires information of all operations, and can automatically regenerate a time chart corresponding to the state of the sequence chart only by changing the operation specification via the sequence chart. Because the user's work is completed only by correcting the part to be changed, it is not necessary to directly and manually edit the time chart, and the work efficiency for preparing and editing the time chart can be significantly improved.
[0106] The present exemplary embodiment of the present disclosure is not limited to the above-described example, and can be appropriately modified, omitted, or assembled. For example, the information such as the sequence chart and the time chart instructed in the display section is not limited to the above-described format. The display result can be not only displayed but also printed to be provided to the user. Further, the unit to be controlled is not limited to the machining robot, and the generation method of the present disclosure is widely applicable as long as the unit is controlled by using the sequence program. The present disclosure can be preferably used for control of various devices provided with solenoid valves and air cylinders and for operation analysis of assembled robots. Further, the present disclosure is applicable to a machine that can automatically perform a stretching motion, a bending motion, and a stretching motion, a vertical motion, a horizontal motion, or a rotational motion, or a complex motion thereof, based on information of a storage device provided in a control unit.
[0107] Other Embodiments
[0108] The embodiment(s) of the present application can also be embodied by a computer of a system or an apparatus that reads out and executes computer executable instructions (e.g., one or more programs) recorded on a storage medium (which can also be referred to more fully as a 'non-transitory computer-readable storage medium') to perform the functions of one or more of the above-described embodiment(s) and / or that includes one or more circuits (e.g., application specific integrated circuits (ASICs)) for performing the functions of one or more of the above-described embodiment(s), and by a method performed by the computer of the system or apparatus by, for example, reading out and executing the computer executable instructions from the storage medium to perform the functions of one or more of the above-described embodiment(s) and / or controlling the one or more circuits to perform the functions of one or more of the above-described embodiment(s). The computer can comprise one or more processors (e.g., central processing units (CPUs), micro processing units (MPUs)) and can include a network of the separate computers or separate processors to read out and execute the computer executable instructions. The computer executable instructions can be provided to the computer, for example, from a network or the storage medium. The storage medium can include, for example, one or both of a hard disk, a random access memory (RAM), a read only memory (ROM), a storage of distributed computing systems, an optical disk (such as a compact disc (CD), digital versatile disc (DVD), or Blu-ray Disc (BD)®), a flash memory device, a memory card, and the like. TM
[0109] The embodiment of the present application can also be implemented by a method of providing software (a program) that performs the functions of the above-described embodiment to a system or an apparatus, a computer of the system or the apparatus, or a central processing unit (CPU), a micro processing unit (MPU) that reads out and executes the program through a network or the various storage media.
[0110] While the present application has been described with reference to exemplary embodiments, it is to be understood that the application is not limited to the disclosed exemplary embodiments. The scope of the following claims is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structures and functions.
Claims
1. An information processing method, comprising: inputting and / or editing a sequence chart through a graphical user interface (GUI), wherein the sequence chart includes operation names of a plurality of operations performed by a device, operation step graphics, and connector graphics, wherein the operation step graphics include operation step information indicating individual operation steps in individual operations and are aligned by operation, and the connector graphics indicate temporal dependencies between respective operations by connecting the operation step graphics, and updating a time chart for causing the device to perform the operations in response to an update of the sequence chart. 2.The information processing method according to claim 1, further comprising graphically indicating the time chart. 3.The information processing method according to claim 2, wherein the connector graphics include arrows indicating temporal dependencies by connecting the operation step graphics. 4.The information processing method according to any one of claims 1 to 3, wherein the operation step information respectively includes information on the operation step and on a time necessary for performing the operation step. 5.The information processing method according to claim 4, wherein each of the operation steps includes at least one of feeding, returning, adjustment of a position, release of a position, assembling, and standby. 6.The information processing method according to claim 1, wherein each of the operations includes at least one of conveying, positioning, and processing. 7.The information processing method according to claim 1, wherein the sequence chart includes a set of areas corresponding to the operations, and wherein the operation steps corresponding to the operations are indicated by being separated by area. 8.The information processing method according to claim 1, wherein the operation names of the operations are indicated in an upper portion of the sequence chart. 9.The information processing method according to claim 3, wherein the time chart is graphically indicated through a user interface. 10.A non-transitory storage medium readable by a computer, configured to store a control program configured to cause the computer to execute the information processing method according to claim 1. 11.An information processing apparatus, comprising: an acquisition section configured to input and / or edit a sequence chart through a graphical user interface (GUI), wherein the sequence chart includes operation names of a plurality of operations performed by a device, operation step graphics, and connector graphics, wherein the operation step graphics include operation step information indicating individual operation steps in individual operations and are aligned by operation, and the connector graphics indicate temporal dependencies between respective operations by connecting the operation step graphics; and a generation section configured to generate a time chart of the operations based on the sequence chart. 12.The information processing apparatus according to claim 11, further comprising a display section configured to graphically indicate the time chart. 13.The information processing apparatus according to claim 11 or 12, wherein the connector graphics include arrows indicating temporal dependencies by connecting the operation step graphics. 14.The information processing apparatus according to claim 13, wherein the operation step information respectively includes information on an operation step and a time necessary for executing the operation step. 15.A manufacturing system comprising: the information processing apparatus according to claim 11; and an apparatus, wherein the apparatus is configured to execute contents of operations described in the time chart generated by the information processing apparatus to manufacture an article. 16.An article manufacturing method configured to manufacture an article by using the manufacturing system according to claim 15. the sequence chart includes operation names of the plurality of operations, operation step graphics, and connector graphics, wherein the operation step graphics include operation step information indicating respective operation steps in respective operations and are aligned by operation, and the connector graphics indicate a dependency relationship between respective operations by connecting the operation step graphics.
17. An interface unit configured to input and / or edit a sequence diagram to generate a time diagram relating to a plurality of operations performed by a device, wherein,
Citation Information
Patent Citations
Resource management device, resource management program, recording medium, and system designed using them
JP2004227051A
Time sequence diagram generation method and device, storage medium and computer equipment
CN115640226A
Device for generating time chart from state transition chart
JP1994203088A
Equipment operation analysis device
JP2017045141A
Program generating device, program generating method, and information storage medium
US20210182101A1