KR20200015642A - Project/Task Intelligent Goal Management Method and Platform based on Super Tree - Google Patents

Abstract

The present invention relates to technology for constructing an intelligent platform that greatly improves the accuracy, speed, persistence, consistency, and objectivity of goal management. In the present invention, based on expertise knowledge and methods (collectively ′knowledge′) necessary to set goals and achieve goal management of the project/task to be achieved, proposed is a technology for collecting data and processing data information (collectively, ′information′) necessary to carry out a goal management, and allowing a computer to use the information systematically for judgement and reasoning for goal management, support project management (PM), and manage and achieve goals autonomously/actively.

Description

Project / Task Intelligent Goal Management Method and Platform based on Super Tree}

The present invention supports the establishment of appropriate and precise execution plans and preparation of time schedules for various projects or tasks to set and achieve goals, and instructs them from the Project Manager (PM) or general manager. Receive or be assigned and fulfill the task, receive and process requests from other Project / Task participants, continuously monitor and report the progress and progress of the Project / Task, Early detection of events including various occurrences of exceptions, Absorb or stop the effects and spread as much as possible, minimize overall project / task execution costs, and target goals Assist in achieving and systematically collect and store all information, including data, methods and knowledge required to achieve the objectives, It relates to (Reasoning and Inference) Intelligent Project / Task Management aims to build technology platforms to help capitalize on.

In general, projects such as EPC Projects of large plants, buildings, ships and structures, construction and production management tasks of smart plants or factories, or energy management tasks of large plants, factories, ships and buildings. In order to perform / Task, first, set the overall goals clearly, establish the execution plan of detailed tasks to be performed to achieve the set goals, and continuously manage the goals until the goal is achieved based on the set time schedule. You have to do it. To do this, it is necessary to collect and analyze various and vast amounts of information, and cope with a lot of detailed tasks simultaneously while coping with events that may occur from time to time. However, in the process of relying on a traditional software system or tool that does not have manpower or reasoning ability, it is often difficult to achieve the goals set earlier due to overlooking important situations, missing monitoring or misjudgment.

In the case of the Plant EPC Project, the project management center (PMI) is mainly focused on the project management body of knowledge (PMBOK) by gathering the knowledge, practices and processes required for project management. The diverse and vast amount of knowledge and information required for each phase is classified into the Knowledge Management Area and subdivided into detailed Processes to collect and use them. It specifies the guideline of the method and recommends to carry out the project accordingly, and is used as the main standard of project management along with ISO 21500 (Guidance on Project Management), and the progress analysis and management of the project and random Techniques for handling various events and risks that may occur and spread, such as Critical Path Method, Event Chain Method, Critical Chain Method, EV Performance support systems and tools for large projects / tasks based on A (Earned Value Analysis) techniques have been developed and used mainly by representative companies such as Intergraph, Primavera, and Microsoft.

However, the various Project / Task management support systems or tools that have been developed and used so far suggest various menus and submenus that are configured arbitrarily, and know the paths and uses of the menus and submenus given by the project participants, The paradigm of the fundamental manual method that needs to be collected and utilized as a function is found. Therefore, due to the limitation of the amount and speed of information that humans can process and judge at the same time, and the persistence, consistency, and accuracy of tasks that can be performed, especially large projects that need to process several thousand or tens of activities simultaneously. In many cases, this is often beyond the initial budget range and the completion date, resulting in significant losses.

Production management tasks of general plants or factories are also developed and used in various production management support systems or tools such as ERP, MES, PLM, SCADA, FMS. It is necessary to know how to use them and to collect and judge information and manage them by using the menus and submenus presented on the dashboard and the one-sided menus. Therefore, it is necessary to set appropriate goals, manpower, time, materials, equipment, and funds. A number of tasks that must be performed at the same time, from procurement management of various resources such as management, operation and monitoring of production and support processes, emergency stop of predicted events and production lines, failure rate, quality and cost management, and new product development. Accurately plan, monitor and optimally coordinate detailed management actions to achieve production goals It is very difficult to go out.

In recent years, especially after the Alphago, artificial intelligence (AI) technology and the Fourth Industrial Revolution have become a hot topic, and the necessity of establishing a smart factory to reduce costs and intelligently automate overall production management has emerged. Attempts have been made to apply concepts such as digital manufacturing and virtual factory.However, the specific functions and contents of the Smart Factory have not yet been clearly established for each factory type. Since it is not well established, most factories are building smart factories that are uniquely designed to improve some of their existing automation.

In the case of energy reduction target management task, various factory energy management systems (FEMS) and building energy management systems (BEMS) are being established, but mainly provide dashboards and analysis tools to energy managers, present energy usage situation, It is designed to discover saving factors and save energy. However, energy management systems (EMS), which do not have energy saving specialists on most sites, and that have some automatic saving features, can also shut down unused equipment, control excessive circulation water, or reduce waste heat. By reducing the amount of common sense, such as retrieval, by selecting and saving some energy-using facilities that are likely to be saved, such as fishing, the savings are limited and skepticism about the effect of EMS construction is also beginning to emerge. Doing. According to the Paris Climate Agreement, by 2030, 37% of greenhouse gas emissions should be reduced compared to BAU, and despite the urgent need for energy saving, such as solving fine dust problem, the spread of EMS has not been properly achieved.

In the case of the power system, which is a large infrastructure, the amount of information required to manage the goal of providing stable and inexpensive power, the size, complexity and variety of tasks to be analyzed and managed, and the required accuracy Due to (Accuracy) and real-time speed, even though various analysis and supporting S / W tools are currently used, the overall optimal operation is very difficult in reality, and there is a possibility of huge cost reduction. For example, the establishment and construction of various power plants, transmission lines, substations and distribution lines, the mix of power generation sources, the unit commitment of various power plants, the active and reactive power of the power system. Optimal Load Flow Analysis and Monitoring, Economic Dispatch, Stability and Reliability Analysis and Monitoring, Distribution Line Voltage Control, Power Plant Maintenance Analysis and operation of overhaul, demand-side management, seal load management, power storage (ESS) and various renewable energy facilities are all related and must be carried out continuously. In addition, despite the fact that various support systems or tools are used for each field, overall optimal operation and cost minimization are very difficult.

In addition, in the case of PC or server management for the daily work of an individual or a company, the operating system that manages the computer system has been almost monopolizing the operating system market for a few decades. Almost no improvement in service functions continues like tradition, and the situation continues to force computer administrators or users to use very inconvenient use. Most of the functions and troubleshooting explanations are awkward or unkind, except for the File Directory, and most of the names and functions of many menus and submenus that are named and set by the developer subjectively (subjective) without any logic. It has to be learned and remembered to find its way, and it is slowed down from time to time, and in terms of security, it is vulnerable enough to be compared to a pot of silver and silver. It has been coping with viruses and hacking by tinkering every time it is drilled. This mighty situation persists.

In the era of the 4th Industrial Revolution, the development of artificial intelligence technology is expected, and it is time to fundamentally improve the manual goal management or operation of various inefficient or inconvenient projects or tasks. In the future, they can be inferred and judged by their managers or users, or assigned to various tasks, and can help them achieve their desired goals while minimizing overall costs including quality, safety, convenience, and environmental costs. The development of intelligent target management technologies and systems needs to be made.

As described in the background art, large plant construction projects, production management tasks in medium and large plants or factories, energy management tasks in factories or buildings, corporate business management, computer operation management tasks, and operation management of various social-based systems. Up to tasks, many detailed tasks that need to be executed or processed concurrently for goal management even if you use existing conventional Project / Task support system or tools (Work, Work Package according to the characteristics of Project / Task) Most of the quality of management and monitoring activities is difficult to achieve accurate goal management by deviating from the fundamental limitations of human ability in terms of required speed, persistence, consistency, memory and accuracy. There is this.

In the present invention, the basic management task of the Project / Task to set and achieve the goal is assigned as a task, and it supports itself and actively supports the general manager (Project Manager (PM)) and other managers. The goal is to develop the basic technology to implement the Project / Task intelligent goal management platform that can be minimized and achieved.

More specifically, it collects and stores the information to achieve the goal, and utilizes it to support the establishment of a detailed implementation plan and the creation of a schedule, and the progress and progress of all detailed tasks of the Project / Task to be performed to achieve the goal. Continuously monitor and report progress, track down the cause, establish countermeasures, and anticipate risks and events that can affect the achievement or progress of goals as early as possible. Platform task that actively utilizes PM to request or recommend actions that PM should make or action to take in case of opportunity. As a basic task, the platform performs its own tasks, and the Project Manager (Project Manager (PM)) is responsible for providing the desired information or performing management tasks. Project / Task that supports direct PMs and actively supports PMs to minimize the overall cost and achieve the goals set by allowing other managers to receive and process requests or recommendations. By devising the technology to implement the intelligent goal management platform (Platform), we will prepare the foundation technology to build the intelligent autonomous goal management system of all the projects / tasks to set and achieve the goal.

Project / Task intelligence objectives of the present invention to actively support Project Managers (PMs) and other managers who wish to set and achieve goals, to minimize overall costs and to achieve set goals In order to implement a management platform We need a method and knowledge to systematically collect and store vast amounts of information, use it to continuously infer the desired information, judge the situation, and take necessary measures.

In the present invention, based on the expertise and method (collectively, 'Knowledge') necessary to set the target and perform the target management of the Project / Task to achieve, the data and processing data necessary to carry out the target management Collecting information and relational information (collectively 'Information') between the information and the knowledge that enables the computer to systematically use this knowledge and information to make judgments and reasoning for goal management By creating information collection, storage, and utilization techniques and intelligent autonomous platform construction technology, computers with artificial intelligence can support PM and manage and achieve the goals of projects / tasks autonomously and actively. I want to create a technology that is

More specifically, the type of information, such as 'BREAKDOWN TREE (BDT)', 'IVY', 'VINE', 'BUSH' and 'SHRUB' as a specific means for enabling the collection, storage and utilization of the information. According to the characteristics and characteristics, various 'PLANT' data structures or data models, which are specialized for the storage and use of the information, are created and defined, and the basic framework of overall goal management information composition ( Define and configure Smart Total Unified Management Platform (STUMP) as a stub to form a framework) or foundation, 'graft' the PLANTs to STUMPs, and create PLANTs according to the relationship between information. As a 'Body of Goal Management Knowledge and Information' (BOGMKI) according to the characteristics of the Project / Task that wants to establish and manage goals by freely integrating with each other, the 'Super Tree' To define and implement.

'Super Tree' as 'BOGMKI' accepts and stores 'any information necessary for reasoning and judgment for goal management of Project / Task to set and achieve goals' (defined as 'Big Information'), and stores each PLANT. In addition to the internal paths through parent / child, precedent / successor, or other free-adjacency relationships among the information within them, a bi-directional path through nodes of graft-connected PLANTs is provided, so that all information stored in the Super Tree It is possible to freely access and use as inference related information (Context) from any location of Super Tree.

Based on the information stored in the Super Tree, 'SWEEP' which continuously monitors and manages the progress and event occurrence status of all detailed tasks at every moment throughout the entire stage of Project / Task goal management. and Event Evaluation and Proceeding) By applying the goal management technique, we intend to devise a platform construction technology that proactively supports and assists the Project Manager as a Virtual Project Manager and performs autonomous or intelligent tasks.

As a result of the present invention, it is possible to be given a goal management task to be regularly or repeatedly performed to set and achieve a goal as a basic task, to cooperate with the Project Manager (PM), to implement the instructions from the PM, In addition, by receiving and processing requests from other managers of Project / Task and proactively responding to various exceptions or events occurring in the goal management process, it is possible to achieve the goals of Project / Task. It is possible to implement an intelligent autonomous goal management platform that can be greatly enhanced.

In particular, the goal management is voluntarily or proactively based on the SWEEP goal management technique, which manages the entire goal management process thoroughly for all managed objects, greatly improving the accuracy, promptness, sustainability, consistency and objectivity of the goal management. You can. In addition, early detection and response of events or risks that may impede the achievement of the objectives, alerts or alerts the relevant parties, and delays in progress may occur. In this case, it is possible to build an intelligent goal management system of Project / Task that can minimize or minimize the spread of the spread. As a result, large-scale projects such as Plant EPC, Ship Building, Building Construction, and other infrastructure construction, Smart Factory construction and operation, computer system operation management, corporate management, energy management, organization operation management and various competitions It has the effect of greatly increasing the possibility of successful achievement of various and complex tasks, ranging from (game) to stock investment.

Furthermore, the basic principles of this platform can contribute to the enhancement of competitiveness in the field of artificial intelligence (AI) technology, which is emerging as a core technology of the fourth industrial revolution, and ultimately all human activities to set and achieve goals. It can be widely applied and applied as a common base technology for the construction of various intelligent goal management systems that support the goal to achieve the goal at the total minimum cost.

1 is a flowchart of intelligent goal management of a Project / Task based on a Super Tree.
2 is an exemplary configuration diagram of a Super Tree.
3 is a diagram illustrating the configuration of an ORE (Order and Request Expression) Generation BDT
4 is an exemplary configuration diagram of IVY.
5 is a diagram illustrating a configuration of VINE.
6 is an exemplary configuration diagram of Node Attribute SHRUB (NAS).
Figure 7 is an example implementation of Super Rule.
8 is a configuration example of a Super Tree-based Project / Task target management platform server

With reference to the accompanying drawings below the super tree based on the present invention The preferred embodiment of the Project / Task intelligent goal management platform and method will be described in detail. The location reference number in each drawing uses three digits and the first number represents the drawing number. The same description can be repeated for clarity. Technical terms may be combined with English language for clarity of meaning. Names and expressions defined in the present invention, or a case of the name or expression used for the first time only by brief description without defining separately, and when trying to distinguish or emphasize a specific expression separately may be represented by 'single quote'.

The project / task goal management platform of the present invention sequentially divides all targets to be managed and divides them, and continuously and intelligently autonomously manages and progresses over the entire execution period / time of the project / task to reach a goal of setting. Use strategy. In the present invention, all the management levels (defined as 'Vertical Breakdown Task Plane') that are broken down to all the detailed levels as described above are divided into a series of management unit time units ('Horizontal Progressing Time'). 'SWEEP' (Successive Work and Event Evaluation and Proceeding) Goal Management Technique (Method) or Method (Method) To be defined).

Project / Task goal management platform of the present invention, based on the SWEEP goal management strategy throughout the entire process of Project / Task goal management, substitute and support PM as a Virtual Project Manager (VPM), the progress of all the managed tasks In order to thoroughly monitor and manage the occurrence of various events and events at every moment, a vast amount of raw data, derived data, and contextual relational information (hereinafter, collectively referred to as 'information' and goals) are used. Methods and knowledge (hereinafter collectively referred to as' knowledge ') are required for performing management tasks. In the present invention, any' information and knowledge required to set and achieve the goals of the Project / Task is required. 'Body Of Goal Management Knowledge and In' to collect, accept, and support autonomous reasoning and judgment. As a formation (BOGMKI), it constructs and utilizes a super tree.

1 is based on the Super Tree according to the present invention Project / Task This is a flowchart that shows the procedure of task management task of intelligent goal management platform.

1, based on the Super Tree according to the present invention Project / Task intelligent goal management platform supports project / task general manager or project manager (PM) (hereinafter collectively referred to as 'PM') through the following five-step process and performs goal management tasks autonomously and actively .

Step 1.Start Project / Task Initiating and Basic Information Collection Stage (S100)

Present 'preliminary information input window' that is selected according to the field of Project / Task (hereinafter, simply 'Project / Task') to establish and manage goals, and provide the field, name, final goal, General basic information such as scope and total execution period of 'Deliverable to State' or 'Deliverable' is collectively inputted from Project Manager (PM).

Step 2. Detailed Information Collection and Super Tree Constructing Stage (S101, S102)

Based on the entire basic information received in the 'Project / Task start and the entire basic information collection step', the project is configured in advance by field using the platform implementation method of the present invention and the expertise of each field of Project / task. Super Tree Basic to Reference Skeleton of / Task field is selected and presented. Based on the presented Skeleton, Knowledge and Expertise in the relevant Project or Task field, and various data, processing data information, and relation (Relation or Context) information (collectively) 'Information' is inputted from the Project Manager (PM) and 'Team members or other managers (hereinafter collectively referred to as' other managers') who perform tasks under the direction of the PM. 'Super Tree' is defined and constructed to implement the 'Body of Goal Management Knowledge and Information (BOGMKI)'. The constituent super tree is referred to as' Work 'Work Package' or 'Activity', which are collectively referred to as' Task 'according to the field and characteristics of Project / Task. Quantitative information or quantified information of hierarchical / sequential information to be classified or subdivided (S102), and the result or result state (hereinafter, collectively referred to as 'Deliverable') to be completed for each task as a scope of execution of each task; It basically includes expertise and information such as resources, costs, and budgets that need to be put in place to complete the Deliverables. To set specific goals and accomplish specific projects / tasks, BOGMKI, a total collection of expertise and information implemented in Super Tree, is defined as 'Big Information'.

Step 3. Task Scheduling Stage (S103)

Collaborate with PM, Scheduler, and each task manager for all the detailed levels of tasks to be performed in order to breakdown and achieve the goal in the 'detailed information collection and super tree construction stage' (S101 and S102). Baseline Duration is set considering the possibility of exceptions. Task execution time divided into progress by each task's baseline duration as 100%, unit task time (Default is 'Day', described below based on 'Day'). Establish a baseline schedule. (E.g., using S-Curve or Linear function) Estimate the quantitative quantity of Deliverables corresponding to the baseline plan progress for each unit time and the corresponding resource and cost. On the contrary, the 'Actual Supply Plan' of each resource considering the 'Allocation Unit' is established for each unit time, and the quantity and cost of deliverables that can be completed from the actual input plan are quantitatively determined. Calculate The quantitative amount of Deliverable that can be completed is converted back to the progress schedule of the task. In the converted unit time execution plan, the resource is allocated to go ahead of the baseline plan, and the point when the sum of each unit time execution plan is 100% is the 'Goal Duration' of the task. The difference between the Baseline Duration and the Execution Goal Duration is defined as the Task Internal Buffer of the task. Subsequently, for each Execution Goal Duration, 'Milestones' indicating the specific progress or completion status of the task are set, and mutual finish-to-start, finish- By establishing the predecessor and successor relationships of to-Finish, Start-to-Start, and Start-to-Finish, baseline and execution schedules are established for all levels of detail, and corresponding Baseline Duration and Execution Goal Duration Calculate

Step 4. Task Performing Step 'Performing Stage (S104)

According to the 'Execution Schedule' of each task established in the 'Task Execution Planning Step', at the beginning of each task, the expected supply resource and the expected completion Deliverable and Estimate the corresponding expected progress. If progress is expected to be delayed, take precautions and continuously monitor the progress and progress of all tasks along the way. It interrupts resource input during task execution and immediately responds to an event that can affect progress. After each unit time, each task compares the planned progress of the unit time and the progress of the unit time performance, and compares the cumulative execution plan progress and the cumulative performance progress up to the unit time. In the event of a 'delayed-degree event' that differs by more than a pre-defined Significant Level, the event-absorbing tactic (EAT) is applied to recover the delayed progress as early as possible. It tracks and analyzes the causes of progress delays, accumulates them as experiences, and reflects them in the target management after the current unit time. The platform of the present invention does not provide a function or a tool passively, but the platform performs autonomously and actively, a task assigned as a task to achieve a goal, and thus, it is called a 'platform task', and thus achieves a goal. This is distinguished from the usual 'Task' (also called 'Work' Work Package 'or' Activity '), such as construction, design and procurement, which must be performed and managed as a direct act. At the same time, the PMs perform additional instructions, assign tasks, and handle other managers' requests, thereby resolving the 'detailed tasks' (defined as' Vertical Breakdown Task Plane'). We will manage and achieve goals precisely through three-dimensional, continuous, proactive and intelligent autonomous processes throughout the 'period of time management' (referred to as 'Horizontal Progressing Time Axis').

Step 5. Completion (Closing) Stage (S105)

Complete all the Project / Task successfully by completing the final Deliverables that satisfies the quality standards for all the detailed level tasks that managed the progress in the 'task execution phase', and if there is an owner of the Project / Task separately It is passed over to the owner and achieves the goal of Project / Task.

If necessary to increase the clarity of the description below, a specific example of the Project / Task will be described. Mainly engineering / procurement / construction (EPC) projects of large plants, production management tasks in smart factories, energy saving management tasks in energy management systems, power system operation management tasks and computer operating systems The following describes the performance management task in (Operating System).

Hereinafter, the configuration and utilization method of the Super Tree will be described in detail with reference to FIG. 2.

First, we represent all management activities to achieve the goals of Project / Task that we want to set up and manage at the cost of 'Optimal-minimum', and as the 'Virtual Project Manager' (VPM) Symbolically, a root node representing a total and unique starting point or entry point of the Project / Task goal management is generated 201.

The management goal of the Project / Task may be two or more, so the 'optimum / minimum' cost is appropriate for factors such as environment, quality, convenience, safety and security, depending on the characteristics and goals of each Project / Task. It means the total minimum cost that is assigned to the total cost by assigning the weight value that is judged.

Next, classify or subdivide all the management activities that need to be performed to achieve the goals of the Project / Task, and represent and represent the management activities for each major management area classified or subdivided. Create major management nodes for the server (202).

Subsequently, as a stub which is the base of the Super Tree configuration, a tree data structure is created, in which the main management nodes are child nodes of the root node, and is defined as 'STUMP' (Smart Total Unified Management Platform). 203).

The STUMP is built to explicitly enumerate all major areas or sectors that should be performed for project / task goal management and to form a framework that establishes the overall information storage and management system. do. The Major Management Nodes may each have Minor Management Nodes, which are subdivided into detailed management actions, as child nodes. For clarity of the overall information and management system, STUMP does not exceed 3 levels.

Next, to collect, store and utilize all the information necessary for the management of the targets of the Project / Task selected for each major management sector or field, it is specialized according to the type and characteristics of the information and the relationship between the information. Define data structures of each purpose as follows.

1. Among the target information that should be used for goal management, when systematically or hierarchically classifying or subdividing, it has a structure of 'tree data structure' to manage information that can be broken down into homogeneous or homogeneous detailed information. BREAKDOWN_TREE '(hereafter referred to as "BDT").

2. Schedule management, Progress management, Dependency or Preceding / Succeeding Relation management of each task to be carried out over the entire time / period to be performed for goal management. Set the management unit time to manage the operation status of the facility and the management of various events and risks at the desired time resolution level (Default is 'Day') 'IVY' of the structure that connects management time units in the form of a chain of length corresponding to the duration of each task.

3. Various production, manufacturing or manufacturing processes such as raw materials, semi-finished products, and products flowing in a certain direction, support systems for handling various media and energy such as cooling water, compressed air, and electric power, and various circuits. In order to store and manage the function and role of a process or block, an interconnection relationship, an interaction relationship, an operation state or an operation state information representing a facility or a component or a group thereof, VINE is a structure that connects according to the form of a process, system or circuit.

4. A network composed of computers, accessories and elements that perform two-way communication around a network or busbar. Unlike other VINEs, a network or entity that moves according to the selection and conditions of a starting point and a target point. In a variety of networks or systems in which equipment, elements or other elements or entities are connected by which direction may be changed, the functions / roles of the equipment, elements or entities, 'BUSH' with directional edge-connected Graph Data Structure structure for storing and managing interconnection and action relationship, operation status and operation status information.

5. In addition to the information stored in the STUMP, BDT, IVY, VINE, and BUSH, the platform is required to carry out a given objective management task by default, to perform instructions from the PM, or to handle requests from other managers. 'SHRUB' with Tree Data Structure structure to store all information, knowledge and methods needed for the purpose and to use for reasoning.

The respective 'STUMP', 'BDT', 'IVY', 'VINE', 'BUSH' and 'SHRUB' are collectively defined as 'PLANT' (204).

Subsequently, for each PLANT type defined above, an arbitrary number of individual PLANTs are generated (Instantiate) as needed for goal management, and the root node or start node is connected to each node of the STUMP. Separately, the act of connecting the Root Node or Start Node of another PLANT of the same kind or heterogeneity is defined as 'graft' (205, 206, 207).

For each node of each PLANT grafted to the STUMP, it is necessary to additionally store related information for goal management or to access information stored in another PLANT for inference. Root Node or Start Node can be grafted repeatedly (208, 209), and each node can access, search, and traverse between nodes within its own PLANT. In addition to paths, additional paths that can be accessed, searched, and moved to other PLANT nodes through Graft will be created. 'Body Of Goal Management Knowledge and Information' (BOGMKI), which consists of the STUMP and all the PLANTs grafted to the STUMP, is defined as 'Super Tree'.

First, the method for direct access to each node in the Super Tree, which is configured to store all the information necessary for goal management, is explained. All PLANTs that make up a Super Tree are given a unique PLANT Name and PLANT Number in the Super Tree, and are referred to as 'Root Node' or 'Start Node' of each PLANT. Generic node name is the same as the corresponding PLANT name. PLANT According to the characteristics of Project / Task, number is composed and assigned so that the total number of PLANT and relative position of the relevant PLANT within the PLANT can be determined.

All nodes in each PLANT are also given a unique node name ('Node Name' or 'Node Given Name') and a node number in the PLANT. Node Numbering configures and assigns a number system that can determine the total number of nodes and the relative position of a specific node within the PLANT according to the PLANT type. In addition, each node additionally has a 'Node Full Name' consisting of a path from its own root node to its own node and its 'Node Given Name'. It is defined as (PPN).

If there are many PLANTs of the same composition as the same PLANT and it is difficult to give a unique name to each PLANT, the PLANT Path Name (PPN) of the node that grafted the PLANT is placed before the root node or start node of the PLANT. So that it has a unique name. In the case of nodes, when there are many similar nodes in the same PLANT and it is difficult to give unique node names, they are distinguished or accessed by using path parts that are uniquely distinguished among the PPNs of the nodes.

The 'Graft' is made by storing the PLN (PLANT Path Name) of the other node in each of the graft party nodes as a graft attribute value, and the 'Grafting Parent' and 'Grafting Child' are mutually established according to the direction of the graft. Relationship is established, and 'Graft Path', which is a relative path for accessing node information of other grafted PLANTs, is formed around each node from both nodes. 'Root Node' or 'Start Node' of all PLANTs except STUMP can be grafted to Root Node or any node of other PLANT, and any node of any PLANT can be grafted to any node of other PLANT as needed can do.

The type of graft is determined according to the relationship between the information formed in the graft. Typical graft types include, but are not limited to, the relationship of providing detailed to attribute information to main information; Physical leading / sequence linking relationship; Temporal precedence / sequence relationship; Predecessor / dependency relationship of logical condition; The relationship between physical main information and sub information; Information relationships that are Identical to Equivalent; The relationship between a task and how it is performed, knowledge, and expertise / knowledge-how; It can be added or omitted depending on the field and characteristics of Project / Task. Therefore, the graft has directionality according to the interrelationship between the nodes that are grafted, and in the same or equivalent information relationship, the graft can be arbitrarily determined according to the convenience of using information for goal management. In addition, all grafts in Super Tree can be made statically or dynamically during goal management or reasoning process. These are called 'Static Graft' and 'Dynamic Graft' respectively. In the case of 'Dynamic Graft', Graft may be terminated (hereinafter referred to as 'Degraft') after the purpose or purpose of the graft is completed.

Every node in the Super Tree has a path from the root node (represented by 'ROOT') of the Super Tree to the node and a path name including the node itself, which is called a 'Super Tree Path Name' (STPN). Therefore, STPN of all nodes except STUMP Node includes one or more 'Graft Path'. In addition, when each node grafts a node other than root to a node of another PLANT, the node has a STPN via the grafted node, in addition to the original STPN including the root node of the PLANT to which the node belongs. The STPN via the Root Node of the PLANT that the node belongs to is especially called the 'original STPN'. Accordingly, each node may have one or more STPNs, and may select and utilize a desired STPN according to the surrounding information (Context) needed in the reasoning process using the node. Arbitrary Nodes Except Root in a Specific PLANT In the case of an STPN formed by directly grafting to another PLANT node, the name of the arbitrary node includes the node's PPN in parentheses.

In addition, any two nodes in the super tree may form a path name as a relative path starting from the other node to the self, and defined as' Relative Super Tree Path Name (RSTPN). In the path constituting the 'RSTPN', the path portion in the direction descending from the ROOT of the Super Tree is called a 'forward path', and the path portion in the direction up toward the ROOT is a 'reverse path'. It is called. Each Super Tree Relative Path Name (RSTPN) may be redirected to a specific node or backtracked to a path that has passed in progress, and thus may include both a forward path and a reverse path.

When inference needs to be made using surrounding information centered on a specific node, the original STPN of the node is defined as a 'center of interest node' or 'COIN' (Center of Interest Node). Therefore, the surrounding information of a specific node can be easily accessed by specifying the node as a COIN and an RSTPN centered on the COIN.

The following describes the notation method of the STPN, PPN and RSTPN which are node paths for storing and accessing information in each node of the Super Tree. Forward path notation between nodes uses Slash ('/') instead of Arc for convenience. However, in the case of graft path, it should be written as Double Slash ('//'). In addition, Back Slash ('＼') is used to indicate Reverse Path, and Double Back Slash ('＼＼') is used for Reverse Graft Path. However, the Path notation may use other symbols as long as there is no confusion depending on a programming language for implementing a platform.

In the expression of paths for accessing each of the Super Tree Nodes, in case of accessing the node or performing inference for goal management. Nodes that can be omitted are omitted and can be represented by a simplified path expression. In addition, when comparing two paths to determine whether they match, if the path includes the wildcard notation '*', it can be matched with any path including one or more nodes in the corresponding position. It can be matched with one node of. In addition, if a variable node expression such as '? Node_variable' is used at a specific node position of a path, the actual node name of the variable node position can be extracted as a corresponding variable node value from a matching relative path.

When graft is made between two nodes, the expression of the corresponding graft path is expressed as 'PPN // (Grafting Child Node's PPN) of the forwarding parent node' in the forward direction, and 'PPN of the Grafting Child Node' in the reverse direction. '' It is expressed as' '(PPN of Grafting Parent Node)'.

It then describes the behaviors that the platform can do to, or utilize, the Super Tree and the PLANT or PLANT Nodes that make up the Super Tree in order to carry out its goal management tasks.

"Operation" for the Super Tree and each PLANT or PLANT Node is called "Operation" that can be performed on the PLANT. 'Operation' in Super Tree is divided into 'Common Operation' that can be applied to all PLANTs and 'Exclusive Operation' that can be applied to each PLANT. Even in the operation of, the application method can be changed according to the applied PLANT.

Basic operations performed on the Super Tree include 'Create_Super_Tree', 'Create_PLANT', 'Create_Node', 'Insert_Node', 'Delete_Node', 'Graft', 'Degraft', 'Prune' and 'Node_search'. Examples of operations of the high abstraction level include 'Node_Visit', 'Node_Eval', 'Node_Expand', 'Node_Shrink', 'Path_generate', and 'Path_Instantiate'. The names of all operations defined in Super Tree can be changed by changing the order and capitalization of constituent words according to the use environment of the operation and whether or not the expression is emphasized. The name of each operation indicates the purpose of the operation, and the details of the operation are defined by the platform implementation engineer, administrator, or PM depending on the characteristics of the project / task. Each operation expresses its details explicitly, excludes the creation of a black box, and implements it using "rules" to allow for free and flexible tuning or updating.

'Create_Super_Tree' presents a basic Super Tree structure or skeleton typical of the corresponding Project / Task field that is pre-configured when basic information is input in order to construct a new Project / Task goal management system. This is the operation to create, add, delete, and graft various PLANTs and nodes, and create a super tree.

'Create_PLANT' presents a typical basic structure or skeleton of the PLANT type to be created under the selected Super Tree Skeleton, and creates, adds, and deletes nodes of the PLANT freely on the graphic, and creates the PLANT, and other PLANTs. Operation to graft.

The 'Create_Node' presents a typical basic node of a PLANT and a skeleton of a node attribute SHRUB (NAS), and 'Instantiates' a specific node to insert or connect to the PLANT. This is the operation to make it possible to connect.

The 'Insert_Node' is an operation for connecting the generated node to the PLANT, and the 'Delete_Node' is an operation for deleting the node selected in the PLANT. The 'Insert_Node' or 'Delete_Node' operation includes the connection or disconnection processing operation of neighboring nodes of the node, depending on the type of PLANT.

The 'Graft' operation is to connect the same or heterogeneous PLANT to the selected PLANT, and the 'Degraft' is an operation to separate the grafted PLANT. The 'Prune' operation is an operation for deleting all descendant nodes or subsequent nodes including a node to select, and the 'Node_search' is an operation for searching for a node having a desired condition in the entire Super Tree or a specific PLANT. As a result of the 'Node_insert' and 'Graft' operations, the total number of nodes in the Super Tree increases or a new relationship is formed between the nodes. BOGMKI's Super Tree knowledge and context information are increased, and the learning effect of utilizing the information from these nodes for reasoning for goal management Will be done.

All operations on the Super Tree, the functions and tasks that are basically implemented on the platform, and the operations on the higher abstract levels are used to represent and process the tasks and requests to the platform. In order to express and process requests and operations, 'Basic Terms and Expressions' are defined and used as the keyword of the platform, and the defining keyword is called' Semantic Primitive (SP).

Basic Semantic Primitives ('SP') include 'Graft' and 'Degraft' for operations that interconnect or separate PLANTs to form and terminate relationships between information, 'Visit' for visiting specific nodes, and specific nodes. Or 'Evaluate' (or simply 'Eval') to return the value of a specific attribute of the node, when the value of a specific variable is set, the relevant 'Fact' is announced and the part or all of the preconditions are satisfied by the Fact. There is an 'Assert' that allows you to 'Invoke' and 'Execute' (also referred to as 'Fire' or 'Trigger').

In addition to the examples of commonly used SP. Mainly, the 'Acquire', 'Check', 'Collect', 'Compare', 'Compute'Conduct', 'Control', 'Create', 'Define', 'Determine' ',' Develop ',' Display ',' Estimate ',' Evaluate ',' Explain ',' Find ',' Forecast ',' Implement ',' Monitor ',' Perform ',' Plan ',' Report ', It uses SPs such as 'Set', 'Show', 'Simulate', 'Summarize', 'Support' and Validate, and displays 'Expand', warnings or notifications to show detailed information or time of specific equipment. 'Alert' for confirmation, 'Confirm' for confirmation, and 'Every' for indicating the scope of the operation target, or 'Each', 'All' and 'With_condition', the time at which the information is provided or included / "Every_day", "Today", "Yesterday", "Previous_day", "Tomorrow", "Next_day", "Every_week", "Last_week", "Every_month", "Last_month", "Present", 'In_progress', 'Past', and 'Future', lines of operation 'All', 'Every', 'If', 'Else_if', 'Else', 'Equal' (Quantity), 'Eq' (Quality) or 'Is',' Not_Eq ',' Greater_Than (GT) "," Greater_or_ Equal (GE) "" Higher "," Lower "," Above "," Below "," Less_Than (LT) "," Less_or_ Equal "(LE)," AND "," OR Use SP such as' and 'NOT' and add Jargon or Lingo commonly used in the field as SP as the SP according to the characteristics and convenience of each Project / Task. Each SP may be defined or used to include other SPs for the purpose of defining definitions or their meanings.

Each node in the Super Tree can be grafted with 'Node Attribute SHRUB' (NAS) to systematically and hierarchically divide and store the attributes of the node. Each attribute node of the NAS basically includes the node's own PPN, the number of 'child nodes' or 'subordinate nodes' or 'adjacent nodes' of the node, the node name list, the number of grafts, the type of graft, Attribute information such as PPN List of Grafting Parent Nodes and PPN List of Grafting Child Nodes is stored. Therefore, the attributes of all nodes can be accessed through 'STPN' including the NAS Graft Path of the node in Super Tree or 'RSTPN' from the node. You can continue to graf other PLANTs to each node of the NAS.

The 'Node_Visit' is an operation of visiting or selecting the nodes to perform a desired operation on a specific node. Each node in the Super Tree can be used as a variable if the node itself is a variable expression. The 'Node_Eval' is an operation for returning a variable value of a corresponding node when the particular Node is evaluated. If the node itself is not a variable node, it can store a value to be returned at 'Node_Eval' by including 'Value', Node or 'Eval Expression' Node in the attribute node. The 'Value' Node has a value that must be returned directly at Node_Eval, and the 'Eval Expression' Node has a 'Eval Expression' in List form that allows returning a value through logical or arithmetic operations at Eval. The first element of an 'Eval Expression' is typically an arithmetic operator or logical operator, or a function, method, or procedure that can be called and executed, and the remaining elements are primarily Arguments.

The 'Node_Expand' is an operation for expanding a visited node, and is divided into 'Node_Level_Expand', 'Node_Total_Expand', 'Compound_Node_Expand', 'Compound_Node_Expand', and 'Node Graft Expand'.

The 'Node_Level_Expand' is an operation of displaying a child node or a subsequent node of a corresponding node according to the structure of the corresponding PLANT within the PLANT of the selected node. Therefore, if you want to display only child nodes or subsequent nodes of the selected node, perform '1-Level' Expand operation. In the case of IVY, 1-Level Expand is also called as 'Node Increment' due to its structural characteristics.

'Node_Total_Expand' is an operation that indicates all descendants or successors below or after the node in the PLANT of the selected node along the structure of the PLANT.

A node represented by collecting or compressing a complex structure or element into one node is defined as a 'compound node', and the 'compound_node_expand' defines a compound node as a node of the node. It is an operation to expand or expand to a PLANT showing the detailed configuration. In this case, if the extended PLANT is homogeneous with the PLANT to which the original composite node belongs, the entire PLANT can be inserted into the original PLANT to replace the composite node. Otherwise, the corresponding composite node can be replaced. Grafts the PLANT extended to.

 The 'Node_Graft_Expand' is an operation that shows the entire PLANT to which the node belongs on the display showing only the node that is grafted to briefly indicate the graft.

Subsequently, the 'Node Shrink' is an operation of collecting necessary information from all descendant nodes or subsequent nodes of the selected node, storing them as attributes of the selected node, and pruning all descendant nodes or subsequent nodes. Aggregation of the information means selecting, statistically processing or logically determining specific attributes.

The path_generate includes a variable expression node such as '? Node' or a wildcard expression such as '*' or '&' in the path of the STPN to generate a general-purpose STPN that can be matched with the STPN of a plurality of nodes. 'Path_Instantiate' is an operation for instantiating the variable STPN with the actual node name in the general-purpose STPN so that the corresponding STPN can be Node_Eval as a specific node name.

The Super Tree operations may be added or omitted depending on the characteristics of the Project / Task. In addition, the expression of each operation name can be displayed in uppercase or lowercase for the position and expression of the verb and noun expression for the purpose and content of the operation or the specific use.

With the above structure of Super Tree, all the information and knowledge necessary for the goal management of the Project / Task to set and achieve the goal are belonged to the PLANT, the Name of the Node, the attributes of the Node, and the Path of the Node. (Path), relationships with other nodes in the PLANT, and contexts with neighboring PLANT nodes connected by Graft. Each node can be used as a variable with a value represented by a number, literal, or list. In the case of a List, it simply contains an 'Enumeration List' that enumerates its Member elements, an 'Function List' that contains the arguments and function names and arguments to perform arithmetic or logical operations during the 'Eval', and judgment or reasoning. It is divided into 'Operation List' which includes operation and additional information. Each node value can be input manually through keyboard or smart phone, automatically input through sensor or measurement system or other server or internet, or calculated by arithmetically or logically calculating other node value (s). Calling or introducing existing algorithms, statistics, or arithmetic S / W packages or tools such as, Linear Programming, Dynamic Programming, Search, Sorting, etc., or apply 'Rule' to above node values It can be obtained by judgment through Reasoning or Inference.

Next, the configuration and utilization of each PLANT constituting the Super Tree will be described in detail.

First, a method of constructing a STUMP that forms a basic framework or skeleton of a Super Tree is as follows.

The root node of the Super Tree and the root node of STUMP is basically the name, content, goal, 'Project / Task Charter SHRUB' 210 which includes the overall basic information such as subject to owner, PM to general manager, execution period, total budget and location, and monitors the progress along the entire project / task progress. In order to manage, Graft 'Master Calendar-mapped Progress Management IVY' (212) to be described later.

The goal of the Project / Task may be the completion date or construction period, scale or production capacity and budget in the case of a plant EPC project, and annual output, quality and target cost per product in the case of a Smart Factory construction task. In the case of corporate management, it can be an annual sales target and a profit target, and in the case of a Building Management Task, it can be an indicator of annual operating management expenses, safety, security, and benefits, and in the case of a computer system, response time (Response Time). ), It can be a security level and usability indicator, and in the case of Energy Management Task, it can be energy savings and cost savings.

Next, create major management nodes 202 that represent and represent all management activities and objects to be performed according to the characteristics of the project / task and the goals to be achieved by major sectors or sectors, and connect them to child nodes of the ROOT. It configures 'STUMP' which is 2-Level Tree Data Structure or Data Model.

 An example of typical major management nodes is the duration of the 'Detailed Task' (also referred to as 'Work', 'Work Package', or 'Activity', depending on the project / task). 'Time Management Node' (209) for creating a schedule, schedule, day of week, holiday, main event information and time related information of each calendar date; A 'Deliverable Management Node' 213 for managing the final goal of the Project / Task and the result or state (hereinafter, collectively referred to as 'Deliverable') generated as a result of performing each task; 'Task Management Node' 214 for managing the overall and detailed tasks that need to be performed directly or indirectly to complete or produce Deliverables, which are the outcomes or states of Project / Task achievements; 'Resource Management Node' for managing all resources that must be put in to complete or produce Deliverable; 'Master Facility Management Node' 215 for managing system equipment and measurement control system equipment such as production process, electrical system, steam supply system, compressed air system, cooling water supply system, and HVAC system; Space Management Node to manage all spaces and locations required for Project / Task execution, and 'Event Management Node' events among all 'Event Management Node' events to cope with all events that can occur or occur in the course of goal management. 'Platform and Super Tree Management Node' to configure 'Risk Management Node' Super Tree for managing dangerous events that may cause delay and to manage the platform itself; In addition, as a main management item at the time of super tree construction, 'Rest-of-All Management (ROAM) Node' is added to accommodate all management sectors that have no profit or cannot be identified separately. Should include 100% of management activities.

Each of the major management nodes may be subdivided into a plurality of detailed major management nodes, respectively, or may have detailed detailed management nodes as child nodes.

For example, the Task Management Node is an ITB or RFP Preparation Management Node, Bid Preparation Management Node, Contract Management Node, Engineering Design Management Node, Construction Management Node, Test, depending on the characteristics of the Project / Task. It can be subdivided into separate Major Management Nodes such as and Commissioning Node, or all can be configured as child nodes of Task Management Node. In the case of Smart Factory establishment and operation task, it can be subdivided into Production / Manufacturing Facility Management Node, Production / Manufacturing Process Monitoring Management Node, and Inventory Management Node.In the case of computer operation management task, In addition to Processor Management Node, Memory Management Node, Disk Management Node, File Management Node, Device Management Node, and Network Management Node, Security Management Node and User Service Management Node can be added and subdivided. For operational tasks, Energy Consuming Facility Management Node, Energy Consuming Category Management Node, Space Management Node, Energy Cost Management Node considering Time of Use (ToU), Peak Electric Power Management Node for managing maximum demand power, and Configure the same Management Nodes to replace Task Management or subdivide Task Management Nodes It may be configured as a child node.

Next, the structure of the breakdown tree (BDT) will be described in detail.

In order to store and utilize information that can be broken down into homogeneous or homogeneous detailed management target information when classified or subdivided sequentially or hierarchically among the information on the target to be managed by each field of each management node of STUMP, It classifies or subdivides management targets sequentially or hierarchically, and constructs a tree data structure that represents each detailed management target information as a node and connects them to an arc having a parent-child relationship. BDT ').

Each BDT is configured to include 100% of targets and 100% of targets for each level (also referred to as 'The 100% Rule' in the Project Management Community). In addition to the explicit child nodes, a level-of-all node (hereafter referred to as a 'ROA' node), which collects all other targets and collects the remaining targets, is added to each level. Include%.

The root node of the BDT for each management object configured as described above is grafted to the STUMP node representing the management of the corresponding field or sector. In addition, each node of the BDT may also graft with other PLANT nodes in the Super Tree associated with the corresponding object.

An example of a typical BDT that constitutes a goal management platform is that each detail generated by hierarchically classifying or subdividing all and all detailed actions or tasks to be performed to achieve or complete the final goal of the Project / Task during the planning period. 'Task BDT' representing a task of a level as a node, and grafting to a task management node of STUMP; 'Deliverable BDT' for hierarchically breaking down Deliverables to be completed or achieved as a result of performing the task for each task of the Task BDT as a node during a target planning period, and grafting to the Deliverable Management Node of STUMP; 'Event BDT' which displays all the events that can occur in the process of goal management task by category by node and grafts to Event Management Node of STUMP; All the facilities that should be utilized as part of the resources to achieve the goals according to the project / task, or all the facilities that need to be installed or constructed, are hierarchically by type, manufacturer, capacity, model, location, etc. Classified as 'Master Facility BDT' which individual unit facilities become Leaf Nodes and grafted to STUMP's Master Facility Management Node; When the building is included in the target, 'Space BDT' which breaks down each floor and the space of each floor as Node and grafts to Master Facility Management Node of STUMP; In order to manage and utilize the physical location of all the facilities and spaces of the various Facility BDTs and the Space BDT and the location information on the screen and the drawing, a coordinate system represented by a 4 x 4 Homogeneous Coordinate Matrix in a hierarchical structure is defined and these coordinate systems are defined. 'Coordinate System BDT' which is represented as Node and grafted to Master Facility Management Node of STUMP; In order to manage the sensors, instruments, and controllers (Monitoring and Control Points) that are installed in all facilities and spaces, all points are classified as nodes by type, location, and name of the points. 'Monitoring and Control Point BDT' that grafts to the Master Facility Management Node; 'Resource BDT' which classifies all resources to be put in order to achieve the goal of Project / Task, divides them into hierarchical nodes, and grafts to Resource Management Node of STUMP; All activities related to the execution of Project / Task, namely construction, design, procurement, and supervision, are divided into fields and represented as nodes, and the required resource, production, and cost information for each performance unit are displayed. Classify all nodes included in 'Platform BUSH', which represents the configuration of H / W constituting 'Cost Estimation Standard BDT' platform itself, which is stored as Graft to STUMP's Resource Management Node. 'Platform Facility BDT' grafting to Super Tree Management Node; In order to manage the progress of Project / Task and calendar mapping of all IVY nodes, each year including the entire period of Project / Task is a child node of Root Node. 'Project / Task Calendar Time BDT' that grafts to STUMP's Time Management Node by breaking down etc hierarchically All the PLANTs that make up the Super Tree are classified by type to form a BDT whose name is Node, and each node is grafted with the root node of the PLANT, and the 'Super Tree PLANT' is grafted to the Platform and Super Tree Management Node of STUMP. BDT '; 'Order and Request (ORE) Generation' is composed to assemble all orders and requests that can be given to the platform by subdividing them into specific types and to express them as attributes of nodes and nodes. BDT '; Node that can organize all methods, knowledge, and reasoning flows for the goal management as rules as rules, and classify the composed rule SHRUBs by type and content as a property 'Rule BDT' which is composed of Graft and Graft on ROOT; Can be mentioned. In addition, it is composed of nodes that classify and subdivide all the Project / tasks to compose Super Tree by field, and can construct 'Super Tree BDT' of upper level that grafts Supter Trees that constitute each Project / Task. have. A data model consisting of the Super Tree BDT and the Super Trees grafted to each node of the Super Tree BDT is defined as 'Super Tree FOREST', and is used when trying to manage a plurality of projects / tasks.

Each task of the Task BDT includes both an action to be performed directly by a person and an action to be performed by using equipment or facilities. Set goals according to the characteristics of the project / task, including design, procurement, construction, test and commissioning, and production in the factory, as well as management, system operation, organizational operation, computer management, energy saving, and transportation. It includes any actions that must be taken to achieve it. The level of detail represented by a task includes the detailed task as product information of the same name, and the platform autonomously bidirectionally dictates the type, amount, and cost of resources to be input for Deliverables generated as a result of performing the detailed task. Subdivide to the level that allows progress and calculation. If the detailed level of the activity can be managed without further progress management, it is not subdivided anymore and is included in the detailed task information.

For example, in the case of PLANT EPC Project, as a child node of 'Electric Construction Task' of Task BDT, the 'Peripheral Transformer Installation' task is further subdivided into 'survey', 'dig', 'form', 'Rebar', ' Anchoring ',' Concrete ',' Concrete Curing ',' TR Body Installation ',' Conservator and Bushing Assembly ',' Nitrogen Filling and Oil Filling ',' Cabling ',' Instrumentation and Control Wiring ',' Test and Commissioning ' It can be broken down into a series of detailed tasks, such as a task, a work package, or activities, and each detailed task includes an amount of Deliverables corresponding to all or part of the progress to be generated as a result of performing the task in the attribute information. The product information can be used to estimate the type, quantity and cost of resources. Conversely, the task progress value corresponding to the amount of Deliverable that can be completed or created can be calculated according to the amount and cost of resources that can be put in the unit.

Apart from the Master Facility BDT, a 'VINE Facility BDT' or 'BUSH Facility BDT' that separates facilities or devices for each process, system or circuit represented by each VINE and BUSH is grafted to the root node of the VINE or BUSH.

 Every facility or space is representative of the facility or space and designates a standard location, which is called the “representative point” of the facility or space. Nodes requiring location information among the nodes of the Facility BDT and the Space BDT use one of the nodes of the Coordinate Management BDT as a reference coordinate system, and have their 'representative location' coordinates and Orientation information in the reference coordinate system as attributes. The highest coordinate system serving as a reference, that is, the coordinate system of the Root Node of the Coordinate Management BDT is defined by defining the lower left corner point of the overall plan view of the Project as the origin and the true north direction as the Y axis.

PPN or STPN of Leaf Nodes of 'Monitoring and Control Point BDT' is unique in Super Tree and can be used as TAG of corresponding control point in platform. The additional information such as unit of TAG value, communication protocol and address are stored as attributes of the corresponding Leaf Node, so that simple TAG notation can be expressed more clearly than conventional TAG expressions represented by a chain of a plurality of abbreviated codes. Nodes and attribute information can be used for inference related to the corresponding TAG.

The event constituting the Event BDT is divided into a Negative Event, a Positive Event, and a Neutral Event according to the effect on the goal achievement, and means a Negative Event as a default unless otherwise specified.

Typical resource types constituting the Resource BDT include Manpower, Capital (Budget, Expense), Material, Equipment, Facility, Energy, and Time. If there is a Management Node for each Resource type in STUMP, a BDT for each Resource is constructed and directly grafted to the Management Node. Otherwise, the BDT is included as a Subtree of the Resource BDT.

In case of Project / Task that requires the participation and cooperation of multiple personnel, it includes Project Manager (PM) or General Manager and all Team members or Project / Task related persons (Project Owner, Owner agency personnel, Subcontractor, etc.). Stakeholder ') is represented as a hierarchical tree by professional field or department or department, and is responsible for each task, identity, authority, obligation, qualification or capability, standard product information, Construct a 'Manpower BDT' that stores all the information needed for target management such as individual actual product information and the ability to create specific Deliverables as attributes and graft them as child nodes of STUMP's Resource Management Node or Manpower Management Node in STUMP In case of creating separately, Graft is done directly to the node.

Each Day Node of the Project / Task Calendar Time BDT has attribute values such as day of week, sunrise and sunset time, forecast and actual weather information, and holiday status information.

The 'ORE Generation BDT' is designed to receive, express, and execute orders from PM or platform builders or administrators, or assignments and requests from other Project / Task parties. Configure together.

First, when Root of ORE Generation BDT of Level 1 is selected, a candidate group of SPs (Semantic Primitives) is presented as child nodes as a keyword representing a corresponding instruction or request, so that the PM can select or directly input it. When a specific child node is selected from the proposed candidate group, it is selected as an attribute of the selected child node, and the detailed expression, content, or values that need to be input are presented as defaults, and can be selected or directly entered. If the required attribute is inputted, the candidate group and attributes of the child nodes of the next level generation of the expression that can embody the instruction or request indicated by the SP according to the selected SP child node are presented for input. Iterate and refine the level until the expression of the instruction or request is complete. When input to leaf node is completed, if additional contents need to be supplemented, request to input as attribute of corresponding node on generated path. Therefore, 'ORE Generation BDT' is configured to display and store specific instructions or requests to the Platform as attributes of the path to the node and the nodes on the path within the 'ORE Generation BDT'. All candidate nodes and attributes presented at the above levels are pre-stored in the Super Tree and are accessed by the STPN.

PPN formed by inputting to leaf node along a specific path in the ORE Generation BDT is not a name of the leaf node but a context as a whole path and attributes of each node and node included in the path. It represents the expression of assignment or request, and this path expression is defined as 'instruction and request expression stem' ('ORE STEM' or simply 'STEM').

In order to support STEM input and configuration using ORE Generation BDT, the node name can be directly inputted by PM for each depth or the node names that can be selected at the current depth position in alphabetical order based on the input contents up to the previous depth. You can also select the drop-down menu by listing them. If you enter the node name, if there is additional information required, the PM presents the input window and saves it as an attribute of the node by directly inputting or drop-down menu. The input of the STEM is performed by executing the 'STEM_Generation_Rule'.

3 is an exemplary view showing the configuration of STEM. An example of a typical candidate node presented for each depth of an ORE Generation BDT and a value or expression of a node represented by an attribute of each node are as follows.

Depth 0 Node: Root Node (301) of ORE Generation BDT

○ Attribute: relevant instruction, task and request issue time, name, text representation, subject (Default: PM) 302

Depth 1 Node: Semantic Primitive: (one of the Leaf Nodes of the SP BDT, eg Report, Estimate, Monitor) (303).

○ Attribute: Content of the instruction or request, execution time, repetition, reporting method (PC, Smart Phone, etc.) and format (Table, PLANT) (304)

Depth 2 Node: Target of instructions, tasks, and request actions: Object or object's state or specific property value (node of Super Tree)

Case 1: When an object is selected (intermediate node in STPN, for example, Task, Facility, Resource) (305)

○ Attribute: Number of objects (single, plural), name of object

If the target is singular: the target's STPN

-If there are multiple targets: BDT that contains the target or subtree of BDT

Depth 3 Node: The state or specific attribute value of the selected object (STPN representing that Variable) (306).

Case 2: When an object's state or specific property values are selected (state examples: Progress State, Operating State, Efficiency, Performance, Statistics, etc. Example property values: Early, Normal, Delay, Delay_Hi, Delay_Hi_Hi) (307)

○ Property: STPN or STPN Template that represents the target state or property value, and the condition or condition value

If the target is singular: STPN of the node

-In case of multiple targets: STPN Template of Node expression

Depth 3 Node: Target Object (STPN of Target Object) 308

Each STEM configured as above is given an issue number and name and grafted to the node of the corresponding STEM name of 'ORE STEM Classification and Depository BDT'. In the description of Rule SHRUB described later, an example of the configuration of ORE STEM is shown.

Instructions, missions, and requests that must be performed regularly or frequently, among STEMs, are stored in the 'Regular Oder, Assignment and Request (ROAR) Table' so that only the detailed attributes can be modified and used repeatedly. STEMs whose path nodes are the same and differ only in the attributes of each node are called 'homogeneous STEM'. In the case of Homogeneous 'STEM', the PPN and common attributes are stored in the 'ROAR' table as a template to simplify the input and creation of Homogeneous STEMs.

The STEMs configured as above are named as paths of the instantiated ORE Generation BDT, and are assigned to BDT nodes of the corresponding name of 'STEM Classification and Depository BDT' which represent STEMs by segmenting them by field, type, and content. Graft. The 'STEM Classification and Depository BDT' is grafted to the node of the corresponding STEM name of the 'Super Tree PLANT BDT'.

Each STEM is capable of 'Assert' as a 'Fact' of the act of issuing the instructions, tasks and requests as a whole, and a 'Rule' that explicitly indicates the specific methods and procedures for the implementation of those instructions, tasks and requests. Invoke and execute them. All rules are implemented in ‘Rule SHRUB’ described below.

At each node of all BDTs, a Root Node can be grafted by configuring a 'Node Attribute SHRUB' (NAS) that stores or systematically classifies or divides information of attribute values of the node. Examples of the main attributes are, for Facility BDT Node, the specification, symbol, image, location, orientation, 3D model, accumulation, operation method, operation history, energy consumption, reliability, actual efficiency, Performance indicators, etc. In the case of Task BDT Node, it has 'Nature of Activity' (NOA) attribute node, subjects and qualifications of necessary actions, necessary actions, Create descendants that contain specific content information of task execution behavior such as target deliverable, required equipment or equipment, materials, energy, and execution time, or separately configure NOA SHRUB to graft to the NOA attribute node. Can be.

As examples of common operations performed on the BDT, operations such as 'Node_Level_Shuffling', 'DFS_Next_node_Search', and 'BFS_Next_node_Search' are configured.

 The 'Node_Level_Shuffling' is an operation of reconfiguring the classification system by reversing the level positions between the parent nodes and the child nodes according to the purpose of utilizing the BDT.

If you need to enumerate all nodes belonging to each BDT, or visit each node sequentially and need to evaluate, you can use a search algorithm such as Depth First Search (DFS) or Breadth First Search (BFS). use. The 'DFS_Next_node_Search' and 'BFS_Next_node_Search' are operations that visit the nodes of the target BDT in the order of DFS or BFS at every operation and return the node of the next visited location.

Next, the configuration and use of IVY will be described in detail with reference to FIG. 4.

Each unit time divided by subdividing the time or duration required to perform each task constituting task BDT into 'unit time' time of a certain length of task execution is represented by node, and ' From the 'Start Node' 401, to the 'Finish Node' (or 'Last Node') 402 corresponding to the end unit time sequentially constitutes a data structure connected by an arc and defined as 'IVY'.

The unit time is selected according to the characteristics of each task and the convenience of management, and can be selected from Day, Hour, Minute, Second, or Week, Month, Quarter, and the default value is 'Day'. The time can be generated by 'Expand' or 'Shrink' (also expressed as 'Condense' or 'Collapse') of the 'Day' Node, which will be described below with reference to 'Day'.

Each IVY configured as described above is grafted as a 'Task Progress Management IVY' 403 to a corresponding Task Node of a Task BDT to be performed in a corresponding duration. If the task to be performed is the monitoring task of the operation status, graft as 'Operation Monitoring and Management IVY'. Each IVY is given a unique name. If it is difficult to give a unique name, the IVY is distinguished by a path expression including a parent node grafted. In each Day-Node, planning and performance information of Deliverable and progress corresponding to the assigned date and completion and resource and cost to be input and other related tasks Information, Milestone information corresponding to a certain magnitude, etc. are directly grafted to the attribute value or a dedicated SHRUB having the information is separately grafted to the node of the attribute name.

Due to the nature of the structure of IVY, all nodes except Start Node have one 'Previous Node' and all nodes except Last Node have one 'Succeeding Node'.

Each node of IVY assigns a series of node numbers starting with 1th (or 1st) of the Start Node, and the node number is also used as a node given name (405). The PPN of each node is indicated by omitting other IVY nodes except for the node itself due to the nature of the IVY node name, and the Node Number of the Last Node becomes the length of the corresponding IVY and at the same time becomes the duration of the task (402, 406).

If each Day node of IVY wants to display only pure time length regardless of calendar day, weekend or holiday, it is called 'Net Duration' IVY (407), and if it corresponds to a specific date of calendar, 'Calendar- It is called mapped'IVY (403, 404, 408).

The 'Net Duration IVY' is mainly used when establishing a schedule based on the Net time / period required to perform a task, and when converting to 'IVY', the calendar date to start the task of the Start Node of Net Duration IVY Forward Mapping (409) and Map Finish Nodes to Deadline and Reverse Mapping and Deploying the remaining nodes in the forward direction (409) Backward Mapping 'and' Bi-directional Mapping 'to choose the intermediate node corresponding to a specific milestone according to the desired calendar date, bidirectionally map and deploy.

In order to establish a schedule for performing each task, the Net Duration IVY may be configured first according to the characteristics of the task to select and map among three calendar mapping methods, or may be configured as a calendar-mapped IVY directly from the beginning. In addition, due to the nature of the task, such as the achievement of the annual production goal or the annual energy saving goal, the IVY may be configured in which both the start date and the completion date are fixed to a specific calendar date.

The entire execution period from the start date of the project / task to the completion date of the project / task to use as a reference for configuring the calendar-mapped IVY for monitoring the overall progress and progress of the project / task and performing each detailed task. 'Master Calendar_mapped Progress Management IVY' (408) including the graft to the ROOT of the Super Tree. Each node number of the 'Master Calendar_mapped Progress Management IVY' (hereinafter, the expression 'Calendar_mapped' is omitted) is called 'Master Node Number' (410) and represents the total number of days since the start date of the entire project / task.

The NAS of each node of the 'Project / Task Progress Management IVY' has attribute information on the corresponding date, day of the week, weather, sunrise and sunset time, instructions and execution result of the PM on the target management platform on the corresponding day, and other project / To store and display information on the progress of the Project / Task, such as the results of requests and processing by Task stakeholders, the day and cumulative overall progress plan light performance, the processing of events and risks that occurred on that day, and so on. do.

'Task Progress Management IVY' of each task is a 'Master Node Number' (413) that represents the elapsed date from the start date of the entire project, in addition to its own 'Self Node Number' (412) that represents the elapsed date from the start date of the task. With the attribute, you can see the calendar date information of the day, the number of days since the start of the entire project / task, and the relative progression with other tasks, and the preceding successor with other tasks. Setting and task progress Buffer management can be performed by simply comparing the serial number.

In addition, for special-purpose IVYs, the name of IVY represents a specific variable name, and each node of IVY represents a significant value among the nodes of 'Node Variable IVY' which represent the variable value of the corresponding unit time or the average value of the variable during the unit time. 'Sparse IVY', which only selects nodes with significant information as optional or explicit, and omits the remaining nodes, and 'Shorter, which consists of expanding the nodes of specific unit time IVY to lower detailed unit time nodes. Unit Time Expanded IVY 'and' Longer Unit Time Shrinked IVY ', which is composed of the upper long unit time nodes, and to record the occurrence time and number of irregular events such as data acquisition, equipment failure, wage increase and material value increase. There is 'Arbitrary Interval IVY'.

The 'Node Variable IVY' is mainly used to treat or utilize a series of variable values as a group, such as establishing a task execution schedule or analyzing a trend of a specific variable.

IVY configured as described above, in addition to each task node of Task BDT, all the nodes in the Super Tree that require monitoring and management actions according to the time of establishing or proceeding with a schedule are required. It consists of length and grafts.

Exclusive operations defined and applied by IVY include 'Reference_IVY_display' 'Top_down_Scheduling', 'Bottom_up_Scheduling', 'IVY_node_increment', 'IVY_node_decrement', 'IVY_shift', 'IVY_split', 'Calendar_Y_mappingraft' Examples include Absolutely Needed Time (ANT) _estimation ',' IVY_node_Expand ',' IVY_node_Shrink ',' Progress_estimate ',' Buffer_setting ',' Milestone_sliding ',' 4D_display ', and' Present_Time_Line_set '.

The 'Reference_IVY_display' is an operation for presenting a IVY of a basic length to generate an IVY, and the 'Top_down Scheduling' is an operation for allocating a magnitude to each unit time in a top-down manner for a predetermined duration. Bottom_up Scheduling 'is the operation to set the total duration by Bottom_up method by calculating and taking the progress of each unit time. 'IVY_node_increment' and 'IVY_node_decrement' are operations that increase or decrease the node length of IVY by one. 'IVY_shift' is an operation that moves the calendar mapping location of the entire IVY back and forth before the start of the task. May fluctuate. 'IVY_split' is an operation that proceeds in succession to two or more subsequent IVYs in order to divide one IVY into two or more tasks during the progress of a task, and 'Calendar_mapping' converts the configured 'Net Duration IVY' into 'Calendar_mapped IVY'. 'IVY_graft' (414, 415, 416, 417) is a graft to set up a predecessor / successor relationship between IVY nodes, and 'ANT_estimation' is no longer reduced from the current to the end of the task. This operation calculates the Absolutly Needed Time. 'IVY_node_expand' is an operation to graft a specific IVY node as 'Unit Time Expanded IVY', which is a detailed unit time node IVY of the lower level, and 'IVY_node_shrink' collects node groups of a specific IVY as a long unit time IVY node of higher level. Longer Unit Time IVY ',' Progress_estimate 'is an operation that calculates the progress of a specific IVY node and the cumulative progress up to the corresponding IVY node, and' Buffer_setting 'is a Progress Management IVY of tasks having a predecessor / successor relationship. It is an operation that connects nodes between nodes with a graft and sets or coordinates spare days. 'Milestone_sliding' is an operation that moves the node positions of Milestones back and forth according to the progress of tasks, and '4D_display' is the unit time of measurement IVY. It is an operation that displays the progress status of the task as it progresses, and 'Present_Time_Line_set' (418) converts the unit time node including the current time to the current node. The previous node is set as the past node, and the subsequent node is set as the future node. Therefore, when the 'IVY_node_expand' operation is performed, the current node may be deployed to IVY including the current node, the past node, and the future node in detail unit of time.

Next, the configuration and use of the VINE will be described in detail with reference to FIG. 5.

Each facility or element constituting a production process or system of a specific function is represented as a node, and the physical connection and handling medium for them to interact and perform their functions. Or a data structure that represents the direction of the flow of an object as an arc and defines it as 'VINE'.

The direction of the arc is determined by the direction of flow of an object, such as a product such as a solid or liquid, a gas, a current, a signal, or a product in a physical form. Occasionally, in the case of partial bidirectional connectivity, the reverse connection is denoted by graft.

An example of a typical VINE is a production process of a target plant or factory that needs to be constructed or operated to achieve a set goal of a project or task, or supporting systems such as power systems, steam systems, compressed air machines, cooling water systems, and air conditioning systems. In the case of (Utility / Supporting System), 'VINE' which represents each equipment (Equipment / Facility) of the process or supporting system as a node, and shows arcs for the preceding and successive connections between the facilities. Can be. In general, VINE, which represents the main process or various supporting systems, is generally long in length, and in the case of batch process or intermittent process, it may be short or consist of one facility.

As a special VINE, you can configure a VINE that represents the flow of logic. In this case, it is separately called 'Logical VINE'. Examples of logical VINEs include a flow chart for computer programming, a start-up / shut-down sequence of a process facility or a system, and a block diagram showing a process of producing a product.

As a kind of node constituting the VINE, a virtual 'Root Node' to a 'Start Node' representing a starting point of the VINE and a '501' node (501) and one or more child nodes or successive nodes (Succeeding) A general 'equipment node' with a node) (502), a 'branch node' node (503) representing a branching point of a process or system or circuit, 503, a 'joining node node' node (504) representing a confluence point, and 504 'Compound Node' representing 'Facility' that can be expanded into a separate detailed VINE that shows detailed configuration according to the 'Compound Node' (505), and 'Piping Node' representing the pipe of the pipeline. (506), 'Cable Node' representing the cable of the line (507), 'Duct Node' representing the doc, 'Component Node' representing various elements of the circuit, such as Vent (508) and Drain (509) 'Dangling Node' or 'Attached Node' in the form of hanging on the main VINE stem (510, 511), depending on the characteristics of other processes, systems and circuits, it is possible to create and add a node with a name indicating its function.

The measurement control circuit necessary for each process, system, and facility is also composed of separate VINE, common power (P: Source) and Ground or Neutral (N: Sink), measuring instrument, Sensor, Transducer, Actuator, Controller, terminal terminal and Circuit elements such as terminal points, various relay and relay contacts, electronic switch and switch contacts, various switches, and display lamps (hereinafter, collectively referred to as 'elements' or 'measurement control equipment') are represented as nodes. The connection cables between the devices are not shown separately unless specification or distance is used or managed for the target management.

Each Vine is given a unique name (512), the name of the Start Node uses the name of the VINE, and the number of the Virtual Start Node is 0. Each node within a VINE is also given a unique name and node number within that VINE. The node numbering system is configured in the form of serial numbering or a preceding / sequential relationship depending on the characteristics of the process or system represented by VINE. Each node's PPN can be as simple as possible to maintain uniqueness, and the simplest form of the PPN can be 'VINE_Name / * / Node_Name'.

When a plurality of facilities or devices having the same specification exist in the stand-by or in parallel, the denominator is a constant or an array variable expression '[n]' representing the total number of the equipment 'n' in the common name of the equipment. A suffix of the fractional expression '_i / [n]', which represents the serial number 'i' assigned to the equipment, is suffixed so that each equipment node can have a unique name within its VINE (513, 514, 515). . Pipe or cable nodes of the same specification that can exist in a large number of places are used by using common names such as 'Pipe' or 'Cable', and constructing a PPN including the equipment nodes connected to the front, and using them as node names.

Each VINE constructs a specific VINE-specific BDT that systematically classifies the VINE facilities by type, and grafts it to the root of the VINE. All leaf nodes of the VINE-only BDT are also included in the Master Facility BDT, and may differ from the Master Facility BDT. If nodes representing the same equipment or variables belong to different plants, they are called 'Alias Nodes'.

Each node of the VINE can be grafted by constructing a Node Attribute SHRUB, which systematically classifies attributes of a facility or device and stores them as values of nodes. All VINE nodes have basic attributes such as the connected back and forth facility information, that is, the number of preceding nodes, the number of PPNs and successive nodes, the number of PPNs, the total number of grafts, the number of grafted nodes, and the alias node information. Store as a value.

In addition to the basic attribute values, in the case of VINE Nodes representing the production process or system, the position coordinates and orientations on the drawing or monitor screen indicating the physical position coordinates and orientations, the schematics or the physical layout of the equipment, and the orientations, 3D models, and symbols. And applicable, such as magnitude, preceding facility (s) of the facility, inputs and outputs externally connected, or changes in the physical or chemical state of media or products within or through the facility. Function or role information of the facility, operation method and operation status monitoring standard of the facility, real-time operation and operation status information, installed instrument information and real-time measured value, 'control logic information' causes and types of alarms, failures Cause and Type of Emergency Trip, Ripple Range Information, Start / Stop Sequence, 'Type of Input Energy' by Equipment and Standard and Actual by Type And stores a confidence, more attribute values, such as the determination and the actual value, driving history, and reliability information of various performance indicators. In the case of a node in which aliases exist, attribute information to be stored may be different for each alias. The NAS is also grafted to each node of the VINE-only BDT so that the functions and performance related information, statistical information, and the like in the VINE of the corresponding facility or device, such as common specification information, maintenance history, and reliability information of the corresponding VINE facility or device, Store and manage comparability information between similar facilities.

The 'control logic information' may be stored by grafting a VINE representing a control logic circuit of a corresponding facility to a node of a corresponding attribute concurrency of the corresponding facility. In case of VINE node as relay element of control logic circuit, contact information for driving the relevant relay and excitation status information of relay, and information such as current position of switch in case of change over switch, scope of task of target management (Scope) and save as needed.

The type of input energy for each facility includes secondary energy such as basic energy such as power, coal, oil and gas, and steam, compressed air, vacuum, cooling water, fruit, cold, and heat generated by basic energy. Include all energy.

By configuring VINE to include the connection status, interaction, and function information of each facility or elements as described above, the target management platform enables the target management platform to operate or operate the respective components or elements of the process, system, or circuit represented by VINE. It is possible to evaluate the validity and adequacy of the system, to logically trace the cause and spread of the abnormal situation such as alarm or emergency stop, and to estimate the loss of pipelines or lines. . Therefore, VINE enables the implementation of 'Digital Twin' of the process or system to be represented.

Next, VINE will be described in detail by taking a typical manufacturing process line as an example. Starting from the root node that symbolically represents the starting point of the process, it designates one main path that leads to the main facility nodes and reaches the last node, connecting the facility nodes along the main path. Proceed with the configuration of VINE. When a junction is encountered in progress, it creates a 'branch node' at that branch. Each branch node stores the number of nodes and the node name as attribute values, and additionally sets the 'branch stack', and pushes and stores the node name of the path to be traced last among the nodes branched from the branch point, and preorders. Depth First Search (DFS) search continues with the creation of the next subsequent installation nodes along the main path. When it reaches the last node (514, 515), it climbs back track in the reverse direction to the root / start node again along the configured path. If no branch node is created, it is raised to root node and the configuration of the VINE is terminated. When encountering the branch point node created when going down in the back track process (503), POP the Node Name of the highest path in the stack set in the branch node node, and again along the branch path like VINE node generation method in the main path Create subsequent nodes, proceed to Last Node, and backtrack. If you create a subsequent node and descend and rejoin the original path that branched, the node will be changed to a 'junction node'. Finally, when the stack of all 'branch nodes' is emptied and returned to the root node of the VINE, the configuration of the VINE is completed.

If there is a path that returns to the upper path of the process or the system itself, such as a minimum flow or condensate recovery line, the path is joined using a graft (518) to prevent the formation of a cycle in the VINE. . The corresponding graft information is stored in the attributes of both joining nodes, and it can be determined that the corresponding path connected from the PPN of each node to be stored is the return path.

In the case of sub-process or supporting system VINE, which starts separately and joins the main path, the root nodes are grafted to the root node of the main process VINE so that the relationship between the main process and each sub-process and supporting system can be known. 520)

Since the PPN of typical VINE Nodes is longer, only those nodes that need to be explicitly represented for inference for goal management are included in the path, and the remaining nodes are omitted. In its simplest form, a PPN may consist of only two explicit nodes, such as 'VINE_Name / * / Node_Name'.

Nodes in a natural tree structure, such as an internal power distribution system of a factory or building, do not specify a main path separately and follow Nodes in a way similar to 'Breadth First Search (BFS)' in the form of a one line diagram. It creates and inputs, and connects cables or bus to store phase number, phase name and neutral line information as attribute values. In the case of the distribution panel, it is represented as a composite node, and when the detailed connection information is needed in the reasoning process for goal management, the detailed structure of the distribution panel is displayed by expanding to the lower detailed VINE. Facilities connected in parallel, such as self-powered facilities for power generation, photovoltaic facilities, and energy storage devices (ESS), form a VINE separately and connect them to the confluence points by graft. Examples of the confluence node Node may be a facility node such as an automatic transfer switch (ATS) or a closed transition transfer switch (CTTS).

Typical operations for VINE include 'analyze_Trend', 'check_Consistency', 'display__Schematics', 'display_VINE', 'display__3D_Layout', 'display_4D_Layout', 'estimate_Losses', 'estimate_Operational_Cost', 'estimate_check_Reliot' operations such as', 'find_Bottleneck', 'monitor_Idling_Facility', 'monitor_Operating_State', 'monitor_Start-up_Sequence', 'monitor_Shut_down_Sequence', 'monitor_Performance', 'expand_Compound_Node', and 'shrink_into_Compound_Node'. The purpose of each operation is described separately according to the corresponding name. Specific implementation contents may vary according to the characteristics of Project / Task.

In the case of an internal distribution system in a factory or building, you can additionally configure operations such as 'monitor_Power_Quality', 'monitor_Peak', utilize_Time-Of-Use-Rate, 'stimate_Cable_Loss', 'estimate_Transformer_Loss' and 'estimate_Motor_efficiency'. The monitor_Power_Quality 'operation can be further divided into detailed operations such as' monitor_kW', 'monitor_kVar', 'monitor_Voltage', 'monitor_Phase_unbalance', 'monitor_HFD', 'monitor_Power_factor', and 'monitor_Neutral_Current'.

Next, the specific configuration and use of BUSH will be explained.

 In various systems in which equipment or elements for performing a specific purpose function are connected to each other and data or objects can be moved in both directions, each equipment or element is represented as a node. It configures Data Model or Data Structure that shows the connection relationship as an edge and is called 'BUSH'.

The BUSH aims to represent all the remaining systems and networks that are not included in the definition and characteristics of VINE described above. Typical examples include various computer networks, a processor, a memory, a disk, a port, a keyboard, a monitor, and various peripheral devices connected to a bus, a measurement control circuit for two-way communication, various traffic and road networks, And BUSH representing a national electric power system.

Examples of the equipment and elements constituting the node of BUSH include various servers, PCs, network equipment, and measurement control equipment in the case of the computer network system BUSH. More specifically, mainly network equipment, Main Server, other servers (Back-up Server, DB Server, Web Server, ERP Server, MES Server, SCADA Server, PI Server, etc.), PC, Network Switch, Router, Access Various network equipment such as point and router, specialized network of lower level measurement control equipment, data collection and control equipment such as DCS or PLC for measurement / control, and control panel of various sites connected to these measurement / control equipment , Sensors, instruments, transducers and relays, their connecting points, and facilities connected to the ports of the main server and other servers. The national grid system BUSH includes power plants, transmission line installations, distribution line installations and loads.

In the case of the server node or the PC node, it may be expanded or expanded with the detailed configuration BUSH as a “compound node”. In this case, the processor, bus, memory, hard disk, and peripheral devices may be configured as detailed BUSHs that are entities, or nodes, and may be expanded as they are or included as part of the original BUSH, or grafted to the corresponding compound node. If the measurement control equipment requires detailed configuration information of PLC ladder or DCS internal circuit or logic, designate PLC or DCS as compound node and expand to VINE or BUSH according to the circuit configuration. Graft to the DCS node.

The connection relationship between the facilities or elements includes wired and wireless connections, and when necessary for the purpose management, the connection relationship is explicitly expressed as a node similar to the pipe or cable in the VINE, and other devices or elements to be connected. Include or omit it in the node's properties.

BUSH includes 'Configuration BUSH', which is configured according to the geometry or schematics of the system to be represented, and 'Adjacency BUSH' to represent other facilities or elements directly connected to each facility or element.

The configuration of the 'Configuration BUSH' will be described using a typical Computer Intranet as an example. First, a root node that symbolically represents the starting point of BUSH is set, and any 'Center of Universe (COU) Node' which is the center of configuration or connection of the system among the facilities or elements is established. Select to be a Level-2 child node of the root node. Next, the equipment or elements directly connected to the COU node are set as Level-3 child nodes of the COU node, and the equipment or elements connected to each child node are continuously generated as child nodes in a DFS manner. Proceed as above, and return to the COU Node is completed 'Configuration BUSH'.

The 'Adjacency BUSH' is different from the traditional tree in that the parent structure of the tree is reversed because the same Level-2 nodes can have different Level-2 nodes as mutual child nodes. First, set up a virtual root node and set all equipment or element nodes as level-2 child nodes of the root node, and connect other adjacent level-2 nodes to each child node of the level-2. The configuration is completed by connecting to the Level-3 child node of each Level-2 node. If each node is connected in a complex way like many-to-many, and the physical shape or configuration does not provide additional information, it is possible to configure only 'Adjacency BUSH' without configuring 'Configuration BUSH'.

As in VINE, each node of BUSH is also grafted to the root node of the BUSH by constructing a dedicated BDT of the BUSH that is divided into subdivisions or subdivisions.

Graft Node Attribute SHRUB (NAS) that stores and manages attribute information of corresponding node in each Node of BUSH. The NAS basically includes the node's serial number, address, name, function, specification, symbol, shape or shape, physical location, location on the drawing or screen, and child node. Alternatively, store Adjacent Nodes and Graft information. Each node name, in the case of Computer Network System BUSH, uses general names such as COU, Server, PC, Network Switch, Router, and Bus as part of the Node Name to distinguish the functions or characteristics of the node.

In the case of a server node, in addition to the above basic attributes, service information such as Web service, FTP, and email, and ERP, MES, FMS, SCADA, PI Server, Electronic Document Management System (EDMS), and Enterprise Content Management System (ECMS) When interlocking with the same server type and function, and various project management tools, design integration tools, and engineering software, data contents exchanged with data communication methods or protocols are stored as attribute values.

The configuration of the platform of the present invention, which is built for the goal management of Project / Task, is also represented as BUSH, and can be included in the Super Tree to be managed together, thereby managing the platform's own configuration, function and performance, as well as linking with other servers. And centralize the management of goals through the exchange of information.

Dedicated operations to BUSH include operations such as "display_BUSH", "display_Schematics", "monitor_Operating_State", "expand_Node", and "trace_Path".

For example, in the case of BUSH, which represents a computer network system, operations such as 'show_Protocol', 'expand_Compound-Node', 'monitor_Traffic', and 'trace_Communication_Path' can be exemplified. monitor_Response_Time ',' monitor_Page_Fault ',' monitor_Port ',' monitor_Program_Behavior ',' monitor_Virus ',' monitor_Hacking ',' monitor_User-behavior ',' serve_User_request ',' optimize_Time_Quantum ',' optimize_Working_Set_Size ',' optimize _'_ ache_Start Detailed operations such as monitor_System_Call 'and' monitor_Background_Program 'can be added.

The purpose or function of each operation is the same as the name of the operation, and the specific contents and the method of performing the operation may be different according to the field and characteristic of the Project / Task. For example, the 'trace_Path' may be defined as an operation for searching for all paths (except cycles) existing from any start node to any destination node in BUSH, and define Adjacency BUSH. As you expand, you can do this in three steps:

Step 1. Select the Start Node among the Level-2 nodes of the Adjacency BUSH to search the path and set the loop variable 'i' to 2.

Step 2. For each Level (i + 1) child nodes of the set Level i node

(1) If the child node is the starting node or a node already included in the PPN path from the immediately higher parent or starting node to the current child node, the child node prunes.

(2) If the Level (i + 1) child node is a destination node, the 'Plant Path Name' (RPPN) from the starting node to the destination node is included as one of the found relative paths.

(3) For each of the other Level (i + 1) child nodes, copy Level 3 child nodes of the node and connect them as Level (i + 2) child nodes, and increment by i = i + 1. Repeat Step 2.

(4) If there are no other child nodes in (3), go to Step 3.

Step 3. Report all relative paths found.

 The path search of the three steps is performed by Depth-First Search (DFS) method, and step 2 (1) naturally excludes Cycling of the search process. You can easily find the minimum cost path by allocating the cost or distance to each edge and pruning the path that is more expensive than the minimum cost found during the path search. As described above, the Adjacency BUSH that is extended to track all the routes from any departure node to the destination Node in BUSH is called 'Expanded Adjacency BUSH'. The method of performing the three steps of the 'trace_Path' operation is also implemented as a 'rule' which will be described later in order to express the contents explicitly.

Next, the configuration and use of the SHRUB will be described in detail. 6 and 7 show examples of the configuration of a NAS (Node Attribute SHRUB) and a Rule SHRUB, respectively.

Computation and Estimation, Reasoning and Inference, and Management to perform the tasks that are instructed or given by PM and basic tasks related to the goal management of the platform for the purpose of Project / Task. Create root nodes that represent and represent methods, processes, and rules, and classify or refine the operations, reasoning, and management actions or objects starting from the root node. We create a tree-type data structure that creates child nodes or candidate groups of child nodes, and defines it as 'SHRUB'.

As a basic SHRUB, there is a 'Node Attribute SHRUB' (NAS) that grafts each PLANT Node to store and manage attribute information of each PLANT Node including the SHRUB itself. Each attribute node constituting the NAS can directly store the attribute value, connect child nodes that subdivide the attribute, and graft other PLANTs related to the attribute.

For example, Task Nodes at each level of detail of the Task BDT include 'Nature (Activity of Node) Node', 'Progress Management Node', 'Deliverable Management Node', 'Resource Management Node', 'Cost Management Node' and It is possible to graft NAS including nodes such as 'Event Management Node', and again, each attribute node may have child nodes subdividing the attribute, or a separate management SHRUB including the detailed attributes may be grafted. have. For example, the 'NOA Node' includes Task Management SHRUB for managing the overall and common information of the task, such as execution period, budget, details, present situation data, time tag, and person in charge of the task. You can graft.

The Task Node also grafts 'Progress Management IVY' to manage the progress of the task, and also grafts the NAS to each node (assuming 'Day Node') of the grafted 'Progress Management IVY' (601). NAS that grafts to each IVY node of Progress Management IVY 'is a' Self Information Node '(603) for managing the information of Day Node itself such as Project (Master) Node Number (602) and Graft information of the corresponding' Day 'Node. And nodes such as 'Daily Progress Management Node' (604), 'Deliverable Management Node', 'Resource Management Node', 'Cost Management Node' and 'Event Management Node' for managing the progress and progress of the task. And descendant nodes containing detailed information.

In addition, the nodes that need to manage the detailed progress or the situation according to the progress of each of the Management attribute Node nodes are grafted IVYs of detailed time units such as 'Hour' IVY 609 or 'Minute' IVY. Graft NAS to each node of IVYs in detailed time unit (610) to collect detailed task management information such as count, average value, maximum value, minimum value, latest value and standard deviation of data collected continuously in real time. Store and use them as attribute values.

For example, among the 'Daily' Management-related information, the Progress Management-related information includes the 'Daily Execution Schedule', which is a task execution plan of the corresponding day that is already established, and the actual that is established at the start of the day, reflecting the actual resource availability of the day. The NAS includes the execution plan, 'Daily Actual Execution Schedule', and nodes representing the 'Daily Actual Progress' value, which is the actual progress progressed on the day.

In addition to the Task BDT, each node of Facility BDT, Resource BDT, VINE-only BDT and BUSH-only BDT also grafts NAS including target management-related information, and IVYs for progress, schedule, and operation status management.

As other SHRUBs, 'RULE SHRUB' is grafted to the property of Rule Name Node of Rule BDT, and 'QUEUE', 'STACK', 'LIST' and ' TABLE '.

The 'QUEUE', 'STACK' and 'LIST' are implemented as 2-level SHRUBs. The root node stores the types, names, and number of child nodes as attributes, and the child nodes represent each element. In the case of nested lists, it is represented as SHRUB whose level is increased by the descending depth. In case of general 'TABLE' or other 2-D array, each column's name, number, and number of rows are stored as attributes in the root node, and each level-2 child nodes of the root node are each row. Level-3 child nodes of each Level-2 child nodes represent each column of the corresponding row. Therefore, the number of child nodes of the root node becomes the number of rows. Tables and arrays of 3-D and above are configured in the same way by increasing the level of SHRUB.

As a dedicated operation applied to SHRUB, operations such as 'Node_Eval', 'Rule_generate', 'Fact_Assert', 'Rule_invoke', and 'Rule_execute' are defined. In particular, in the case of QUEUE, 'Arrive' and 'Depart', in case of STACK, 'Push' and 'Pop', and in case of List, 'take_Next' for accessing the next element from the present location (Present Location) and For example, 'take_nth' for accessing an arbitrary nth List element, and for tables, define operations such as 'take_ij_th' for accessing an element of 'Column j' in 'Row i'.

Depending on the implementation language of the platform or target management system, the node name (including the given name, PPN, STPN and RSTPN) itself can have a value as a variable, and the value of the node by including a 'value' node in the NAS. Save or express' Expression 'that can be Evaluate including' Eval Expression'Node in the form of List or 'ORE (Order and Request Expression) STEM' and return the value of the List. It may be. When the Node_Eval evaluates a specific node name, the node returns a value that the node has as a variable, returns a value node included in the NAS of the node, or expresses an expression of the expression node. Evaluate to return a value.

The 'Rule_generate' operation indicates and implements specific methods and knowledge for handling the basic tasks and functions of the platform and requests from the PM or Team members or other managers or related parties. It is an operation to organize the rules into SHRUB.

Every Rule is a method, process, and know-how that is determined objectively or subjectively to handle the instructions given to the platform, requests from project / task participants, and the basic functions or tasks of the platform. An expression of knowledge and information, including how, to express its contents explicitly, to update it freely, to include it in the Super Tree as a consistent and unified framework, and to use it for goal management. Implemented as SHRUB of Super Tree. The SHRUB representing the rule is called 'Rule SHRUB' or simply 'Rule', and the name of the rule is the same as the name of the root node of the rule SHRUB.

The root node 701 of Rule SHRUB has two left-hand side (LHS) nodes as conditional parts and a right-hand side (RHS) node 703 as an action or execution part (703). Has a child node The LHS and the RHS may be a 'condition part' and an 'action part', or a 'premise part' and a 'conclusion part', or 'antecedent part', respectively. Also called the 'Consequent Part'. In the case of a rule that is executed without condition when called, it may consist of only RHS without LHS.

The 'LHS Node' and the 'RHS Node' each have two or more child nodes. If the condition part of a rule contains only one condition, the node itself becomes an 'Implicit' LHS node, that is, a condition node without explicitly creating an LHS node. The node itself becomes an implicit RHS node, that is, an Action Node, without creating a.

A rule can include additional rules directly or execute in conjunction with a graft to specify the action to be performed by the rule. Nodes that play a role as a root of a rule that is directly included internally are called “Internal Rule Nodes.” “Internal Rule Nodes” also have LHS Nodes 705 and RHS Nodes 706 as child nodes. Also, the rule node for grafting additional external rule is called 'Rule Graft Node' (707).

Types of 'Rule SHRUB Node' constituting the rule include 'Root Node', 'LHS Node', 'RHS Node' '' If Node ',' Then Node ',' Else Node ',' Internal Rule Node'Rule 'Graft Node', 'End Node', 'Exit Node', 'Go_to Node', 'Wait_on_Condition Node' and various 'Operation Nodes' (also called 'Performing Node' or 'Acting Node'). The 'Then Node' may be further classified into detailed types such as 'Then Node' or 'True_Then Node' (Default), 'False_Then Node', 'Else_Then Node', and 'Case_Then Node'.

Like other SHRUB nodes, the 'Rule SHRUB Node' has attributes (708, 709), the number of child nodes, their name, the 'Eval Expression' (710, 711) of the node, It contains logical conditions and graft information that must be satisfied between child nodes. The logic conditions include 'AND', 'OR' and 'ALL'. 'All' is defined as a logic for evaluating each child node regardless of the Eval result.

The 'Eval Expression' may consist of a simple traditional List expression not represented by SHRUB or may be a name of a specific 'STEM'. The first element of the list could be an arithmetic operator, a logical operator, or an SP expression to indicate a particular action, or it could be the name of a function of the associated software package or tools, such as statistics or a mathematical software package. The second element or less is composed of one or more Arguments such as STPN to STPN Template to express the object and value or result of the operation or action. Lists can also be nested. Examples of typical SPs representing the behavior used in the Eval expression of the List type include 'Assert', 'Go_to', 'End', 'Set_as', 'Put_in', 'Take_next', and 'Take_nth'. When evaluating a list, the operation or instruction is executed directly.

If each Rule SHRUB Node is 'Eval', like other SHRUB nodes, if the node is a variable node that has a value, the value is returned. Otherwise, the 'Eval_Expression Node' is an attribute node of the node. 'Eval_Expression' of 'is evaluated and executed according to its contents and the result is returned.

 Rule is configured as a template rule that uses path variable expressions to be used as universally as possible according to the contents of missions and operations, and it is possible to execute execution by replacing variables with specific values or expressions when called.

Subsequently, when a graft is formed between the two nodes represented by the aforementioned 'ORE STEM', the expression of the corresponding graft path is expressed as 'PPN // (PPN of the Grafting Child Node) of the Parenting Node' in the forward direction. In this case, it is expressed as 'PPN ＼＼ of Grafting Child Node' (PPN of Grafting Parent Node). The Rule SHRUB for the implementation of instructions, requests, and platform basic tasks, and for specific implementation, is constructed as follows: (The attributes of each Rule Node are braces, and the comments are parentheses ( Parenthesis)

Step 1. Root Node {Property: Rule call condition; A specific PLANT or STPN (number of node variables to be replaced and node variable expressions) of the node containing the information to be provided for rule enforcement; Return method of Rule execution result (Return method, presentation method and format, STPN or PLANT to store return value)}

Step 2. LHS Node and its Children Nodes {attributes: Type of node itself; Eval Expression (condition or operation or action to be satisfied); Number of child nodes; Name, number and type of child nodes, visit order of child nodes (Default: depth-first search (DFS)) and Eval conditions (AND, OR, ALL); About Graft}

Step 3. RHS Node and its Children Nodes {Attributes: Node own type; Eval Expression (mainly what to do); Number of child nodes; Names of child nodes; Number and type; Visit order of child nodes (Default: Depth-First Search) and Eval condition (usually ALL); About Graft}

The Eval Expression includes the substitution of a variable node for loop construction and an Assert 712 of an instantiated Fact, a method of reporting execution results (type and content, a means (monitor, smart phone, alarm)), a termination condition of rule execution, and It also includes an end instruction ('END') (713).

In the 'Fact_Assert' operation, when a value is input or set to a specific node of various PLANTs including the SHRUB of the Super Tree, the name and the value of the corresponding node are checked as 'Fact' or 'Advocated' as Fact. , Invoke and execute (expression as Execute, Fire, or Trigger) 'Rules' including the creation of the relevant Fact or the value of the Fact as the Invoke Condition. As described above, each ORE STEM can also be asserted as a fact.

Conditional expressions for invoking the rule include 'variable name node' expressions such as '? Task' or '? Day' for flexible matching with the asserted fact and the general use of the rule. It may contain wildcard expressions such as '&' that can match any single node expression, '*' that can match one or more node names, or path abbreviations such as '/../'. have. In the case of Fact including 'Variable Name Nodes', if the corresponding 'Variable Name Node' expressions are replaced with a specific Node Name, the Node and the entire conditional expression are 'Instantiated' and 'Assert' as a specific Fact. Becomes possible. In addition, as described above, in the case of a node that is clearly included in the corresponding path from the context of the path, all of the nodes may be omitted. As described above, a rule including a variable expression and wildcard nodes is called a 'template rule' for general application.

 The 'Rule_invoke' is an operation that calls a rule that satisfies part or all of the conditional part as an asserted fact, and the 'Rule_execute' visits each of the Rile SHRUB Nodes of the invoked rule sequentially from the root node to 'Eval' Is an operation to 'Execute'. If you want to call a specific rule, you can call Fact that meets the condition of the rule and call it through Match, or you can call it explicitly through 'Invoke' command.

When the 'Rule Graft Node' is Evaled, the Template Rule grafted to the Node of the same name in the Rule BDT is 'Dynamic Graft' to the corresponding Rule Graft Node and is instantiated to the context of the corresponding Rule Graft Node. Invoke.

If it is necessary to construct a loop that loops and invokes the rule itself in the rule, in the node of the calling position, the Fact included in the Eval expression of the node of the position to be returned is called 'Assert'. Alternatively, the 'Go_to' operation and the PPN of the node of the position to return to are directly specified. As described above, Fact_Assert that is executed to execute itself in a rule is called 'Local Fact Assert'.

When encountering a 'Wait_on_Condition Node' waiting for a certain condition to be satisfied, such as a situation where an administrator has to enter a specific value during rule execution, set 'Wait_on_Condition Flag' at the corresponding location and skip and proceed to the flag. The execution can be continued at the set position.

When the platform is started, the first 'Project Manager Agent' is created, creating agents that are in charge of each functional area of the platform.In addition, the 'Asserted Rule Invoking Agent' (ARIA) is created to invoke the rule. Create When a certain fact is asserted, ARIA invokes a rule that satisfies some or all of the conditional conditions due to the fact, and sequentially visits the root node and visits the rule SHRUB node, and then executes the rule according to the result of the evaluation. I'm going. Rule SHRUB Node visit is the default, and the rule SHRUB is visited in the order of Depth First Search (DFS) in order of prevalence, and ARIA is the 'Present Eval Node' for the node currently visiting for Eval. Rule execution is automatically terminated when all nodes of RHS are Eval.If rule encounters 'End Node' or 'Node' during rule execution, rule execution is terminated at the corresponding position.

As a result of the Eval of the 'Eval Expression', True / False, a variable value or an operation result value is returned, or the result value is asserted as a fact. In this case, if there is a rule that includes the asserted fact as part or all of the predicate, the rule is called and executed, and when the newly executed rule asserts a new fact, the rules are called and executed in series. 'Forward Reasoning' takes place. If 'Unknown' or 'Null' is returned as a result of evaluating a specific rule SHRUB node, ARIA finds a rule that can present the node value as a result of RHS execution and evaluates whether the condition is satisfied. The rule node value is acquired through backward reasoning. If manual input of a specific value is required to satisfy the LHS of a rule invoked in the backward reasoning, request to input the value directly from other managers including PM or Project team members or subcontractors, and the 'Wait_on_Condition' 'Set Flag.

'Rule Generation Rule' ('RGR') is constructed and used to support rule generation. Rules that perform the basic tasks and functions of the platform are implemented by the platform construction engineer and experts in the relevant field when building the platform according to the characteristics of the project / task. In addition, the rules for executing PMs and other managers' requests and requests are interactively configured with the platform manager or PM based on the STEMs created by 'ORE Generation BDT'.

The generated rules are grafted to the node of the corresponding rule name of 'Rule BDT' which is divided and subdivided according to the purpose, field or type of rule application, and 'Rule BDT' is a child node of 'Platform and Super Tree Management Node' of STUMP. Graft on 'Rule BDT Node'. .

As an example of STEM configuration and implementing rules using STEM, PMs provide high abstraction level instructions such as "Report every working day at PM 6:00 every task whose daily progress state is 'Delay'". Take the case of getting off the platform.

First, candidates of nodes and attributes are presented sequentially through the GUI presented by using 'ORE Generation BDT' and 'STEM Generation Rule', and the corresponding STEM is composed by receiving selection or input of specific nodes or attributes. . To represent both the main path and an attribute at the same time, the attributes are shown in braces '{}' :)

Depth 0 Node: STEM {RootIssue_Time: 'Present', Title: 'Task_Report_Order'Text_Expression: "Report every working day at PM 6:00 all tasks whose daily progress state is'Delay'", Orderer: PM}

Depth 1 Node: 'Report' (SP) {Report_Time: PM 6:00, Everyday except Holiday, Reporting_method: PC (Name) AND Hand_phone (Number), Report_format: Format_No}

Depth 2 Node :? Task (Target_Object) {Object_task: All_tasks in Task BDT (DFS with Postorder)}

Depth 3 Node: 'Daily_progress_state' (Variable) {Condition: (EQ? Task //? Day // Daily_progress_state 'Delay'),? Day: Today}

The input produces the following ORE STEM.

ORE_STEM_Node_Name (Node_Number: Number, Issue_Time: Present, Title: 'Daily_Delayed_Task_Report_Order', Text_Expression: "Report every working day at PM 6:00 all tasks whose daily progress state is 'Delay'", Orderer: PM} / 'Report' {Report_Time : PM 6:00, Everyday except Holiday, Reporting_method: PC (Name) AND Hand_phone (Number), Report_format: Format_No} / Target_ Object:? Task {Object_task: All_tasks in Task BDT (DFS with Postorder)} / State: Daily_progress_state { Condition: (EQ? Task //? Day // Daily_progress _state 'Delay'),? Day: Today}

In Figure 7, in particular based on the ORE STEM, shows the configuration of a rule for implementing the instruction. The composing rule is implemented as a template rule that includes a variable node expression for general use.

For the execution of the rule, the 'Eval Expression' of the conditional node that matches the Fact being asserted becomes (EQ? Task //? Day // Daily_progress_state 'Delay'). (707) The Eval Expression is a node variable. '? task' and '? day' are included, '? day' is replaced with the IVY Node Number of the day, and all tasks in the Task BDT are sequentially visited in a depth first search (DFS) manner. If '? task' is replaced with the actual task node name, the STPN is instantiated like 'Task-i // kth_day // Daily_progress_state' to enable Assert as Fact, and whenever Assert as Fact, Returning to the conditional expression, the process of checking whether the 'Daily Progress State' property Node value of the task is set to 'Delay' is repeated for all tasks. In addition, at 6 pm of every working day, construct a Rule that calls the Rule.

For the processing of the platform that should be performed regularly and continuously at the arrival of a specific time such as hourly, daily or weekly, when the specific time is reached, Assert 'Present Time' as Fact and subject to the arrival of the time. Invoke the rules to be invoked in order by including the RHS nodes in order, and define them as 'Timer Rule'.

As described above, the LHS Node and the RHS Node have both LHS Nodes and RHS Nodes, and any number of child nodes can be included.Each node constituting a rule, that is, 'Rule SHRUB Nodes' is the number of child nodes and 'Eval'. 'The method or condition is a property value of the NAS, and the Eval Expression of each Rule SHRUB Node can include node names represented by STPN, so it can represent and utilize the context information of the rule, and use the' Internal Rule 'in the Rule. It is composed of a combination of modularized knowledge by making it possible to include or graft other rules, enhances the generality of rule by constructing it as a template rule, and makes the rule itself to execute itself repeatedly. Rule '.

Super Rule can include LHS and RHS repeatedly in both LHS and RHS, and Rule execution proceeds from left to right in the DFS manner, and visits the Rule Nodes to evaluate the 'Eval Expression' of nodes visited. Node's Eval Expression can execute Fact included in LHS conditional part on the left side or loop execution using Go-To command, and if 'Eval Expression' is 'END', Rule execution at the corresponding position It stops, and when it returns to the root by evaluating to the rightmost node, it ends automatically.

The 'Super Rule' is a Super Rule by subdividing and modularizing the reasoning (Reasoning and Inference) to perform the tasks, instructions, requests, and platform functions of the High Abstraction Level into the 'Divide and Conquer' strategy. All nodes, internal rules, or grafted rules within the system share common contexts, enabling consistent and focused reasoning. Segmentation and modularization are possible up to each node level, and insertion and deletion of nodes can be used to freely tune or modify inference or judgment process and contents. Therefore, the problem of the conventional and distracting rule execution method, in which a large number of independent rules are chained randomly and executed, and the relationship between the fragmentary results generated by each rule and the ultimate purpose of the rules that are chased and executed is unclear. Can be improved. In addition, the combination of frequently used conditions or actions naturally includes the function of Rete Algorithm to improve the inefficient rule execution method by repeatedly testing the same conditions by using the expression jointly through Internal Rule or Rule Grafting. In addition, the Super Rule can be composed of a combination of modularized rules, which can simplify or automate the 'Rule Generation' process, and can include a loop that repeatedly executes the rule itself. Even if the number of tasks is large, it can be handled simply by a few rule executions.

Super Rule (Hereinafter, all information generated during the execution of 'Rule' is stored as a node of Super Tree which can be accessed by STPN. The node that stores the information is created by using an existing node or creating a new node. It can be added temporarily or temporarily, or the necessary information can be pruned or degrafted to the nodes after use, and nodes disconnected directly or indirectly from ROOT after Prune or Degraft perform garbage collection. In the case of a node that shows a condition or action for repetitive execution, when the rule no longer needs to be repeated during execution of the rule, the node is pruned by the rule that is instantiated, which is called 'pruning'. Template Rule is not influenced by 'Pruning' Rule returns 'Eval result' of Node's Eval result in execution process or Right_most Chi of RHS After ld's Eval is finished, that is, continue EVAL of DFS rule node and return to root node.

Rules are mainly used to perform basic functions and functions of the platform, to handle target management tasks that are to be repeatedly or continuously and continuously at a specific time, to perform PM instructions or tasks assigned from PMs, and to frequently occur events ( Organize, call, and execute for the handling of events or risks, and for handling inquiries, requests, recommendations, mutual information and exchanges of opinions and consultations with Project / Task personnel.

The purpose and result of the execution of the Rule is to investigate or search and confirm one or more specific information through inference or reasoning, to create, to estimate, to judge, or to determine information. Includes Decisions, Explanations, Reports and Presentations, and any other direct or indirect implementation of any necessary Measures or Activities. All information necessary for invocation and execution of Rue and significant acquisition information obtained as a result of execution are stored as Nodes in a location suitable for the context of the information in the Super Tree.

Based on the above-described Super Rule, an indication of a high abstraction level may be directly given to the platform, assigned as a mission, or requested by a service. As a result, unlike the conventional one-way menu methods (Paradigm) that PM and other Project related people need to know, find and use the path and function of Menu and Sub-menus in order to search or manipulate the information desired by PM or other Project related people, PM is a platform. Gives the user the desired instructions, assigns tasks or tasks, and other managers can directly ask the platform for what they need, allowing them to continuously and precisely manage thousands or even tens of thousands of tasks to be performed and managed simultaneously. As a result, SWEEP goal management techniques can be applied. In the present invention, a service providing method for directly instructing or requesting a high abstraction level, command or request from the platform is called a 'proactive and smart service' (PASS) method. do.

As described above, the goal management platform of the present invention, as described above, is a BOGMKI (Body Of Goal Management Knowledge and) which is a collection of all information and knowledge necessary for the basic process and goal management of Project / Task goal management. Information is composed of Super Tree, intelligent autonomous and active use of Super Tree, systematically divided and subdivided into tasks (Work, Work Package or Activity) of all levels of detail to accomplish the goal. Continuous and continuous according to the time precision of selecting the target management action of the platform that monitors and manages the progress and progress (referred to as the task of Project / Task itself). To be done. The platform continuously collects additional information or knowledge that is needed during the course of execution, responds to randomly occurring events or risks early, accumulates experiences, learns, and utilizes the future. Forecasts and responds, processes and proceeds with input from a PM or other manager as a quasi-natural language expression. The present invention uses a goal management method that continuously monitors, manages, and continuously monitors the progress of all tasks and events occurring during the execution of tasks. In the present invention, such a target management method is referred to as 'SWEEP' (Successive Work and Event Evaluation and Proceeding) target management technique.

Subsequently, the platform of the present invention uses the SWEEP goal management technique to describe the detailed method of utilizing the Super Tree and intelligently and autonomously performing the above-described five-step process.

Every 'Platform Task' is implemented as a rule to express its details explicitly, is executed by executing a rule, any information necessary for goal management and any information that is generated and stored in the goal management process. All information is stored and used as a node of the Super Tree.

When the platform is activated, the platform is the first step and enters the 'Project / Task Initiating and Basic Information Collection Stage' (S100). Create a general 'Project Manager Agent' in the form of thread or process. As described above, the Project Manager Agent creates professional agents that support and support each functional area of the platform as it is created, and additionally implements an 'Asserted Rule Invoking Agent' (ARIA) that oversees the invoke and execution of rules. Create The generated ARIA calls ' Project / Task Initiation Rule' and presents the 'Input Window' to receive basic information about Project / Task. Goal, ' Deliverable or State (collectively' Deliverable '), Performer to Owner, Project Manager (PM) or General Manager (collectively' PM '), Period, Overall Budget and Location Receives the entire basic information, such as from PM to configure the 'Project / Task Charter SHRUB' (211).

Enter additional basic information according to the characteristics of Project / Task. For example, in case of Plant EPC Project, Site location, area, Owner to Customer, Representative, Implementer, Execution Period, Inside Battery Limit (ISBL) and Project scope including OSBL (Outside Battery Limit) and related regulations.In the case of Smart Factory's production management task, the type of product, production target by each type, quality standard and target deadline In the case of energy management task, there are baseline and calculation basis of energy use by energy to be saved, routine and non-routine adjustment items, and energy saving method. In the case of the power system operation management task, the target power supply reserve rate, the frequency variation rate and the voltage fluctuation rate may be mentioned. In the case of the computer operation management task, the average response time and virus Examples of security maintenance goals include infection prevention and hacking defenses.

The input window, along with expressions such as 'What can I do for you?' And 'Please input your order or request.', Allows the PM or other administrators to directly enter the desired 'Platform Task' without searching or selecting Menu or Submenu. Drop-down menu such as 'Create New Project / Task' and 'Continue Project / Task (Name)', and input support service that completes the rest when text is input. To provide. When instructing 'Create New Project / Task', the vertical or vertical template of 'Project / Task Charter SHRUB' of the relevant field, which is configured by field according to the name and field of the project / task input to create It is presented as a horizontal Tree structure and provides a GUI for selecting, adding, or deleting nodes. If a specific node is selected with a mouse, the value of the node can be entered directly or a template of 'Node Attribute SHRUB' (NAS) can be presented for input as an attribute value. When requesting 'Continue Project / Task (Name)', restore the previous target management progress context or environment by reading the pre-stored Super Tree in the format such as DB, Spread Sheet, or XML File. . The input window may also receive a verbal input of a brief expression, which will be described later, in the case of a frequently used instruction or request.

Subsequently, as a second step, a detailed information collection and super tree constructing stage based on the entire basic information received in the 'Project / Task start and full basic information collecting step' ( S101). First of all, among the basic structure skeletons of Super Tree for each Project / Task field that the platform builder has configured and saved with the help of experts in each field, select Skeleton of Super Tree for goal management of the selected Project / Task field. present.

The Skeleton of the Super Tree presented above is a platform implementation engineer and experts in the relevant field when implementing the Platform of the relevant Project / Task field, and the relationship between typical basic data, processed data information, and information related to the execution of the Project / Task. It collects knowledge, know-how, expertise, and methods to construct various PLANTs and grafts these PLANTs according to their correlations. PM cooperates with Platform to modify or customize Skeleton presented according to its management policy and task execution strategy, and forms detailed Super Tree for the goal management of Project / Task.

First, PM starts the concrete composition of STUMP, which is the basic framework of Super Tree, with Platform.

The root node of the super tree and the root node of the stump in the skeleton of the presented super tree are the 'Project / Task Charter SHRUB' 211 and the entire project / task execution period. ) 'Master Calendar_mapped Progress Management IVY' 212 is created and grafted to monitor and manage the target management progress indicated by connecting to a series of nodes (Default is 'Day').

Subsequently, add, delete or modify the major management nodes presented as child nodes of the ROOT, and customize STUMP to complete. Subsequently, NAS and various PLDTs such as BDT, IVY, VINE, BUSH, and SHRUB are composed by using the template of Skeleton and PLANT of Super Tree, which is also given to each STUMP Node. Each PLANT's configuration and Graft provide a GUI such as creating a node and dragging it with a mouse. In order to simplify the configuration of Super Tree, GUI can be selected or dragged to connect or graft not only individual nodes but all or part of PLANT.

For example, when configuring VINE, typical basic frame or sample for each VINE type is provided through GUI (Graphical User Interface) for input according to the characteristics of Project / Task. According to the specific production process, system or circuit configuration, provide symbol of each equipment and device node to menu, and when PM or manager in charge drags and connects them, the nodes and arcs of the corresponding VINE are created and simultaneously Schematic Drawing and physical layout are also composed. If a specific node is selected, Default property information of the equipment or device is presented in the form of Spreadsheet or Table and can be modified. The default property information can be entered manually or received through other servers or the Internet. Like the configuration of other PLANTs, the VINE configuration method expresses the contents explicitly and implements them as rules so that they can be freely modified and updated. 'Control Logic Information' of the whole process or system or each facility is composed of VINE representing the control logic circuit, and stored in the process or system or facility node directly or by grafting to the control logic attribute node of the NAS.

Following the 'Detailed Information Collection and Super Tree Constructing Stage' (S101), the third step enters the 'Task Scheduling Stage' (S103). When the PM issues a 'Crate Task Schedule' to the platform, the platform will call the whole and all detailed tasks to perform (also referred to as' Work 'Work Package' or 'Activity', as described above, depending on the field and characteristics of the Project / Task, The task BDT is classified and divided into hierarchical and sequential categories by sector or sector, and the PM is required to select a desired task node. When a specific task node is selected, 'Baseline Progress Management IVY', which is configured and indicates 'baseline duration' of the task grafted to the task node, is presented. Each node of IVY, that is, the reference unit time, is set to 'Day' as the default, and is described below based on 'Day'. The selection of reference unit time can be selected differently according to the characteristics of Project / Task, and each IVY node is deployed to lower detailed IVY nodes represented by detailed unit time 'Hour', 'Minute' and 'Second' Nodes as needed. (Expand), and the IVY composed of deployed nodes is grafted to the parent node. In addition, the entire 'Day' Node IVY is composed of the upper unit time 'Week', 'Month', 'Quarter' and 'Year' nodes to form a shortened IVY and to the shortened Start node of IVY. You can also graft.

There are two types of IVY to be presented: 'Net Baseline Progress Management IVY' and 'Calendar-mapped Baseline Progress Management IVY', which can be selected by each PM, Scheduling Engineer, or Qualified Task Manager. According to the characteristics of the task, first, the task progress plan is established with 'Net Baseline Progress Management IVY', then the Work policy for weekends and holidays is defined, and then 'Calendar-mapped Baseline Progress Management IVY' is developed based on the calendar date. You can create a schedule from the beginning, or specify a start date on the calendar and then develop a progress plan with Calendar-mapped Baseline Progress Management IVY. In case of making progress plan with 'Net Baseline Progress Management IVY' and converting to 'Calendar-mapped Baseline Progress Management IVY', mapping to calendar can be done by 'Forward Mapping', 'Reverse Mapping' and 'Bi- There are three ways of directional mapping. If the task is performed continuously without weekends or holidays, the two IVYs have the same length. Each node of 'Mapped Baseline Progress Management IVY' represents the number of days since the start of the entire project in addition to 'Self Node Number' and has 'Master Node Number' which is the Node Number of Master Progress Management IVY as an attribute value. 312)

The IVYs present in the form of a Gantt Chart that represents each node as a continuous quadrilateral node on a chart that spans the entire project / task execution period, or in the form of a chain that represents each node as a small circle. When presenting 'Net Baseline Progress Management IVY', the horizontal axis represents pure period / time, and when presenting 'Calendar-mapped Baseline Progress Management IVY', the corresponding calendar period is indicated with date.

 In the case of Plant EPC Project or Building Construction Project, the completion target period or time limit is the baseline duration. In the case of the factory's annual production target achievement task, one year is the baseline duration. If no period or time limit is specified, the baseline duration is determined to be appropriate in consideration of exceptions that may occur during the execution of the project / task.

At the bottom of 'Baseline Progress Management IVY' presented by the platform, a graph for progress schedule creation and input with the horizontal axis as the period or time and the vertical axis as the progress value is presented together, and the elapsed time of the baseline duration of the selected task. In other words, 'Task Finish Point' is displayed at the position where the Progress Value becomes 100% in the Last Node of 'Net Baseline Progress Management IVY'. Subsequently, 'unit time baseline progress value' and 'unit time baseline progress value' are calculated for each unit time node between the origin and the task completion point. The progress value can be calculated by using the S-Curve function (Sigmoid function) or Linear function in the top-down method, or by inputting from a separate file such as a spread sheet. When subdividing a task into a plurality of detailed tasks, each detailed task is assigned a weight value whose total sum is 1, depending on the importance, and assigned to the detailed task for the progress value of each detailed task. The progress value of the upper task is calculated as the sum of the multiplied weight values.

When the 'Unit Time Baseline Progress Value' is set as an attribute value of NAS grafted to each node of 'Net Baseline Progress Management IVY' of each task, the 'Unit Time Baseline Deliverable Completion' and 'Unit Time Baseline Deliverable' of the corresponding Deliverables are set. The cumulative completion amount 'is calculated or set together with the PM. Make sure that 100% of the completed Deliverables are 100% of the progress value.

The platform is the completion or completion state of the Deliverables corresponding to the progress value of each task (hereinafter, collectively referred to as 'completion amount') and progress, and the resources to be input to achieve the completion amount. Conversion between quantities is done with a rule to specify and indicate the content and method of conversion. On the contrary, the detailed progress value of the task is calculated from the quantitative value of the progress status of each Deliverable. As a result, the subjective judgment and input of the task manager are excluded in principle and the objectivity is maintained in calculating the progress value, and the platform can be established autonomously or actively for the task execution plan establishment and progress management.

As an example of specific 'Deliverables' and Deliverable Progress and Task Progress Estimation, for the Power Plant Construction Project, the entire Deliverable is a completed plant, training of Crew Members, and relevant documentation such as drawings and manuals. For example, the main detailed deliverable of the completed power plant deliverable is 'electric power facility', and again, the main transformer installation and completion status as one of the more detailed deliverables which further subdivides the electric power plant deliverable. Can be. The 'Peripheral Transformer Installation and Completion Status' Deliverable can be completed by performing the 'Peripheral Transformer Installation Construction' task, and the 'Peripheral Transformer Installation Construction' task can be started when the basic design is completed and subdivided again. 'Survey', 'dig', 'die', 'rebar', 'anchoring', 'concrete', 'concrete curing', and 'TR body installation' that can be performed after the transformer is procured and transported to the site , A series of detailed tasks such as 'Conservator and Bushing Assembly', 'Nitrogen Filling and Oil Fill', 'Cabling', 'Instrumentation and Control Wiring', and 'Test and Commissioning'. Can be broken down, and the finished product or completion state obtained as a result of performing each subdivided detailed task corresponds to 100% of the Deliverable's quantitative progress, and the corresponding detail from the quantitative progress value of each Deliverable. Quantitatively measure the progress of a task The calculated conversion.

According to the characteristics of Project / Task, resource BDT is created by dividing and subdividing required resources by type or division. Each detailed Resource Node stores the product information including quantity and cost information of the Deliverables that can be generated per input unit of the corresponding resource and the STPN of the tasks requiring the resource as attribute information, and the 'Supply Management' of the corresponding resource. Graft IVY '. Each node of Supply Management IVY of each resource includes the contract, transportation, goods receipt, warehousing and inventory status of the resource, and procurement status such as input plan and cost, actual input and cost for each task to be input. The node of the NAS which stores the input plan amount information for each target task of a specific day of each resource has a 'Resource Oriented STPN' whose Resource Name Node is higher in the path than the Task Name Node, Nodes of the NAS that store the input plan information of the corresponding resource of the day have 'Task Oriented STPN' where the Task Name Node is higher in the path than the Resource Name Node, and both nodes are mutually aliased by having the same value. The value entered in one node is automatically set to the value of another alias at the same time.

Subsequently, the amount and cost of each type of resource to be inputted to complete the unit time baseline Deliverable completion amount of each Deliverable are calculated based on Cost Estimation Standard information. The product information is divided into types of deliverables, constructs, stores, and utilizes a 'product BDT' including information on requirements and costs of resources to be input to complete a unit deliverable. The product information is based on the certified standard product information, and is configured to include any resource and adjustment rate information to be put in order to perform a project / task for goal management. Typical resource types include Manpower, Material, Equipment, Energy, Facility, and Time. The unit time related information is stored in the NAS of the mode IVY node, and the information related to the entire period is stored as attributes in the NAS of the root node of the IVY and the NAS of the task node.

 If a significant amount of time and resources are required for preparation before the production or production of the Deliverable, the preparation time and resources can be quantitatively counted as part of the Deliverable and included in the Deliverable Progress. However, if a specific preparation task does not lead to actual Deliverable's progress due to an unexpected event or cannot be utilized, the progress corresponding to the preparation task is rolled back to zero and the resources put into the preparation task are considered lost.

Examples of basic resources required for project / task progress include manpower, budget, and time. In addition, in the case of Plant EPC Project, design drawings, specifications, construction materials, construction equipment, installation facilities or devices, main processes And support system, site, space, and energy.In the case of Smart Factory's production management task, each product can be the quantity that meets the quality standard and cost for the target period, and in the case of the energy management task, This includes the energy, energy supply facilities, energy use facilities, and spaces. Computer operation management tasks include processors, memory, hard disks, peripherals, files, processes, and network facilities.

If a specific 'unit time baseline Deliverable cumulative completion amount' that can objectively check the progress status and give a corresponding progress value (%) in each task is an important meaning or turning point in performing the task, the corresponding cumulative completion Give a name and serial number separately and call it 'Milestone'. Therefore, each Milestone has a corresponding progress value. Therefore, when the progress is accelerated or delayed, the position of each Milestone is moved back and forth and the corresponding Milestone Node is changed. This is called 'Milestone Sliding'. In addition, the node whose progress value corresponds to a certain milestone in the Progress Management IVYs of each task is called a 'Milestone Node'.

In the case of task that can search the optimal length of Net or Calendar_mapped Baseline Progress Management IVY due to the characteristics of Project / Task, the length of IVY is incremented or decremented by GUI, and the corresponding unit time is changed whenever the length of IVY is changed. Task progress value and cumulative progress value, completion and progress value of Deliverables, cumulative completion amount and cumulative progress value, amount and cumulative amount of resources to be input, cost and cumulative costs, and total progress value of the whole Deliverable (100%) Calculate the amount of Deliverables, total input amount and total cost of each resource, and present the baseline reflecting the safe margin in consideration of various exceptions that may occur during the task with PM or other managers. Allows you to set a Duration.

Next, to complete the corresponding 'Unit Time Baseline Deliverable Completion' of each Deliverable for each unit time, the 'Unit Time Actual Resource Input Plan' considering the actual input unit of each resource to be inputted, PM or other managers It decides autonomously by making a decision together with the decision or by the platform, and presents the decision to PM or other managers. For example, if the input resource is manpower, even if the baseline input amount was calculated as a real number containing a decimal point, if the actual input unit should be an integer man-day, it should be input as a man-day integer value that rounds off the decimal point. This time, the 'unit time Deliverable Actual Completion Target Projection' is calculated by inverting the unit time Deliverable that can be completed with the 'unit time actual resource input plan', and the corresponding 'Unit Time Execution Progress Plan Value' and 'Unit Time Execution Progress' To cumulative planned values. The cumulative unit time execution progress plan value always sets the unit time deliverable actual target plan amount and the corresponding unit time actual resource plan amount so that it is always larger than the unit time baseline cumulative plan value.

The point of time when the cumulative plan value of the unit time execution progresses to 100% is defined as the execution goal duration of the task. In order to manage the actual progress of the task during the 'Execution Goal Duration' period, 'Actual Progress Management IVY' of the corresponding Duration length can be separately configured and grafted to the task node for management. . Since the performance progress was planned to be ahead of the baseline progress, the length of 'Actual Progress Management IVY' is shorter than the length of 'Baseline Progress Management IVY', and the difference period between the two IVYs, that is, the spare period, is defined as the 'Internal Buffer' of the task. '

Next, set up the predecessor / successor relationship between tasks. The predecessor / sequence relationship between tasks is established by grafting between nodes corresponding to the milestone progress of the Task Management IVY, that is, milestone nodes. The predecessor / successor relationship between tasks includes a typical finish-to-start graft that grafts the last node of the preceding IVY to the start node of the subsequent IVY, and transfers a specific milestone node after the start node of the preceding IVY to the last node of the subsequent IVY. Start-to-Finish Graft grafting to a specific Milestone Node that has a follow-up relationship, Start-to-Start Graft grafting to a Start Node of a subsequent IVY to a specific Milestone Node after a Start Node of a preceding IVY, and Last of a preceding IVY There is a Finish-to-Finish Graft that grafts a Node to a Milestone Node that is a successor to subsequent IVYs. Accordingly, each IVY may have one or more preceding / following relationships among four preceding relationships or four subsequent relationships in the preceding / following relationship with other IVYs, and may also have a preceding / following relationship with one or more other IVYs. The four kinds of preceding / successive relationship setting using Milestone Nodes enable sophisticated management of buffer (float or float), progress management, and critical path and duration management.

Each of the preceding and subsequent grafts has a buffer period of a unit time subtracting 1 from the difference between the 'Master Node Number' of the preceding IVY node to be grafted and the 'Master Node Number' of the subsequent IVY node. The Buffer is referred to as 'Feeding Buffer' from the viewpoint or perspective of the preceding task, and the Receiving Buffer from the viewpoint or viewpoint of the subsequent task. Each of the above buffers is managed by two types, a 'Net Buffer' representing a net free period and a 'Calendar Buffer' simultaneously representing a date and a period of a specific calendar. The length of the 'Calendar Buffer' is the same as or longer than the length of the 'Net Buffer', depending on the weekends and public holidays.

In particular, in the case of 'Finish to Start' leading / sequential relationship, the preceding task is called 'Succeeding Task Feeding Buffer'. Subsequent tasks are called 'Preceding Task Receiving Buffer'. Therefore, the chain of tasks whose length of 'Succeeding Task Feeding Buffer' is 0 becomes the critical path over the entire project / task execution period. Each task can be 'Late Finish' which is delayed by the length of task's shortest 'Feeding Buffer' without affecting other related tasks. 'Early Start' is possible. Even if 'Early Start' is available, if there is a Milestone whose Receiving Buffer has a length of 0, if the Milestone of the corresponding preceding task cannot be advanced, it cannot be 'Early Finish'.

Establish and establish a Baseline Schedule and Execution Schedule for all level of tasks, including progress planning for each unit time, Deliverable Completion Plan, input resources and cost plan All information is stored directly as an attribute of the IVY Node or as a node value of Variable-valued IVY that is grafted to a node representing the schedule name of the NAS of the task, and each information is a unique STPN (Super Tree) of the node. Node can be accessed.

The task schedule establishes up to a detailed task or activity level selected from task nodes of a TASK BDT according to the characteristics and scale of the project / task.

In the case of a plant EPC project, up to the task scheduling stage (S103), in order to prepare an optimal IBT (Invitation to Bid) or RFP (Request for Proposal) of the client or the owner, or engineering and construction Companies can also be used to assess bids, prepare bids, and prepare bids that take into account their mobilizable resources and costs for specific IBTs or RFPs.

Based on the task execution plan established in the task scheduling stage (S103), the fourth stage, 'Task Performing Stage' (S104), is entered to perform target management of the Project / Task. Start and proceed.

 The ultimate goal of all Project / Task goal management is to achieve the goals you have set for your plan or beyond. Therefore, the core of all goal management activities is to continuously monitor and manage the progress and progress of all tasks to be carried out throughout the whole process of goal management, and to successfully complete the project / task. To achieve the goal. The following describes how to perform the task mainly on Plant EPC Project or Smart Factory Production Management Task, and the method and principle can be applied to most other Projects / Tasks as it is.

Progress management of each task aims to execute or execute execution schedule, and baseline schedule is managed as deadline. The progress of each task manages the progress and cumulative progress of each unit time, and the performance compared to the plan is called 'progress rate'.

At the beginning of each unit time, the platform will, for each task selected for progress management in the Task BDT, provide the project managers with the inputs of resources needed to fulfill the task's execution schedule, and the corresponding Deliverable's estimate. Present the expected progress of the task corresponding to the completion amount and progress, and require input of 'real input plan resource amount' to be secured and input at the beginning of the unit time and 'expected Deliverable completion amount' that is expected to be completed. It receives the input and confirms with the next higher manager. The platform calculates the estimated Deliverable Completion Amount using the product information stored in the Cost Estimation Standard BDT as the actual input plan amount inputted by itself, and the estimated Deliverable entered by the Task Manager. Compare with 'complete amount'. If there is a large difference between the two estimates, consult with managers on the need to adjust product information, including temporary premium rate adjustments. If agreed to adjust, modify the product information and record the modification history including the 'application period' of the modified product as an attribute of the node storing the product information.

The 'application period' may be temporary or may be the entire execution period of the rest of the task, and the platform uses adjusted product information of all 'Execution Schedule' values of the unit time nodes of the Progress Management IVY corresponding to the application period. Recalculate and present to managers for consent. If the manager agrees, the IVY length, Milestone location, and buffer size change with the preceding / following tasks are presented to the manager including PM and confirmed. The estimation of the expected progress over a specific unit time is called the "Unit Time Progress Forecast," and the calculation of the overall progress of the task is called the "Task Progress Forecast."

When the progress of Deliverable and the corresponding task is delayed due to insufficient amount of input of specific resource during a certain unit time, options of actions that can be taken to the manager of the task and the next higher level manager are presented through the input window. Choose the action you want or ask to enter it separately. Examples of possible actions include 'accept and proceed', 'self-resolving insufficient resources', 'request for support of the resource', 'overtime request' and 'special request'. According to the selected option, the specific request contents are composed based on the 'ORE BDT' and 'STEM' indicating the high abstraction level instruction or the expression of the request, and the input request contents are sent to PM and Schedule Engineer. If the report is approved, the template of the Super Rules that can execute the STEM contents is instantiated and invoked and executed by the STEM contents.

At the beginning of each unit time, the platform continuously collects all necessary and collectable information from sensors, instruments, cameras, other servers, the Internet, and the IOT to monitor and manage the progress and progress of tasks. The information collection also includes inputs that are requested and received from the PM or other managers as needed.

Follow the elapsed time and until the end of the unit time, if the actual amount of completed Deliverables differs from the planned amount by more than Significant Level, the relevant rule is called to trace the cause. Establish and implement measures. If the platform does not automatically receive the completion quantity or status of the Deliverables, the task manager or manager requests input at a predetermined time, and the task manager or manager reports the situation at the time when the progress delay is anticipated and supports necessary. Ask. do. Typical causes of delay include lack of resource input in terms of quantity or quality, including manpower, or changes in the environment, regulatory and policy. In addition, the occurrence of exceptions such as power outages, major equipment failures, line stoppages, and bad weather are the main causes, but as a result, it causes a delay in progress due to insufficient input of related resources.

The occurrence of the delay and exceptions is called an event, and an event that is particularly shocked among the events may affect the progress of the task or related tasks or the entire project / task. ).

Resource input to create each Deliverable is input into actual Supply Unit. In addition, when there are a plurality of resources to be input at the same time, the 'Resource Integration Effect' is calculated to estimate the effect of insufficient resources on Deliverable progress and the loss of other resources. doing Implement and utilize rules. For example, if the main worker is absent from the workforce performing a specific task, the possible progress may be 0% even if the assistants have gone to work, and the workforce of the assistants will be lost unless they are dedicated. For tasks that require continuous use of the overhead crane, only 50% of the crane can be used, 50% of the Deliverable's progress, even if all materials and other equipment, including workers, have been put in. It is a loss. In addition, even if the resource is quantitatively put in, the progress of Deliverable may be delayed if the quality is deteriorated. Therefore, it implements and utilizes 'Resource Quality Evaluation' rules to evaluate the quality of resources.

A situation in which a single event occurs and a series of events spreads is generally called an event chain, and an event chain method has been proposed and used as a method of coping with this. The SWEEP technique of the present invention uses a strategy of absorbing as early as possible or stopping before a certain milestone time point so that the chain itself is not formed when an event occurs.

When each unit time has elapsed, the task progress is compared with the expected progress of the unit time for each task and the progress rate of the task is calculated. In order to calculate the progress rate, the achievement or status at the completion of the task is called 'Task Total Deliverable', and the achievement or status corresponding to every unit time is called 'Unit Time Deliverable', It is called 'Cumulative Deliverable' and the performance compared to each plan is called Deliverable's 'Progress Rate'. The total, unit time, and cumulative progress of each task is represented by the progress rates of the Deliverables.

If there are two or more Deliverables, each weight is assigned and summed to calculate the progress rate of the whole Deliverable. By converting the quantitative Deliverable's progress into a task's actual progress value, each task manager or manager should not enter the performance progress value directly by subjective judgment. The progress input of the Deliverable is specified by inputting an image, a specific state, and a quantity, and the next higher manager or a Scheduling Engineer (also referred to as a 'scheduler') confirms the accuracy of the input.

The nodes including the present time (Present Time) among the nodes of the lower detailed unit time IVYs including the Progress Management IVY of each task are called the current node, and the nodes corresponding to the past time are the past nodes. The node corresponding to the future time is called a future node. Every IVY includes only one Present Node. Therefore, the lower detailed unit time IVY that develops and generates a corresponding Present Node may include all Present Nodes, Past Nodes, and Future Nodes. Current status monitoring and progress management information are stored as attributes of Present Nodes. Situation monitoring and progress management information saved as attribute information of Past Nodes are used as learning data as trend analysis, statistical calculation, forecasting of future situation, and coping and experience. Expected resource input, Deliverable completion status or status, expected task progress, and expected events and probability of occurrence are stored as attributes of the Future Node, and the expected progress results when the Future Node becomes a Present Node or Past Node. The forecasting method is tuned to reflect the actual occurrence of events and events.

If the progress is delayed during execution of each task, the lengths of the 'Feeding Buffers' of the task are decremented by the number of nodes with the slower progress of the Progress Management IVY, and the lengths of all the 'Receiving Buffers' are incremented by the number of nodes with the slower progress. When the length of a specific feeding buffer is less than 1, 'Milestone Sliding' should be performed in the direction of increasing the date backward, that is, the milestone node position of the subsequent task of the milestone position. This is caused by a propagation delay. If the length of a particular 'Receiving Buffer' is increased, the length of the corresponding Feeding Buffer of the preceding task at the corresponding Milestone location is increased, so that the preceding task has more spare days for the subsequent task at the progress up to the Milestone.

Conversely, as the progress progresses during each task, the length of the 'Feeding Buffer' of the task is incremented by the number of nodes of the faster progress of Progress Management IVY, and the length of all the 'Receiving Buffer' is increased by the number of nodes of the faster progress. do. If the length of a specific Receiving Buffer is less than 1, the position of the preceding Milestone Node of the corresponding Milestone location should be moved forward, that is, in the direction of decreasing date, when it is not possible to move the Milestone location forward in the preceding task. The task can no longer proceed quickly.

Among the milestones of each task, the milestone that is fixed to a certain calendar date and set as deadline is called 'Deadline Milestone', and the milestone prevents the 'Milestone Sliding' that moves backward. Set the Relative or Absolute Priority Weight between two grafted preceding / following Milestones to determine whether Milestone with higher priority is 'Milestone Sliding' first, and then with Milestone with lower Priority. In principle, 'Milestone Sliding' should be decided depending on it. When Progress IVY is displayed on the monitor, the locations of milestones are displayed, and the length of buffers is also displayed in the form of IVY, and when the length of the buffer increases or decreases, the increase or decrease of the number of nodes is presented.

For each task, 'Schedule and Milestone Adjustment Record Table' (SMART) is composed of SHRUB and grafted to Start Node of Progress Management IVY of the task to store and manage the adjustment history of all schedules and milestones.

In each increment and decrement, all the preceding and subsequent IVYs are checked for changes in resource input and constraints, and the task cost is calculated together to stop and determine where the total cost is minimum.

Tasks The predecessor / sequence relationship between each task of BDT is a material procurement task for supplying hundreds or thousands or more of materials, parts or raw materials, and construction or production in the case of Plant EPC Project or Factory production management task. It can be used for smooth material procurement management by forming between the nodes of Progress Management IVY and Operation Management IVY of tasks. In addition, the operation management of each facility or system for the progress of the start / stop sequence that requires multiple devices and systems to be started or stopped in sequence and concurrently during the start / stop of the main process or support system in the production management task. It can also be set between IVYs to manage proper lead time and monitor normal progress.

Once the unit time starts and ends, it continuously monitors and manages the progress and progress of each task. Progress Management IVY of each task expands each unit time node, 'Day' Node, to lower 'detail unit time' IVY according to the required precision of monitoring and management, and expands 'Hour Node' and 'Minute'. Node 'or' Second Node 'IVY is created and grafted to monitor and manage. Every time the 'detailed unit time' elapses to be monitored and managed, Assert the corresponding time to call and execute the rules that perform the monitoring or management work to be performed. Basic tasks include Deliverable's current assessment or judgment and today's forecast for the future. Information needed for evaluation and forecasting may be collected through sensors, measurement facilities, other servers, and the Internet, or you may ask the person in charge of the task or administrator to enter the amount of Deliverables generated by the 'detailed unit time' and the day's forecast.

During the unit time, it continuously monitors and evaluates the progress and progress of the task, and progresses when the progress is 'delayed' compared to the execution plan or when a situation that causes 'delay' occurs. ', Analyze the cause and establish countermeasures to absorb the impact or impact as early as possible and to minimize propagation.

When the job end time passes as a unit time or as a detailed unit time within the unit time, the progress of the unit time and the cumulative progress up to the unit time are evaluated. When a Negative Event with a progress level of 'Delay' occurs, the cause is analyzed and countermeasures are established at the time point of the unit time.

In order to absorb the shock as early as possible and minimize the propagation when the event of the magnitude delay event occurs, the following 'Event Absorbing Tactic (EAT)' is used.

If the 'Progress State' of a specific task is determined to be 'Delay' by applying a Rule, the Rule that searches for the cause of the 'Delay' is executed. The ultimate cause of delay in progress of all tasks is the insufficient completion or completion status due to the occurrence of quantitative or qualitative Insufficient Supply events. Therefore, the cause tracking rule of progress delay searches for and traces the insufficiently input resources and the cause of the insufficient resources. Therefore, the progress delay event of a specific task in the SWEEP technique is an event that has already been predicted at the time of occurrence of an event in which resources that need to be put into the task are insufficient, and the predicted result is effective. In the case of insufficient resource input, the predicted progress delay is forward (data-driven) reasoning, and in the case of delayed progress, the cause such as the kind and reason of the insufficient resource input due to backward-driven reasoning is traced. .

If progress delay occurs or is expected during the execution of a task, the 'Day' Node (Default), which is the current unit time, is replaced with the 'Hour' Node IVY of the lower detailed unit time to improve the accuracy of situation monitoring and management. It can be deployed and monitored and managed as 'Minute' Node IVY and 'Second Node IVY'. After use, it can 'Degraft' the IVY. In the case of PM, the management unit time is mainly 'Day', and in the case of each task manager, the 'Hay' can be managed by deploying the 'Day' Node.

First, after every 'Day' unit time, the Deliverable Completion Plan for 'Next Unit Time' will increase as much as the cumulative Deliverable on the day of production or completion that is insufficient compared to the execution plan. Additional resources to be added to complete the increased Deliverable are added to the original scheduled execution schedule, and the incremental completion amount is increased by incrementing each input unit within the allowable range. Increase until the corresponding task progress is restored.

First, during the next unit time, additional resources that need to be added are incremented into the input unit within the available input range, and if the recovery is possible during the next unit time, that is, one unit time, the unit recovers one unit time. It is called unit-time recovery and estimates the increase in total cost. Cost calculations also include overhead and fixed costs. Next, the recovery period is incremented, the increment of the resource is decremented, distributed to the incremented recovery period, and the total cost of the two unit time recovery is calculated. If the cost is increased by comparing the costs of the '1 unit time recovery' and the '2 unit time recovery', the process returns to '1 unit time recovery' (Backtrack) and confirms and implements the revised execution plan.

 If the '2 unit time recovery' cost is reduced to a level higher than Significant Level (significant level) than the '1 unit time recovery' cost, as long as the cost is reduced by incrementing the recovery unit time one by one to calculate the required cost. If the decrease in cost falls below a significant level, or if unit time is found to start increasing costs, then the previous unit time is set as the progress recovery plan period, and the action plan is added to the additional allocated resources and increased unit time progress. Establish and confirm and execute in agreement with PM and the task manager.

If the progress cannot be recovered during the 'next unit time', the unit time is continuously incremented until the recovery is possible, and the resource is continuously incremented within the range where the resource can be added. When the unit time is reached, the total cost is calculated, and the unit time is incremented to calculate the cost. If the decrease in cost falls below a significant level, or if unit time is found to start increasing costs, then the previous unit time is set as the progress recovery plan period, and the action plan is added to the additional allocated resources and increased unit time progress. Establish and confirm and execute in agreement with PM and the task manager.

At this time, 'Impact' at the time point of occurrence of the time delay event due to the progress delay event may be regarded as 'spread' and 'absorbed' to the minimum cost unit time node, and this is 'Event Absorbing' It is called.

The time until the first recoverable unit time is the time that can be no longer shortened even if all the means and efforts are made regardless of the cost at this point, and this is the 'absolutely needed time' (ANT It is called)). During the re-establishment and consensus process of the execution plan, the PM or the task manager may advance the unit time up to the maximum ANT between the minimum cost unit time and the unit time of the ANT position.

If the 'Milestone Nodes' are encountered during the process of continuously incrementing the 'Day' unit time node because the progress is impossible to recover, the 'Milestone Sliding' occurs when the milestones are pushed back, and the tasks that follow the current task The length of the 'Feeding Buffer' between the milestones begins to decrease. If Milestone is created, the length of Feeding Buffer becomes 0 or less due to 'Milestone Sliding', 'Chain' of an event where progress delay propagates to the subsequent task while subsequent Milestone is sliding together to keep the length as 0 And the overall cost can be greatly increased. Therefore, the progress delay event should be absorbed as far as possible before meeting the next milestone.

In addition, due to 'Milestone Sliding' due to the progress delay, the length of the 'Receiving Buffer' with Milestones of Tasks related to the current Task increases, and the length of the Receiving Buffer was 0. As the number of predecessors increases, they can afford to progress to their predecessor milestones, leaving room for opportunity.

When a positive event that progresses a task faster than the execution plan or a faster performance occurs, the resource is incremented or decremented as an input unit, similar to the minimum cost unit time search process when the progress is delayed. Starting from 'Reduce,' search the unit time for which the total cost reduction is the maximum, and shorten the task execution plan period up to the unit time, and agree with the PM and the task manager. In the shortening process, milestones slide in the direction of an early unit time node, and the length of feeding buffers increases and the length of receiving buffers decreases. If a Receiving Buffer with a length of 0 or less is created, the progress of the current task cannot be advanced any more quickly if the progress of the preceding task can be accelerated and the relative milestone cannot be sliding together with the earlier unit time node.

Event Absorption Strategies for Progress Recovery In the process of applying EAT, the resources to be input are incremented or decremented in the input unit within the input range, and the incremental time unit increments or decrements the corresponding time recovery node to minimize the minimum cost. The technique of searching for progress recovery period is called 'Gradual Resource Allocation and Cost Evaluation' (GRACE) search technique.

In the GRACE search technique, the increase or decrease of Deliverable progress corresponding to the desired task progress change, the increase or decrease of the amount of resource to be inputted for the increase or decrease of Deliverable progress, and conversely, the increase or decrease of the amount of resource input, and the corresponding increase and decrease of Deliverable progression. And the progress of the corresponding task is calculated and searched through increments and decrements of unit time and resource input unit, so that the platform can be implemented for all tasks whose progress is delayed by implementing the entire process of progress recovery as a super rule. To automate the progress recovery mission. All information necessary for all the above calculations and search exists as a Node value having a unique STPN in the Super Tree.

The GRACE technique is also used to find and establish an execution plan for performing all tasks of the Task BDT at a minimum cost.

Depending on the characteristics of the Project / Task, the amount of resources that can be put in and the progress recovery time (Time) are set as Constraints, LP (Dynamic Programming), DP (Dynamic Programming), or Complementary Slackness. KT (Kuhn-Tucker) Optimization Technique that applies Inequality Constraints such as Condition can be implemented as a Rule or applied as a separate Tool Package.

As described above, by applying the Event Absorption Strategy (EAT), through the continuous and continuous detailed progress assessment and forecasting and coping with 'Delay' time, the possibility of progress delay of the task and the occurrence of events are detected and stopped as early as possible. This can ultimately increase the likelihood of successful goal completion for the entire Project / Task and reduce overall costs.

In order to systematically manage various events including the 'task progress delay' that may occur in the process of performing a task, all events that may be generated according to the characteristics of the Project / Task are classified into types or types to form an 'Event BDT'. As described above, an event is classified into a positive event, a negative event, and a neutral event according to the effect on the goal achievement. If not specified otherwise, the event is defaulted. Examples of positive events include achieving the target milestone, actual Manpower's ability to be more efficient than standard production, and lowering raw material prices. Root Node grafs by constructing SHRUB of 'Event Monitoring And Recording Table (EMART)' to manage the actual events. The NAS of each event node stores frequency of occurrence of the corresponding event, probability of occurrence and likelihood, and 'event management procedure information'. For example, the probability of occurrence of an event is periodically calculated using a Weibull distribution, which is a probability distribution of a multi-parameter that can include various types of distribution.The distribution parameters are MLE (Maximum Likelihood Estimate) and Newton-Raphson Method. The frequency of event occurrence is estimated using Poisson Arrival analysis techniques. For periodic calculations, Suspended Data and Censored Data, which utilizes a small number of data and time data without events, are also included in the MLE.

In the 'Event Management Procedure Information', each event is identified by 'Detect', 'Assessment and Countermeasure Establishment', 'Action', 'Follow-up' and 'Learn'. It is managed by five courses of '(Learning), and these five courses are called' Event Handling Process' (EHP). EHP implements it as a rule to express its contents explicitly and update it freely. In the EHP, 'Detect' is divided into 'discovery' and 'discovery of actual occurrence', and 'Assessment and Countermeasure Establishment' refers to the size of impact, target tasks and event duration. In the case of negative events, measures can be taken to absorb the impact of events early or stop propagation, and in the case of positive events, they can contribute to the achievement of goals as opportunity. In this process, event scenario analysis can be performed.In the case of 'Action', the established measures are implemented.In 'Follow-up', the effects of event response results are evaluated, statistics are calculated, and 'Learning' 'Accumulates and learns about event handling as an experience. The EHP is also performed as a rule, and all necessary information and results are stored in the PLANTs and PLANT Nodes of EMART and other related Super Trees. For example, the progress delay event of the task is recorded as the value of the child node of the 'Occurred Event' node of the NAS grafted on the 'Day' node of the delayed date of progress management IVY grafted to the corresponding task node of the task BDT. It is also stored as the value of the task child node of the 'Occurred Event' node of the NAS of the corresponding 'Day' node of the Master Progress Management IVY grafted to the ROOT that is 'Alias'.

In the case of the Plant EPC Project, an example of the occurrence of a resource shortage event that occurs frequently is a case in which a specific material supplied to a specific construction work task is short. The occurrence of the event is an 'Eval Expression' that compares the input value of the resource with the sensor value or measurement value that can detect the supply of the material from the site where the task is executed, or the input value from the task manager. Is included in the conditional (LHS), and if the shortage of resource input is satisfied, the conclusion or execution unit (RHS) calls a rule to 'Assert' the occurrence of the shortage event of the resource as 'Fact'. It can be found by An event asserted as a fact is recorded in the Event Table SHRUB grafted to the NAS's occurrence history record node of the event name node of 'Event BDT' and corresponding to Event Record Management IVY grafted to the Event BDT. It is also stored in the NAS of the generation unit time node, and the detailed management contents according to the EHP are recorded in 'ENART'.

For example, a specific rule configuration for the discovery of the event that the resource input shortage situation occurs, first, the location of the necessary information in the Super Tree, according to the progress plan determined when the execution plan of 'Task i', which is an arbitrary task, is established The simplified STPN of the 'input plan' value of 'Resource p', which is the material to be put into 'k_th Day', becomes 'Task Oriented STPN' in the expression 'Task_BDT / Task_i // k_th_Day // Resource_p / Supply_Schedule_Value'. The 'input plan' value of a resource is a value of 'Task_i' node, which is a child node of a corresponding resource input target node of a NAS grafted to a 'Day' node of Resource Supply Management IVY grafted to a 'Resource p' node of a Resource BDT. It can be expressed as 'Resource Oriented STPN' of 'input plan' node, 'Resource_BDT / Resource_p // k_th_Day // Task_i / Supply_Schedule_Value'. Thus, the two nodes become Alias. In addition, the STPN of the 'real input amount' node of the 'Resource_p' has a final node name of 'Actual_Supply_Value' and the remaining paths are the same as the STPN. When the shortage of input of 'Resource p' occurs at the site of performing 'Task i', the event discovery (Super) rule sends an Eval Expression, which compares the planned value and actual input value of nodes of the 'Task Oriented STPN', to LHS. If the condition is satisfied, the RHS includes an action for asserting the input short event 'Fact of Resource_p' in the RHS.

For example, knowledge of how the platform is assigned to the task and autonomously tracks the cause of the event that occurred, for example, in the case of Smart Factory production target management task, the cooling water supply pump of the cooling water system is set to Lo-Lo (Low) of the level of the cooling water tank. For example, in the case of tripping to Low, the measured values of Flow, Pressure and Motor Current, which are operating state monitoring attribute nodes included in the NAS of the corresponding Pump Node of the VINE representing the process, Pump detects a tripped event from falling to zero without any operation. In addition, a node indicating a motor name for driving the pump among the attributes is an alias, and a node having a corresponding motor name exists in the power supply system VINE. In the power supply system VINE, the circuit breaker (CB) node that is responsible for the input and interruption of the motor can be traced from the STPN of the motor, and whether or not the CB is opened or blocked from the status attribute value of the NAS of the breaker. It can be seen. The breaker control circuit VINE grafted to the control attribute node of the CB can track the contact point of the open relay of the breaker, and the contact that operates the relay from the PPN of the relay node. From the 'Coolant Tank Level Lo-Lo', which is the closed sensor contact name among the found contact elements, the cause of the trip is that the level of the coolant tank is 'Low Limit'. It is possible to track the occurrence of the event lowered below the setting value. All the above tracking processes and methods are implemented as one or a few template rules and commonly used for similar trip or alarm tracking.

Actions at each event occurrence are included when the action is asserted in the LHS, including the event occurrence fact in the LHS, and executed by executing a rule including the actions to be taken in the RHS.

For example, when an event occurs in which the task i, which is the task i, is short of 'Resource p' on the 'k'th date, if the inventory of' Resource p 'is sufficient, additional supply may be provided. For example, among other tasks that use 'Resource p', the only option is to dedicate if it is possible to do so or to accept it as it is. The 'injection shortage situation' Fact of the 'Resource p' is included in the LHS, and a rule is formed and executed to include the measures in the RHS. NAS inventory grafted to the 'k_th_day' node of the Resource Oriented STPN for the entire inventory information of 'Resource p', the unit price information of 'Resource p' and the information of other tasks using 'Resource p' It can be collected from the value of the 'total inventory' node, the value of the 'unit price' node and the child nodes of the 'use task' node.

In the actual SWEEP technique, the event of 'injection shortage' event of 'Resource p' is the event that causes it, for example, 'surge of loss rate', 'out of stock', 'delay of delivery' of 'Resource_p' Since the event may have already occurred, the rule that triggers the cause event occurrence Fact is included in the LHS, and the 'Assumption of shortage situation occurrence' Fact of 'Resource p' is included in the RHS, and the assert is already executed. Foresee and establish countermeasures.

Rule is composed of 'Template Rule' that uses variable expression for most of node names that make up STPN included in Eval Expression for general use, and replaces variable expression nodes with specific Node Name when calling or executing. Enforce. Variable Expression Node Names can be repeatedly replaced with a plurality of specific Node Names in a Rule, and a Loop can be applied to the Rule.

For example, in the STPN example, 'Task_i' is represented by '? Task', 'k_th_day' is represented by '? Day', 'Resource_p is represented by a variable expression node name represented by'? Resource ', and'? Task 'is represented by All tasks of Task BDT, '? Day' are replaced by all nodes of Progress Management IVY, and '? Resource' is replaced by all resources of Resource BDT, and the same Template Rule can be instantiated and executed repeatedly.

With the above task progress and event coping strategy, the repetitive progress delay of the same or similar tasks, or the repeated occurrence of the same or similar events is calculated by calculating the probability distribution and the probability of occurrence and accumulating them in 'EMART' as an experience. Expect and prepare in advance, and continuously update the product information such as situation-adaptive loss rate calculation, proficiency and efficiency of input personnel, from actual resource requirements information used to complete the unit deliverable. Accurate schedule including task duration calculation is possible, and the information acquired can be continuously added to the Super Tree as BOGMKI to continue learning and increase the reasoning ability.

This platform also differs from the conventional software system or tools that PM uses in search of desired functions in menus or submenus that are presented in a hierarchical structure. ) Or allow other managers or team members to directly enter inquiries, requests for information, support requests, opinions or suggestions by keyboard or oral, and ARIA provides Extracts information from STEM representing a request, instantiates and invokes the corresponding Template Rule for processing. Frequently entered instructions or requests form a 'Frequent Order and Request Table' (FORT) to store and utilize. Instructions or requests stored in FORT can be instructed by the platform with a shortened keyboard input or verbal command such as 'F1' or 'F2', and automatically completed and presented even if only part of the instruction or request is entered. Provide service. In particular, the order or request that is repeatedly executed regularly is called 'Regular Order And Request' (ROAR), and once stored in FORT, a Timer Rule that asserts the time is executed whenever the execution time of each ROAR arrives. Rule that can execute the ROAR is invoked and executed. As described above, an active and autonomous service provision method for an indication or request is defined as a 'proactive and smart service' (PASS) method.

The PASS intelligent service providing method represents a process of autonomously performing a forest-provided forest as a Platform Task in the process of inputting and modifying a Super Tree, establishing and adjusting a task plan, and processing an event. By presenting Nodes or Symbols, if you move, connect or disconnect Nodes or Symbols selected by PM or other administrators to the desired location, the GUI also automatically updates the relations in the Super Tree.

The platform also supports the operation of facilities to achieve smooth goals when tasks need to be run. For example, in the case of production plants, the automatic control of every moment is usually in charge of the automation system and the SCADA, so the target management platform collects and utilizes the information necessary for the target management at necessary time intervals in conjunction with them. The TAG of the collected measurement values is converted into the corresponding STPN and stored. The uniqueness of STPN and IVY Node include time information, and the additional information can be included as attribute information. The expressive power that can be included as attribute information is better and simpler than the conventional control point TAG system that connects various weaknesses. Can also be used as a substitute for TAG. For events that may directly affect the achievement or progress of the target, such as line stoppages or trips to major facilities, the target management platform will actively intervene to detect early signs, track the cause of the trip, and directly perform, request and take action. Perform operational monitoring support tasks such as recommendations, performance monitoring and reliability estimates.

An example of a typical higher level of abstraction or task expression, for example, will report the tasks, with their cause, at the end of the day, at the end of the day, `` every day, before the start of work, the progress will be slowed down. Report the expected tasks, together with the reason, `` Report the facilities, at this point, with a high likelihood of downtime '' `` Report the facilities, with significant performance degradation in the last three months '' Last week, we will report space, along with reasons, for which energy use has increased significantly over the last week. '

Finally, the final stage is 'Project / Task Completing Stage' (S105). In the 'Project / Task Completion Phase', all the Deliverables at all levels of Task BDT are compared with the targets and plans that have actually established Deliverables. All Deliverables that need to be handed over are taken over, and the experience of performing the Project / Task is stored in the Super Tree as expertise and method, along with the learning effect and the scale of Big Information of the Project / Task. Increase utility and close target management.

In the case of the Plant EPC Project, the successful completion of commissioning and completion of the plant that satisfies the guaranteed performance within the target completion period and budget, and in the case of the Production Management Task, the annual production target In the case of an energy management system (EMS) for achieving and reducing energy, the baseline value reflects the annual and non-routine adjustment factors generated during the energy use process. In some cases, such as achieving a reduction target, successful management of the target can be assessed.

As described above, the intelligent platform of the present invention is based on the 'SWEEP' goal management technique, and proceeds over 'period / time before goal management' for all the detailed levels of tasks targeted for goal management. Through continuous, proactive and intelligent autonomous and thorough and precise goal management, you can greatly enhance your project / task success.

This Super Tree-based Project / Task's intelligent goal management platform (abbreviated as 'Platform') is a hardware-based main server, all project / tasks such as PM and PM, non-PM team, middle manager, owner, agent, supervisor, and subcontractor. Stakeholder (hereinafter collectively referred to as PC for 'stakeholder', additional back-up server, DB server, web server and cloud server, and various measurement control facilities It consists of network facilities.

The target management system of a specific project or task built on the platform or platform is implemented in the main server. 8 is a preferred configuration of the platform for intelligent goal management of the Project / Task of the present invention.

For the intelligent autonomous target management task of Project / Task, the platform of the present invention is functionally the Project / Task general management unit 801, Input / Output management unit 802, Super Tree configuration management unit 803, Knowledge-base management unit 804 ), It is composed of a progress management unit 805, a resource management unit 806, an event management unit 807, a risk management unit 808, and a DB management unit 809.

All management departments, including the Project / Task general management unit 801, are managed by the master agent and ARIA collectively, and additionally create and manage professional agents in charge of other management units according to the size and characteristics of the project / task. Delegate or share Hereinafter, the duties in charge of each management unit will be described.

The project / task general management unit 801 supports PM and is in charge of overseeing and supervising the platform tasks in all five stages of project / task goal management.

The project / task general management unit 801 collects and stores the information and knowledge necessary for goal management, establishes the goals and schedules of the entire and each detailed task by using them, and based on the information continuously collected, Coping with events or contingency, consistently aligning short-term, medium-term and long-term goals, and achieving established goals at a 'gross minimum cost', Implement PM's Platform Task instructions, provide information to perform tasks for 'all Project / Task stakeholders' other than PM, deliver and follow-up instructions that PM gives to other managers, and other managers Report requests from the PM to the PM, and those that can be handled directly are responsible for the processing.

'All Project / Task Affiliates' includes PM, 'Team Member or Intermediate Manager or Field Representative' (referred to as 'Other Managers'), Project Owner and Owner Agent, and other stakeholders. do.

 The total minimum cost is equivalent to the weight assigned to each item when it is necessary to consider quality, convenience, safety, environment and security in addition to the direct cost required to complete the Deliverable of the Project / Task. It means the cost that minimizes the total cost reflecting the cost.

The input / output manager 802 collects all information including all data and knowledge that other managers need for goal management, and is in charge of all output tasks that the platform must export.

The information is collected through Project / Task associates, measuring instruments, sensors (including IOT sensors), DCS, PLC, and other servers or the Internet that are authorized to input PM and specific information. In case of control point, measured value or sensor value input to external TAG is received and converted by mapping to corresponding STPN in Super Tree, and conversely, output value converts STPN to corresponding external TAG value. In addition, Super Tree STPN can be directly used as a TAG.

In addition, with the direction of the Project / Task General Management Department and the requests and support of other management departments, it accesses the knowledge base and DB to present the progress or operation of the Project / Task (Display), and from PM and other managers. It provides GUI that can provide 'PASS' type service that can receive instructions or request of the user, display report items, and set up and coordinate Task Schedule with PM. The input / output function is provided directly or through a web service or a cloud service.

In the case of the duration of the Project / Task, the GUI presents the node representing the unit time in the form of a Gantt Chart or a series of chains.In the graphic, Increment, Decrement, Split, Merge, Expand, It supports the planning, coordination and progress management of tasks by enabling the selection of Shrink, Shift, Milestone location, and setting up pre / follower relationship. All operations on other PLANTs are also made possible by clicking and dragging the mouse on the display. Typical operations support includes GUIs for Node Insert, Node Delete, Node Expand, Super Tree Skeleton Display, PLANT Display, Graft, STEM Generation, Rule Generation, and State Monitoring.

The display is capable of selection and scrolling of accumulation, logical connection configuration of all BDT, IVY, VINE, BUSH, SHRUB and Super Tree, physical layout and schematics of 3D Drawings, process or supporting system and facilities or space. It includes a 4D display that shows the change of state over time, and it also includes monitor, drawing, and coordinate management in the field and management of various symbols to support this. If you need to monitor and display the progress and progress of the hundreds or thousands of tasks or the operation status of the facility, and suggest the situation to be immediately and visually understood, you can use the Sector Graph composed of hierarchical structure. (See Korean Patent 10-1233264)

All of the above GUIs minimize the traditional hierarchical ordered menu provision method that memorizes and navigates through the menus and sub-menus that PM and other administrators unilaterally suggest, and uses the ORE Generation BDT to help PMs and other administrators It provides I / O service of 'Proactive And Smart Service' (PASS) method that allows you to directly input desired instructions or requests. Or, other administrators can enter a questionnaire such as 'What can I do for you?', 'What do you want?', 'Please input your Order or Request.' When entering the front part of the text, use the ORE Generation BDT to display the options of the remaining expected texts as drop-down menus for easy selection and input. The instruction or request entered is composed of STEM and stored in 'Classification and Depository BDT', and the corresponding Template Rule that can be processed is configured and stored in Rule BDT, called and instantiated and executed. Instructions and requests can be executed by keyboard input or verbal commands in shortened form such as 'F1' or 'F2'.

The Super Tree configuration manager 803 presents a basic skeleton configured in a typical form according to the characteristics and fields of the project / task inputted as the overall basic information (S100), so that the PM and other managers It is responsible for supporting the construction of Super Tree through inputs, modifications and defined operations such as Graft within given authority. In addition, branches or plants that are pruned or grafted are responsible for retrieving resources allocated to Super Trees by performing garbage collection when the connection with ROOT is lost.

The knowledge base management unit 804 collects and collects the expertise required to perform project / task goal management in cooperation with a PM or platform implementation engineer, and uses semantic primitives to provide typical instructions, tasks, requests, and manipulations. It implements (Operations) as Rule or Template Rule, composes and stores Rule BDT, and manages management so that saved Rules can be called and executed.

The project / task progress management unit 805 establishes an execution plan of all tasks on the task BDT to perform the goal management, a completion plan of corresponding Deliverables and a resource input plan, a cost estimation, progress of the Deliverables, and a corresponding task. It is in charge of progress calculation, monitoring of resource input, calculation of actual cost and coordination of task execution plan. The task execution plan is used in combination with the top-down method and the bottom-up method, and the task execution plan that minimizes the overall cost, is in charge of progress and coordination according to the progress.

The resource manager 806 monitors and manages the procurement or supply plan, input progress, and performance of all resources to be input to complete or complete corresponding Deliverables for completing each task of the Task BDT.

To this end, all resources to be put in order to achieve the goals of Project / Task are divided into subdivisions and divisions to form a resource BDT, and each resource node has a quantity and quantity of deliverables that can be created for each resource allocation unit. Cost Estimation Standard, including premium rate and cost information, is stored and utilized in the NAS (Node Attribute SHRUB).

Disturbance or exception that occurs irregularly during task execution is defined as an event. The event manager 807 manages an event according to an event handling process (EHP), applies an EAT strategy based on a 'GRACE' (Gradual Resource Allocation and Cost Evaluation) technique, and early affects the effect. Absorb or minimize spillage.

Risk is defined as an event, especially when the completion period of the entire project or task or the main task is delayed or the goal is difficult to achieve. The risk management unit 808 forms a risk BDT by classifying the expected risks by type, calculates a probability of occurrence and a hazard rate, and prepares preventive measures and measures for each occurrence scenario to minimize the possibility of occurrence. In the case of actual risks, it is in charge of the task of minimizing damages by dealing with them early.

Typical risks include typhoons, fires, large safety accidents, delays in procurement of major equipment, delays in design, and design changes in the case of the Plant EPC Project. In the case of energy-saving systems, there are unexpected unexpected long-term heat waves or cold, exceeding the maximum demand power, and in the case of computer systems, information leakage or malicious virus invasion situation may be caused by hacking. have.

The database (DB) 809 management unit stores all the information necessary to perform the task management task of the Project / Task, including the configuration of the Super Tree in the form of a DB, spread sheet, or XML file, Back- It maintains the continuity of goal management by stably restoring or preparing the reasoning environment including Read-in Super Tree every time the program is restarted, and maintains the continuity of goal management through DB. It is in charge of the task of enabling information exchange or sharing of information among agents. Spreadsheets or other file types can also be used as an aid for information storage.

As described above, the Super Tree-based Project / Task intelligent goal management platform technology provides an integrated management means for overall management of projects or tasks in various fields to set and manage goals, and provides instructions from the administrator. To support the establishment of sophisticated goal achievement plans, to continuously monitor and manage the progress and progress of the Project / Task, and to proactively respond to events and risks occurring in the process. Supports PM and other Project / Task managers in various areas to absorb shocks early, to prevent or shorten the formation of the event chain due to the spread of events, to minimize overall costs and to achieve their goals. Common core technology that can build customized intelligent goal management systems according to the characteristics of Technology) and tools.

The invention can also be embodied as computer readable code on a computer readable recording medium. The computer-readable recording medium includes all kinds of recording devices in which data that can be read by a computer system is stored. Examples of computer-readable recording media include ROM, RAM, hard disks, USB, CD-ROMs, optical data storage devices, and the like, which may also be implemented in the form of carrier waves (eg, transmission over the Internet). do. The computer-readable recording medium can also be distributed over network coupled computer systems or smart phones so that the computer-readable code is stored and executed in a distributed fashion.

Although the preferred embodiments of the present invention have been illustrated and described above, the present invention is not limited to the above-described specific preferred embodiments, and names or abbreviations of various data structures, data models, information, and techniques used in the present invention may be used. It is used for convenience and clarity of function and contents explanation, and similar names can be used. Therefore, any person of ordinary skill in the art without departing from the gist of the present invention claimed in the claims of the present invention can implement the principles of the present invention in a DB or modified in a similar manner. Of course, such changes will fall within the scope of the claims.

Claims (15)

For the project or task to set and achieve goals, collect methods and knowledge (hereinafter collectively referred to as 'knowledge') to manage the goals, and establish goals based on the collected knowledge. It collects all raw data, processed data information and contextual relational information (hereinafter collectively referred to as 'information') that is necessary to manage and achieve, and is 'knowledge, information and total collection''BOGMKI' (Body of Goal Management Knowledge and Information) named by

By utilizing the configured BOBMKI, and also included in the BOBMKI, execute rules that explicitly express the method of judgment or inference and content, and execute target management autonomously and actively. For each specific level of tasks (also referred to as work, work package, or activity) to be performed to achieve a goal, which are systematically divided and subdivided in the BOGMKI. The duration of the task is divided into a standard length of unit management time selected by the Project Manager (PM) or the Platform Construction Engineer, and the progress and progress of the task continuously and repeatedly after each unit time has elapsed. Monitoring and evaluating, continuously collecting additional information and knowledge necessary for goal management, and randomly occurring events or risks. Actively cope with the 'EAT' (Event Absorbing Tactic) strategy based on the 'GRACE' (Gradual Resource Allocation and Cost Evaluation) progress management technique devised and named in the present invention, thereby prematurely impacting the event. It can be absorbed in order to block or shorten the event chain formed by the spread of events, and the information acquired in the process of task is added to the BOGMKI and accumulated as an experience in order to increase the overall knowledge. Forecast through the Event Scenario analysis to cope with the future, and also based on the 'PASS' (Proactive And Smart Service) intelligent I / O service provision method proposed and named in the present invention to the PM or other managers It processes and receives instructions and requirements from similar natural language expressions or short verbal expressions, and configures, updates, and manages BOGMKI. Task done by giving the planning of any destination you need and the progress and management of progress PM or any other situation provided a GUI that allows administrators to handle with Graphic and be presented visually (Display),

Super Tree-based Project / Task intelligent goal management method, which supports PM as a virtual PM and supports project / task goals at a total minimum cost.
The method of claim 1,

As a means for constructing and utilizing 'BOGMKI', the total collection of knowledge and information, to set goals, plan, and implement the plans to be performed, to achieve the goals, According to the types and characteristics of the collected knowledge and information (hereinafter, collectively referred to as 'information'), each unit information is represented by a node, and the corresponding knowledge, which represents a relationship between the information, is represented by an arc. Design and define various PLANT '(Plant) Data Structures or Data Models that are specialized in the expression, storage and utilization of information.

The data model defined and constructed above includes 'PLANT' such as 'BREAKDOWN TREE (BDT)', 'IVY', 'VINE', 'BUSH' and 'SHRUB' and 'operation' for constructing and utilizing these PLANTs. And a Smart Total Unified Management Platform (STUMP) as a stub to form the basic framework or foundation for connecting these PLANTs.

'Graft' the PLANTs to the STUMP, and freely grafting the PLANTs with each other according to the relationship between the information, to form a BOGMKI,

BOGMKI, formed by grafting of the PLANTs, is defined as 'Super Tree' and used for goal management.

With the configuration of the 'Super Tree', all nodes constituting the Super Tree are not only internal / adjacent relations such as parent / child or preceding / successful relations according to the characteristics of the corresponding PLANT in the PLANT to which they belong. An additional relationship is formed with the nodes of the PLANTs connected by the graft, and all information stored in the Super Tree can be freely accessed as context-related information (Context) from any Node location of the Super Tree and used for inference and judgment. Will be

'SWEEP' (Work and Event Evaluation and Proceeding) of the present invention to autonomously monitor and manage the progress, progress and event occurrence status of all levels of tasks continuously and repeatedly during the target management period by using the Super Tree. By applying precision target management techniques,

The Super Tree-based goal management platform actively supports and assists PM as a Virtual Project Manager (VPM), and precisely autonomously, continuously and repeatedly executes the assigned tasks throughout the entire project / task goal management process. Super-Tree based Project / Task intelligent goal management method characterized in that it can be carried out.
The method of claim 2,

For each management node constituting the STUMP, information that can be broken down into detailed management target information of homogeneous or homogeneous (homogeneous) is stored when classified or subdivided sequentially or hierarchically among information on targets to be managed. In order to use and utilize, each management target is classified or subdivided sequentially or hierarchically, and each detailed management target information is represented by a node, and a tree-type data structure which connects the indicated nodes by an arc having a parent-child relationship is constructed. Define and use this as 'Breakdown Tree' (expressed as 'BDT'),

Each BDT is configured to include 100% of targets and 100% of targets for each level, and for this purpose, in addition to explicit child nodes, there may be targets missing from the division. Super Tree-based Project / Task intelligent goal management, which adds 100% of management targets to each level by adding 'Rest-of-All' (ROA) nodes that symbolize all remaining targets. Way.
The method of claim 2,

The duration of each task to be performed is divided by the unit time of the time resolution level desired to be managed over the whole time / period to be performed for the goal management. Each divided time is represented by a node, and chains are sequentially arced from 'Start Node' to 'Finish Node' (or 'Last Node') corresponding to the end unit time. Configure and use Data Structure of 'IVY',

The unit time is selected according to the characteristics of each task and the convenience of management.The unit time can be selected from Day, Hour, Minute and Second, or Week, Month, Quarter and Year, and the default value is 'Day'. , Other unit time can be generated by 'Expand' or 'Shrink''Day'Node,

The IVY is a schedule management of all the tasks to be performed for goal management, progress management, interdependency (Preceding / Succession Relation) management, operation status management of various equipment to be operated, and various Super Tree-based Project / Task intelligent goal management method, which is used to manage the desired time resolution level according to the time of event and risk.
The method of claim 2,

Each facility or element that constitutes a system of other functions including various production processes or supporting systems that must be used or utilized to achieve the goals of the Project / Task. A data model that represents nodes and interacts with each other and performs physical functions and handles the flow of an entity or object in an arc. Define and leverage,

The VINE has various production, manufacturing or manufacturing processes such as raw materials, semi-finished products, and products flowing in a certain direction, and process support systems and circuits for handling various media or energy such as cooling water, compressed air, and electric power. Super Tree-based Project / Task, which is used for modeling, interaction, which utilizes the functions of the facilities and devices, and their connection relations, and inferences, judgments, and displays related to operation status or operation status. Intelligent goal management method.
The method of claim 2,

Network consisting of computers, accessories and elements that perform two-way communication around the network or busbar. Unlike other VINEs, the direction of a moving medium or entity varies depending on the selection and conditions of the starting point and target point. In a variety of networks or systems in which equipment, elements or other elements or entities, which can be changed, are configured and connected, functions / roles and interconnections of the equipment, elements or entities And the data structure that stores and shows the operational relationship, operation status, and operation status information in the form of a graph that connects nodes with edges with no direction, and defines and utilizes as 'BUSH'.

The platform of the present invention, which is constructed for the purpose of project / task management, also displays the configuration as BUSH and can be included in the Super Tree to be managed together, thereby managing the platform's own configuration, function and performance, as well as other servers. Super Tree-based Project / Task intelligent goal management method characterized by enabling the unification of goal management tasks through interworking and information exchange.
The method of claim 2,

In addition to the information stored in the STUMP, BDT, IVY, VINE, and BUSH itself, it performs the target management tasks basically given to the platform, receives or executes instructions or tasks from the PM, or receives and processes requests from other managers. Creates and saves all knowledge and information needed in order to create and save a data structure in the form of a tree structure, and define and utilize it as 'SHRUB'.

All of the knowledge and information include the attribute values of all nodes of the STUMP, BDT, IVY, VINE, and BUSH, various arithmetic and logical operations, situation determination, cause tracking, countermeasures, action implementation, and process execution. The reasoning and inference necessary to process the tasks of the platform, the instructions from the PM, the tasks assigned to them, and the requests from other managers, using the knowledge and information, and the attribute values and knowledge and information. Super Tree-based Project / Task intelligent goal management method characterized in that it comprises a rule (Rule) that can be determined.
The method of claim 2,

According to the needs of goal management, a random number of PLANTs are generated for each PLANT type (Instantiate), and the root node or start node is connected to each node of the STUMP, and the nodes between the PLANTs are connected to each other. To define and utilize the meaning or association of the connection as a 'graft',

According to the Graft, the nodes of two PLANTs that are grafted are connected to other PLANT information through Graft, in addition to the information formed by the parent child relationship or the preceding / sequential relationship between nodes in the PLANT to which they belong. Is formed, the contextual information that can be accessed and utilized is increased, and the learning effect of increasing knowledge and information is generated in Super Tree as a whole. Task How to manage intelligence goals.
The method of claim 2

All nodes in each PLANT have a unique node name ('Node Name'or' Node Given Name 'and Node Number) within the PLANT, and each node additionally has a root node of the PLANT to which it belongs. Has a 'Node Full Name', which is a path name consisting of a path from itself to itself and its own 'Node Given Name', which is defined and used as a 'PLANT Path Name' (PPN) of the node.

In addition, all nodes in the Super Tree have a path from the root tree (expressed as 'ROOT') of the Super Tree to the node and a path name including the node itself, which is called the 'Super Tree Path Name' (STPN). Define and utilize)

Among the STPNs, in particular, the STPN via the Root Node of the PLANT to which the node belongs to is called the 'original STPN'. Therefore, every node in the Super Tree has one or more STPNs including the original STPN.

In addition, any two nodes in the Super Tree can form a Path Name as a relative path starting from the other node to themselves, defining and utilizing this as 'Relative Super Tree Path Name' (RSTPN), and using 'RSTPN'. In the path constituting the path, the path part of the direction descending from the ROOT is called a 'forward path', and the path part of the direction up toward the ROOT is called a 'reverse path', and each RSTPN proceeds. In the meantime, you can change the direction at a particular node or backtrack to the path you passed.

Therefore, the PPN, STPN and RSTPN can be utilized as a means of accessing information of a specific node, information of neighboring nodes of the node, and attribute information of all nodes on a path.

In case of inference by using surrounding information centering on a specific node, designate the node as 'COIN' (Center of Interest Node) to replace the original STPN of the node, and use all surrounding information as the starting node. Can be represented and accessed in a simple RSTPN,

As the method of STPN, PPN, and RSTPN, instead of using Arc between nodes, the forward path is represented by Slash (/), and in the case of a graft path, it is represented by Double Slash (//), and the reverse ( Reverse) Path uses Back Slash (＼), Reverse Graft Path is denoted by Double Back Slash (＼＼), and the notation of Path may use other symbols as long as there is no confusion depending on the programming language implementing the platform. There is,

In the notation of the paths, when a particular node is accessed or a reasoning for goal management is performed, when the uniqueness of the path is maintained or the omitted nodes can be determined even if omitted from the nodes on the path, The nodes can be omitted and represented as a simplified path expression.

In addition, when comparing two paths to determine whether they match, if the path includes a wildcard notation '*', it can be matched with any path that includes one or more nodes in the corresponding location. Can match any single node in position,

If you use a variable node expression such as '? Node' at a specific node location of the path, you can extract the actual node expression of the location of the variable node from the matching relative path as the value of the variable node.

Super Tree-based Project / Task intelligent goal management method, which provides a means for storing, extracting and utilizing information by accessing nodes in Super Tree with various paths and methods.
The method of claim 7,

It includes instructions that the PM gives to the platform, requests from Project / Task stakeholders, and objective or subjective methods, processes, and know-how to handle the platform's basic functions or tasks. The expression of knowledge and information is expressed in explicit, freely updated, and implemented in SHRUB to be contained in the Super Tree as a consistent and unified framework and used for goal management. ,

Instructions that the PM gives to the platform, requests from people involved in the Project / Task, and the basic functions or tasks of the platform are expressed and stored in the path composed of a series of nodes and the attributes of the nodes on the path. In the present invention, the expression is referred to as 'ORE (Order and Request Expression) STEM' or simply STEM, and the STEM is used to generate a rule for performing a corresponding instruction, request, and mission.

The root node of a rule has two child nodes, a 'left-hand side (LHS) node' as a condition part and a 'right-hand side (RHS) node' as an action or execution part (LHS). And RHS are 'Condition Part' and 'Action Part', or 'Premise Part' and 'Conclusion Part', or 'Antecedent Part' and ' Also called Consequent Part, and when called, a rule that executes without condition may consist of only RHS without LHS.

The 'LHS Node' and the 'RHS Node' each have two or more child nodes, and if the conditional part of the rule includes only one condition, the node itself is 'Implicit' without explicitly generating the LHS Node. LHS Node, that is, Condition Node, and if the executive includes only one Action, the Node itself becomes an implied RHS Node, that is, Action Node, without creating an RHS Node.

Rule is configured as a template rule that uses a path variable expression when it is to be used for general purposes, and by replacing and substituting the variable nodes included in the path variable with a specific node name when the call is made, the execution is executed. Make it possible,

Each node constituting the rule (Rule Node) has the number of its child nodes, the 'Eval' method or condition, and its 'Eval Expression' as attribute values of the NAS.

'Eval Expression' of each Rule Node can include Node names represented by STPN, so it can show and utilize the rule's context information.

Each rule can be composed of a combination of modular knowledge by including 'Internal Rule' in a rule or allowing other rules to be grafted to specify the action to be performed by the rule.

Each Rule can include LHS and RHS repeatedly in both LHS and RHS, and the rule is executed from left to right in the DFS manner, evaluating the 'Eval Expression' of nodes visited by visiting Rule Nodes. As an Eval Expression of a Node that Eval is in progress, Assert the Fact included in the LHS conditional part on the left side of the node or iterate through loops using Go-to command and execute the Rule with 'END' expression. It can be terminated forcibly in the middle of the process, and it proceeds to the rightmost node, and when it returns to the root, it is automatically terminated.

Define and use the rule consisting of the above structure and function as 'Super Rule',

By constructing the 'Super Rule', the reasoning (Reasoning and Inference) to perform the tasks, instructions, requests, and platform basic tasks of the High Abstraction Level is subdivided and modularized into the 'Divide and Conquer' strategy. In addition, all nodes, internal rules, and grafted rules in a super rule can share a common context and proceed with consistent and focused inference, so that a number of independent rules can be randomized. As a result of chaining and execution, it is possible to remedy the problem of the conventional and distracting rule execution method, which is unclear on the relevance and ultimate purpose of the fragmented results generated by each rule. Combination implements the contents as a separate rule, so a super rule can be composed of a combination of modularized rules. ation) It can support the automation of the process, and it can include a loop that executes the rule itself, even if the number of tasks that need to manage the progress is super tree-based, characterized in that batch processing is possible by calling a few rules Project / Task Intelligence Goal Management Method.
The method of claim 4

In order to recover the progress of a task (also called a work, work package, or activity) in which an event with a slower progress than the execution schedule progress occurs, input additional resources to be added. Increment or Decrement within the input range or input reference unit within the possible range, and the increase or decrease of Deliverable and Cost, and the period of task execution according to the change of progress and corresponding time of target management The task progress recovery method is used to evaluate the change of duration, and the progress recovery method is called GRACE ('Gradual Resource Allocation and Cost Evaluation') technique, and the GRACE technique is used. 'Event Absorbing T' which absorbs the impact of the event of delayed occurrence as early as possible and minimizes propagation. actic (EAT)), and the GRACE technique is also used to explore the optimal task performance period Super-based Project / Task intelligent goal management method.
The method of claim 2

In order for the platform to receive and process instructions from PMs or requests from other administrators, a set of nodes with names representing representations of each instruction or request, progressively materializing its contents, and corresponding nodes Paths, and stored as attributes of the nodes constituting the paths, and name them as 'Order and Request Expression (ORE) STEM' of the instruction or request. Super Tree-based Project / Task intelligent goal management method, which uses ORE STEM to create a rule to fulfill a corresponding instruction or request.
The method of claim 12

The PM gives the platform a high abstraction level instruction or instruction, and requests from other managers are received, expressed in the ORE STEM, converted into rules, and processed as rules. By allowing the platform's basic tasks to be assigned as a platform's mission,

In order to search, manipulate, and generate the information that PM and other project related people want, it breaks away from the conventional one-way and manual menu providing method (Paradigm), which requires the user to know and navigate the menus and sub-menu paths and functions. It provides a service that can directly request or request a high abstraction level, command or request to the platform, and provides the active and intelligent service providing method of 'PASS' (Proactive And Smart Service) service. Define and utilize in the manner of provision,

Through the PASS service provision method, the target management system of a specific Project / Task built on the platform can be used without having to learn how to use it separately, even when there are a large number of tasks that need to be managed simultaneously and repeatedly. In addition, it is possible to delegate autonomous and continuous precision management tasks to the platform with only a few commands or requests, so that it effectively supports the realization and application of the SWEEP goal management technique of the present invention. Way.
The method according to claim 1 and 2,

Based on Super Tree according to the present invention Project / Task intelligent goal management platform,

Present 'preliminary information input window' that is selected according to the field of 'Project / Task' (abbreviated as 'Project / Task') to establish and manage goals, and the field, name and final goal of Project / Task. 'Start Project / Task' which receives general basic information such as scope and total execution period of 'Deliverable or State' (collectively 'Deliverable') from Project Manager (PM) and Project / Task Initiating and Basic Information Collection Stage,

Based on the entire basic information received in the 'Starting Project / Task and Collecting Basic Information,' expertise required to implement an intelligent goal management platform that can perform goal management through intelligent judgment and reasoning ( Knowledge and method (collectively 'Knowledge'), and the relationship information (Relation or Context) (collectively 'Information') between various data, processed data information and information deemed necessary based on the knowledge, 'Detailed Information Collection and Super Tree Constructing' which constructs and stores 'Super Tree', a 'Body of Goal Management Knowledge and Information (BOGMKI)' Stage),

For all the detailed levels of tasks that need to be performed in order to breakdown and achieve the goal in the 'Detailed Information Collection and Super Tree Composition Phase', the PM, Scheduler, and managers in charge of each task are cooperated. ) Set the Baseline Duration that takes into account the possibility of occurrences of the), and based on the set Baseline Duration, reflect the quantitative quantity of Deliverables to be completed or completed and the unit time that reflects the available resources. Calculate the progress of each execution plan 'Schedule', the time when the sum of the unit time execution plan's progress is 100% is set as 'Execution Goal Duration' of the task, and the baseline duration and execution goal The difference between the durations is the task internal buffer, and the baseline duration and the execution goal duration are the same according to the characteristics of the project / task. May be set,

Set 'Milestones' indicating the specific progress or completion status of the task for the execution goal duration of each task, and mutual finish-to-start and finish between milestones according to the preceding and subsequent relationships with the milestones of other tasks. By establishing the predecessor and successor relationships of -to-Finish, Start-to-Start, and Start-to-Finish, baseline and execution schedules are established for all levels of detail, and the corresponding baseline duration and execution goal duration 'Task Scheduling Stage' to calculate the

According to the 'Execution Schedule' of each task established in the 'Task Execution Planning Step', at the beginning of each task, the expected supply resource and the expected completion Deliverable and Calculate the corresponding expected progress, and in case of 'event' that is expected to be delayed, take measures in advance by supplying resources or adjusting the schedule, and continuously monitor the progress and progress of all tasks according to the progress time. In the event of a vent that can interfere with resource input and affect the progress of the task, the Event Absorbing Tactic (EAT) is applied and the response is minimized. Each time the task progresses, 'plan progress'and' performance progress' of the unit time are compared for each task, and 'cumulative plan progress'and''Progressive Performance Progress', and if a 'delayed event' occurs that differs by more than a pre-determined Significant Level, the EAT strategy is applied to recover the delayed progress as early as possible. By tracking or analyzing the causes of the causes and accumulating them as experiences, reflecting them in the target management after the current unit time, carrying out additional instructions and assigning tasks from the PM, and handling the requests of other managers, All three levels of detail ('Vertical Breakdown Task Plane') are defined in three-dimensional, continuous, and active form over the 'Horizintal Progressing Time Axis'. Proactive and Intelligent Autonomous, precise management of the goal is based on successive work and event evaluation and proceeding (SWEEP) goal management techniques. And "task performing step" (Task Performing Stage) to naahganeun achieved,

Complete and complete the final Deliverables that meet the quality standards for all the detailed levels of tasks that managed progress in the 'Task Execution Step', and if there is an owner of the Project / Task, hand over to the owner Go through the process of 'Project Completion (Closing) Stage' which accomplishes the goals of Project / Task and closes Project / Task.

Super Tree-based Project / Task intelligent goal management method which supports PM of Project / Task and performs goal management task autonomously and actively.

The platform of the present invention includes a project / task general management unit, an input / output manager, a super tree configuration manager, a knowledge-base manager, Super Tree-based Project / Task intelligent goal management platform comprising a progress management unit, a resource management unit, an event management unit, a risk management unit, and a DB management unit.

Images