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

Abstract

In the present invention, the platform is given the task of target management of projects or tasks to set and achieve a goal, and under the direction of the Project Manager (PM) or general manager, all management that must be managed and performed to achieve the goal Based on the'SWEEP' (Successive Work and Event Evaluation and Proceeding) goal management technique, which manages and proceeds with the task (also referred to as work or activity), as if taking a precise look at the entire process, target management is autonomous And it relates to a technology to build an intelligent platform that greatly improves accuracy, speed, persistence, consistency and objectivity of goal management by actively performing it.
In the present invention, based on expertise and methods (collectively,'knowledge') necessary to set goals and perform goal management of a project/task to be achieved, data and processing data required to carry out goal management And relational information between data (collectively,'information') is systematically collected, and the platform utilizes these'knowledge and information' for various judgments and reasoning for goal management, supports PM, and supports autonomous/active We intend to devise an intelligent autonomous goal management platform technology that can manage and achieve goals.
Types of knowledge and information, such as'BREAKDOWN TREE(BDT)','IVY','VINE','BUSH', and'SHRUB' as a specific means to enable the collection, storage and use of the systematic knowledge and information. Various'PLANT' (plant) knowledge and information models specialized in storage and use of the relevant knowledge and information are created and defined according to the data and characteristics. By defining and configuring'STUMP' (Smart Total Unified Management Platform) as a stump to form a framework or foundation,'Graft' the PLANTs to STUMP, and between knowledge and information As a'Body of Goal Management Knowledge and Information (BOGMKI)' according to the characteristics of the project/task to establish and manage goals by freely grafting plants according to the relationship,'Super Define and implement'Tree'.
With the configuration of the Super Tree, each knowledge and information stored in the form of a node in the Super Tree is internal through an adjacency relationship such as a parent/child relationship or a preceding/successor relationship between the knowledge and information in the affiliated PLANT. In addition to the Access Path, a two-way access path through the nodes of the plants connected by the Graft is provided, and freely access all knowledge and information stored in the Super Tree at any location in the Super Tree as surrounding related information (Context). ) And can be used for reasoning,'SWEEP', which continuously monitors and manages the progress of all detailed tasks and event occurrence conditions at every moment throughout the entire phase of project/task goal management, and requires extensive knowledge and information accordingly. (Work and Event Evaluation and Proceeding) Enables the implementation and application of target management techniques, and the platform is a Virtual Project Manager, proactively supports and assists Project Managers or general managers, and intelligently and autonomously supports assigned tasks. To be able to perform.
This Super Tree-based intelligent platform construction technology is a technology in the field of Knowledge Representation and Reasoning of Artificial Intelligence, and large projects such as various Plant EPC, Ship Building, Building Construction and large-scale Infrastructure Construction, as well as Smart Factory construction. And operation, computer system operation and security management, corporate management, organizational management, energy management, various sports management and stock investment, as well as personal goals, health, safety and benefit management. It can be used as a common core technology essential for the establishment of various intelligent autonomous goal management systems that support the achievement of goals at a minimum overall cost in a wide range of activities.

Description

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

The present invention collects expertise and methods ('collectively'knowledge') in the relevant field for goal management of a project/task to set and achieve goals, and based on the collected knowledge, goal management By systematically collecting various data, processing data, and relationship information (collectively,'information') necessary to carry out the performance,'BOGMKI' (Body of Goal Management Knowledge and Information), which is a'total collection of knowledge and information' And, based on the knowledge and information stored in BOGMKI, by executing rules that express the method or content of reasoning and inference included in BOGMKI in an explicit manner (Execute), Basic goal management tasks, instructions from the PM, requests from other managers, and all tasks to be managed (also referred to as work or activities) that must be managed and performed in order to achieve a given goal. The accuracy and speed of goal management by autonomously or actively performing goal management based on the'SWEEP' (Successive Work and Event Evaluation and Proceeding) goal management technique that manages and proceeds precisely throughout the entire process and period. , Sustainability, consistency and objectivity, and the technology to build an intelligent platform that greatly enhances the likelihood of successful achievement of goals.

In general, projects such as EPC projects of large plants, buildings, ships and structures, construction and production management tasks of smart plants or factories, and energy management tasks of large plants, factories, ships and buildings To perform /Task, first, set the overall goal clearly, establish a plan for the detailed tasks to be performed to achieve the set goal, and continuously manage the goal until the goal is achieved based on the set time schedule. It must be done. To this end, it is necessary to simultaneously collect and analyze various and vast amounts of information, cope with events that may occur frequently, and proceed with numerous detailed tasks at the same time. However, in the process of managing it by relying on traditional software systems or tools that do not have human resources or reasoning ability, it is often difficult to achieve the initially set goals due to overlooked, omission or misjudgment of important situations.
In the case of the Plant EPC Project, the Project Management Institute (PMI) is the main focus, and the knowledge, practices, and processes necessary for project management are collected into PMBOK (Project Management Body of Knowledge). Diverse and vast amounts of knowledge and information required for each phase are classified into the'Knowledge Management Area' and further subdivided into detailed'Processes', and the collection and use of them The guideline of the method is specified, and it is recommended to perform the project accordingly. It is used as a major standard for project management along with ISO 21500 (Guidance on Project Management), and is used as a project progress analysis and management and randomization. ) Based on techniques for handling various events or risks that can occur and spread, for example, Critical Path Method, Event Chain Method, Critical Chain Method, EVA (Earned Value Analysis) technique, etc. System and tools to support the execution of large projects/tasks have been developed and used mainly by representative companies such as Intergraph, Primavera and Microsoft.
However, the various Project/Task management support systems and tools that have been developed and used to date present various menus and submenus that are subjectively configured, and understand the path and purpose of the menus and submenus given to the project related people, It is not deviating from the fundamental passive paradigm that must be collected and utilized while finding functions. Accordingly, due to the limitation of the amount and speed of information that can be simultaneously processed and judged by humans, the persistence, consistency, and accuracy of tasks that can be performed, especially a large project that must simultaneously process thousands to tens of thousands of activities. In the case of them, they are often outside the initial budget range and the completion target date and cause large losses.
For general plant or factory production management tasks, various production management support systems and tools such as ERP, MES, PLM, SCADA, and FMS have been developed and used, but as in the case of the plant EPC, the manager can use each system or tool. By knowing how to use them one by one, collecting information and performing management using the screen presented on the Dashboard and menus and submenus unilaterally given, setting appropriate goals, manpower to be invested, time, materials, equipment, and funds From procurement management of various resources such as procurement management, operation and monitoring of production processes and support processes, response to anticipated events and emergency shutdowns of production lines, defect rate, quality and cost management, and development of new products, a number of processes that must be carried out simultaneously In reality, it is very difficult to accurately plan, monitor, and optimally coordinate detailed management actions to achieve production targets.
In recent years, especially after AlphaGo, artificial intelligence (AI) technology and the 4th industrial revolution have become hot topics, and the necessity of establishing a smart factory to intelligently and autonomously perform overall production management and reduce costs has emerged. Attempts to start and apply concepts such as Digital Manufacturing and Virtual Factory are also being made, but the functions and contents of specific Smart Factory for each factory type have not yet been clearly established, and artificial intelligence-based technology for smart system construction has also been made. As it has not been properly established, most factories are building smart factories that only enhance the existing automation functions.
In the case of energy reduction target management task, various factory energy management systems (FEMS) and building energy management systems (BEMS) are being built, but mainly energy managers are provided with dashboards and analysis tools, and energy use status is presented, and the manager It is configured to use this to discover savings and to save energy. However, most of the sites do not have energy-saving experts, and even in the case of an energy management system (EMS) that has a function to automatically save some, it is necessary to turn off unused facilities, control excessive circulation of cooling water, or reduce waste heat. As a method of saving at the level of common sense, such as recovery, savings are limited by selecting and saving some energy-using facilities, which are mainly saving potential, as if fishing, and the savings effect is limited and skepticism about the effect of establishing EMS begins to arise. Are doing. According to the Paris Climate Agreement, a whopping 37% of greenhouse gases should be reduced compared to BAU by 2030, and despite the national need for energy savings such as solving the fine dust problem, the spread of EMS has not been properly achieved.
In the case of the power system, which is a large-scale infrastructure facility, the amount of information required to manage the goal of supplying stable and inexpensive power, and the size, complexity and diversity of tasks to be analyzed and managed, and required accuracy Due to (Accuracy) and real-time speed (Speed), despite the fact that various analysis and support S/W tools are currently being used, overall optimal operation is very difficult in reality, and the possibility of enormous cost reduction still exists. For example, the establishment and construction of construction plans of various power plants, transmission lines, substations and distribution lines, mix of power sources, start-stop plans of various power plants (Unit Commitment), 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 ( Overhaul), demand-side management, peak load management, power storage system (ESS), and the acceptance of various renewable energy facilities are all related and must be carried out continuously. The reality is that it is very difficult to optimize overall operation and minimize cost even though various support systems and tools are used for each field.
In addition, in the case of PC or various server management for daily business processing of individuals or companies, the computer operating system in charge of management has been almost monopolized by a few specific companies in the operating system market for decades. It is a tradition that the service function is hardly improved, and the situation continues to force computer administrators and users to use it very uncomfortable. Most of the functions and explanations for problem solving are awkward or unfriendly, and most of them have no logic except for the File Directory, and the names and functions of numerous Menus and Submenus that are subjectively named and set by the developer are individually. It is necessary to learn and remember to find a path, and it is often slow, and in terms of security, it is weak enough to be compared to a silver pot, so we have been dealing with viruses and hacking by tinkering whenever it is pierced. These mighty situations continue.
In the era of the 4th industrial revolution, the development of artificial intelligence technology is expected in earnest, and a fundamental improvement is needed in the manual target management or operation method of various projects or tasks that are inefficient or inconvenient so far. In the future, by receiving instructions from managers or users or assigned various tasks, most of them can infer, judge and perform themselves, and support the achievement of desired goals by minimizing the overall cost, including quality, safety, benefits and environmental costs. It is necessary to develop intelligent target management technologies and systems that can be achieved.

As explained in the previous background, large-scale plant construction projects, production management tasks in mid-large-sized plants or factories, energy management tasks in factories or buildings, corporate management, computer operation management tasks, and operation management of various social infrastructure systems From tasks to tasks, numerous detailed tasks that must be simultaneously performed or processed simultaneously for goal management, even with the existing conventional Project/Task support system or tools (Work, Work Package depending on the characteristics of Project/Task) , Activity is also expressed.), the quantity of management and monitoring actions is mostly out of the fundamental limits of human ability in terms of required speed, persistence, consistency, memory ability and accuracy, making it difficult to achieve accurate goal management. There is this.
In the present invention, the basic management task of the project/task to be set and achieved is assigned as a task and performed by itself, actively supporting the general manager (Project Manager (PM)) and other managers, and paying the total cost of the set goal. We intend to come up with a base technology to implement a project/task intelligent goal management platform that minimizes and supports achievement.
In more detail, it collects and stores information to achieve the goal, and uses it to support the establishment of a detailed implementation plan and schedule, and the progress of all detailed tasks of the project/task to be performed to achieve the goal (State ) And progress are continuously monitored and reported, and various risks and events that may interfere with goal achievement are predicted or detected as early as possible to minimize their impact, and opportunity (Opportunity) In the event of a problem, the platform will actively use it as much as possible, receive and process instructions from the PM and requests or suggestions from other managers, and make decisions or actions to be taken by the PM or other managers. By creating a project/task intelligent goal management platform implementation technology that actively supports PM so that the set goal can be successfully achieved by requesting or recommending it, various projects/tasks to set and achieve goals We intend to prepare the foundation technology to build an intelligent autonomous target management system for people.

Project/Task intelligent goal of the present invention to actively support the project/task manager (Project Manager (PM)) and other managers who want to set and achieve goals, minimize overall costs, and achieve the set goals To implement a management platform (Platform) It requires methods and knowledge to systematically collect and store vast amounts of information, and use it to continuously infer the desired information or judge the situation, and take necessary measures.
In the present invention, based on the expertise and method (collectively,'Knowledge') necessary to set the goal and carry out the goal management of the project/task to achieve, the data and processing data required to carry out the goal management And relational information between data (collectively,'Information'), and these'knowledge and information'(or'information') are systematically utilized by the computer, and judgment and reasoning for goal management ), by devising techniques for collecting, storing, and using information and technology for building an intelligent autonomous platform, a computer with artificial intelligence capabilities supports PMs and autonomously/actively aims for projects/tasks. We want to come up with a technology that allows us to manage and achieve this.
More specifically, types of information, such as'BREAKDOWN TREE(BDT)','IVY','VINE','BUSH'and'SHRUB' as specific means for enabling the collection, storage and utilization of the information. Depending on the characteristics and characteristics, the'Knowledge and Information Model', which is a variety of'PLANT' (plants) specialized in the storage and use of the relevant information, is devised and defined, and the basic framework of the overall goal management information composition Define and configure'STUMP' (Smart Total Unified Management Platform) as a stump to form (Framework) or Foundation,'Graft' the PLANTs to STUMP, and PLANT according to the relationship between information They freely combine each other to form a'Body of Goal Management Knowledge and Information (BOGMKI)' according to the characteristics of the project/task to establish and manage goals, and this is a'Super Tree It is defined as'and obtained and used.
The'Super Tree' as the'BOGMKI' accommodates and stores all information necessary for reasoning and judgment for setting goals and managing the goals of the Project/Task to achieve, and parent/child or parental information between the information in each PLANT. In addition to the internal path through the preceding/successor relations or other free connection (adjacency) relations, a bidirectional path through the nodes of the plants connected by the Graft is prepared, and all information stored in the Super Tree is related to the surroundings at any location in the Super Tree. It makes it possible to freely access and use it for reasoning as information (Context). All knowledge and information stored in the Super Tree that is configured to achieve the goal of a specific project or task that sets a goal is defined as'Big Information'.
Based on the information stored in the Super Tree,'SWEEP' is also conceived in the present invention and precisely continuously monitors and manages the progress of all detailed tasks and event occurrences at every moment throughout the entire project/task goal management phase. By applying'(Work and Event Evaluation and Proceeding)' goal management technique, we intend to devise a platform building technology that actively supports and assists the Project Manager as a Virtual Project Manager, and autonomously performs assigned tasks.

As a result of the present invention, for a project or task to set and achieve a goal, a goal management task to be performed regularly or repeatedly can be given as a basic task of the platform, cooperate with the Project Manager (PM), and By fulfilling the instructions, receiving and processing requests from other managers of the project/task, and actively responding to various contingency or events occurring in the goal management process, It is possible to implement an intelligent autonomous goal management platform that can greatly improve the ability to achieve the goal.
In particular, the platform autonomously or actively performs target management based on the SWEEP target management technique that continuously and precisely manages all targets to be managed over the entire target management process and period/time. It can greatly improve speed, persistence, consistency and objectivity. In addition, it detects and responds to various events or risks that may hinder the achievement of the target early, and may issue an alert or call attention to the relevant parties, and progress may be delayed. In this case, it is possible to construct an intelligent goal management system of Project/Task that can absorb or minimize its ripple as much as possible. As a result, not only large construction projects such as various Plant EPC, Ship Building, Building Construction, and other Infrastructure Construction, but also the establishment and operation of Smart Factory, the establishment of a Smart and Secure computer operating system (Operating System), corporate management, energy management, and organization It can greatly enhance the possibility of successful goal achievement of various and complex tasks ranging from operation management of the company and various games, sports, stock investment, election and personal goal management.
Furthermore, the basic principle of this platform can contribute to enhancing the competitiveness of the artificial intelligence (AI) technology field, which is emerging as a core technology of the 4th industrial revolution nationally, and ultimately, a number of 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 target management systems that support the achievement of the goal at the lowest overall cost in the domain.

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

Definition and explanation of terms and abbreviations
Representative terms and abbreviations used to simplify and clarify the description in the present invention are defined and described as follows. The definition may be repeated for emphasis on existing commonly used terms or terms previously defined by a specific standard. If the definition is different, the definitions of the terms and abbreviations below take precedence. For more clarification of meanings or for frequently used terms and abbreviations, they are repeatedly defined and explained in the text.
BOGMKI: Abbreviation for Body of Goal Management Knowledge and Information, a'total collection of goal management knowledge and information' collected and composed to achieve the goal of a specific project or task that sets goals.
Knowledge: Method, procedure, know-how for collecting and using necessary information in order to perform all detailed tasks that must be completed in order to achieve the set goal for a specific project or task that sets a goal (Know-how) and Specialized Knowledge
Information: Raw data and processing data collected to achieve the set goal based on knowledge for a specific project or task that sets a goal. Attribute information of data, and relational information existing between data are collectively referred to as (collectively, the above knowledge and information are also briefly expressed as information)
Deliverable: The general term for the result or result status of the project or task that sets the goal
Task: Generic term for work, work package, and activity to be performed to create and complete Deliverable or complete
Platform Task: Tasks that the platform itself performs for the purpose of instructing and assigning tasks that the PM gives to the platform for goal management, requests from other managers, basic functions of the platform, or processing tasks
Super Tree:As a means to realize BOGMKI, a comprehensive collection of target management knowledge and information, based on STUMP, PLANTs such as BDT, IVY, VINE, BUSH, and SHRUB are freely'grafted' according to the relationship existing between knowledge and information. ) And defined together with'Operation' (Knowledge and Information Model)
Graft:Operation of connecting the Root Node or Start Node or arbitrary Node of the same or heterogeneous PLANT to the Node of one PLANT, and specifying the relationship to associate with each other (Operation)
Operation: The Super Tree and each individual PLANT can be defined and executed, and PLANT creation, modification, graft, node insertion, search, evaluation, and utilization. A generic term for the same act
Big Information: Any knowledge and information included in Super Tree or BOGMKI
STUMP (stump): As an abbreviation of Smart Total Unified Management Platform, it is composed to prepare the foundation of the Super Tree composition, and the root becomes the ROOT of the Super Tree, and the Knowledge and Information Model (or Briefly,'Information Model')
BDT: As an abbreviation of Breakdown Tree, it is composed to manage information that can be classified into detailed unit information of the same kind or homogeneity when systematically or hierarchically classified or subdivided among target information to be used for goal management. Knowledge and Information Model in Tree Data Structure type defined with manipulation
IVY (Ivy): It divides and subdivides the entire duration or time of target management into'Unit Time', the standard for task performance management of a certain length, and represents each subdivided unit time as a node, and'Start' which represents the start unit time. A Knowledge and Information Model that is configured by connecting with arcs sequentially from'Node' to'Finish Node' (or'Last Node') corresponding to the end unit time, and defined along with Operation
VINE (Vine): Various production, manufacturing or manufacturing processes that handle raw materials, semi-finished products and products flowing in a certain direction, support systems that supply various media or energy such as cooling water, compressed air, steam and power, and other various circuits ( Circuit) or a system that performs a specific function, each facility, component, or element or entity constituting the process or system is represented as a node, and the type of the process or system and these processes A knowledge and information model that expresses and configures the interconnection relationship between these facilities, devices, or elements or objects in an arc along the flow of media or objects handled by a system or system, and defines them along with manipulation.
BUSH: Various systems or networks composed of facilities for performing specific purpose functions, elements or entities are connected so that data, medium or objects can move in both directions. In (Network), a knowledge and information model that represents each facility, element, or entity as a node, and the connection relationship between them is represented by an arc, and is defined with operation.
SHRUB (shrub): In addition to knowledge and information represented by STUMP, IVY, VINE, and BUSH, rules representing and implementing various operations, reasoning and judgment, and management actions and procedures, and detailed attribute information of specific information , Knowledge and Information Model that organizes and stores Table, List, Stack and Queue for various records in the form of Tree Data Structure, and defines along with manipulation
PLANT:STUMP, BDT, IVY, VINE, BUSH and SHRUB collectively
NAS: Node Attribute SHRUB, an abbreviation of SHRUB, that systematically/hierarchically classifies and subdivides the attribute information of each node in the Super Tree.
Node Given Name or Node Name: Node name given to each node itself for each individual plant
PPN (plant internal path name):As an abbreviation of PLANT Path Name, it is a node name or'Node Full Name' that is represented as a path consisting of the path from the Root Node to itself and its own'Node Given Name', which nodes in each individual PLANT have. It can be used for reasoning and inference by accessing all nodes on the path including itself and attribute information of nodes, and abbreviated notation is possible within the range that maintains the uniqueness of the name.
Node Number:A number assigned to each node by reflecting the structural characteristics of the plant for each individual plant
STPN (Supertree Path Name): As an abbreviation of Super Tree Path Name, it is a node name that represents the path from the Root Node (expressed as'ROOT') of the Super Tree to itself and the path including the node's own Node Name, which each node in the Super Tree has. All nodes on the path including itself and attribute information of nodes can be accessed and used for inference, and abbreviated notation is possible within the range of maintaining the uniqueness of the name.
RSTPN (Supertree Relative Path Name): Relative Super Tree Path Name. It is an abbreviation of Relative Super Tree Path Name. It is the name of each node that starts from the other node and reaches itself between any two nodes in the Super Tree, or the name of each node that starts from any other node and reaches itself. Node name, or node name of neighboring nodes represented as a path to each neighboring node with a specific node as the central node (COIN), and abbreviated representation is possible within the range that maintains the uniqueness of the name.
Alias Node:For a specific node, a node that belongs to another PLANT but represents the same facility or component, entity or object, and variable or value as the corresponding node
COIN (node of interest): An abbreviation of Center Of Interest Node, which is the center of interest or reasoning.
Eval: It is an abbreviation of'Evaluation'. When a specific node name is evaluated, it evaluates the Eval Expression of the node itself or included in the properties and returns the result value.
Unit Time: It is a unit of the default elapsed time or period selected for the convenience of goal management, and the default is'Day', and can be freely changed to other time units according to the desired time management precision.
BEAR Mark: Progress Management IVY of each task is carried at the end, and it is a mark that is displayed at the location of the Finish Node that represents the various durations of the relevant task.Baseline Duration (B), execution target It represents the duration (Execution Goal duration (E)), Anticipated Completion Duration (A), and Real completion Duration (R), respectively, and once the first task schedule is confirmed,'B' and'E' 'Mark's node position is fixed.
SMART: It is an abbreviation of Schedule and Milestone Adjustment Record Table, which is composed of SHRUB to store and manage the schedule of each task and the adjustment history of Milestones, and is a table that grafts to the Start Node of Progress Management IVY of the task.
Milestone: In each task, it is possible to objectively check the progress status, including the start status and completion status, and a status that becomes an important meaning or turning point in which the corresponding progress value (%) can be assigned.
Super Rule: It is composed of SHRUB, has an LHS (Left Hand Side) Node and RHS (Right Hand Side) Node, and both LHS Node and RHS Node can have an arbitrary number of child nodes, and each node has the number of child nodes and ' Eval' method or condition is used as an attribute value in the NAS of the corresponding node, and it is configured as a template rule to improve the universality of the rule by receiving the associated ORE STEM and STPN as an execution environment, and to configure the rule to execute itself repeatedly. , By including'Internal Rule' in the Rule or allowing other rules to be grafted, the Rule is composed of a combination of modularized knowledge, while sharing common context information, and consistent and focused (Focused) By allowing reasoning and inference, judgment, execution of procedures or methods, and calculations, high abstraction level tasks, instructions, requests, and platform tasks can be processed and implemented. To configure to be
Assert (published):Operation to announce a specific fact and invoke and execute the rule containing the relevant fact in the LHS or conditional partREGIME Agent:As an abbreviation for Rule Expression Generation, Invocation Management and Execution Agent,'Project Manager Agent', which is first created when the platform is started, is created together with the agents in charge of each functional area of the platform, and Rule Expression is created ( Generation), invocation management (Management) and execution (Execution), intelligent S/W Agent that supports Rule execution of other Agents
ORE STEM: Paths that are sequentially selected in the ORE Generation BDT for specific instructions or assignments given by the PM, requests from other managers, and the platform assignments, using ORE Generation BDT, and attribute values of nodes on the path As an abbreviation for Order and Request Expression STEM (command and request expression stem) expressed as, it is also briefly expressed as'STEM', and as a specific path of ORE BDT, it is possible to separate the Graft and Node Eval, and the corresponding instruction and task , Provide as enforcement environment information to the rule called to perform requests and tasks
RORE: As an abbreviation for Regular Order and Request, STEM performed regularly
ORE Table: As an abbreviation of Order And Request Table, the ORE STEM representing the instructions given by the PM to the Platform, the duties assigned, requests from other managers, and the basic tasks given to the Platform, and the rules for performing the instructions, duties, requests and tasks. Table that stores information to call
Event: As all situations that occur randomly during the task execution process, it is classified into Positive Event, Negative Event, and Neutral Event according to the effect on task progress, and classified into Local Event and Global Event according to the scope of the affected tasks. Events are classified into risks, and depending on the field and characteristics of the project/task, the arrival or elapse of a specific time, entry into each execution stage of the project/task, instruction or assignment from the PM, and requests from other managers. Occurrence is also included in the event and handled by calling and executing rules that can cope with the event according to the Event And Risk (EAR) Handling Process when the Event Detection Rule detects a specific event.
EAR Table: As an abbreviation of Event And Risk Table, STPN representing events and risks that are actually expected or already occurred during project/task execution in Event and Risk BDT, and information to call rules to handle the event and risk. Table to do
EAT: As an abbreviation for Event Absorbing Tactic, an event absorption strategy to prevent the impact of various negative events occurring in the target management process early or to minimize the spread.
EMART: An abbreviation of Event Monitoring And Recording Table, a table composed of SURUB to monitor and manage events occurring in the process of task execution.
GRACE: An abbreviation of Gradual Resource Allocation and Cost Evaluation. For each task to be performed for target management, the resource to be input is incremented or decremented in an input unit within the range of the possible input, and the optimal task execution period (Duration) In the process of searching for or applying the event absorption strategy (EAT), a technique to search for a period/time that can recover progress or situation with minimal Expense or Effort
Semantic Primitive: Basic terms and expressions defined as a unit keyword for expressing and processing all operations, rules, and platform tasks performed on the Super Tree (Basic Terms and Expressions)
NOA: As an abbreviation of Nature Of Activity, the specific activity content of a specific activity, task, or work indicated by the node and node name of the Super Tree
ANT: As an abbreviation for Absolutely Needed Time, the shortest required time or period that cannot be shortened beyond that even if all feasible efforts, means, and resources are mobilized.
PASS (Active Autonomous Service): It is an abbreviation of Proactive And Smart Service. Instead of unilaterally providing Menu, Submenu, or Tool, and allowing PM, other administrators or users to find and use the necessary functions, they directly direct instructions or commands of a high abstraction level. An intelligent active autonomous service delivery method that allows you to drop or request a platform
Super Forest: Knowledge and Information Model in the form of a Tree data structure that has multiple Super Trees as Subtrees
SWEEP: Abbreviation for Successive Work and Event Evaluation and Proceeding, a goal management technique that precisely continuously, continuously and autonomously processes and proceeds with all tasks and events to be performed or processed to achieve the set goal.(Complete definition and explanation of the above terms and abbreviations)
Super Tree-based according to the present invention with reference to the accompanying drawings below A preferred embodiment of the project/task intelligent goal management platform and method will be described in detail. The position reference number in each drawing uses 3 digits, and the first number represents the drawing number. The same description may be repeated for better clarity. In the case of technical terms, they can be mixed with English expressions to enhance the clarity of meaning. In the case of a name or expression defined in the present invention, or a name or expression used for the first time only by a brief description without a separate definition, and when trying to distinguish or emphasize a specific expression separately,'single quotation marks' may be added.
The project/task intelligent goal management platform of the present invention sequentially divides and subdivides the objects to be managed in order to achieve the goal for a project or task that sets a goal, and all detailed level management targets ('Vertical Breakdown Task Plane '), according to the established management plan (Schedule), over the entire project/task execution period (regarded as'Horizontal Progressing Time Axis') divided into a series of management unit time And it uses a goal management technique that manages and proceeds as if scanning precisely in 3-Dimension, and this is defined as'SWEEP' (Successive Work and Event Evaluation and Proceeding) intelligent goal management technique.
The Project/Task intelligent goal management platform of the present invention represents and supports PM as a Virtual Project Manager (VPM), based on the SWEEP goal management technique throughout the entire project/Task goal management process, and In order to precisely monitor and manage the progress and the occurrence of various events at every moment, first, a method and expertise to manage the set goals elaborately and intelligently (collectively,'knowledge). '), which is required to establish, manage, and achieve goals based on the collected knowledge, usually of a vast scale, and relational information that exists between raw data, processed data and data ( Collectively,'information') is collected and utilized. In the present invention, all'knowledge and information' (or collectively expressed as'information') required to set and achieve the goal of the project/task is collected and accepted, and autonomous inference and reasoning and judgment ( A'Super Tree' is created, constructed and utilized as a'Body Of Goal Management Knowledge and Information' ('BOGMKI') for use in Decision).
1 is a Super Tree-based according to the present invention Project/Task This is a flowchart showing the target management task execution procedure of the intelligent goal management platform.
1, Super Tree-based according to the present invention The Project/Task intelligent goal management platform supports the general manager of the Project/Task or the Project Manager (PM) (hereinafter collectively referred to as'PM') through the following 5 steps (process), and autonomously and actively performs goal management tasks. .
Step 1. Project/Task Initiating and Basic Information Collection Stage (S100)
A pre-configured'basic information input window' selected according to the field of the target project/task' (hereinafter referred to as'Project/Task' for short) is presented, and the field, name, final goal of the project/task, Overall basic information such as the scope and total execution period of'Deliverable to State' hereinafter referred to as'Deliverable' is input from the Project Manager (PM).
Step 2. Detailed Information Collection and Super Tree Constructing Stage (S101, S102)
Based on the total basic information input in the'Project/Task Start and Total Basic Information Collection Step', the project is configured by field in advance by using the platform implementation method of the present invention and the field-specific expertise of the project/task. Select and present the Super Tree Basic or Reference Structure Skeleton in the /Task field. Based on the presented Skeleton, knowledge and expertise in the relevant project or task field, and relational information (collectively,'information') between various data, processing data and data collected based on the relevant knowledge (Information)), received from the Project Manager (PM) and'Team members or other managers who perform tasks under the direction of the PM' (hereinafter collectively referred to as'other managers'), and'knowledge and knowledge for goal management' It composes the'Super Tree' as a total collection of information' (Body of Goal Management Knowledge and Information (BOGMKI)). The super tree to be made up of all and all detailed tasks to be performed (also referred to as'Work','Work Package' or'Activity' depending on the field and characteristics of the project/task, and hereinafter, collectively referred to as'Task') are organized by field or division. Quantitative information or quantification of information for performing hierarchically/sequentially classified or subdivided (S102), and the result or result status (hereinafter collectively referred to as'Deliverable') to be completed for each task as the scope of execution of each task It basically includes information and expertise, such as resources, costs, and budgets to be invested to complete the corresponding deliverables. Depending on the field and characteristics of a project or task, the total number of tasks may be 1, and the activity may be not only a physical activity but also an Intellectual activity, and the Deliverable is not only a quantity that can be expressed in units of measurement, but also a specific state. In addition, the resource to be input specifies both quantity and quality, and the expertise and method are the task execution method, execution strategy, and situation necessary to successfully achieve the goal. To state judgment knowledge, reasoning (Inference and Reasoning) capability, Know-how, Heuristics, and knowledge of the duration of a rough task execution.
As described above, all knowledge and information included in the Super Tree that is configured for the execution of a specific project/task to be achieved and to set a goal is defined as'Big Information'. In addition, in the case of trying to perform target management of multiple projects or tasks, a Tree-type Knowledge and Information Model in which the Super Tree, which is configured for target management of each project or task, as child nodes, is formed, and this is called'Super Forest. It is defined and utilized as'.
Step 3. Task Scheduling Stage (S103)
Breakdown in the'Detailed Information Collection and Super Tree Configuration Step' (S101, S102) and cooperate with PM, Scheduler and managers in charge of each task for all detailed tasks to be performed to achieve the goal. Set the'Baseline Duration' in consideration of the possibility of occurrence of exceptions for each task. The progress of each task at the elapsed time of the Baseline Duration is set to 100%, and the task execution unit time (Default is'Day', hereinafter described based on'Day'). Establish a baseline schedule. (Example: Using S-Curve or Linear function) Calculate the quantitative amount of Deliverables corresponding to the standard plan progress for each unit time, and the corresponding resource and cost. Next, conversely, each resource can be supplied in consideration of the'Allocation Unit' for each unit time above, and a feasible'actual supply plan' is established, and can be completed from the actual input plan. Quantitatively calculate the amount and cost of Deliverable. The basic main resources include Manpower, Facility, Material, Equipment, Capital, Time, and Space, and in determining the quantity that can be supplied for each resource, the quality, capacity or capability, and time and cost of the resource are determined. Consider together. The quantitative amount of deliverable that can be completed is converted back to the corresponding unit time of the task, the'Execution Schedule' Progress. The converted unit time execution plan allocates resources to go ahead of the standard plan, and the point at which the sum of each unit time execution plan reaches 100% is referred to as the “goal duration” of the task. The difference between Baseline Duration and Execution Goal Duration is set to the'Execution Internal Buffer' of the relevant task. Next, for each Execution Goal Duration,'Milestones' representing the specific progress or completion status of the task are set, and according to the preceding and subsequent relationships with the Milestones of other tasks, Milestones are mutually Finish-to-Start, Finish- By setting the preceding and subsequent relationships of to-Finish, Start-to-Start and Start-to-Finish, Baseline Schedule and Execution Schedule are established for all detailed level tasks, and corresponding Baseline Duration and Execution Goal Duration are set. Calculate. Depending on the field and characteristics of the project or task, the duration of each task may be predetermined or may be the time until a specific situation or state is achieved.
Step 4.Task Performing Stage (S104)
According to the'Execution Schedule' of each task established in the'Task Execution Plan Establishment Step', each time the task starts at every unit time, the Expected Supply Resource and the expected Deliverable that can be completed accordingly Calculate the corresponding expected progress. In case progress is expected to be delayed, measures are taken in advance, and progress and progress of all tasks are continuously monitored according to the progression time. In the case of an ‘event’ that interferes with the resource input during task execution and can affect the progress, take immediate action. Whenever each unit time elapses, the planned progress and performance progress of the unit time are compared for each task, the cumulative plan progress and the cumulative performance progress up to the unit time are compared, and the Significant Level prescribed in advance. ), in the event of a'delayed progress event' that differs by more than one, a'event absorption strategy' (Event Absorbing Tactic (EAT)) based on the GRACE (Gradual Resource Allocation and Cost Evaluation) technique described later is applied to maximize the delayed progress. It recovers early, tracks and analyzes the cause of the progress delay, accumulates it as experience, reflects it in goal management after the current unit time, uses events that may become opportunities for early completion, and additional instructions given by PM from time to time By performing the task assigned to the task and processing the requests of other managers,'All tasks of the level of detail subject to target management' (defined as'Vertical Breakdown Task Plane')'period/hour before target management' SWEEP' (Successive Work and Event Evaluation and Proceeding) Intelligent Autonomous Goal Management, which manages and achieves goals precisely through three-dimensional, continuous, proactive, and intelligent autonomous progress (regarded as'Horizontal Progressing Time Axis') Use the technique to carry out the goal management platform task. Depending on the field and characteristics of the project/task, if the progress needs to be managed in real time other than the progress, the occurrence of a situation that may affect the achievement of the goal is regarded as an event, and the task is to recover the situation or use the opportunity. It modifies or coordinates the execution plan or strategy, and performs the goal management platform task using the SWEEP technique.
Step 5. Project/Task Completion (Finishing) Stage (S105)
In the case that the entire project/task is successfully completed by completing the final deliverables that satisfy the quality standard for all tasks of the level of detail that have managed progress in the'task execution step', and there is a separate project/task owner In the event, it is handed over to the corresponding owner, and the goal of the project/task is achieved. ■
The intelligent goal management platform of the present invention supports the general manager of the Project/Task or the Project Manager (PM) (collectively, “PM”) through the five-step process, and autonomously and actively performs the goal management task.
The five-step target management process is mainly explained by plant engineering/procurement/construction (EPC) projects or production management tasks in a smart factory, but in addition, corporate management, organizational management, energy management, smart computer From the implementation of an operating system, management of goals and strategies or operations of various games or sports, stock investment, election management, and personal goal management, a wide range of humans who want to set and achieve goals It can be applied and applied in the field of activity. Depending on the field and characteristics of the project or task for which the goal is set, the PM may be other CEO, general manager, supervisor, or individual, and instead of the task execution plan, the execution strategy can be established, and the task execution period (Duration) can be given as the time until reaching a specific time or state, and progress management of a task can be parallel or replaced with state management.
If necessary for clarity of the description below, an example of a specific project/task will be described. Mainly explains the engineering/procurement/construction (EPC) project of a large plant or the production management task in a smart factory. In addition, the energy saving management task in the energy management system, and the power system, a large-scale national infrastructure An operation management task and a performance management task of a computer operating system are described as examples.

Hereinafter, the configuration and utilization method of the Super Tree will be described in detail with reference to FIG. 2.
First, it represents all management actions to achieve the goal of the project/task to be set and managed at the cost of'Optimal-minimum', and is the top manager (PM) 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 created (201).
The project/task management goal may be two or more, and therefore the'optimal/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 overall minimum cost that is reflected in the total cost by assigning the determined weight value.
Next, all management actions that need to be performed to achieve the goals of the above project/task are classified or subdivided by major field or division, and each division or subdivided major management field represents and represents the relevant management actions. Create major management nodes for (202).
Subsequently, as a stump that is the basis of the Super Tree composition, a Knowledge and Information Model in the form of a Tree data structure is created in which the main management nodes are child nodes of the Root Node, and this is defined as'STUMP' (Smart Total Unified Management Platform). Do (203).
The STUMP is constructed to form a framework that explicitly enumerates all major fields or sectors to be performed for goal management of a project/task and establishes an 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, and STUMP is based on not exceeding 3 Levels for clarity of the overall information and management system.
Next, in order to collect, store, and use all knowledge and information (hereinafter collectively referred to as information) necessary for the target management of the project/task selected for each of the major management sectors or fields, Depending on the relationship, the following information models for specialized purposes are defined and configured together with operations that can be performed on the model.
1. The structure of the Tree Data Structure that is organized to manage information that can be broken down into detailed unit information of the same kind or homogeneity when systematically or hierarchically classified or subdivided among the target information to be used for goal management. With'BREAKDOWN_TREE' (hereinafter expressed as'BDT').
2. The entire duration or time of target management is divided and subdivided by the management standard'Unit Time' of the desired time precision, and each subdivided unit time is expressed as a node, and the starting unit time From the'Start Node' representing the'Start Node' to the'Finish Node' (or'Last Node') corresponding to the end unit time, it is configured by connecting with arcs sequentially, and defined together with the operation, and the goal management is transferred. Schedule management of each task to be performed over time/period, progress management, progress management, dependency or preceding/successor relationship management, management of the operating status of various facilities to be operated, and various events In order to manage (Event) and risk management at the desired time resolution level, it has a structure in the form of a chain of nodes of unit time with a length corresponding to the duration of each task. 'IVY'.
3. Various production, manufacturing or manufacturing processes that handle raw materials, semi-finished products and products flowing in a certain direction, various media such as cooling water, compressed air, steam, and power, and a support system that supplies energy, and other various In a system that performs a circuit or a specific function, each facility or component, or element or entity constituting the process or system is represented as a node, and the form of the process or system is represented. Accordingly,'VINE' of the structure that represents the interconnection relationship between these facilities, devices, or elements or entities in Arc.
4. Various systems in which facilities for performing functions of specific purposes, elements or entities are connected so that data, medium or objects can move in both directions. In a network or network,'BUSH' has a structure that represents each facility, element, or object as a node, and represents the interconnection relationship between these facilities, elements, or objects in an arc along the shape of the system or network.
5. In addition to the information stored in the above STUMP, BDT, IVY, VINE and BUSH, the platform is basically required to perform a given goal management task, fulfills instructions from PM, or processes requests from other managers. 'SHRUB' with Tree Data Structure structure to store all information and knowledge needed for and use for reasoning.
The'STUMP','BDT','IVY','VINE','BUSH' and'SHRUB' are collectively defined as'PLANT' (204).
Subsequently, for each type of PLANT defined as above, an arbitrary number of individual PLANTs are created according to the need for target management (Instantiate), and the Root Node or Start Node is mainly connected to each node of the STUMP, and thus child nodes Separately, the act of connecting the Root Node or Start Node of other plants of the same or different types is defined as'Graft' (205, 206, 207).
In each node of each plant that has been grafted to the STUMP, related information is additionally stored for goal management, or if it is necessary to access information stored in another plant for inference, Root Node, Start Node, or arbitrary Node can be continuously and repeatedly grafted (208, 209), and through the Graft, each node can access, search, and search between nodes within its own PLANT. In addition to the traversal path, paths that can be accessed, searched, and moved to other PLANT belonging nodes through Graft are additionally created. The “Body Of Goal Management Knowledge and Information” (“BOGMKI”) consisting of all the plants grafted to the STUMP and STUMP is defined as “Super Tree”.
First, a method for direct access to each node in the Super Tree, which is configured to store all information necessary for target management, is described. All PLANTs composing the Super Tree are given a unique PLANT Name and PLANT Number within the Super Tree, and the'Root Node' or'Start Node' of each PLANT (hereinafter referred to as'Root Node' if not specified separately). The Node Name of (general name) is the same as the corresponding PLANT Name. PLANT Numbers are assigned by configuring a numbering system to determine the total number of PLANTs and the relative position of the relevant PLANT within the PLANT according to the characteristics of the Project/Task.
All nodes in each PLANT are also given a unique node name ('Node Name' or'Node Given Name') and a node number (Node Number) in the affiliated PLANT. Node Numbering is assigned by configuring a numbering system that can determine the total number of nodes of the plant and the relative position of a specific node within the plant according to the type of the plant. In addition, each node additionally has a path from the root node of the plant to which it belongs to itself and a'Node Full Name' consisting of its own'Node Given Name', which is the'PLANT Path Name' of the corresponding node. It is defined as'(PPN).
If it is difficult to give a unique name to each plant because there are many plants of the same (Identical) configuration as the same type of PLANT, the PLANT Path Name (PPN) of the node that has grafted the plant is placed in front of the Root Node or Start Node of the relevant PLANT. Paste them together so that they have a unique name. Even in the case of a node, when it is difficult to assign a unique Node Name because a number of similar nodes exist in the same PLANT, a uniquely distinguished path part of the PPN of the corresponding node is used to distinguish or access.
The'Graft' is achieved by storing the PPN (PLANT Path Name) of the other node as a Graft property value in both parties to graft, and mutually'Grafting Parent' and'Grafting Child' between both nodes according to the direction of the graft. The relationship is established, and a'Graft Path', a relative path that allows access to node information of other Grafted PLANTs, is formed centering on each node from both nodes. 'Root Node' or'Start Node' of all PLANTs except STUMP can be grafted to the Root Node of other PLANT or to any node, 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 connected to the graft. Typical types of grafts include the relationship of providing details or attribute information of main information; Physical antecedent/successor linkages; Temporal antecedent/successor relationship; Antecedent/successor relationship or dependency relationship of logical conditions; The relationship between physical main information and sub information; Identical to Equivalent information relationships; The relationship between the task and its execution method, knowledge, and expertise/technique or know-how; There are, and can be added or omitted depending on the field and characteristics of the project/task. Therefore, the graft has a directionality according to the mutual relationship between the nodes to be grafted, and in the same or equivalent information relationship, the direction can be arbitrarily determined according to the convenience of using information for target management. In addition, all grafts in the Super Tree can be statically or dynamically performed during goal management or inference, and these are called'Static Graft' and'Dynamic Graft', respectively. In the case of'Dynamic Graft', the graft may be canceled (hereinafter referred to as'Degraft') after the purpose or purpose of the graft is terminated.
All nodes in the Super Tree have a path from the Super Tree's Root Node (expressed as'ROOT') to itself and a path name including the node itself, and this is called'Super Tree Path Name' (STPN). Therefore, STPNs of all nodes except for the STUMP Node include one or more'Graft Paths'. In addition, when a node other than the root in each plant is grafted to a node of another plant, the node has an STPN through the grafted node in addition to the original STPN that includes the root node of the plant to which it belongs. The STPN that passes through the root node of the plant to which the node belongs is specifically called'Original STPN'. Therefore, each node may have one or more STPNs, and a desired STPN may be selected and utilized according to the context required in the inference process using the node. In the case of STPN formed by grafting random nodes to other PLANT nodes except for the root in a specific PLANT, the name of the corresponding node is indicated by including the PPN of the corresponding node in parentheses.
In addition, two arbitrary nodes in the Super Tree can form a Path Name as a relative path starting from the other node and reaching itself, and this is defined as a'Relative Super Tree Path Name (RSTPN). In the path constituting the'RSTPN', the path part in the direction descending from the ROOT of the Super Tree is called the'Forward Path', and the path part in the direction going up toward the ROOT is the'Reverse Path'. It is called. Each Super Tree Relative Path Name (RSTPN) may change direction from a specific node during progress or backtrack to a path that has passed, and thus may include both a forward path and a reverse path.
When inference needs to be made while using surrounding information centering 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 designating the node as a COIN and using the COIN-centered RSTPN.
The following is the method of notation of the STPN, PPN, and RSTPN, which is the node path for storing information in each node of the Super Tree and for accessing, retrieving, extracting, or searching. Explain about it. The forward path between nodes is marked with Slash('/') instead of Arc for convenience. However, in the case of the Graft Path, mark it as Double Slash ('//'). In addition, when indicating a reverse path, use Back Slash ('\'), and in case of a reverse direction graft path, use double back slash ('\\' ). However, the path notation may use other symbols as long as there is no confusion depending on the programming language implementing the platform.
In the expression of paths for accessing each of the Super Tree Nodes, when accessing a corresponding node or making reasoning (Reasoning or 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 or not, if the path includes'*', which is a wildcard notation, it can be matched with an arbitrary path including one or more nodes at the corresponding location, and if it includes'&' 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 location of a path, the actual node name of the corresponding variable node location can be extracted as the variable node value from the matched relative path.
When a graft is made between two nodes, the expression of the corresponding Graft Path is expressed as'PPN of Grafting Parent Node//(PPN of Grafting Child Node)' in the forward direction, and'PPN of Grafting Child Node' in the reverse direction. It should be expressed as'\\' (PPN of Grafting Parent Node)'.
Next, the ‘action’ that the platform can perform on or utilize the Super Tree and the PLANT or PLANT Nodes that make up the Super Tree will be described in order to perform the goal management task.
The'action' 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 in the whole Super Tree and'Exclusive Operation' that can be applied separately to each plant, and has the same name. Even for the operation of, the method of application may vary depending on the applied plant.
Basic common operations performed on Super Tree include'Create_Super_Tree','Create_PLANT','Create_Node','Insert_Node','Delete_Node','Graft','Degraft','Prune' and'Node_search'. Examples of manipulations 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 represented by changing the order and case of constituent words according to the use environment of the operation and whether the expression is emphasized. The name of each operation indicates the purpose of the operation, and the details of the detailed operation are defined by the platform implementation engineer or manager or PM according to the characteristics of the project/task. Each operation is implemented using'Rule' so that the details are explicitly indicated, the creation of black-box is excluded, and can be adjusted or updated freely and flexibly.
In order to compose a new Project/Task goal management system, the'Create_Super_Tree' presents the typical basic Super Tree structure or skeleton of the relevant Project/Task field that has been previously configured when basic information is entered, and is freely displayed on the graphic. It is an operation to create, add, delete, and graft various plants and nodes, and to create a super tree.
The'Create_PLANT' presents the typical basic structure or skeleton of the type of PLANT to be created under the selected Super Tree Skeleton, creates, adds, and deletes nodes of the plant freely in the graphic, creates the plant, and It is an operation to graft.
The'Create_Node' presents the skeleton of a typical and basic Node of the designated PLANT and the Skeleton of the attribute SHRUB (Node Attribute SHRUB (NAS)), and'Instantiate' it as a specific node and insert or connect (Insert) or connect ( It is an operation to be able to connect).
The'Insert_Node' is an operation for connecting the created node to the corresponding PLANT, and the'Delete_Node' is an operation for deleting the node selected from the PLANT. The manipulation of'Insert_Node' or'Delete_Node' includes manipulation of connecting or disconnecting nodes around the corresponding node according to the type of the PLANT.
The'Graft' operation is an operation that connects the same or different types of PLANT to the selected PLANT, and'Degraft' is an operation to separate the grafted PLANT. The'Prune' operation is an operation to delete all descendant nodes or subsequent nodes, including the selected node, and the'Node_search' is an operation to search for a node with a desired condition in the entire Super Tree or within 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 nodes, and thus'the total aggregate of goal management knowledge and information', that is, ' The knowledge and context information of the Super Tree, which is'BOGMKI', is increased, and the learning effect of using the information of these increased nodes for inference for goal management is increased. Will come true.
All operations performed on the Super Tree, functions or tasks basically implemented in the platform, and operations of the higher level of abstraction are used to represent and process the instructions or tasks and requests given to the platform. In order to express and process requests and operations,'Basic Terms and Expressions' are defined and used as Platform Keywords, and the defining Keyword is called'Semantic Primitive (SP)'.
Basic Semantic Primitives (hereinafter referred to as'SP') are'Graft' and'Degraft' for manipulation of interconnecting or separating PLANTs to form and terminate relationships between information,'Visit' to visit specific nodes, and specific nodes. B.'Evaluate' (or simply'Eval') to return a specific attribute value of the corresponding node, and when a specific variable value is set, the relevant'Fact' is announced and all or part of the prerequisites are satisfied as the Fact. There is an'Assert' that allows you to'Invoke' and'Execute' (also expressed as'Fire' or'Trigger') to'Satisfied''Rule'.
In addition to that, examples of commonly used SPs. 'Acquire','Check','Collect','Compare','Compute''Conduct','Control','Create','Define','Determine' ','Develop','Display','Estimate','Evaluate','Explain','Find','Forecast','Implement','Monitor','Perform','Plan','Report', SPs such as'Set','Show','Simulate','Summarize','Support' and'Validate' are used, and'Expand' to display detailed information or time of a specific facility 'Alert' for notification,'Confirm' and'Acknowledge' for confirmation,'Every' to indicate the range of manipulation targets, or'Each','All' and'With_condition', providing specific information or including in the information 'Every_day','Today','Yesterday','Previous_day','Tomorrow','Next_day','Every_week','Last_week','Every_month','Last_month','Present ','In_progress','Past', and'Future','All','Every','If','Else_if','Else','Equal' ( Quantity),'Eq'(Quality) or'Is','Not_Equal','Greater_Than(GT)','Greater_or_ Equal(GE)''Higher','Lower','Above','Below','Less_Than (LT)','Less_or_ Equal' (LE),'AND','OR' and'NOT' SPs are used, and each P Depending on the characteristics and convenience of roject/Task, Jargon or Lingo commonly used or commonly used in the relevant field are added and utilized as SP. Each SP may be defined or used, including other SPs, to define or specify its meaning.
By grafting'Node Attribute SHRUB' (NAS) to each node in the Super Tree, the attribute of the corresponding node can be systematically/hierarchically classified and subdivided and stored. Each attribute node of the NAS basically includes the node's own PPN, the node's child node or successor node, the number of'Adjacent Nodes' and the Node Name List, the number of Grafts, the type of Graft, and the Grafting Parent Nodes. It stores property information such as PPN List and PPN List of Grafting Child Nodes. Therefore, the properties of all nodes can be accessed through'STPN' including the NAS Graft Path of the node in the Super Tree or'RSTPN' starting from the node. Each node of the NAS can continue to graft other plants.
The'Node_Visit' is an operation for visiting or selecting corresponding nodes to perform a desired operation on a specific node. Each node in the Super Tree can use itself as a variable if it is a variable expression that can have its own value. The'Node_Eval' is an operation to return the variable value of the node when a specific node is evaluated. If the node itself is not a variable node, a value to be returned when'Node_Eval' can be stored including a'Value', Node, or'Eval Expression' Node in the property node. The'Value' Node has a value that must be returned directly when Node_Eval is performed, and the'Eval Expression' Node has a'Eval Expression' in the form of a List that enables a value to be returned through a logical operation or arithmetic operation when Eval is performed. The first element of the'Eval Expression' is usually an arithmetic operator, a logical operator, or a function, method, or procedure that can be called and executed, and the remaining elements are mainly arguments.
The'Node_Expand' is an operation to expand 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 to display a child node or a subsequent node of a corresponding node within a PLANT belonging to the selected node by the level specified according to the structure of the corresponding PLANT. Therefore, if you want to display only the child nodes or subsequent nodes of the selected node, perform the '1-Level' Expand operation. In the case of IVY, 1-Level Expand is also called'Node Increment' due to structural characteristics.
The'Node_Total_Expand' is an operation in which all descendants or successors below or after the corresponding node within the PLANT belonging to the selected node are indicated according to the structure of the corresponding PLANT.
A node that is represented by collapsing or condensing a facility or element of a complex structure into one node is defined as a'compound node', and the'Compound_Node_Expand' refers to a compound node of the corresponding node. This is an operation that expands or expands to a plant showing a detailed configuration. At this time, if the expanded PLANT has a homogeneous structure with the PLANT to which the original complex node belongs, the entire expanded PLANT can be inserted into the original PLANT to replace the corresponding complex node. Otherwise, the corresponding complex node The expanded PLANT is displayed by grafting.
The'Node_Graft_Expand' is an operation that shows the entire PLANT to which the corresponding node belongs on the display showing only the grafted node 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 it as a property of the selected node, and pruning all descendant nodes or subsequent nodes. The collection of the information refers to selecting specific attributes, statistically processing, or logically collecting and determining.
The'Path_generate' is an operation of generating a general-purpose STPN that can match the STPNs of multiple nodes by including a variable expression node such as'?node' or a wildcard expression such as'*' or'&' in the path of the STPN. And'Path_Instantiate' is an operation to instantiate the STPN so that Node_Eval is possible as a specific Node Name by replacing all variable expression nodes with actual node names in the general-purpose STPN.
The Super Tree operations can be added or omitted according to the characteristics of the project/task. In addition, the expression of each operation name may be displayed in upper and lower case or by changing the position of the verb and noun expression for the content and emphasis of the operation or according to a specific use.
With the configuration of the Super Tree as described above, all information and knowledge necessary for the goal management of the project/task to set and achieve, the affiliated plant, the name of the node, the properties of the node, and the path of the node It is possible to save as (Path), the relationship between other nodes in the affiliated PLANT, and the relationship (Context) with neighboring PLANT nodes connected by Graft. Each node can be used as a variable that has a value represented by a number, a literal term, or a list. In the case of List,'Enumeration List' which simply enumerates member elements,'Function List' which includes operator and function names and arguments for arithmetic operation or logical operation at'Eval', and judgment or reasoning. It is divided into'Operation List' that contains additional information and operation to perform. Each node value is manually input through a keyboard or smart phone, or automatically input through a sensor or measurement system or other server or Internet, or by arithmetically or logically calculating the other node value(s) received. , Linear Programming, Dynamic Programming, Search, Sorting, etc. Existing algorithms, statistics, or arithmetic software packages or tools are called or introduced and calculated, or'Rule' is applied to the above node values. It can be acquired by judgment through reasoning or inference.
Next, the configuration and utilization of each PLANT constituting the Super Tree will be described in detail.
First, the configuration method of STUMP that forms the framework or foundation of the Super Tree is as follows.
In the ROOT Node, which is the root node of Super Tree and the root node of STUMP, basically, the name, content, goal, 'Project/Task Charter SHRUB' (211), which includes all basic information such as execution subject or owner, PM or general manager, execution period, total budget and location, and monitors progress along the entire project/task progress period. To manage,'Master Calendar-mapped Progress Management IVY' (212) and'Master Event BDT' to be described later are grafted.
The goal of the above project/task can be the completion date or construction period, scale, production capacity and budget in the case of a plant EPC project, and in the case of a smart factory construction task, it can be the annual production volume, quality and target cost for each product. In the case of corporate management, it can be an annual sales target and profit target, in the case of a building management task, it can be an indicator of annual operation and management costs, safety, security, and benefits, and in the case of an energy management task, it can be It can be a savings cost, and in the case of a computer operation management task, it can be an indicator of Response Time, Security level and usability, and in the case of a sports goal management task, it will be a win rate, win, or win. In the case of a stock investment goal management task, it can be the investment return target amount, and in the case of an individual goal management task, it can be the acquisition of a specific qualification or the achievement of a set goal.
Next, according to the characteristics of the project/task and the goal to be achieved, all management actions and targets to be performed are categorized by major division or field, and representative Major Management Nodes 202 are created and connected to the child nodes of the ROOT. It composes'STUMP', a knowledge and information model in the form of a tree.
Typical examples of major management nodes are the duration of the project or the entire task to be managed as'detailed tasks' (also expressed as'work','work package', or'activity' depending on the project/task). A'Time Management Node' 210 for creating and scheduling, managing the day of the week, holidays, major event information and time-related information of each calendar date; A'Deliverable Management Node' 213 for managing the final goal of a project/task and a result (Deliverable) or result state (hereinafter collectively referred to as'Deliverable') generated as a result of each task execution; A'Task Management Node' (214) for managing all and detailed tasks that must be directly or indirectly performed in order to complete or produce a Deliverable, which is a result or state of achieving the goal of a project/task; ‘Resource Management Node’ for managing all resources that must be put in to complete or produce Deliverable; A'Facility Management Node' 215 for managing system facilities such as production processes, Electrical System, Steam Supply System, Compressed Air System, Cooling Water Supply System, HVAC System, and instrumentation control system facilities; 'Space Management Node' to manage all spaces and locations required for project/task execution; 'Event Management Node' for coping with all events that may or may occur in the process of performing target management; A'Risk Management Node' for managing dangerous events that may cause delay in the entire task among events; 'Platform and Super Tree Management Node' to organize Super Tree and manage the platform itself; In addition, the'Rest-of-All Management (ROAM) Node' (216), which accommodates all management areas that have no practical benefit or cannot be accurately identified as a major management item at the time of Super Tree composition. In addition, all management actions should be completely (100%) included.
Each of the major management nodes may be subdivided into a plurality of detailed major management nodes and replaced, or may have subdivided detailed management nodes as child nodes.
For example, the Task Management Node is based on the characteristics of a project/task, and in the case of a plant EPC project, ITB or RFP Preparation Management Node, Bid Preparation Management Node, Contract Management Node, Engineering Design Management Node, Construction Management Node, Test It can be divided into separate Major Management Nodes as subdivided like and Commissioning Node, or all can be configured as child nodes of Task Management Node. In the case of Smart Factory construction and operation task, it can be subdivided into Production/Manufacturing Facility Management Node, Production/Manufacturing Process Monitoring Management Node, and Inventory Management Node, and in the case of computer operation management task, the normal operating system (OS) In addition to the Processor Management Node, Memory Management Node, Disk Management Node, File Management Node, Device Management Node and Network Management Node, it can be subdivided by adding Security Management Node and User Service Management Node. In the case of the operation task, the Energy Consuming Facility Management Node, Energy Consuming Category Management Node, Space Management Node, Energy Cost Management Node considering Time of Use (ToU), and Peak Electric Power Management Node to manage the maximum power demand, and The same Management Nodes can be configured to replace Task Management or can be configured as child nodes that subdivide Task Management Nodes.
Next, the breakdown tree (BDT) will be described in detail.
In order to store and utilize information that can be broken down into detailed management target information of the same or homogeneity, if 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-type Knowledge and Information Model that represents each of the generated detailed management target information as nodes and connects them to an arc that has parent-child relationship, and this is called'Breakdown Tree' (hereinafter ' BDT').
Each of the above BDTs contains 100% and only 100% of the objects classified at each level (also referred to as'The 100% Rule' in the Project Management Community), and for this purpose, there are objects that are omitted from the classification. In addition to the child nodes expressed as explicit, a'Rest-of-All' Node (hereinafter referred to as'ROA' Node), which symbolically represents all other targets, was added to the level to be managed completely. 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 division. In addition, each node of the BDT may also graft with other PLANT Nodes in the Super Tree related to the target.
An example of a typical BDT that is configured in a goal management platform is each created by hierarchically classifying or subdividing the entire 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' which represents the task of the level of detail as a node and grafts it to the Task Management Node of STUMP; "Deliverable BDT" which hierarchically breaks down the Deliverable to be completed or achieved as a result of the execution of the task for each task of the Task BDT during the target planning period and displays it as a node, and grafts it to the Deliverable Management Node of STUMP; ‘Master Event and Risk BDT’ that grafts to STUMP's Event Management Node, indicating all events and risks that may occur in the process of executing the target management task by category by category and displaying them as nodes; Hierarchy by type, manufacturer, capacity, model, location, etc. of all facilities that need to be used as part of the resource to achieve the goal according to the project/task or all target facilities that need to be installed or constructed Separately classified, individual unit facilities become Leaf Nodes, and'Master Facility BDT' which grafts to STUMP's Facility Management Node; When a building is included in the target,'Space BDT' which breaks down each floor and the space of each floor and displays it as a node, which is grafted to the Master Facility Management Node of STUMP; In order to manage and utilize the physical location of all facilities and spaces of the various Facility BDTs and Space BDTs, and location information on screens and drawings, a coordinate system represented by a 4 x 4 Homogeneous Coordinate Matrix of a hierarchical structure is defined, and these coordinate systems are defined. 'Coordinate System BDT' which is represented as a node and grafts to the Master Facility Management Node of STUMP; In order to manage sensors, instruments and controllers installed in all facilities and spaces, that is, Monitoring and Control Point, all control points are classified by type, installation location, and the name of the control point, and displayed as nodes. 'Monitoring and Control Point BDT' grafting to the Master Facility Management Node; 'Resource BDT', which divides all the resources to be put in to achieve the goal of Project/Task, divides them hierarchically, expresses them as nodes, and grafts them to STUMP's Resource Management Node; All activities related to project/task execution, namely construction, design, procurement, supervision, etc., are subdivided by field and displayed as nodes, and the required resource and part count and cost information for each subdivided activity are attribute. All nodes included in the'Platform BUSH', which represent the configuration of the H/Ws that make up the'Cost Estimation Standard BDT' platform itself, which are stored and grafted to STUMP's Resource Management Node are classified by function. 'Platform Facility BDT' grafting to Super Tree Management Node; In order to manage the project/task progress date and calendar mapping of all IVY nodes, each year including the entire period of the project/task is used as child nodes of the root node, and the month, day, and hour for each year 'Project/Task Calendar Time BDT' which grafts to STUMP's Time Management Node by breaking down hierarchically; All the plants that make up the Super Tree are classified by type, and the BDT with the name of the node is composed, and the root node of the plant is grafted to each node, and the'Super Tree PLANT grafts to the Platform and Super Tree Management Node of STUMP. BDT'; 'Order and Request (ORE) Generation, which is configured to display as properties of Node and Node by subdividing all orders and requests that can be made to the Platform by type and specifying them by content, and grafts them to ROOT. BDT'; Node that can graft all methods, knowledge, and reasoning flows for goal management into SHRUBs as rules, and classify the configured Rule SHRUBs by type and content and graft them as attributes. 'Rule BDT' consisting of; Can be mentioned. In addition, it is composed of nodes that divide and subdivide all the projects/tasks to compose the Super Tree by field, and the upper'Super Tree BDT' that grafts the Supter Trees composing each project/Task to each node can be configured. have. The Knowledge and Information Model consisting of Super Trees grafted to each node of the Super Tree BDT and Super Tree BDT is defined as'Super Tree FOREST', and is used when target management of multiple projects/tasks is to be performed.
Each task of the Task BDT includes both an action to be performed by a person and an action to be performed using equipment or facilities. Plant EPC Project design, procurement, construction, test and commissioning, and production in the factory, as well as management, system operation, organizational operation, computer management, energy saving, transportation, etc., according to the characteristics of the project/task, set and achieve goals It includes any actions that must be done to do so. The level of detail indicated by a task includes the detailed task as part number information of the same name, and the platform autonomously provides two-way information on the type, amount, and cost of resources to be invested for the deliverables generated as a result of executing the detailed task. It proceeds to and subdivides to the level that can be calculated. If the detailed level of the activity can be managed without separate progress management, it is not further subdivided and managed by including it in the property information of the detailed task.
For example, in the case of the PLANT EPC Project, as a child node of the'Electrical Work Task' of Task BDT, the'Peripheral Transformer Installation Work' task is subdivided into'Survey','Tream','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 Work, Work Package, or Activities, and each of the detailed tasks is the amount of deliverable (Quantity or State) corresponding to the total or partial progress to be generated as a result of performing the corresponding task. Is included in the attribute information, and the type and amount of resources to be injected and the cost can be calculated using the part-count information, and conversely, it can be completed or created according to the amount and cost of the resources to be input in a unit that can be input. You can also calculate the task progress value corresponding to the amount or state of the Deliverable.
Separately from the Master Facility BDT, a'VINE Facility BDT' or'BUSH Facility BDT' that divides facilities or devices for each process, system or circuit represented by each VINE and BUSH is constructed and grafts to the Root Node of the corresponding VINE or BUSH.
All facilities or spaces represent the facilities or spaces, and a location that serves as a reference is designated, and this is called a “representative point” of the facility or space. Among the nodes of the Facility BDT and Space BDT, a node requiring location information uses one of the nodes of the Coordinate Management BDT as a reference coordinate system, and has its own'representative location' coordinate and orientation information in the corresponding reference coordinate system as attributes. The highest coordinate system that becomes the overall reference, that is, the coordinate system of the Root Node of the Coordinate Management BDT, is based on defining the lower left corner point of the plan view of the entire project site as the origin and the positive north direction as the Y axis.
The PPN or STPN of the Leaf Nodes of the'Monitoring and Control Point BDT' is unique in the Super Tree and can be used as a TAG of the control point in the platform. By storing additional information such as the unit of the corresponding TAG value, communication protocol, and address as properties of the leaf node, it is possible to display a simple and clear TAG compared to conventional TAG expressions represented by a chain of multiple abbreviations codes. Nodes and attribute information can be used for inference related to the TAG.
The events constituting the Master Event and Risk BDT are largely classified into negative events, positive events, and neutral events according to their impact on achieving the goal, and unless otherwise specified, they refer to negative events as defaults. The Master Event and Risk BDT collects and configures the events that can occur during the execution process of each task constituting the Task BDT.
Typical types of resources constituting the Resource BDT include Manpower, Capital (Budget, Money), Material, Equipment, Facility, Energy, and Time. In particular, in the case of convenient and secure operation target management tasks of computers or smartphones, the main resources include Processor, Memory, peripheral devices (Pripheral) and Network, and in the case of stock investment target management tasks, it becomes Money. . When there is a separate management node for each resource type in STUMP, a BDT is configured for each resource and directly grafted to the corresponding management node, and otherwise, it is included as a subtree of the resource BDT.
In the case of a project/task that requires participation and cooperation of a large number of personnel, the project manager (PM), general manager, and all team members or project/task related people (Project Owner, Owner agency personnel, Subcontractor, etc.) Stakeholder') is represented as a tree of hierarchical structure by specialized field, department, or department in charge, and each responsible task, identity on the platform, authority, duty, qualification or capability, and career standards , By configuring'Manpower BDT' that stores all the information required for target management, such as individual real product information and the ability to create a specific Deliverable, as a property, Graft it to a child node of STUMP's Resource Management Node or Manpower Management in STUMP. When creating a node separately, graft directly to the node. In particular, in the case of Sports, the Manpower may be composed of a manager, a player, a support manpower, and a manpower of the opposing team, and in the case of a specific goal management task of an individual, support or force to achieve the goal of himself and the surrounding area Include manpower who can do it.
Each Day Node of the Project/Task Calendar Time BDT has the day of the week, sunrise and sunset times, forecast and actual weather information, and public holiday information as attribute values.
The'ORE Generation BDT' receives an order or a task assigned by a PM, a request from other project/task related persons, and a basic task (collectively,'Platform Task') given to the platform. In order to express and implement it, it is composed as follows. `
First, if the Root of the ORE Generation BDT of Level 1 is selected, a candidate group of SP (Semantic Primitives) is presented as child nodes as a keyword expressing the corresponding instruction or request, so that the PM can select or directly input it. When a specific child node is selected from the suggested candidate group, the detailed expression, contents, or values that are selected as properties of the selected child node or required to be input are presented as defaults and presented so that they can be selected or directly entered. When the required attribute is entered, the candidate group and attributes of the next level generation of child nodes of the next level of expression that can specify the instruction or request indicated by the SP again according to the selected SP child node are presented so that they can be entered. It repeats and concreteizes by increasing the level until the expression of the instruction or request is completed. When the input to the Leaf Node is completed, if additional supplementary content is required, additional input is requested as the attribute of the corresponding node on the created path. Therefore, the'ORE Generation BDT' is configured to display and store a specific instruction or request to the Platform as a path to the Leaf Node in the'ORE Generation BDT' and the properties of the nodes on the path. All candidate nodes and properties suggested by each level above are pre-stored in the Super Tree, so that the Super Tree is configured and accessed by STPN.
The PPN formed by inputting from the ORE Generation BDT to a leaf node along a specific path is not the name of the leaf node, but the context as the entire path and the attributes of each node and node included in the path. It represents an assignment or an expression of a request, and this path expression is defined as'Order and Request Expression Stem' ('ORE STEM' or simply'STEM').
To support STEM input and configuration using ORE Generation BDT, the PM can directly input the node name for each depth, or the node names that can be selected at the current depth position based on the input contents up to the previous depth are in alphabetical order. You can also present the listed drop-down menus to choose from. When a node name is entered, if additional information is needed, the PM presents the input window and directly or the Drop-down Menu is input and saved as a property of the corresponding node. The STEM input is performed by executing'STEM_Generation_Rule'.
3 is an exemplary diagram showing the configuration of an ORE Generation BDT. An example of a typical candidate node type presented for each depth of ORE Generation BDT and a node value or expression represented by the attribute of each node is as follows.
Depth 0 Node: Root Node of ORE Generation BDT (301)
○ Attribute: Relevant instruction, task and request issue time, name, text expression, subject (Default: PM) (302)
Depth 1 Node: YesSemantic Primitive: (one of the Leaf Nodes of SP BDT. Example: Report, Estimate, Monitor)(303)
○ Attributes: The content of the instruction or request, execution time, repeatability, report method (PC, Smart Phone, etc.) and format (Table, PLANT)(304)
Depth 2 Node: Object of instruction, task, and request action: object or object's state or specific attribute value (node of Super Tree)
Case 1: When an object is selected (intermediate node of STPN, eg Task, Facility, Resource)(305)
○ Attribute: Number of targets (singular, plural), name of target
-If the target is singular: STPN of the target
-In case of multiple targets: BDT or BDT subtree including the target
Depth 3 Node: State of the selected object or specific property value (STPN representing the variable) (306)
Case 2:When selecting the state of an object or a specific property value (Status example: Progress State, Operating State, Efficiency, Performance, Statistics, etc. Property value example: Early, Normal, Delay, Delay_Hi, Delay_Hi_Hi)(307)
○ Attribute: STPN or STPN Template indicating the target state or attribute value, and if there is a selection condition, the corresponding condition state or condition value
-If the target is singular: STPN of the node
-In case of multiple targets: STPN Template of the corresponding Node expression
Depth 3 Node: Target object (STPN of target object) (308) ■
Each STEM constructed using the ORE Generation BDT is assigned an issue number and name, and is grafted to the node of the corresponding STEM name of'STEM Classification and Depository BDT', which is grafted to the root node of'ORE Generation BDT'. In the description of Rule SHRUB to be described later, an example of the configuration of ORE STEM is shown.
Among STEMs, instructions, tasks and requests that must be performed regularly or frequently are called'Regular Order and Request (ROAR) STEM', and are separately stored in the RAOR Table, and each time or time (Interval) to be executed arrives, the Timer Execute by calling the responsible Rule with Rule. Among STEMs, STEMs in which the path nodes are the same and only the properties of each node are different are called'homogeneous STEMs'. In the case of homogeneous STEM, the same template rule is used, and detailed information to be provided to the rule for inference is supplied from the attribute values of the relevant STEM.
The STEM configured as described above is assigned a name as the path of the instantiated ORE Generation BDT, and the STEM is classified and subdivided by field, type, and content into the BDT node of the corresponding name of'STEM Classification and Depository BDT', which is represented as a node. Graft. The'STEM Classification and Depository BDT' is each grafted to the node of the corresponding STEM name of the'Super Tree PLANT BDT'.
Each STEM can be'Assert' as a'Fact' of the act of making the instruction, task, and request as a whole, and'Rule' that explicitly indicates specific methods and procedures for the implementation of the instruction, task, and request. Invoke them and execute them. All rules are implemented with'Rule SHRUB' to be described later.
In each node of all BDTs, a'Node Attribute SHRUB' (NAS) that systematically/hierarchically separates or subdivides and stores information on attribute values of the corresponding node, and the root node can be grafted. For example, in the case of Facility BDT Node, facility specification, symbol, image, location, orientation, 3D model, accumulation, operation method, driving history, energy consumption, reliability, actual efficiency, and various Performance indicators, etc. In the case of the Task BDT Node, it has a'Nature of Activity' (NOA) attribute node, and the subject and qualifications of the actions required to perform the task, required actions, and desired Descendants including detailed information on task execution actions such as target Deliverable, necessary facilities or equipment, materials, energy, and execution time can be created, or NOA SHRUBs can be separately configured and grafted to the NOA attribute node. I can.
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 for reconfiguring the classification system by reversing the level position between parent nodes and child nodes according to the purpose of using the BDT.
When it is necessary to list all the nodes belonging to each BDT, or to visit each node in sequence and evaluate it, a search algorithm such as Depth First Search (DFS) or Breadth First Search (BFS) is used. 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 each operation and return the node of the next visited location.
Next, the configuration and use of the IVY will be described in detail with reference to FIG. 4.
The time or duration of each task that composes the Task BDT is divided into'Unit Time' of task execution of a certain length, and each subdivided unit time is represented by Node, and the starting unit time From the'Start Node' (401) shown to the'Finish Node' (or'Last Node') (402) corresponding to the end unit time, a Knowledge and Information Model that connects sequentially with arcs is composed, and this is'IVY' Is defined as
The unit time is selected according to the characteristics and management convenience of each task, and can be selected from Day, Hour, Minute, Second or Week, Month, and Quarter, and the default value is'Day', and other units The time can be generated by'Expand' or'Shrink' (also expressed as'Condense' or'Collapse') of the'Day' Node, and will be described below based on'Day'. For example, in the case of a factory's production target management task, production begins, or in the case of a computer operation target management task, a session begins. In the case of sports win rate goal management task, when the game starts, or in the case of stock goal management task, when the stock market opens, the target management unit time for the time is set from'Day' to'Second' by'Expand' and management precision Can improve.
Each IVY configured as described above is grafted as'Task Progress Management IVY' (403) to the corresponding Task Node of the Task BDT to be performed during the corresponding period. If the task to be executed is a situation monitoring and management task, graft it as'State Monitoring and Management IVY'. Each IVY is given a unique name, and if it is difficult to give a unique name separately, the IVY is distinguished by a path expression including the Grafted Parent Node. In each Day-Node, the progress (Progress) corresponding to the Deliverable to be allocated or completed on the date, the plan and performance information of the resources to be invested and the cost (Cost), and precedence/performance information with other related tasks Follow-up relationship information, Milestone information corresponding to a specific progress, etc. are directly acquired as attribute values, or a dedicated SHRUB having the corresponding information is separately configured and grafted to the node of the corresponding attribute name.
Due to the characteristics of the IVY structure, all nodes except the Start Node have one'Previous Node', and all nodes except the Last Node have one'Succeeding Node'.
Each node of IVY is assigned a series of node numbers starting with 1th (or 1st) as the Start Node, and the node number is used as a node given name as it is (405). The PPN of each node is indicated by omitting other IVY nodes except for the node itself due to the characteristics of the IVY node name, and the Node Number of the Last Node becomes the length of the IVY and at the same time becomes the duration of the task (402, 406). ).
When each Day node of IVY represents only the pure length of time regardless of the day of the week, weekend, or holiday of the calendar, this is called'Net Duration' IVY(407), and when it corresponds to a specific date of the calendar, it is called'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 for task execution. When converting to'IVY', the Start Node of Net Duration IVY is the calendar date to start the task. 'Forward Mapping' and'Forward Mapping', which maps and deploys the rest of the nodes according to the daily, weekly, and holiday-specific work or working time policy (409), and'Forward Mapping', which aligns the Finish Node to the deadline and maps it in the reverse direction and deploys it. You can choose from three methods of'Backward Mapping' and'Bi-directional Mapping' in which intermediate nodes corresponding to a specific Milestone are matched to the desired calendar date, mapped in both directions, and deployed.
In the establishment of each task execution schedule, the Net Duration IVY is first configured according to the characteristics of the corresponding task, and then mapped by selecting one of the above three calendar mapping methods, or it can be configured as a calendar-mapped IVY directly from the beginning. In addition, IVY can be configured in which both the start date and the completion date are fixed on a specific calendar date due to the nature of the task, such as achievement of the annual production target or the annual energy saving target.
In order to monitor the overall progress and progress of the project/task and use it as a reference for configuring a calendar-mapped IVY for the execution of each detailed task, the entire execution period from the start date of the project/task to the completion target date Compose'Master Calendar_mapped Progress Management IVY' (408) that includes and graft to the ROOT of Super Tree. Each node number of'Master Calendar_mapped Progress Management IVY' (hereinafter,'Calendar_mapped' expression is omitted) is called'Master Node Number' (410) and represents the total number of days elapsed from the start date of the entire project/task.
The NAS of each node of the above'Project/Task Progress Management IVY' is the attribute information of the date, day of the week, weather, sunrise and sunset time, instructions and implementation results issued by the PM to the target management platform on that day, and other projects/ To store and display information related to the overall progress of the project/task, such as the request and processing result of the task related people, the day and cumulative total progress plan, performance, various events and risks occurring on the day do.
The'Task Progress Management IVY' of each task is its own'Self Node Number' (412) that represents the days elapsed from the start date of the task, and the'Master Node Number' (413) that represents the elapsed days from the entire project start date. By having as an attribute, it is possible to know information related to the calendar date of the day, the number of days elapsed from the start date of the entire project/task, and the relative progression relationship with other tasks, and precedence and follow-up relations with other tasks The setting of the task and the management of the task buffer day can be performed simply by comparing the serial number.
In addition, as IVYs for special purposes, the name of IVY represents a specific variable name, and each node of IVY is'Node Variable IVY' representing the variable value of the corresponding unit time or the average value of the variable during unit time. 'Sparse IVY', which shows only nodes with significant) information as selective or explicit, omitting the remaining nodes, and'Shorter, which expands and configures nodes of a specific unit time IVY into subordinate detailed unit time nodes Unit Time Expanded IVY' and'Longer Unit Time Shrinked IVY', which is composed by collecting and configuring the upper long unit time node, and to record the time and number of irregular events such as data acquisition, equipment failure, wage increase and material price 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, trend analysis of specific variables, correlation analysis, and comparison analysis.
IVY configured as above is a period in which monitoring and management actions are required for all nodes in the Super Tree that require monitoring and management actions according to the time of establishing a schedule or progressing in addition to each Task Node of Task BDT. It is composed of the length of and used by grafting.
Exclusive operations defined and applied in IVY include'Reference_IVY_display''Top_down_Scheduling','Bottom_up_Scheduling','IVY_node_increment','IVY_node_decrement','IVY_shift','IVY_spraflit','Calendar_Gpping','IVY_Graft' Examples such as ANT(Absolutely Needed Time)_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 that presents the IVY of the basic length to create an IVY, and'Top_down Scheduling' is an operation that allocates the progress to each unit time in a top-down manner for a specified duration, and ' Bottom_up Scheduling' is an operation that calculates and takes the progress of each unit time and sets the entire Duration in the Bottom_up method. 'IVY_node_increment' and'IVY_node_decrement' are operations to increase or decrease the length of IVY nodes one by one, and'IVY_shift' is an operation to move the entire IVY calendar mapping position back and forth before the start of the task, and the length of IVY according to the work policy in this process. Is subject to change. 'IVY_split' is an operation that continuously proceeds with two or more subsequent IVYs to divide one IVY into two or more tasks while the task is in progress.'Calendar_mapping' is the'Net Duration IVY' configured as'Calendar_mapped IVY'. It is an operation to switch, and'IVY_graft' (414, 415, 416, 417) is an operation that performs a graft to set the preceding/successor relationship between IVY nodes, and'ANT_estimation' is an operation that reduces further from the present to the end of the task. It is an operation that calculates the Absolutly Needed Time. 'IVY_node_expand' is an operation that grafts a specific IVY node by expressing it as'Unit Time Expanded IVY', which is the detailed unit time node IVY of the lower level, and'IVY_node_shrink' is a ' Longer Unit Time IVY', and'Progress_estimate' is an operation to calculate the progress of a specific IVY Node and the cumulative progress up to the corresponding IVY Node, and'Buffer_setting' is the Progress Management IVY of Tasks with a preceding/successor relationship. It is an operation that connects the nodes of the nodes with a graft and sets or coordinates the extra days.'Milestone_sliding' is an operation to move the node positions of the milestones back and forth according to the progress of the tasks, and '4D_display' is the operation of measuring the unit time of IVY. It is an operation that displays the progress status of the task as it progresses, and'Present_Time_Line_set' (418) is the unit time node including the current time as the present node and the previous node as the past node. It is an operation to set the node as a future node after that. Therefore, when the'IVY_node_expand' is operated, the current node can be expanded to IVY including the current node, past node, and future node in detailed time units.
Next, the configuration and use of VINE will be described in detail with reference to FIG. 5.
Each facility, element, or entity that composes a production process or a system of a specific function is represented as a node, and the physical connection and the physical connection to perform the function A data structure representing the flow direction of a medium or object to be handled as an arc is constructed, and this is defined as'VINE'.
The direction of the arc is determined according to the flow direction of an object such as a medium such as a solid, liquid, gas, current, or signal handled by a corresponding process or system, or a product having a physical form. In some cases, if it is partially bidirectional, the connection in the reverse direction is indicated as a graft.
Examples of typical VINEs are production processes of target plants or factories that must be built or operated to achieve the set goals of a project or task, or support systems such as power systems, steam systems, compressed air systems, cooling water systems, and air conditioning systems. In the case of (Utility/Supporting System), each facility (Equipment/Facility) of the process or support system is represented as a node, and'VINEs' that represent the Preceding and Succeeding connections between each facility as an arc are listed. I can. In general, the length of the VINE representing the main process or various support systems is generally long, and in the case of a batch process or an intermittent process, it may be short or consist of one facility.
As a special VINE, a VINE representing the flow of logic can also be configured, and in this case, it is separately referred to as'Logical VINE'. Examples of Logical VINE include a flow chart for computer programming, a start-up/shut-down sequence of a process facility or system, a block representing the product production process of a process, and a specific event according to interlock logic. The propagation path of, etc. are mentioned.
The types of nodes constituting the VINE include virtual'Root Node' to'Start Node' and 501 symbolically representing the starting point of the VINE, and one or more child nodes to successive nodes (Succeeding). Node) with a general'equipment node' (502), a'branch node' node representing a branch point of a process, system or circuit) and a'junction node' node representing a junction point) and (504), as needed According to the'Compound Node' (505) representing the'Compound Equipment' Facility) that can be'expanded' as a separate detailed VINE representing the detailed configuration, the'Piping Node' representing the pipe of the pipeline, and (506),'Cable Node' representing the cable of the line (507),'Duct Node' representing the duct,'Component Node' representing various elements of the circuit, and Vent Valve (508) or Drain (509) Valve There are'Dangling Node' or'Attached Node' in the form of hanging on the main VINE stem (510, 511), and other nodes with names representing their functions are created according to the characteristics of processes, systems, and circuits. Can be added.
The measurement control circuit required for each of the above processes, systems and facilities is also composed of a separate VINE, and a common power source (P: Source) and Ground or Neutral (N: Sink), measuring instruments, sensors, transducers, actuators, controllers, each 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 facilities') are represented as nodes. Connection cables between devices are not separately indicated when there is no need to use or manage specifications or distances for target management.
Each Vine is given a unique name (512, 513), the name of the start node is the name of the corresponding VINE, and the number of the virtual start node is set to 0. Each node in the VINE is also given a unique name and node number in the VINE. The node numbering system is structured in the form of assigning a serial number according to the characteristics of the process or system represented by VINE or representing the preceding/successor relationship. The PPN of each node can be simplified as much as possible to the level in which uniqueness is maintained, and the simplest PPN type can be'VINE_Name/*/Node_Name'.
If there are multiple facilities or devices of the same specification in stand-by or in parallel, a constant representing the total number of facilities'n' or'[n]' representing the array variable is used as the denominator in the common name of the facility. The suffix is added to the fractional expression'_i/[n]' representing the serial number'i' assigned to the facility as a numerator, so that each facility node can have a unique name within the VINE (514, 515, 516, 517). Pipe or cable nodes of the same specification that may exist scattered in a number of times use a general name such as'Pipe' or'Cable', and a PPN including the facility node connected to the front end is used as the node name.
For each VINE, a specific BDT for the VINE, which systematically classifies the relevant VINE facilities by type, is formed and grafts to the root of the VINE. All Leaf nodes of the VINE-dedicated BDT are also included in the Master Facility BDT, and may have different classification systems from the Master Facility BDT. In this way, when nodes representing the same facility or variable belong to different PLANTs, it is referred to as'Alias Node'.
In each node of the VINE, a “NAS” (Node Attribute SHRUB) that systematically classifies attributes of a corresponding facility or device and stores them as values of nodes may be configured and grafted. All VINE nodes have basic properties of connected front and rear facility information, namely, the number of Preceding Nodes, the number of PPNs and subsequent nodes, and PPN, the total number of grafts, PPN of the grafted nodes, and Alias Node information. Save as value.
In addition to the above basic attribute values, in the case of VINE Nodes representing the production process or system, the physical location coordinates and orientation of the facility, a drawing representing Schematics or Physical Layout, or the location coordinates and orientation on the monitor screen, 3D Model, Symbol And accumulation (magnitude), the preceding facility(s) of the facility, inputs and outputs connected to the outside, changes in the physical or chemical state of media or products within or passing through the facility. Facility function or role information, operation method and operation status monitoring standard of the facility, real-time operation and operation status information, installed instrument information and real-time measurement value,'control logic information', cause and type of various alarms, failure To cause and type and spread range information of emergency stop (trip), start/stop sequence,'type of input energy' for each facility, standard and actual value for each type, reliability, calculation method and actual value of various performance indicators, operation history, and Additional attribute values such as reliability information are stored. In the case of a node in which Alias exists, the stored property information may be different for each Alias. The NAS is also grafted to each node of the VINE-dedicated BDT, and functions and performance-related information, statistics, and information in the VINE belonging to the relevant facility or device, such as common specification information, maintenance history, and reliability information of the corresponding VINE facility or device. It stores and manages mutual comparison information between facilities of the same kind.
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 property name of the corresponding facility. In the case of the relay element of the logic circuit that the VINE node controls, the contact information that drives the relay and the excitation status information of the relay, and in the case of a change over switch, information such as the current position of the switch is the scope of the task of target management. Save as needed with (Scope).
'Types of input energy' for each facility are basic energy such as electric power, coal, oil and gas, and secondary energy such as steam, compressed air, vacuum, cooling water, heat, cold air, and heat. It contains all of the energy.
By configuring the VINE to include the connection status, interaction and function information of each facility or device as described above, the target management platform allows the operation or operation of each component facility or device of the process, system or circuit represented by the VINE. It is possible to evaluate the validity and adequacy of the system, logically trace the cause and extent of the spread of abnormal situations such as various alarms and trips, and it is possible to calculate the loss of pipelines or lines. . Therefore, VINE enables the realization of the'Digital Twin' of the process or system to be displayed.
Next, a method of configuring VINE will be described in detail, taking a typical manufacturing process line as an example. Starting from the Root Node, which symbolically represents the starting point of the process, it connects to the main equipment nodes and designates one main path to the last node, connecting the equipment nodes along the main route. Proceed with the composition of VINE. When a branch point is encountered in progress, a'branch point node' is created at the branch location. In each branch point node, the number of subsequent nodes and node name are stored as attribute values, and'branch point stack' is additionally set, and among the nodes branching from the branch point, the node name of the path to be traced later is pushed and stored, and Preorder Depth First Search (DFS) search method continues by creating the following subsequent facility nodes along the main route. When it reaches the Last Node (515, 516), it rises backtracking toward the Root/Start Node again along the configured path. If there is no branch point node created, it will come up to the root node and the VINE configuration is terminated. When encountering the branch node node created when descending in the back track process (503), the node name of the highest path is popped from the stack set in the branch node, and along the branch path again, in the same way as the VINE node creation method in the main path. It creates subsequent nodes, proceeds to the last node, and performs Back Track. When subsequent nodes are created and rejoined to the original path that branched while descending, the node of the original path to be joined becomes'joining point node' (504, 505). Except for the facilities 514 and 515 operated in parallel or stand-by, when the branched processes are rejoined, they are joined by a graft (518). Finally, when the stack of all'branch node's is emptied and returns to the root node of VINE, the configuration of the corresponding VINE is completed.
When there is a path that returns to the upper path of the process or system and joins it, such as the minimum flow or condensate recovery pipe (519), it is joined using a graft (520), and a cycle is formed in the VINE. Prevent it. Corresponding Graft information is stored in the properties of both nodes that are joined, and it can be determined that the corresponding path connected from the PPN of each stored node is the Return Path.
In the case of a sub-process that starts separately and joins the main path (512), the root nodes are grafted to the root node of the main process VINE, and the relationship between the main process and each sub-process is expressed as a property of the graft (521). The confluence of is also contained through the graft (522).
Even in the case of the support system VINE (513), the root nodes are grafted to the root node of the main process VINE, and the relationship between the main process and the support system is expressed as a property of the graft (523). Shown (524, 525).
Since the PPN of typical VINE Nodes is long, only nodes that need to be explicitly indicated for inference for goal management are included in the path and the remaining nodes are omitted. The simplest type of PPN can be composed of only two explicit nodes such as'VINE_Name/*/Node_Name'.
In a system that has a natural tree structure, such as the internal distribution system of a factory or building, nodes are searched in a manner conforming to the'Breadth First Search' (BFS) according to the form of One Line Diagram without specifying a separate main path. It is created and entered, and the number of phases, phase names, and neutral line information for connecting cables or buses are stored as attribute values. In the case of a distribution panel, it is represented as a complex node, and when detailed internal connection information is required during the inference process for target management, it is expanded to the detailed VINE below to indicate the detailed configuration of the distribution panel. Equipment connected in parallel, such as self-generation equipment for emergency power, photovoltaic equipment, and energy storage equipment (ESS), separately constitute a VINE and connect to the confluence by a graft. An example of the junction node may be a facility node such as an Automatic Transfer Switch (ATS) or a Closed Transition Transfer Switch (CTTS).
Examples of typical operations applied to VINE are'analyze_Trend','check_Consistency','display__Schematics','display_VINE','display__3D_Layout','display_4D_Layout','estimate_HotLosses','estimate_Operational_Cost','check_Relimate','estimate_Operational_Cost','estimate_oldability','estimate_oldability' There are manipulations such as','find_Bottleneck','monitor_Idling_Facility','monitor_Operating_State','monitor_Start-up_Sequence','monitor_Shut_down_Sequence','monitor_Performance','expand_Compound_Node','shrink_into_Compound_Node','find_streamor' and'find_upstream' and'find_upstream'. . The purpose of each of the above operations is according to the corresponding name, and specific implementation details may differ depending on the characteristics of the project/task.
In the case of the internal distribution system of a factory or building, operations such as'monitor_Power_Quality','monitor_Peak', utilize_Time-Of-Use-Rate,'stimate_Cable_Loss','estimate_Transformer_Loss', and'estimate_Motor_efficiency' can be additionally configured. 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 described.
In various systems that are configured so that facilities, elements or entities for performing a specific purpose function are connected so that data, medium or objects can move in both directions, Each facility, element, or entity is represented as a node, and a Knowledge and Information Model representing their connection relationship as an Arc is formed, and this is called'BUSH'.
The BUSH aims to represent all other systems and networks that are not included in the definition and characteristics of VINE described above. Typical examples are various computer networks, internal configurations of computers consisting of processors, memory, disks, ports, keyboards, monitors, and various peripheral devices connected to the bus, measurement control circuits for two-way communication, various traffic or road networks, And BUSH representing the National Electric Power System.
Examples of the equipment and elements constituting the node of the BUSH include various servers, PCs, network equipment, and measurement control equipment in the case of the computer network system BUSH. More specifically, centering on 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, Proprietary Network for measurement and control equipment below, data collection and control equipment such as DCS or PLC for measurement/control, and control panel at various sites connected to these measurement/control equipment , Sensors, measuring instruments, transducers, and relays and connecting points thereof, and facilities connected to ports of the main server and other servers. In the case of the national power grid system BUSH, there are power plants, transmission line facilities, distribution line facilities and loads.
In the case of the server node or the PC node, it is a'Compound Node' and can be expanded or expanded to a detailed configuration BUSH. In this case, the processor, bus, memory, hard disk, and peripheral devices can be configured as an entity, that is, a detailed BUSH that is a node, and can be expanded and included as a part of the original BUSH, or can be grafted to the corresponding compound node. If detailed configuration information of the PLC's Ladder Diagram or DCS's internal circuit or logic is required in the above measurement control facility, the PLC or DCS is designated as a compound node, and the corresponding PLC or DCS is expanded to VINE or BUSH according to the circuit configuration type. Graft to the DCS node.
The connection relationship between the facilities or elements includes wired/wireless connection, and if necessary for target management, explicitly indicate as a node similar to a pipe or cable in VINE, and otherwise, the connected facilities or elements Include or omit in the node attribute.
In the BUSH, there are'Configuration BUSH', which is configured according to the shape or schematics of the system to be displayed, 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 symbolically representing the starting point of the BUSH is set, and an arbitrary'Center of Universe (COU) Node' that becomes the center of the system configuration or connection among the above facilities or elements. Select and make it a Level-2 child node of the Root Node. Next, the facilities or elements directly connected to the COU Node are used as Level-3 child nodes of the COU Node, and the facilities or elements connected to each child node are continuously searched in a breadth first search (BFS) method. It proceeds by creating child nodes. When the searched node encounters a node that has already been created while another node is in progress, it connects with a graft rather than a child node, and the node stops further searching to prevent the formation of a cycle. After proceeding as above, it returns to the COU Node, and when there are no more facilities or elements to be searched connected to the COU, the corresponding'Configuration BUSH' is completed.
In the'Adjacency BUSH', a virtual Root Node is first set, and all equipment or element nodes are Level-2 child nodes of the Root Node, and are connected to or adjacent to each child node of the Level-2 (Adjacent ) The configuration is completed by connecting other Level-2 nodes to Level-3 child nodes of each Level-2 node. The'Adjacency BUSH' is different from the traditional Tree in that the parent-child relationship is reversed because the same Level-2 nodes can have different Level-2 nodes as mutual child nodes while having a tree structure. If each node is connected to each other in a many-to-many manner, and the physical shape or configuration does not provide additional information for target management separately, configure only the'Adjacency BUSH' without configuring the'Configuration BUSH'. May be. The configured BUSH is grafted to the Master Facility Management Node of STUMP.
As in VINE, each node of the BUSH is also grafted to the root node of the corresponding BUSH by configuring a dedicated BDT of the corresponding BUSH that is classified or subdivided by type or division.
In each node of BUSH, a Node Attribute SHRUB (NAS) that stores and manages the attribute information of the corresponding node is grafted. In the NAS, the serial number, address, name, function, specification, symbol, shape or isometrics, physical location, location on the drawing or screen, child nodes are basically Or, it stores 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 function or characteristic of the corresponding node.
In the case of a server node, in addition to the above basic properties, it provides service information such as Web Service, FTP, Email, ERP, MES, FMS, SCADA, PI Server, EDMS (Electronic Document Management System), ECMS (Enterprise Content Management System), and When linking with the type or function of the same server and other various project management tools, design integration tools, and engineering software, data exchanged with mutual 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 by BUSH and included in the Super Tree so that it can be managed together, as well as the platform's own configuration, function and performance management, as well as interlocking with other servers. It is possible to unify target management tasks through information exchange.
Dedicated operations for BUSH include operations such as ‘display_BUSH’, ’display_Schematics’, ’monitor_Operating_State’, ‘expand_Node’, and ’trace_Path’.
For example, in the case of BUSH representing Computer Network System, additional operations such as'show_Protocol','expand_Compound-Node','monitor_Traffic', and'trace_Communication_Path' can be added. In the case of a PC or computer server, expand to ' 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_Working_Set_Size','optimize_Size','optimize_Cache 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 content and execution method may be different according to the field and characteristics of the project/task. For example, the'trace_Path' can be defined as an operation to search for all paths (excluding cycles) that exist from an arbitrary start node to an arbitrary destination node from BUSH, and Adjacency BUSH is defined as As it expands, it can be done with the following three-step search method.
Step 1.Select a start node among Level-2 nodes of Adjacency BUSH to search for a path, and set the loop variable'i' to 2.
Step 2. For each level (i+1) child node of the set Level i node
(1) If the child node is a starting node, a parent node of the previous higher level, or a node already included in the PPN path from the starting node to the current child node, the child node is pruned.
(2) If the level (i+1) child node is a destination node, the ‘Plant Path Name' (PPN) from the starting node to the destination node is included as one of the found relative paths.
(3) For each other level (i+1) child nodes, copy the level 3 child nodes of the corresponding node, connect them as Level (i+2) child nodes, and increment with i = i+1, Repeat Step 2.
(4) If there are no other child nodes in (3) above, go to Step 3.
Step 3.Report all relative paths found. ■
The path search in the third step is performed in a depth-first search (DFS) method, and in Step 2 (1), Cycling in the search process is naturally excluded. The minimum cost path can be found simply by allocating cost or distance to each arc and purging the path that is more expensive than the minimum cost found during the path search. As described above, the expanded Adjacency BUSH is called'Expanded Adjacency BUSH' in order to track all the paths from the random departure node to the destination node. The method of performing the three steps of the'trace_Path' operation is also implemented as a'rule' to be described later in order to explicitly indicate its contents.
Next, the configuration and use of SHRUB will be described in detail. 6 and 7 show examples of configurations of NAS (Node Attribute SHRUB) and Rule SHRUB, respectively.
In addition to the information stored in the above STUMP, BDT, IVY, VINE and BUSH itself, perform target management tasks that are basically given to the platform, perform instructions or assignments given by PM, or receive requests from other managers. A Knowledge and Information Model in the form of a Tree Data Structure that represents all knowledge and information required for receiving and processing as a connection relationship between Nodes and Nodes, and operations that can be performed on the Model ) And use it as'SHRUB'.
All of the above knowledge and information are the attribute values of all nodes of the STUMP, BDT, IVY, VINE and BUSH, various arithmetic and logical operations, situation determination, cause tracking, countermeasure establishment, action implementation and procedure progression. Knowledge and information for, and using the attribute values and knowledge and information, the basic task of the platform, the command or assignment given by the PM, and the reasoning and inference necessary to process requests from other managers And rules as a way of making judgments.
As a basic SHRUB, there is'Node Attribute SHRUB' (NAS), which grafts to each PLANT Node to store and manage attribute information of each PLANT Node including 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 of each level of detail in Task BDT include'Nature of Activity (NOA) Node, 'Progress Management Node','Deliverable Management Node','Resource Management Node','Cost Management Node', and NAS including nodes such as'Event Management Node' can be grafted, and each attribute node can have child nodes that subdivide the corresponding attribute, or a separate Management SHRUB including the detailed attributes can be configured and grafted. have. For example, the'NOA Node' includes'Task Management SHRUB' for managing the entire task and common information such as the execution period, budget, specific details, present situation data and Time Tag, and the person in charge of the task. You can graft.
In the task node,'Progress Management IVY' for managing the progress of the task is also grafted, and the NAS is also grafted to each node of the grafted'Progress Management IVY' (assumed as'Day Node') (601). In the NAS that grafts to each IVY node of'Progress Management IVY', the'Self Information Node' for managing the information of the Day Node itself, such as the Project(Master) Node Number(602) of the corresponding'Day' Node, and Graft information ( 603) and'Daily Progress Management Node' (604),'Deliverable Management Node' (605),'Resource Management Node' (606),'Cost Management Node' (607) to manage the progress and progress of the task. And nodes such as'Event Management Node' 608 and descendant nodes including detailed information.
In addition, for the nodes that need to manage the detailed progress or situation according to the progress time among the management attribute node nodes, IVYs of detailed time units such as'Hour' IVY (217, 419, 609) or'Minute' IVY are included. Graft and Graft the NAS to each node of the IVYs of the detailed time unit (610), and details such as the number of collections (Count), average value, maximum value, minimum value, latest value and standard deviation of data continuously collected in real time. It stores and utilizes task management information as its property values.
The Daily Progress Management Node (604) reflects the'Daily Execution Plan' (611), which is the ratio of the progress of the task execution plan for the day to the total progress established previously, The'Daily Morning Plan', which is an action plan to be established, (612), the'Daily Actual Progress' value, which is actually completed on the day of the day, (613), and the Progress Rate, which indicates the ratio of the performance progress to the plan on the day. (614), the progress state (615) information determined from the value of the progress rate is included in descendant nodes (Descendant Nodes).
In addition to the Task BDT, it also grafts the NAS including target management-related information on each node of the Facility BDT, Resource BDT, each VINE-dedicated BDT, and the BUSH-dedicated BDT, and IVYs for monitoring and managing progress and schedule and operation status.
As other SHRUBs,'Rule SHRUB' grafts with the properties of each Rule Name Node of Rule BDT, and'QUEUE','STACK','LIST' and'graft' as properties by configuring SHRUBs to arbitrary nodes as necessary. There is a TABLE'.
The'QUEUE','STACK' and'LIST' are implemented as 2-level SHRUBs, and the type, name, and number of child nodes of the corresponding SHRUB are stored as attributes in the root node, and the child nodes represent each element. In the case of a nested list, it is indicated as SHRUB whose level is increased by the depth of the descending. In the case of a normal'TABLE' or other 2-D array, the name and number of each column and the number of rows are stored in the root node as properties, and each level-2 child node of the root node is a row And Level-3 child nodes of each Level-2 child node 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 or higher are configured by increasing the level of SHRUB in the same way.
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,'Arrive' and'Depart' in the case of the above QUEUE,'Push' and'Pop' in the case of STACK, and'take_Next' to access the next element from the present location (Present Location) in the case of List and , Define an operation such as'take_nth' to access an arbitrary nth List element, and'take_ij_th' to access an element of'Column j'in'Row i'in the case of a table.
Depending on the implementation language of the platform or target management system, the Node Name (including Given Name, PPN, STPN, and RSTPN) itself can have a value as a variable, and the value including the'Value' Node in the NAS of the corresponding node You can save or store'Expressions' that can be evaluated including'Eval Expression'Node' in the form of a List. The'Node_Eval' returns the value that the node has as a variable when evaluating a specific node name, or the value of the Value Node included in the NAS of the node, or the expression of the'Eval Expression' node. This is an operation that returns the value by Evaluate (or simply'Eval'). The'Value' Node has as a child node'Real Value' and'Expected Value' and a'Consistency' Node that checks whether the two values are consistent according to the characteristics of the value of the corresponding Node. The'Real Value' is a value that is actually input or confirmed by a sensor, measuring instrument, other server or administrator,'Expected Value' is a value that is logically expected or determined, and'Consistency' is a value that the two values are substantially identical. As a result of judging whether or not, it has a Yes, No, or Null (don't know) value.
The'Rule_generate' operation is a'Rule_generate' to indicate and implement instructions issued by a PM, requests from team members, other managers, or related persons, and specific methods and knowledge for handling basic tasks or functions of the platform. This is an operation that composes'Rules' into SHRUB.
All rules are an objective or subjective method or policy for handling instructions or assignments given by the PM to the platform, requests from project/task related persons, and basic functions or tasks of the platform, Arithmetic to logical operation, inference (Inference and Reasoning) or judgment according to a set criteria, process (Process) to procedure (Procedure), strategy (Strategy) to operation (Tactic or Operation), including knowledge ( Knowledge) and information, express and freely update the content, and include it in the Super Tree as a consistent and unified framework, and use SHRUB of the Super Tree for goal management. Implement. 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 Rule SHRUB. Therefore, the aforementioned SWEEP technique and GRACE technique are all implemented and executed as rules.
The Root Node 701 of Rule SHRUB is a'Left-hand Side (LHS) Node' 702 as a condition part and a'Right-hand Side (RHS) Node' as an action or execution part (703). It has 2 child nodes. The LHS and RHS are'Condition Part' and'Action Part', or'Premise Part' and'Conclusion Part', or'Antecedent Part', respectively. And the'consequent part'. In the case of a rule that is executed without conditions when called, it may consist of only RHS without LHS. The LHS Node and RHS Node, which are child nodes of the Root Node, are called'Top LHS Node' and'Top RHS Node', respectively.
The'Top LHS Node' 702 and the'Top RHS Node' 703 may each have descendant nodes including one or more child nodes, respectively, and the root node of the subtree each having the corresponding descendant nodes is do. If the conditional part of the rule contains only one condition, the LHS Node is not explicitly created, and the corresponding node itself becomes an'Implicit' LHS Node, that is, a Condition Node, and if the execution unit includes only one action, a separate RHS Node The node itself can be an implicit RHS Node, that is, an Action Node without creating a. The rule that has only one LHS Node and RHS Node is called'Simple Rule' in particular.
Rule can be executed by directly including additional rules internally or interlocking through Graft in order to specify the action to be performed with the corresponding Rule. The node that serves as the root of the rule that is directly included internally is called'Internal Rule Node', and the'Internal Rule Node' also has the LHS Node (705) and RHS Node (706) as child nodes as the root of the Rule. Also, the Rule Node for grafting additional external rules is called'Rule Graft Node' (707).
Types of'Rule SHRUB Node' constituting the rule are'Root Node','Top LHS Node','Top RHS Node','LHS Node','RHS Node','If Node','Then Node' ,'Else Node','Internal Rule Node''Rule Graft Node','End Node','Exit Node','Return_to Node','Go_to Node','Wait Node' and various'Operation Nodes ('Performing Nodes') 'Or'Acting Node'.)'. The'Then Node' can 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'.
'Rule SHRUB Node' (or simply'Rule Node') has properties like other SHRUB Nodes (708, 709), the number of child nodes, name,'Eval Expression' of the node (710, 711), It includes the value of the node, the logical condition to be satisfied between child nodes, and the Graft information. Examples of the logical condition include'AND','OR', and'ALL'. The'All' is defined as a logic that evaluates all child nodes regardless of the Eval result.
The'Eval Expression' is based on a list expression. The first element of the list is an arithmetic operator or a logical operator, or an SP expression indicating a specific action, and when interlocking with other software packages or tools such as statistics or math software packages, it may be the function name of the package or tool. The second element or less is composed of one or more Arguments such as STPN or STPN Template to indicate the object and value of the operation or action or to store the result value. Lists can also be nested. Examples of typical SPs that represent actions used in the List-type Eval Expression are'Assert','Return_to','Go_to','Exit','End','Set_as','Put_in','Take_next', ' There are'Take_nth' and'Wait'. When evaluating a list, the operation or instruction is directly executed.
When'Eval' each Rule SHRUB Node, like other SHRUB nodes, if the node is a variable node that directly has a specific value, the value is returned. Otherwise, the property node of the corresponding node Returns the value of'Value Node' or evaluates'Eval_Expression' and executes as the contents and returns the result.
If you want to use the rule for general purposes, configure it as a Template Rule that uses path variable expression, and when calling it, substitute the variables with specific values or expressions and instantiate them to enable execution. (713) For example, ' In the case of STPN using a variable expression such as'task', it visits Task BDT in depth-first search (DFS) order, retrieves the actual names of all tasks in Task BDT (Retrieve), and replaces'?task' in sequence. Go and configure a loop so that it can be applied to all tasks, or by replacing it with specific dates including variable expressions such as'?day'.
The'Rule_generate' is an operation to create a Rule, and the Rule is created by constructing Rule SHRUB as follows: (The property of each Rule Node is expressed in braces, and comments are parentheses (Parenthesis) ) Will be described in)
Step 1. Root Node {Attribute: Call condition of the Rule; STPN or STEM of a node that contains information to be provided for rule execution; The number of node variables to be substituted and the expression of node variables, or specific PLANT names; Return method of rule execution result (Return means, presentation method and format, STPN or PLANT name (including List, Table, etc.) storing the value to be returned); Each Eval Expression when visiting the node's own Preorder, Inorder and Post Order); Graft information; Explaining the execution details when executing the Rule}
Step 2. LHS Node and its Children Nodes (attribute: the type of the node itself (refer to the type of Rule SHRUB Node described above); Each Eval Expression when visiting the node's own Preorder, Inorder, and Post Order (including the Eval conditions of child nodes (AND, OR, ALL, etc.), but if there is no child node, only the Preorder Eval Expression exists); Number of child nodes; Name, number and type of child nodes, Graft information}
Step 3. RHS Node and its Children Nodes {attribute: the type of the node itself; Each Eval Expression when visiting the node's own Preorder, Inorder, and Post Order (including the Eval conditions of child nodes (AND, OR, ALL, etc.), but if there is no child node, only the Preorder Eval Expression exists); Number of child nodes; The names of child nodes; Number and type; Eval condition (AND, OR, ALL) of child nodes; Graft information} ■
In the'Eval Expression', the substitution information of the variable node, the assert (712) of the instantiated fact, the method of reporting the execution result (format and content, means (monitor, smart phone, alarm)), the loop command (Return_to, Go_to, Local_Fact_Assert)), the termination of the local loop (Exit), the determination of the next visited child node, and the termination condition and termination instruction (END) of the rule execution (713).
In the above'Fact_Assert' operation, when a value is entered or set in a specific node of various PLANTs including SHRUB of the Super Tree, the name and value of the corresponding node are'Assert' or'Advocate' as a fact. , It is an operation to invoke and execute (expressed as Execute, Fire, or Trigger) the'rules' containing the creation of the Fact or the value of the Fact as a condition. Each ORE STEM can also assert the event as a triggered fact when a corresponding instruction is given, a task is assigned, or a request is input.
In the expression of the rule node's Eval Expression, such as'?task','?facility','?resource','?time' or'?day' for flexible match with the asserted fact or for general use of the rule. 'Variable Name Node' expressions, wildcard expressions such as'&' that can match one arbitrary node expression, or'*' that can match one or more Node Names, or'/ Path abbreviations such as ../' can be included. In the case of the Expression including the'Variable Name Nodes', if the included'Variable Name Node' expressions are replaced with specific Node Names, the entire conditional expression of the STPN included in the Expression is'Instantiate' and a specific STPN Or'Assert' as Fact becomes possible. In addition, in order to simplify the expression of the STPN included in the rule, as described above, in the case of nodes that are obvious to be included in the corresponding path from the context of the STPN, all can be omitted and expressed as a shortened STPN. In order to be applied universally as described above, a rule including variable expressions and wildcard nodes is called a'template rule'.
The'Rule_invoke' is an operation that is called to execute the Rule.The Rule is'Time Driven Invoke', which is called at regular time intervals or when a certain time arrives,'Event Driven Invoke', which is called when an event occurs, and identifies the cause. It is called in the same way as'Goal Driven Invoke', which is called for. The'Event Driven' is also called'Fact Driven' or'Data Driven' and mainly uses the Forward Reasoning method, and the'Goal Driven' is also called'Object Driven', and is mainly inferred by the Backward Reasoning method. The SWEEP goal management technique is based on a'Time Driven' method that continuously and repetitively performs most of the tasks or platform tasks to be performed according to the time or time interval set for each task or task. Fact is processed in the'Event Driven' or'Goal Driven' method at the point of occurrence.
The'Rule_execute' is an operation that sequentially visits each Rule SHRUB Node of the invoked Rule from the Root Node and then'Eval' and'Execute' the Rule.
Execution of rules is mainly to perform basic tasks or functions of the platform, process target management tasks to be regularly or continuously and continuously repeated at a specific time, and perform PM's instructions or tasks assigned from PM. , Project/Task related inquiries, requests, suggestions, mutual information, exchange of opinions, and discussions are handled, and events or risks that occur from time to time are handled.
For the processing of the platform that must be carried out regularly and continuously when a specific time arrives, such as every hour, daily, or weekly, when the specific time comes, Assert the'Present Time as a fact' and invoke the event as a condition of the arrival of that time. Compose a Rule that sequentially invokes by including the rules to be done as RHS nodes in order, and defines this as'Timer Rule'. The Timer Rule may be set to be called when the time when a specific condition is satisfied arrives.
According to the field and characteristics of the project/task to set and achieve the goal, the platform presents the basic skeleton and template rules of the Super Tree organized by the field and characteristic, and the specific construction of the goal management system of the project/task and the established system Support the operation.
When the platform is activated, a'Project Manager Agent' in charge of the functions of the Project/Task general management unit 801 is created, and the Project Manager Agent creates intelligent agents in charge of each functional section (FIG. 8) of the platform as it is created. . Among the created agents, the'Knowledge-base Manager Agent' manages rule generation, update, and invocation, and supports other agents to execute the rule and perform their duties.
When a specific Rule is invoked by agents in charge of each function of the platform, the Knowledge-base Manager Agent supplies and calls the Template Rule and STPN and STEM, which are the specific execution context of the Rule and the Template Rule in Rule BDT. One agent instantiates the template rule and supports it to be executed. Each Agent sequentially visits from the root node of the called Rule, evaluates the'Eval_Expression' of the visited Rule Node, and executes the Rule according to the Eval result. Visiting the Rule Node is based on Eval by visiting the Rule SHRUB in the order of Depth First Search (DFS). The node that the Agent is currently visiting for Eval is called'Present Eval Node' (PEN). Except for Leaf Nodes, all nodes with 2 or more children usually visit with 1 Preorder, 1 or more Inorder, and 1 or less Post Order, and the Eval result of the immediately visited child node by changing the Eval Expression for each visit. Depending on the rule execution method or the setting of the Argument can be flexibly adjusted afterwards, when all RHS nodes are evaluated and returned to the Root Node, the rule execution is automatically terminated. Even when meeting a node that asserts', the execution of the rule is terminated at the corresponding location.
As a result of the Eval of the'Eval Expression', the return of True/False or Y/N, the execution of the operation, the judgment of the situation, the Assert of the Fact, and the Physical or Abstract action to be performed by the Eval Expression can be exemplified. .
When the above'Rule Graft Node' is evaluated, a copy of the Template Rule Grafted to the Alias Node with the same name in Rule BDT is temporarily'Dynamic Graft' to the Rule Graft Node, and the environment of the Rule Graft Node It is invoked and executed while being instantiated as (Context), and automatically degrafted when the use of Rule is terminated.
If it is necessary to configure a loop that loops and invokes the Rule itself within the Rule, specify the Eval Expression of the node at the calling location as'Return_to Root' operation and return to the Root of the Rule. Eval starts from the node again and the rule is re-executed. If it is a loop that is executed only in a part of the rule, it is called'Local Loop', and if you want to stop the execution of the loop while executing the local loop, use the'Exit' operation. If you want to move to a specific node, you can directly specify the'Go_to' operation and the PPN of the specific node you want to move, or if the specific node contains a specific fact as a condition, Assert the fact to meet the conditions or match. You can move to the node that becomes. As described above, the Fact_Assert that is performed for the match within the Rule is called'Local Fact Assert'.
If the result of Eval of a specific node during rule execution, waiting for a PM or other administrator to input a specific value or for the unit time to elapse, the Eval Expression at the time of Inorder Visit of the parent node of the corresponding node is set to'WAIT'. , You can wait until the Eval condition of the corresponding node is satisfied. In the case of executing a loop, the turn is set Aside separately so that it is executed when the condition is satisfied, and skips and continues the loop.
In the above, the creation, invocation, and execution of rules have been described, and'Rule Generation Rule' is composed to support the creation and input of rules. The rules that perform basic tasks and functions of the platform or handle various expected events are implemented by the platform construction engineer and experts in the field when building the platform according to the characteristics of the project/task. In addition, the rules for executing instructions and requests of PM or other managers in the process of task execution are based on the relevant STEMs created as'ORE Generation BDT' using'STEM' Generation Rule', and the platform together with the platform manager or PM. Organize interactively.
The generated rules are grafted to the node of the rule name of'Rule BDT', which is classified and subdivided by the purpose of application of the rule, field or type, or by agent in charge of calling and executing the rule. BDT' is grafted to'Rule BDT Node' which is composed of child nodes of'Platform and Super Tree Management Node' of STUMP. .
Subsequently, as a concrete example of implementing the Rule using STEM configuration and STEM, a High Abstraction Level instruction such as "Report every working day at PM 6:00 every task whose daily progress state is'Delay'" The case where the PM falls on the platform will be described as an example.
First, through a GUI presented using'ORE Generation BDT' (Fig. 3) and'STEM Generation Rule', a candidate group of nodes and attributes is sequentially presented, and a selection or input of specific nodes or attributes is received, and the corresponding Construct STEM. (To express the main path and the attribute at the same time, the attribute is indicated within braces' {}'.):
Depth 0 Node: STEM Root {Issue_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 Search)}
Depth 3 Node: 'Daily_progress_state'(Variable) {Condition: (EQ ?task // ?day // Daily_progress_state'Delay'), ?day: Today} ■
With the above input, the following ORE STEM is generated.
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 particular, based on the ORE STEM, Fig. 7 shows the configuration of a Rule for implementing the instruction. The constituting rule is implemented as a template rule including variable node expression for general purpose use.
The'Eval Expression' of the conditional node for the execution of the rule is equal to (EQ ?task//?day//Daily_progress_state'Delay') (710). The above Eval Expression includes the node variables'?task' and'?day', and'?day' is replaced with the IVY Node Number of the day, and all tasks in Task BDT are searched for depth first (Depth First Search: DFS ), and if'?task' is replaced with the actual Task Node Name, the STPN is instantiated like'Task-i//kth_day//Daily_progress_state', and'Return_to Root' operation (712) Returning to the root and starting rule execution again, returning to the conditional expression of LHS, and checking whether the node value of the'Daily Progress State' property of the relevant task is set to'Delay' is repeated for all tasks. You lose. In addition, a Timer Rule that calls the above Rule is configured at 6 PM on every working day.
As described above, the Root Node 701 has a Top LHS Node 702 and a Top RHS Node 703, and both LHS Node and RHS Node can have any number of child nodes, and each Nodes, that is,'Rule SHRUB Node', have the number of child nodes and the'Eval' method or condition as the property values of the NAS, and the Root Node and each Rule SHRUB Node properties and Eval Expression include STPN and STEM information. The execution environment (Context) can be displayed and utilized, and by including'Internal Rule' in the Rule or allowing other rules to be grafted, it is composed of a combination of modularized knowledge and composed of Template Rule to ensure the universality of the Rule. And define a rule that makes it possible to repeatedly execute itself as a'Super Rule'.
Super Rule can contain LHS and RHS repeatedly in both LHS and RHS, and rule execution proceeds from left to right in the DFS method, visits Rule Nodes, evaluates the'Eval Expression' of the visited node, and evaluates in progress. You can configure a loop to redeploy the Rule by using the'Return_to Root' operation in the Eval Expression of the Node, and form a local loop within the Rule or an arbitrary location by using the'Loacal Fact Assert' or'Go_to' operation. It can be executed by moving to and using the'WAIT' Eval Expression when visiting the Inorder of a specific Node, the execution of the Rule is temporarily stopped at the corresponding location, and the child LHS Node has to wait until the Fact included as a condition is Assert. If'Eval Expression' is'END', rule execution is forcibly terminated at the corresponding position, and it is automatically terminated when it returns to the root by evaluating to the rightmost node by continuing.
With the configuration of the'Super Rule' as described above, the content and flow of logical reasoning, judgment, procedure, and action can be explicitly expressed, and the rule can be easily created by SHRUB operation such as insertion or movement of a node. It can be modified or updated, and accordingly, the High Abstraction Level mission, instruction, request, and reasoning and inference for the execution of platform functions are subdivided into a'Divide and Conquer' strategy and modularized. All Nodes, Internal Rules, or Grafted Rules in Super Rule share common context information, so that consistent and focused reasoning can proceed. Segmentation and modularization are possible up to the level of each node, and the reasoning and judgment process and contents can be freely coordinated or modified by inserting and deleting nodes. Therefore, a number of independent rules randomly lead to chaining and are executed, and the relationship between the fragmentary results generated by each rule is chained, and the ultimate purpose of the executed rules is unclear. Can be improved. In addition, a combination of frequently used conditions or actions can use the corresponding expression jointly through Internal Rule or Rule Grafting, and a Super Rule can be composed with a combination of modularized rules, simplifying the'rule generation' process. In addition, it supports automation and can implement a loop that repeatedly executes the rule itself, so even if the number of tasks that need to manage progress or progress status is huge, it can be handled precisely and simply by executing a few rules.
All information generated during the execution of the Super Rule (hereinafter also briefly expressed as “Rule”) is stored as a node of the Super Tree that can be accessed by STPN. Nodes that store information can be added by using an existing node or by creating a new node, and for temporary or temporary use or necessary information, prune or degraft the nodes after use, and after prune or degraft. Nodes whose direct or indirect path to ROOT is broken perform Garbage Collection to recover memory. In the case of a node that represents a condition or action for repetitive execution, if there is no need to repeat any more during the execution of a rule, it is rectified in the instantiated rule, and this is called'Dynamic Pruning'. At this time, the original Template Rule is not affected by'Pruning'.
Therefore, the Super Rule is, in general, in the field of various projects/tasks to set and achieve goals, investigation (Investigation), search (Search) and confirmation (Confirm) of one or more specific information through inference (Inference or Reasoning), and progress. Management, monitoring of the situation, creation of information (Creation), estimation, comparison, judgment or decision of the situation, analysis, expectation or forecast, explanation (Explanation), Report and Display, Strategy establishment, Request, Recommendation, and direct or indirect performance of Measures or Activities. Actions can be expressed and executed as rules, and the reason for inferring a specific action can be explained using the path or process of reasoning.
The Super Tree is configured so that all information necessary for calling and executing Rue is included in the Super Tree, and among the information obtained as a result of the execution of the Rule, all new and significant information is the context of the relevant information in the Super Tree. Nodes are added and stored in a suitable location for the system, and thus the Super Tree as a BOGMKI, a collection of knowledge and information, grows, resulting in a Learning Effect.
In addition, the above-described Super Rule configuration method allows direct instruction of a high abstraction level to be given to the platform, assigned as a task, or requested as a service. Accordingly, unlike the conventional unilateral menu provision methods (Paradigm), in which the paths and functions of Menu and Sub-menus must be fully understood and used for the search or function of information desired by PM or other project related persons, PM is provided to the platform. It gives the desired instruction, assigns a task or task, and other managers can directly request necessary matters from the platform, so that even when there are a myriad of tasks to be performed and managed at the same time, continuous precise management is possible, so that SWEEP goal management It supports the application of the technique. In the present invention, an I/O service providing method that supports direct command, command, or request of a high abstraction level to the platform as described above is referred to as'Proactive And Smart Service' (PASS). )) method. In addition, it is possible to explain the reason or process for the reasoning action or judgment result performed by the rule by using the explicit composition method of the rule contents and the rule description expression included in the NAS, and the composition contents of the rule executed by the platform are presented in the form of SHRUB. It can be received, and the contents of the Rule can be modified or adjusted simply by modifying the Insert or Delete of the SHRUB Node or the Eval Expression.
As described above, the goal management platform of the present invention uses the Super Tree as BOGMKI (Body of Goal Management Knowledge and Information), a collection of all information and knowledge required in the entire process of project/task goal management. The composed and configured Super Tree is intelligently autonomously and actively used based on the Super Rule, and is systematically classified and subdivided, even as tasks (work, work package or activity) of all levels that must be performed to achieve the goal. For these, target management actions (referred to as'Platform Task') to monitor and manage progress and progress are performed continuously and repeatedly according to the selected time precision. During the execution process, the platform continuously collects information or knowledge additionally required, predicts and responds to random events or risks early, and the response result information is added to the node of the Super Tree as experience. It accumulates, learns, and utilizes it, and processes it by receiving it as a semi-natural language expression that gave instructions or requirements from PM or other managers. In the present invention, a goal management method that continuously precisely monitors, manages, and proceeds with the progress of all tasks and events occurring during task execution is referred to as'SWEEP' (Successive Work and Event Evaluation and Proceeding) goal management technique. The execution of the SWEEP goal management technique implements and executes the technique as a rule.
Next, a detailed description will be given of a specific method in which the platform of the present invention uses the SWEEP target management technique, utilizes the Super Tree, and intelligently and autonomously performs the above-described five-step target management process.
All'Platform Tasks' are implemented as rules to express the detailed contents explicitly, execute and execute the rule, and all information necessary for goal management and all information needed for goal management are created and stored in the process of goal management. All information is stored and utilized as a node of the Super Tree.
When the platform is activated, the platform enters the'Project/Task Initiating and Basic Information Collection Stage' (S100) as the first stage, and the project/Task goal management task is first performed. It creates the overall'Project Manager Agent' in the form of a thread or a process. As described above, the Project Manager Agent is responsible for each functional area of the platform as it is created, and supports professional agents, Super Tree Manager Agent, Knowledge-base Manager Agent, Progress Manager Agent, Resource Manager Agent, Event Manager Agent, Risk Manager. Create Agent, I/O Manager Agent, and DB Manager Agent. The created Project Manager Agent'Project/Task Initiation Rule' is called and executed, and the'Basic Information Input Window' is presented to receive basic information related to Project/Task.'Deliverable or state (collectively referred to as'Deliverable'), execution entity or owner, Project Manager (PM) or general manager (collectively referred to as'PM'), execution period, overall budget and location Receives basic information from PM and composes'Project/Task Charter SHRUB' 211.
Depending on the characteristics of the project/task, additional basic information is requested and input. For example, in the case of a Plant EPC project, site location, area, owner or customer, representative, implementer, execution period, ISBL (Inside Battery Limit) ) And OSBL (Outside Battery Limit).In the case of Smart Factory's production management task, the product type, production target by type, quality standards and Target deadlines can be mentioned, and in the case of energy management tasks, the energy use baseline and calculation basis for each energy to be saved, routine and non-routine adjustment items, and energy savings calculation methods are mentioned. In the case of the power system operation management task, the target power supply reserve rate, frequency fluctuation rate, and voltage fluctuation rate are mentioned. In the case of computer operation management task, the average response time, virus infection prevention or hacking protection The same security goal can be cited.
In the input window above, with expressions such as'What can I do for you?' and'Please input your order or request.', PM or other managers can directly select the desired'Platform Task' without searching or selecting Menu or Submenu. Allows you to freely input instructions or requests, and automatically complete the rest when entering a drop-down menu such as'Create New Project/Task' and'Continue Project/Task (Name)' and some text when entering. Provides input support service. When the'Create New Project/Task' instruction is issued, the root of the template of the'Project/Task Charter SHRUB' of the relevant field, which is pre-configured for each field according to the name and field of the project/task for which the intelligent autonomous goal management system is to be built, is the peak. It is presented in a vertical or horizontal tree structure, and a GUI for selecting, adding, or deleting nodes is provided. When a specific node is selected with a mouse, the corresponding node value can be directly input or the template of'Node Attribute SHRUB' (NAS) is presented so that it can be input as an attribute value. In the case of instructing'Continue Project/Task (Name)', it reads the Super Tree previously saved in the form of DB, Spread Sheet, or XML File and restores the previous target management context or environment. . In the case of a frequently used instruction or request, the input window may also receive a simple verbal input.
Subsequently, as a second step, based on the entire basic information input in the'Project/Task start and all basic information collection stage','Detailed Information Collection and Super Tree Constructing Stage' ( S101). First, the Sper Tree Manager Agent is a Super Tree for goal management in the selected Project/Task field among the basic structure skeletons of the Super Tree for each project/task field that the platform builder organizes and stores with the help of experts in each field. Select the Skeleton of and present it.
The Skeleton of Super Tree presented above is the relationship between the platform implementation engineer and experts in the relevant field when implementing the Framework of the platform in the project/task field, typical basic data related to the project/task execution, processed data information, and information. , Expertise (Knowledge), Know-how, Expertise, and Method are collected to form various PLANTs, and these PLANTs are grafted according to their mutual relations to form. The PM cooperates with the platform and configures a detailed super tree for project/task goal management by specifically modifying or customizing according to the management policy and task execution strategy to set the presented skeleton.
First, the PM starts the concrete configuration of STUMP, which is the basic framework of Super Tree along with the Platform.
In the presented Super Tree Skeleton, the root node of the Super Tree and the root node of the STUMP at the same time include the previously configured'Project/Task Charter SHRUB' (211) and the entire project/task execution period in Unit Time. ) Divided (default is'Day') and connected to a series of nodes to monitor and manage the displayed goal management progress,'Master Calendar_mapped Progress Management IVY' (212) is created and grafted.
Next, add, delete or modify Major Management Nodes presented as child nodes of ROOT, and customize STUMP to complete. Each STUMP Node consists of various PLANTs such as NAS, BDT, IVY, VINE, BUSH, and SHRUB, using the Skeleton of the Super Tree and the template of the plants that are also given, and constructs the Super Tree by grafting. The composition and graft of each plant provides graphic input GUI such as creating a node and connecting by dragging with a mouse, and supports not only individual nodes, but also selects and drags all or part of the plant and connects or grafts.
Specifically, taking the case of VINE configuration as an example, first, a typical basic configuration frame or skeleton for each type of VINE is presented according to the characteristics of the project/task. According to the configuration of a specific production process, system, or circuit, symbols of each facility and device node are provided as a menu, and when the PM or the manager in charge drags and connects or replaces them and configures them, the nodes and arcs of the corresponding VINE are created. At the same time, Schematic Drawing and Physical Layout Drawing are also composed. When a specific node is selected, the default property information of the relevant facility or device is presented in the form of a spreadsheet or table and can be modified. The corresponding default property information can be entered manually or can be received through other servers or the Internet. As the default information, information on the operation monitoring item of the relevant facility, information on the criteria for judging the operation status and the name of the judgment, information on events and event propagation that may occur, and calling rules for implementing procedures and procedures for managing each event. It contains Alias Node information of Rule name to do. In particular, the event propagation information includes events that are automatically propagated and generated according to the configuration of the interlock logic of a corresponding facility when a specific event occurs. The configuration of the VINE, like the configuration of other PLANTs, expresses its contents as explicit and implements all of them as rules so that free modification and update are possible. The'control logic information' of the entire process or system or each facility constitutes a VINE representing the corresponding control logic circuit and is stored by grafting it directly to the process or system or facility node or to the control logic property node of the NAS.
As a third step following the'Detailed Information Collection and Super Tree Constructing Stage' (S101), the'Task Scheduling Stage' (S103) is entered. When the PM gives the'Create Task Schedule' instruction to the platform, the Progress Manager Agent will also perform all and all detailed tasks to be performed (as described above, as'Work','Work Package' or'Activity', depending on the field and characteristics of the Project/Task. It presents Task BDT composed by classifying and subdividing and subdividing (collectively referred to as'Tasks') hierarchically/sequentially by field or division, and asks the PM to select the desired Task Node. When a specific task node is selected, the'Baseline Progress Management IVY' indicating the'Baseline Duration' of the task that is already configured and grafted to the task node is presented. Each node of IVY, that is, the reference unit time, defaults to'Day' and will be described below based on'Day'. The selection of the standard unit time can be selected differently according to the characteristics of the project/task, and each IVY node is developed into sub-detailed IVY nodes represented by the detailed unit time'Hour','Minute' and'Second' nodes as needed. You can (Expand), and the IVY consisting of the deployed nodes is grafted to the corresponding upper node. In addition, the entire'Day' Node IVY is aggregated into'Week','Month','Quarter' and'Year' nodes, which are the upper unit time, to form a shortened IVY, and the start node of the shortened IVY. Node) can also be grafted.
There are two types of IVY presented:'Net Baseline Progress Management IVY' and'Calendar-mapped Baseline Progress Management IVY'. When establishing each task execution plan, a PM, a Scheduling Engineer, or a qualified task manager You can choose. Depending on the characteristics of the task, first establish a task progress plan with'Net Baseline Progress Management IVY', then determine the work policy for weekends and holidays, and then develop'Calendar-mapped Baseline Progress Management IVY' based on the schedule calendar date. It is also possible to create a progress plan with'Calendar-mapped Baseline Progress Management IVY' after designating a start date on the calendar from the beginning. When converting to'Calendar-mapped Baseline Progress Management IVY' by establishing a progress plan with'Net Baseline Progress Management IVY', as described above,'Forward Mapping','Reverse Mapping' and'Bi- There are three methods of'directional Mapping'. If the task is executed continuously without weekends or holidays, the lengths of the two IVYs are the same. Each node of'Calendar Mapped Baseline Progress Management IVY' represents the number of days elapsed from the start date of the entire project in addition to'Self Node Number' (412), and the property value of'Project Node Number', which is the node number of Master Progress Management IVY. I have it as (413)
The IVYs are presented in the form of a Gantt Chart representing each node as a continuous quadrangular node on a chart with the entire Project/Task execution period as a horizontal axis, or in a chain form representing each node as a small circle. When ‘Net Baseline Progress Management IVY’ is presented, the horizontal axis represents the pure period/time, and when ‘Calendar-mapped Baseline Progress Management IVY’ is presented, the corresponding calendar period is indicated on the horizontal axis along with the date, day of the week, and holidays.
In the case of the Plant EPC Project or Building Construction Project, the completion target period or time limit becomes the Baseline Duration. In the case of a factory's annual production target achievement task, one year is the Baseline Duration. In the case of corporate management, each fiscal year or quarter can be set as the Baseline Duration, and if a separate period or time limit is not set, the period deemed appropriate in consideration of the contingency that may occur during the execution of the relevant project/task is the baseline. Set to Duration. For other examples, in the case of PC operation, each session, in the case of game or sports management, from the start of preparation to the end of the game, and in the case of educational goal management, from the start of each semester to the end of each semester can be set as the Baseline Duration.
At the bottom of'Baseline Progress Management IVY' presented by the platform, a graph for writing and inputting a progress schedule 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, the'Task Finish Point' is displayed at the position where the Progress Value is 100% in the Last Node of'Net Baseline Progress Management IVY'. Subsequently,'Unit Time Baseline Progress Plan Value' and'Unit Time Baseline Accumulated Progress Plan Value' are calculated for each unit time node between the origin and the task completion point. Calculation of the progress plan value is set by using the S-Curve function (Sigmoid function) or Linear function in a top-down method, or by receiving input from a separate file such as a spread sheet. In the case of subdividing one task into a plurality of detailed tasks, each detailed task is assigned a weight value whose total sum is 1 according to the importance level, and the progress plan value of each detailed task is assigned to the corresponding detailed task. The progress plan value of the upper task is calculated as the sum of the values multiplied by the assigned weight value.
When'Unit Time Baseline Progress Plan Value' is set as the attribute value of the NAS grafted to each node of'Net Baseline Progress Management IVY' of each task,'Unit Time Baseline Deliverable Completion Plan Value' and'Unit Time Baseline Deliverable cumulative completion plan value' is calculated or set together with PM. Make sure that 100% of the completion plan value of the collected deliverables corresponds to 100% of the progress plan value.
The quantity or state of completion of the deliverables corresponding to the progress value of each task (hereinafter referred to as'completion value') and the corresponding progress value, and the quality or ability to achieve the corresponding completion value ( The conversion between the quantity of each resource reflecting the capability, capacity, or efficiency, and the conversion content and method are specifically specified and indicated by a rule. When the actual task is executed, the detailed progress value of the relevant task is calculated from the quantitative value of the progress status of each Deliverable. Accordingly, in principle, subjective judgment and input of task managers are excluded in calculating the progress value, and objectivity is maintained, so that the platform can autonomously or actively perform task execution plan establishment and progress management.
As an example of calculating concrete'Deliverables' and Deliverable progress and task progress, in the case of a power plant construction project, the total Deliverable includes the completed power plant, training of Crew Members, and related documents such as drawings and manuals. Among the completed power plant Deliverables, an example of the main detailed deliverable is'power equipment'. Again, one of the more detailed deliverables of the power facility deliverable is'main transformer installation and completion status' as an example. I can. The'Peripheral Transformer Installation and Completion Status' Deliverable can be completed by performing the'Peripheral Transformer Installation Construction' task as in the above-described Task BDT example, and the'Peripheral Transformer Installation Construction' task is the basic design ( Basic Design) is completed and can be started, and it is subdivided into'Survey','Dream','Formwork','Rebar','Anchoring','Concrete','Concrete Curing', and the transformer is procured and sent to the site. A series of detailed tasks such as'Installation of TR body','Conservator and Bushing assembly','Nitrogen filling and Oil Fill','Cabling','Instrumentation and Control Wiring', and'Test and Commissioning' that can be performed after transport To Work, Work Package, or Activities (collectively referred to as'detailed tasks'), and the finished product or completion status obtained as a result of executing each of the subdivided detailed tasks corresponds to 100% of the progress of Deliverable of the corresponding task. , The progress of each detailed task is calculated by quantitatively converting the progress of the detailed task from the quantitative progress value of each Deliverable, and the progress of the upper task is collected by collecting the progress of each subdivided detailed task and the weighted progress of the detailed tasks calculated by the assigned weight. Calculate.
Each detailed Resource Node of Resource BDT, which is organized by classifying and subdividing required resources by type or division according to the characteristics of the project/task, contains product information including quantity and cost information of deliverables that can be generated for each input unit of the corresponding resource. STPNs of tasks that need the resource are stored as attribute information, and'Supply Management IVY' of the resource is grafted. Each node of Supply Management VY of each resource stores the contract, transport, warehousing, delivery, and inventory status of the corresponding resource, and the procurement status such as the planned input and cost for each input task, the actual input and cost as attributes. The node of the NAS that stores the input plan amount information for each input target task on a specific day of each resource has a'Resource Oriented STPN' in which the Resource Name Node is higher in the Path than the Task Name Node, and the specified input target task The node of the NAS that stores the input plan amount information of the corresponding resource of the day has a'Task Oriented STPN' in which the Task Name Node is higher in the Path than the Resource Name Node, and both nodes become mutually Alias by having the same value. The value input to one node is automatically set to the value of another alias at the same time.
Next, the amount and cost of each type of resources to be invested to achieve the'unit time Baseline Deliverable Completion Plan' for each Deliverable is calculated based on the Cost Estimation Standard information. The part-count information is subdivided according to the type of deliverable, and a “part-count BDT” including the required amount and cost information of resources to be input to complete the unit deliverable is configured, stored, and utilized. The part-count information is based on the certified standard part-count information, and is configured to include all resources and adjustment rate information to be invested to perform a project/task for target management. Typical types of resources are Manpower, Material, Equipment, Energy, Facility and Time. The information related to each unit time is stored in the NAS of the IVY node corresponding to the mode, and the information related to the entire period is stored as an attribute in the NAS of the root node of IVY and the NAS of the corresponding task node.
If a considerable amount of time and resources are required for preparation before the production or production of Deliverable starts, the preparation time and resource are quantitatively calculated and considered as part of the Deliverable and included in the Deliverable Progress. However, if a specific preparatory work fails to lead to the actual progress of Deliverable due to the occurrence of an unexpected event or is not utilized, the progress corresponding to the preparatory work is rolled back to 0 and the resources put into the preparatory work are considered as loss.
Examples of basic main resources required for project/task progress include manpower, budget, and time. In the case of additional Plant EPC Project, design drawings, specifications, construction materials, construction equipment, installation facilities or equipment, and main processes And support system, site, space and energy. In the case of Smart Factory's production management task, it can be the amount of production that satisfies the quality standard and cost for the target period for each product, and in the case of energy management task , Energy, energy supply facility, energy use facility and space, and computer operation management tasks include Processor, Memory, Hard Disk, Peripherals, File, Process, and network facilities.
When a specific'Unit Time Baseline Deliverable Cumulative Completion Plan' that can objectively check the progress status in each task and assign the corresponding progress value (%) becomes an important meaning or turning point in the execution of the task, the corresponding cumulative completion A name and serial number are separately assigned to the planned quantity, and this is called'Milestone'. Therefore, each milestone has a corresponding progress value. Therefore, if the progress is accelerated or delayed, the location of each milestone is moved back and forth accordingly, and the corresponding milestone node changes, which is called'Milestone Sliding'. In addition, the node whose progress value corresponds to a specific milestone in Progress Management IVYs of each task is called the'Milestone Node' of the corresponding milestone.
In the case of a task that can search for the optimal length of Net or Calendar_mapped Baseline Progress Management IVY due to the characteristics of the project/task, the length of IVY is incremented or decremented with the GUI. Whenever the length of IVY changes, the corresponding unit time Task progress value and cumulative progress value, completion amount and progress value of Deliverables, cumulative completion amount and cumulative progress value, amount and cumulative amount of resources to be invested, and cost and cumulative costs, and total progress value of the total Deliverable (100%) Calculate and present the amount of Deliverables corresponding to ), the total input amount and total cost for each resource, consider various contingency that may occur during task progress with PM or other managers, and reflect the safe spare period Set the Baseline Duration of. As described above, a technique for searching for an optimal duration by incrementing or decrementing the length of IVY is referred to as a'GRACE' (Gradual Resource Allocation and Cost Evaluation) search technique.
Next, in order to complete the corresponding'Unit Time Baseline Deliverable Completion' for each Deliverable for each unit time, the'Unit Time Actual Resource Input Plan', which considers the actual input unit of each resource to be put into, is given by PM or other managers. Decide together or execute the rule to make an autonomous decision and present the decision to the PM or other managers. For example, if the input resource is manpower and the actual input unit must be man-day, which is an integer, even though the input amount of the baseline is calculated as a real number including a decimal point, the man-day integer value rounded off the decimal point is'unit time actual resource input. Determine the'planned amount'. Subsequently, the'Unit Time Deliverable Actual Completion Target Plan' is calculated by inverting the complete unit time Deliverable with the determined'Unit Time Actual Resource Input Plan', and the corresponding'Unit Time Execution Progress Plan Value' and'Unit Time Execution Progress Accumulation' Converted to'planned value'. The'Unit Time Deliverable Actual Completion Target Plan' and the corresponding'Unit Time Actual Resource Input Plan' are set so that the'Unit Time Execution Progress Cumulative Plan Value' is always larger than the'Unit Time Baseline Accumulated Plan Value'.
The point in time when the “unit time execution progress accumulated plan value” becomes 100% is referred to as the “execution goal duration” of the task. When the Baseline Duration is determined, a Progress Management IVY fixed to the Baseline Duration length is generated, and a'B' mark is displayed at the Last Node position to indicate that the Baseline Duration is (420). Subsequently, when the Execution Goal Duration is determined,'E' is displayed on the corresponding location node of Progress Management IVY to indicate that it is the last node of the Execution Goal Duration (421). Since the performance progress is planned to go ahead of the baseline progress, the'E' node is located in front of the'B' node, and the period between the two nodes becomes a spare period, which is the'Task Internal Buffer' (422) of the corresponding task. ). In the process of performing the actual task, the expected completion period of the task (Anticipated Completion Duration) is continuously calculated based on the performance progress, and'A' is displayed on the node at the corresponding location to indicate that it is the last node of the Anticipated Completion Duration (423). When the task is completed,'R' is displayed on the Last Node of the Real Completion Duration to indicate that it is the Last Node of the Real Completion Duration. The location of the'A' displayed node may change continuously according to the progress of the task during the task execution process, and if the completion period of the task is expected to be delayed, it may be displayed by extending the IVY behind the'B' node. When starting, the'Task Internal Buffer' becomes a margin or delay period between the'B' Node and the'A' Node. The four duration marks displayed at the end of each task's Progress Management IVY are called the'BEAR' Mark (424) of the IVY, and are stored as properties of the corresponding node, respectively, the reference period and execution target of the corresponding task It indicates the period, expected completion period and actual completion period.
Then, the preceding/successor relationship between tasks is set. The preceding/subsequent relationship between tasks is set as a Graft between nodes corresponding to the Milestone progress of Progress Management IVY of the tasks, that is, Milestone Nodes. The preceding/subsequent relationship between tasks is a general Finish-to-Start Graft that grafts the Last Node of the preceding IVY to the Start Node of the subsequent IVY, and the specific Milestone Node after the Start Node of the preceding IVY is transferred to the Last Node of the subsequent IVY. Start-to-Finish Graft Grafting to a specific Milestone Node in the follow-up relationship, Start-to-Start Graft Grafting to a specific Milestone Node following IVY's Start Node and the Last of the preceding IVY There is a Finish-to-Finish Graft that grafts a Node to a Milestone Node that is a successor to IVY. Therefore, each IVY may have at least one preceding/successor relationship among four preceding relationships or four successor relationships in the preceding/successor relationship with other IVYs, and may have a preceding/successor relationship with one or more other IVYs. By setting the four types of preceding/successor relationships using Milestone Nodes, sophisticated spare day (Buffer or Float) management, progress management, and critical path and duration management are possible.
Each of the preceding/following grafts has a buffer of unit time minus 1 from the difference between the'Project Node Number' of the preceding IVY node to be grafted and the'Project Node Number' of the subsequent IVY node. The buffer is called'Feeding Buffer' from the viewpoint or viewpoint of the preceding task, and is called the'Receiving Buffer' from the viewpoint or viewpoint of the subsequent task. Each of the buffers is managed in two types: a'Net Buffer' representing a net spare period and a'Calendar Buffer' representing a date and period of a specific Calendar at the same time. The length of the'Calendar Buffer' is equal to or longer than the length of the'Net Buffer' according to the working or working policy on weekends and holidays.
In particular, in the case of the'Finish to Start' preceding/successor relationship, the preceding task is called the'Succeeding Task Feeding Buffer'. The subsequent task is called'Preceding Task Receiving Buffer'. Therefore, the chain of tasks whose length of'Succeeding Task Feeding Buffer' is 0 over the entire execution period of the project/task becomes a critical path. Each task is capable of'Late Finish' which is delayed by the length of the shortest'Feeding Buffer' of the task without affecting other tasks in the preceding/successor relationship, and advances by the length of the shortest'Task Receiving Buffer'. 'Early Start' is possible. Even if'Early Start' is possible, if there is a Milestone whose Receiving Buffer has a length of 0, if the Milestone of the relative preceding task cannot be advanced, it cannot lead to'Early Finish'.
In the case of the plant EPC project or factory production management task, the predecessor/success relationship between each task of the task BDT is material procurement tasks for supplying materials, parts, or raw materials that can reach hundreds to thousands or more, and construction or production. It is formed between the nodes of Progress Management IVY and Operation Management IVY of Tasks, and can be utilized for smooth material procurement management. In addition, when starting/stopping the main process or support system in the production management task, it is also set up between Operation Management IVYs of each facility or system for the progress of the startup sequence that requires sequential and simultaneous operation of multiple devices and systems. Thus, it can be used to manage the appropriate Leading Time and monitor whether the startup sequence is normally progressing.
Establish a'Baseline Schedule' and an'Execution Schedule' that includes the progress plan of each unit time, Deliverable completion plan, input resource plan, and cost for all detailed level tasks And, all established information is stored as the attribute of the corresponding IVY Node. The Task Schedule establishes up to a detailed task or activity level (Level) selected among Task Nodes of TASK BDT according to the characteristics and scale of the Project/Task.
In the case of the plant EPC Project, until the'Task Scheduling Stage (S103) of the task execution plan establishment', for the preparation of the optimal IBT (Invitation to Bid) or RFP (Request for Proposal) of the ordering party or owner, or Engineering and Construction It can be used for companies to calculate an appropriate bid amount considering their available resources and costs for a specific IBT or RFP, review whether to bid, and prepare proposals.
Based on the task execution plan established in the Task Scheduling Stage (S103), the goal of the Project/Task enters the next fourth stage, the'Task Performing Stage' (S104). Start management and proceed.
The ultimate goal of all Project/Task goal management is to achieve the set goals with plans or better outcomes. Therefore, the core of all goal management activities is to continuously monitor and manage the progress and progress of all tasks to be performed throughout the whole process of goal management, and successfully complete the project/task according to the established plan. Is to achieve the goal of. Hereinafter, the method of performing each task will be explained mainly on the progress management in the Plant EPC Project or Smart Factory production management task. Among the described progress management contents, the degree of involvement of PMs involved in the progress management and the level of platform autonomy are Porject/ It can be coordinated or adjusted according to the field and characteristics of the task and the level of management precision of the target management system to be implemented. In addition, the described method and principle of progress management can be directly applied or applied to most other projects/tasks.
The progress management of each task aims to execute or execute the execution schedule, and the baseline schedule is managed as a deadline. The progress of each task manages the progress and cumulative progress of each unit time, and the performance against the plan is called the ‘progress rate’ rate).
At the start of each unit time, the platform for each task selected for progress management in Task BDT, the amount of resources needed to execute the execution schedule of the task to the task managers, and the expected amount of corresponding deliverables. It presents the amount of completion and progress, and the expected progress of the corresponding task, and requests the input of the'actual input plan resource amount' to be secured and invested at the start of the unit time and the'expected Deliverable completion amount' expected to be completed. It receives the input and receives the confirmation of the car top manager. The platform separately calculates the'estimated Deliverable completed amount' as the'actual input plan resource amount' inputted by itself, using the part-count information stored in the'Cost Estimation Standard BDT', and the'Expected Deliverable' entered by the task manager. Compare with'Completed Quantity'. If the difference between the two estimates is large, discuss the necessity of adjusting product price information including temporary premium rate adjustments with managers. If it is agreed to make adjustments, the corresponding particulation information is corrected, and the revision history including the'applied period' of the corrected particulation information is recorded as an attribute of the node storing the corresponding particulation information.
The'application period' may be temporary or may be the entire execution period of the rest of the task, and the platform uses the adjusted product information for all the'Execution Schedule' values of the unit time nodes of Progress Management IVY during the applicable period. It is recalculated and presented to managers for consent. If the manager agrees, the change in the length of IVY, the location of the milestone, and the buffer size with the preceding/successor related tasks is presented to the managers, including PM, and confirmed. The estimated progress for a specific unit time as described above is called'Unit Time Progress Forecast', and the estimated progress of the entire task is called'Task Progress Forecast'. A'A' mark is placed at the position of the IVY Node in the expected task completion period determined according to the Task Progress Forecast to indicate that it is the Last Node of the Anticipated Completion Duration (423).
When every unit time starts, the platform continuously collects all necessary and collectable information for target management from sensors, measuring instruments, cameras, other servers, Internet and IOT, and monitors and manages the progress and progress of tasks. The information collection includes inputs requested by PM or other managers when necessary.
Depending on the elapsed time, for systematic management of various events including'delayed progress' of tasks that can occur in the process of performing tasks of each level of Task BDT, all events that may occur in each task are listed by type. Classify by type, configure'Event and Risk BDT' for each task, and graft to the'Event Management Node' of each task's NAS. Each event is classified into Positive Event, Negative Event, and Neutral Event according to its effect on goal achievement. If not specified, it is Default and means Negative Event. Among negative events, events with particularly high impact are called risks. Examples of positive events include early achievement of target specific milestones, the capabilities of real Manpower more efficient and skilled than standard batching, and lower raw material prices. Neutral Event means an event that does not specifically affect the progress or progress of a task. To the node of each event name of the Event and Risk BDT that is grafted to the NAS of each task, the node of the rule name to be executed that stores'event management procedure' information to cope with the event is grafted, and the same name in the Rule BDT. Compose Rule BDT so that Alias Node exists, and Graft Template Rule that can perform the'event management procedure' of the event in the Alias Node. When monitoring and responding to the event, it can be called and executed.
The above'event management procedure' information is for each event,'Anticipation','Detect','Assessment and Countermeasure Establishment','Action','Review of Results' ( Follow-up) and'Learning' include information for management in five processes, and the five processes are called'Eveny And Risk (EAR) Handling Process'. The above EAR Handling Process is implemented as a Rule to express its contents explicitly and to freely update or modify.
In'Anticipation' of the EAR Handling Process, the probability of the event occurring is checked, and in the case of an important event, the probability of the event is calculated. For example, the probability of occurrence of an event is calculated periodically using the Weibull distribution, which is a multi-parameter probability distribution that can include various distribution types. Distribution parameters such as Characteristic Life or Shape Parameter are calculated using MLE (Maximum Likelihood Estimate) and Newton-Raphson Method, and for periodic calculation, a small number of data and duration data without an event occur, or Suspended Data and Censored Data, which are data whose collection is stopped at any time, are also included in the MLE and calculated. The frequency of event occurrence can be calculated through Poisson Arrival analysis. When the probability or possibility of a specific event reaches a certain level, it notifies the PM and the relevant task managers, and proceeds with the rest of the EAR handling process.
For all events in the Master Event BDT, information input means for monitoring and discovery of the event is specified. Examples of the information input means include sensors, measuring instruments, other management servers, the Internet, and manual input through a keyboard, a smart phone, or a tablet PC by an administrator or person in charge. In the'Detect' process, when a specific variable value is set as an information input means for monitoring a corresponding event, a corresponding Fact is asserted to confirm the occurrence of the event as a responsible rule, and a subsequent management procedure is entered.
In the'Asessment and Countermeasure Establishment', the cause or reason of the occurrence of an event that has already occurred, the size of the impact, and the affected tasks are evaluated, and in the case of a negative event, the impact of the event is absorbed early ( Absorb) Stop propagation (Stop) or establish countermeasures or strategies for recovering or overcoming the situation, coordinating task execution plans if necessary, and opportunity in case of positive events ), it can be used to contribute to the increase in the possibility of achieving the goal, and an Event Scenario analysis for selecting a countermeasure or strategy can be performed.
In the'Action' process, the established measures are implemented, and in'Follow-up and Learning', the event response results are evaluated, statistics such as occurrence frequency are calculated, and the event processing process and results are compared with the related Super Tree plants. Stored in PLANT Nodes to accumulate and learn as experiences.
To record expected or actual events,'Event Monitoring And Recording Table' (EMART) is constructed, and the Root Node is grafted to the Root Node of the Master Event BDT.
Hereinafter, the EAR handling process will be described focusing on the'delayed progress event' which is an important event in goal management of most projects/tasks.
For each task in the Task BDT that is currently in progress and wants to monitor and manage targets according to the elapsed time, every unit time, all progress monitoring items stored in the NAS of the task and all events that can occur, by monitoring item and Continuously and repeatedly checks and proceeds at the time interval set for each event. However, if a specific event is detected, it immediately enters the EAR Handling Process.
A typical cause of delay in progress is the lack of resource input in terms of quantity or quality, including Manpower. In addition, the occurrence of events such as power outages, major equipment failures, line stoppages, and bad weather are also affected by lack of resource input and cause delay in progress. When an event with an expected progress delay occurs, the completion amount of the expected deliverables at the end of the unit time that is currently elapsed is compared with the planned amount, and if there is a difference by more than a Significant Level, the task's progress is delayed at that point. 'Assert the event occurrence'anticipation' situation as fact and enter the EAR handling process.
When a specific event occurs, a series of events that propagate and occur is called'Event Chain', and the Event Chain Method has been proposed and used as the main method to cope with this. In the SWEEP technique of the present invention, the'Event Absorbing Tactic (EAT)' event absorption strategy is used to absorb the ripple situation as early as possible so that the chain itself is not formed when an event occurs, or to defend before a specific milestone point. do.
When each unit time elapses, the expected progress of the unit time and the performance progress are compared for each task, and the progress rate of the task is calculated. First of all, to calculate the progress rate, the achievement or performance status at the completion of the task is called'Task Total Deliverable', the achievement or performance status corresponding to each unit time is called'Unit Time Deliverable', and the cumulative achievements up to each unit time Or the performance status is called'Cumulative Deliverable', and the performance against each plan is called the'Progress Rate' of the corresponding Deliverable. The total, unit time, and cumulative progress of each task are represented by the progress rate of the deliverables.
When there are two or more Deliverables, each weight is assigned and summed to calculate the progress rate of the entire Deliverable. By converting the quantitatively calculated progress of Deliverable to the actual progress value of the task, each task manager or manager should not directly input the performance progress value through subjective judgment. In the input of the progress rate of the Deliverable, objective evidence such as video, specific state, or quantity must be specified and entered, and the second-level manager or Scheduling Engineer (or ‘Scheduler’) must confirm the accuracy of the corresponding input.
The nodes including the present time among the nodes of the progress management IVY of each task and the detailed unit time IVYs below are called the present node, and the nodes corresponding to the past time are the past nodes. And a node corresponding to a future time is called a future node. All IVY includes only one Present Node, and therefore, the detailed unit time IVY of the lower level generated by developing the present Node can include all Present Node, Past Node, and Future Node. Current situation monitoring and progress management information are stored as properties of Present Nodes. The situation monitoring and progress management information stored as attribute information of Past Nodes is used for trend analysis, progress situation prediction (Forecast) and event occurrence probability calculation in the current node, and accumulated and learned as experience. The method of predicting the probability of occurrence of an event may include the use of the Weibull distribution described above.
To determine the progress status of each task,'Fast','Normal','Delay','Delay-Hi' or'Delay-Hi-Hi' by executing the rules expressing the monitoring method and the status judgment criteria explicitly. If it is judged as'Delay' or more, the occurrence of the progress delay event of the task is detected, and the subsequent EAR Handling Process is entered. The progress delay event of one task can lead to the occurrence of the progress delay event of subsequent tasks, and at this time, a chain of events is formed.
As an example of a specific progress delay event'Detect', for each task in Task BDT at 11 am, which is the detailed management unit time of today, the completion status of the Deliverable is converted into the progress rate of the task. , In order to determine the progress state corresponding to the corresponding progress rate as a Template Rule that includes (EQ ?task//?day//?h//Progress_State'Delay') in LHS, ?day is'Today' and ?h As'h11', ?Task is visited to Task BDT to DFS and replaced with each extracted task. Instantiate Rule to determine the progress status, while reaching Task-A, the LHS condition (EQ Task-A// If the Eval result of Today//h12//Progress_State'Delay') is returned as'True', the progress delay event of Task A is detected and the subsequent EAR Handling Process is entered.
The ultimate cause of the delay in progress of all tasks is the Deliverable completion amount or insufficient completion status due to the occurrence of the Insufficient Supply Event, which is the quantity or quality of the input resources. Therefore, in the SWEEP technique that regularly and continuously monitors the supply status of each resource, the progress delay event of a specific task has already occurred as a follow-up event through Event Driven Reasoning at the occurrence of the event in which the resource to be put into the task is insufficient. It is expected to be anticipation.
In order to improve the precision of situation monitoring and management, and detect and cope with it as early as possible when a progress delay occurs or is expected during task execution, the'Day' Node (Default), the current unit time, is set to the'Day' Node (Default) below the detailed unit time. With Hour' Node IVY, it can be continuously deployed with'Minute' Node IVY and'Second Node IVY to monitor and manage, and after use, the corresponding IVY can be'Degraft'. In the case of PM, the management unit time is mainly'Day', and in the case of each task manager, the'Day' node can be deployed to manage'Hour' as a unit time.
In this way, the possibility of recovering progress by increasing the input resources without extending the duration of the task's execution schedule as much as possible for the delayed task is explored as follows. Whenever each unit time elapses, the deliverable completion plan of'Next Unit Time' is increased as much as the accumulated Deliverable of the day of production or completion compared to the execution plan. In order to complete the increased Deliverable, the additional resources to be added are incremented by each input unit within the range of the input available, and the amount of completed Deliverable is increased until the corresponding task progress is restored.
The calculation of the amount of resources to be put to create or complete the amount of Deliverable additionally is the Resource BDT that is grafted on the NAS of each task and includes the resource information required for the task, and the Alias of each Resource name node of the Resource BDT. The information contained in the NAS of the Resource Node of the same name in the Master Resource BDT is used. Each Resource Node of the Master Resource BDT has information related to common information related to the corresponding Resource, product information for resource input, quality assessment of resources, and information related to a method of integration of resources in the NAS.
In the case of manpower, the standard defined qualification name can be used as the standard, and when a specific individual with the relevant qualification is designated and input, the Poomsum coordinated by reflecting the individual's capabilities is applied. When there are multiple resources to be input at the same time, in order to calculate the effect of the insufficiently inputted specific resource on the Deliverable progress and the loss of other resources due to it, rules indicating the'how to collect resources' Calculate by calling and executing. As an example of the above'how to collect resources', if the main worker is absent from the manpower performing a specific task, the possible deliverable progress can be 0% even if the auxiliary workers go to work, and the manpower of the auxiliary workers is dedicated. Everything is lost unless you do. In the case of a task that requires continuous use of the overhead crane, even if all materials and other equipment including workers are put in, if only 50% of the use of the overhead crane is possible, the progress of Deliverable is determined as 50%, and the manpower for the rest of the time is All is lost. In addition, even if the resource is normally input quantitatively, the progress of Deliverable may be delayed if the quality is deteriorated. Therefore, the appropriateness of the resource quality is evaluated by executing the rules related to'Resource Quality Assessment'.
If recovery is possible during'next unit time', that is, 1 unit time by the increment operation of the above resources, it is referred to as '1-unit-time recovery', and an increase in total cost is calculated. When calculating the cost, overhead and fixed costs are also reflected. Next, the recovery period is incremented, the increase in resource is allocated to the incremented recovery period, and the total cost is calculated for the'two unit time recovery'. When the cost is compared with the above '1 unit time recovery' and '2 unit time recovery', if the cost increases, it returns to '1 unit time recovery' (Backtrack) and the '1 unit time recovery' plan is determined as the progress recovery plan. do.
When the '2 unit time recovery' cost decreases to a significant level or more than the '1 unit time recovery' cost, the recovery unit time is continuously incremented one by one and the required cost is calculated. If the cost reduction decreases below a significant level or the unit time at which the cost starts to increase is found, the last unit time is determined as the progress recovery plan period, and the execution plan is determined with the additional resources allocated and the increased unit time progress. It is established and confirmed by agreement with the PM and the relevant task manager.
If progress cannot be recovered during the'next unit time', the unit time is continuously incremented until recovery is possible, and resources are continuously incremented within the range that can be input. When the unit time for recovery of progress is met, the total cost is calculated, and the unit time is continuously incremented to calculate the required cost. If the cost reduction decreases below a significant level or the unit time at which the cost starts to increase is found, the last unit time is determined as the progress recovery plan period, and the execution plan is determined with the additional resources allocated and the increased unit time progress. It is established and confirmed by agreement with the PM and the relevant task manager.
At this time, the'Impact' at the node of the unit time at the time of occurrence due to the progress delay event is'distributed' to the node at the unit time of the least cost progression recovery, and can be regarded as'absorbed'. It is called'absorbing'.
The time up to the unit time that can be recovered for the first time is a time that can no longer be shortened even if all possible means are mobilized and made effort regardless of the reosurce or cost put in at the present time, and this is the'shortest time required' (Absolutely It is called Needed Time (ANT)). During the re-establishment and agreement process of the execution plan, the PM or the corresponding task manager may advance the minimum cost progress recovery period up to ANT.
If'Milestone Nodes' are encountered in the process of continuing incrementing the unit time node because the above progress cannot be recovered,'Milestone Sliding' occurs in which the corresponding Milestones are pushed back, and the Milestones of the Tasks that are in a subsequent relationship to the current Task The length of'Feeding Buffers' in between starts to be decremented. When the'Milestone Sliding' causes the length of the Feeding Buffer to be less than 0, the subsequent milestone slides together to keep the length at 0, forming a'chain' of the event in which the progress delay is propagated to the corresponding subsequent task. And the overall cost can be greatly increased. Therefore, the progress delay event is to be absorbed before meeting the next milestone as much as possible.
In addition, due to the'Milestone Sliding' due to the delay in progress, the length of the'Receiving Buffers' with the Milestones of the tasks in precedence with respect to the current task starts to increase, and the length of the buffer where the length of the Receiving Buffer was 0 As is Incremented, the preceding task has room for progress to the corresponding preceding milestone, thus creating room for use as Opportunity.
When a specific task is able to proceed faster than the execution plan or a positive event that results in faster performance occurs, the resource is incremented or decremented by the input unit, similar to the process of searching for the minimum cost unit time when the progress is delayed and '1 unit time Starting from'Reduction', search the unit time where the total cost reduction is maximized, shorten the task execution plan period up to the unit time, and implement it in agreement with the PM and the relevant task manager. In the process of shortening the planning period, the milestones are slid in the direction of the unit time node early, the lengths of the feeding buffers are incremented, and the lengths of the receiving buffers are decremented. If a Receiving Buffer whose length is less than 0 is generated, the progress of the preceding task is accelerated, and if the relative milestone cannot be slid together to the early unit time node, the progress of the current task cannot proceed any more quickly.
Among the milestones of each task, a milestone fixed on a specific calendar date and set as deadline is called'Deadline Milestone', and'Milestone Sliding' that moves the milestone backward should not occur. Relative or absolute priority or weight is set between the two grafted preceding/following milestones to determine whether'Milestone Sliding' of the high priority milestone is first, and the low priority milestone's In principle,'Milestone Sliding' is subordinated to the decision. When Progress Management IVY is displayed on the monitor, the locations of the milestones are displayed, and the lengths of the buffers are also displayed in the form of IVY, and when the buffer length increases or decreases according to the progression delay, it is presented so that the increase or decrease of the number of nodes can be visually confirmed. It provides'PASS' I/O service. In addition, for each task, the'Schedule and Milestone Adjustment Record Table' (SMART) is configured as SHRUB, and it is grafted to the Start Node of Progress Management IVY of the task, and the adjustment history of all schedules and milestones is saved and managed.
In the process of applying the event absorption strategy EAT for recovery of the above progress, increment or decrement of the resources to be invested in the input unit within the range of the possible input, and increment or decrement the node of the unit time of the progress recovery period accordingly. The technique to search for the minimum cost progress recovery period in the state is called the'Gradual Resource Allocation and Cost Evaluation' (GRACE) optimal period search technique.
In the GRACE search technique, the amount of Deliverable corresponding to the change in the desired task progress or the increase or decrease of the progress, the increase or decrease of the amount of resources to be input for the increase or decrease of the Deliverable progress, and vice versa By calculating and exploring both the increase and decrease of the progress and the corresponding increase and decrease of the task progress through the increment and decrement for each unit time and resource input unit, the progress recovery process is implemented as a super rule, and the platform autonomously establishes a progress recovery plan. To be able to perform. All information necessary for the above all search and calculation exists as a Node value having a unique STPN in the Super Tree.
The GRACE technique is applied in the reverse direction even when the progress of a specific task is accelerated, and can be used as a technique for maximizing Opprotunity with coordination of the progress plan of the tasks in the preceding/successor relationship with the relevant task. The GRACE technique is also used to search for and establish an execution plan for executing each task at minimum cost for all tasks of Task BDT.
Depending on the characteristics of the project/task, along with the GRACE search method, the amount of available resources and the progress recovery period are set as constraints, and LP (Linear Programming), DP (Dynamic Programming), or Complementary Slackness The optimal period can be searched by implementing KT (Kuhn-Tucker) Optimization Technique, which applies Inequality Constraints such as Condition, as a Rule or interlocked with a separate Tool Package.
As described above, by applying the EAT event absorption strategy, the delayed task progress can be recovered as early as possible and its ripple effect can be minimized.
Depending on the field and characteristics of the project/task, for events that need to be dealt with immediately when a situation occurs, it enters the EAR handling process at the time when the event occurs. Examples of events that require immediate response include interruption of major material procurement in plant EPC management or occurrence of design changes in major construction or delay in procurement of major facilities, interruption of raw material supply at the factory and stopping of major facility failures, computer operation management tasks. Examples such as excessive slowdown of computer speed or detection of virus intrusion and hacking attempts, loss or loss crisis or inferiority in Sports' supervisory management, and stock price plunge of investment stocks in stock investment task.
In particular, in the case of the Plant EPC Project, the construction material supply interruption event causes the construction to cease, and in the case of the factory operation management task, the raw material or raw material supply interruption event leads to the production line suspension, causing enormous losses and making it difficult to achieve the set goals. You may. Moreover, in assembly production plants, there are cases in which thousands of raw materials are input. In accordance with the production plan, supply management IVY is applied to the relevant raw material node of Reosurce BDT in order to determine and manage the size and order time for each lot, taking into account the appropriate safety stock maintenance, raw material price fluctuations, and minimum period from order to stocking date according to the production plan. Graft. The attributes of each day node of IVY include the total requirements of the raw materials that are different from the production plan on the day, the day's starting stock, the day's input and end stock, the raw material quality and loss rate, the expected exhaustion date, the day's order volume, the order intermediate inspection, and the stocking amount It is stored as a value, and the raw material node stores the price and price change forecast information of the raw material as attribute values. It continuously checks the current stock, order, and stocking status at the start and end time of each unit time in which production is in progress, and at a certain time in progress, and prevents the occurrence of raw material supply interruption events. Securing the minimum safety stock is a constraint, considering the current price and price prospect of raw materials, and searching by incrementing or decrementing the purchase date and lot size using the above GRACE technique to determine the appropriate purchase lot size and timing. Examples of STPNs used as information used for search are'Resource_BDT/ Resource_p// k_th_Day// Total/ Supply_Schedule_Value','Resource_BDT/ Resource_p// k_th_Day// Start_Stock_Value','Resource_BDT in the case of management of k_th_day of Resource_p. / Resource_p// k_th_Day// End_Stock_Value','Resource_BDT/ Resource_p// k_th_Day// Order_Size','Resource_BDT/ Resource_p// k_th_Day// Warehouse_In', and'Resource_BDT/ Resource_p// k_th_Day// Warehouse_Out' . The appropriate inventory and minimum safe inventory information of Resource_p are stored and utilized in'Resource_BDT/ Resource_p// Optimal_Stock_Value' and'Resource_BDT/ Resource_p// Safe_Stock_Value'.
When the Resource_p is put into multiple production tasks, the input plan amount for the day in any Task_i can be known from the value of STPN such as'Task_BDT/ Task_i// k_th_Day// Resource_p/ Supply_Schedule_Value'. The'out of stock event of Resource_p' may be found by continuously or periodically executing a Rule including the expression'(LT Resource_BDT/ Resource_p// k_th_Day// End_Stock_Value Resource_BDT/ Resource_p// Safe_Stock_Value)' in LHS.
In the case of Smart Factory production target management task, production may be stopped even when a'Trip Event' of major facilities occurs during plant operation. In the case of a major facility trip occurrence event, as an example of tracking the cause of the trip, for example, when the cooling water supply pump of the cooling water system operated as a support system in most factories trips, VINE indicating the process first In a situation where the measured values of Flow and Pressure, which are the monitoring property nodes of the corresponding Pump Node's NAS, suddenly drop to 0 without any additional operator's operation, the Pump trip event is found ( Detect). In addition, among the properties of the pump node, the node representing the motor name that drives the pump is Alias, and has a node with the motor name in the power supply system VINE. In the power supply system VINE, the circuit breaker (CB) node responsible for the closing and breaking of the motor is included as the leading node in the PPN of the corresponding motor, and the secondary current of the breaker is calculated from the state attribute value of the NAS of the corresponding breaker. It is 0, and it can be seen that the current location of the CB is open. In the'breaker control circuit' VINE grafted to the control circuit node of the corresponding breaker's NAS, the contact of the open relay of the breaker can be tracked, and the relay is continuously operated from the PPN of the corresponding relay node. It is possible to find the series and parallel contact elements that make it possible. If it is confirmed that the'coolant tank level Lo-Lo' limit switch contact among the found contact elements is closed, the coolant pump has tripped due to the lack of suction head as the level of the coolant tank is Low-Low. You will be able to trace it. In addition, the trip of the cooling water supply pump starts from the'Coolant Tank Level Lo-Lo' alarm, and the trip relay of the cooling water supply pump is excited due to the close of the contact point of the corresponding limit switch, and the circuit breaker of the pump motor is opened and the pump trip. It is also discovered as a process leading to a situation, and it is possible to review the consistency of what happened. The reasoning starting from the Pump Trip result and tracking the cause proceeds as Backward Reasoning, and the reasoning starting from the Tank Level Lo-Lo and confirming the consequential situations proceeds as Forward Reasoning.
The series of tracking processes and methods are implemented as Template Super Rule, and are performed with the same purpose and context of tracking the cause of trip of a specific pump, and can be similarly used for trip or alarm tracking of most pump facilities. All information necessary to execute the above Rule is included in Super Tree.
The event that has been confirmed to occur is recorded in the'Event BDT' grafted to the NAS of the corresponding task, in the event table SHRUB grafted in the NAS occurrence history record node of the node of the event name, and the root of the Master Event BDT. Collect and record in'EMART' to be grafted.
This platform also allows PMs to direct High Abstraction Level instructions or assign duties to the platform through STEM configuration, and other managers and team members also inquire, request information, and request support. , Opinions or suggestions can also be entered directly through a keyboard, orally, or through a smart phone. Therefore, it is fundamentally different from the conventional software system or tools that users need to learn and use the path and function of Menu or Submenu presented in a hierarchical structure. In particular, the frequently entered instructions or requests are stored separately by configuring the'Frequent Order and Request Table' (FORT), and instructing the platform to implement even with keyboard input or verbal commands in shortened expressions such as'F1' and'F2' It also provides a service that automatically completes and presents the rest when a part of an instruction or request is entered. Among the instructions or requests stored in FORT, the instructions or requests that are regularly repeatedly fulfilled are called'Regular Order And Request' (ROAR), and the Timer Rule that asserts the time when each ROAR's execution time arrives is executed. Invoke and execute the Rule that can execute the ROAR. As described above, an active and autonomous service provision method in response to an instruction or request made to the platform is referred to as the'Proactive And Smart Service' (PASS) method.
The PASS intelligent service method, which the I/O Agent executes and provides exclusive rules, autonomously performs tasks assigned to the platform as Platform Tasks in the process of inputting and modifying Super Tree, establishing and adjusting task plans, and handling events. It can explain the process of execution, continuously reports the rules that the platform calls and executes, and confirms whether the platform is operating normally. In addition, nodes or symbols representing each unit information are presented, and when the nodes or symbols selected by PM or other administrators are moved, connected, or separated to a desired location with a mouse, the relationship between the corresponding information is automatically updated in the Super Tree accordingly. A GUI is also provided. The Platform Task is a project/task such as delivery of instructions given by PM to team members, convocation and recording of meetings (video conference, group talk room meeting, actual meeting, etc.) for smooth execution of Project/Task and time saving. It also provides a service to smooth the flow of task progress.
The platform also supports facility operation to achieve smooth goals when facilities need to be operated to perform projects/tasks. For example, in the case of a production plant, since the automatic control at every moment is usually handled by an automated system or SCADA (System Control and Data Acquisition), the target management platform interlocks with them to provide information necessary for target management at required time intervals. Collect and use. The TAG of the collected measurement values is converted to the corresponding STPN and stored in the Super Tree. If IVY is included in the path along with the uniqueness of the STPN, it can also include related time information, and additional information can be included as attribute information in the NAS of each node on the path. Abbreviations) can be used as a substitute for the existing TAG, as it can be expressed more simply and clearly than the conventional control point TAG system. In particular, for events that can directly affect goal achievement or progress, such as a line stop or trip of a major facility, the platform actively intervenes through logical reasoning using VINE to detect signs early and trace the cause of the trip. In addition, it can directly perform, request, or recommend actions to be taken, and perform high-level operational monitoring support tasks such as performance monitoring and reliability calculation of major facilities.
Examples of typical high-level abstraction level instructions or assignments or request expressions given to the platform are:'Show Progress State Of All Task {In Task BDT, In Progress}','Report Everyday {At 6:00 PM, With Report Format(Format No.)} Every Task {In Task BDT, In Progress} Whose Daily Progress State Is Delay','Show P&ID Of Process Line {Line Name}','Show Every Major Facility {In Facility BDT} Whose Reliability Is Below Low','Report Any Indication Of Hacking','Explain Why Computer Become Slow','Explain Usage Of Every Process Running','Report Every Facility {In Facility BDT} Whose Energy Consumption Increase Significantly During Last Week','Open Meeting {At 100:AM, Common Image Meeting} Tomorrow With Selected Member {In Manpowre BDT} With Agenda {Description}'. In the above example, {Bracelet} indicates a detailed attribute, and (Parenthesis) indicates a specific value or comment. All of the above instructions, tasks and requests are represented by STEM and implemented by template rule.
When the task performing stage (S104) is completed, the final stage, “Project/Task Completing Stage” (S105), is finally performed. In the'Project/Task Completion Stage', we evaluate and check whether the goal has been successfully achieved by comparing all Deliverables actually completed for all levels of Task BDT with established goals and plans, and if there is a separate customer or owner Deliverables that need to be handed over are handed over, and the experience of performing the project/task is stored and accumulated in the Super Tree as a specialized knowledge and method for learning, upgrading the Super Tree as Big Information, and similar in the future. When constructing an intelligent goal management system for a project/task, it enables a platform with improved capabilities to be provided, and goal management is terminated.
In the case of the plant EPC project, after successful commissioning, the transfer/acquisition of the plant that satisfies the guaranteed performance within the target completion period and budget range is completed, and in the case of production management tasks, the annual production target is determined at the desired cost and quality for each product. Achievement, in the case of a company, achievement of the operating profit target, and in the case of an energy management system (EMS) for energy saving, the baseline value is calculated as a routine and non-routine adjustment factor that occurred in the energy use process. ) To achieve the goal of annual energy consumption or cost reduction reflecting in the baseline, in the case of computer operation management, safe operation and convenient use from viruses or hacking for a certain period of time, victory in various sports management supervision or acquisition of championships, In the case of achieving the target investment return in stock management, obtaining or passing a specific qualification, it can be evaluated that successful target management has been achieved.
As described above, the intelligent platform of the present invention is based on the'SWEEP' goal management technique, and proceeds through the'period/hour of target management' for all detailed level tasks that are the target of goal management. By continuously, proactive and intelligently autonomously managing goals thoroughly and elaborately over time, the possibility of successful project/task achievement can be greatly improved.
This Super Tree-based Project/Task intelligent goal management platform (simply'Platform') is hardware based on Main Server, Project Team other than PM and PM, middle manager, owner, agent, supervisor, subcontractor, manager, supervisor, PCs and Smart Phones for all Project/Task Stakeholders (collectively,'Stakeholders') such as individuals, and additional physical or functional Back-up Server, DB Server, and Web Server depending on the characteristics and scale of the Project/Task And Cloud Server, various measurement and control equipment, and network equipment connecting them.
The target management system for a specific project or task built based on the Platform or Platform of the present invention is implemented on the H/W centering on the Main Server. Fig. 8 shows the preferred functional configuration of the Project/Task Intelligent Goal Management Platform of the present invention. Shows an example of.
For the intelligent autonomous goal management of Project/Task, the platform of the present invention is functionally provided with a Project/Task general management unit 801, Input/Output management unit 802, Super Tree configuration management unit 803, and Knowledge-base management unit 804. ), It consists 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.
The master agent manages all the tasks of all management units including the project/task general management unit 801, and delegates management by creating additional specialized agents in charge of each management unit according to the size and characteristics of the project/task. To share. The functions or duties in charge of each management unit will be described below.
The project/task general management unit 801 supports PM and is responsible for overall command and supervision of the platform task throughout all stages of project/task goal management.
Project/Task general management unit 801 collects and stores information and knowledge necessary for goal management, uses this to establish goals and schedules for all and each detailed task, and based on the information collected continuously, various kinds of Responding to events or contingency, continuing to coordinate short-, medium- and long-term plans and goals, and achieving the established goals at a'total minimum cost', and instructions given by PM as platform tasks. Performs the assigned task, provides information to all project/task stakeholders, including PM, for task performance, delivers instructions from the PM to other managers, and follows-up, and all relevant parties ( It supports communication, exchange of opinions, coordination, and aggregation among stakeholders, convenes direct or indirect meetings, reports requests from other managers to the PM, and manages the processing.
The above'all project/task related persons' includes PM, team member or middle manager or field manager (referred to as'other manager'), project owner, owner agent, subcontractor and other related persons.
In addition to the direct cost and O/H required to complete or complete the Deliverable of the Project/Task, the'Total Minimum Cost' is a weight for each item if it is necessary to consider quality, convenience, safety, environment and security. It means the cost that minimizes the total cost reflecting the cost converted into equivalent by allocating.
The Input/Output management unit 802 collects all information including all data and knowledge required by other management units for target management, and is responsible for all output tasks that the platform must export.
The above information is collected through PM and project/task related persons who are authorized to input specific information, measuring instruments, sensors (including IOT sensors), DCS, PLC, and other servers or the Internet. In the case of the control point, measured values or sensor values that are input to an external TAG are input and converted by mapping to the corresponding STPN in the Super Tree. Conversely, the output value converts the STPN into the corresponding external TAG value. Also, Super Tree's STPN can be used directly as a TAG.
In addition, receiving the direction of the Project/Task general management department and the request and support of other management departments, access the Knowledge-base and DB to present and display the progress or operation status of the Project/Task (Display), and from PM and other managers. Provides a GUI that provides a'PASS' type of service that can receive instructions or requests from the user, display the report, and establish and coordinate a task schedule with PM. The input/output function is provided directly or through a web service or cloud service, and includes both wired and wireless input/output.
In the case of the duration of a project/task, the GUI displays Progress Management IVY representing the relevant period and IVY nodes representing each unit time in the form of a Gantt Chart or a series of chains represented by nodes. Increment, Decrement, Split, Merge, Expand, Shrink, Shift, Milestone location can be selected and the preceding/subsequent relationship can be set arbitrarily on the screen to support task planning and coordination and progress management. All operations for other PLANTs are also supported by clicking and dragging the mouse on the display. Typical manipulation support is Node Insert, Node Delete, Node Expand, Super Tree Skeleton Display, PLANT Display, Graft, STEM Generation, Rule Generation and GUI for State Monitoring.
The display can select accumulation and scroll, and the logical connection configuration of all BDT, IVY, VINE, BUSH, SHRUB and Super Tree as a whole, and the physical layout and schematics of the process or support system and facilities or spaces represented by VINE or BUSH , 3D Drawings, and 4D Display showing the state change according to the time of progress. It also includes a monitor to support this, drawing and coordinate management in the field, and management of various symbols. Even in the case of projects/tasks with hundreds to thousands of tasks to be performed at the same time, the monitoring results of the progress and progress of all tasks or the operation status of the facility are displayed, so that the situation can be clearly and visually identified immediately. To present, you can use a sector graph organized in a hierarchical structure. (Refer to Korean Patent 10-1233264)
In particular, avoiding the inconvenient hierarchical traditional menu and item selection method, which requires PM and other managers to remember the paths of Menu and Sub Menus unilaterally presented and search them one by one, and learn the meaning of various selection items. By using Generation BDT, we provide I/O service of'Proactive And Smart Service' (PASS) type that supports PM or other managers to directly input desired instructions or requests.'PASS' type type In order to provide the service, the I/O management department allows the PM or other manager to input instructions or requests.'What can I do for you?','What do you want?','Please input your Order or Request. When inputting, input the front part of the text, and use the ORE Generation BDT to present the options of the remaining expected texts as a drop-down menu so that they can be easily selected and completed. An instruction or request is represented by STEM, and a Template Rule that can handle the instruction or request is configured and stored in the Rule BDT, instantiated, and executed.
The Super Tree configuration management unit 803 presents a typical Super Tree framework (Skeleton) in the form of a typical (Typical) according to the characteristics and fields of the project/task received (S100) as overall basic information, and gives PM and other managers. It manages the task of supporting the construction of the Super Tree through input and modification within the authority and defined operations such as Graft. In addition, branches or plants that are pruned or degrafted are in charge of collecting Super Tree related resources by performing Garbage Collection when the connection with the ROOT is disconnected. When trying to manage multiple projects/tasks, it supports the configuration of a Super Forest that has each Super Tree as a Subtree.
The knowledge base management unit 804 cooperates with a PM or a platform implementation engineer, and uses Semantic Primitives to construct a Super Tree, an operation performed on the Super Tree, perform a task on the platform, an instruction given to the platform, and a task to be given. And it implements the expert knowledge and methods necessary for the execution of the request as a Rule or Template Rule, configures and stores the Rule BDT, and manages the management so that the saved rules can be called and executed.
The project/task progress management unit 805 establishes an execution plan of tasks that separately manage progress among tasks on the task BDT, and establishes a completion plan and resource input plan for corresponding deliverables, calculates cost, calculates progress of deliverables, and It is responsible for calculating the progress of the corresponding task, monitoring the resource input situation, calculating the actual cost, and coordinating the task execution plan. Establishing a task execution plan uses a top-down method and a bottom-up method in parallel, and establishes a task execution plan that minimizes the total cost by using the GRACE method, and continuously adjusts according to progress. Responsible for the task of achieving the goal at the lowest cost.
The resource management unit 806 monitors and manages the procurement or supply plan and input progress and performance of all resources to be invested in order to create deliverables to be completed or completed in order to complete each task of Task BDT.
To this end, we cooperate with PM and other managers, classify and subdivide all the resources that need to be invested to achieve the goal of the project/task by type and division to form the Resource BDT, and each Resource Node is a resource for managing the resource. Supply Management IVY is grafted, and the cost estimation standard including quantity and various premium conditions and cost information that can be created for each allocation unit of the corresponding resource is stored in NAS (Node Attribute SHRUB) And use it.
The event management unit 807 manages various events that occur randomly during task execution according to the EAR handling process, and prepares in advance through scenario analysis for events that are determined to be important. In the event of a delayed event, the EAT strategy based on the'GRACE' (Gradual Resource Allocation and Cost Evaluation) technique is applied to absorb the impact early or minimize the spread.
Among the events, in particular, “Risk” is defined as an event in which the completion period of the entire project/task or the main task is delayed or the goal achievement may be difficult. The risk management unit 808 cooperates with the PM and other managers to classify the expected risks by type to configure the Risk BDT, calculate the probability of occurrence and the hazard rate, and take precautionary measures to minimize the possibility of occurrence. Countermeasures are prepared for each occurrence scenario, and in case of actual risk, it is in charge of work to minimize damage by responding early.
The database (DB) 809 management unit stores all information necessary to perform the intelligent target management task of the Project/Task, including Super Tree configuration information, in a format such as DB, Spread Sheet, or XML File. It performs tasks to -up and provides, and maintains the continuity of goal management by stably recovering or preparing the reasoning environment including the read-in super tree every time the program is restarted, and with other servers through DB. It is in charge of the task of exchanging information and sharing information between agents.
As described above, this Super Tree-based Project/Task intelligent goal management platform technology provides an integrated general management means for each project or task to set and manage a goal, Executes instructions from and tasks assigned by PM, supports the establishment of an optimal goal achievement plan, continuously precisely monitors and manages the progress and progress of the project/task, and negative events that occur in the process B. Proactively cope with risks early and support to minimize the impact, prevent or shorten the creation of the event chain due to the spread of events, and utilize Opportunity to the fullest, minimizing overall cost and achieving the set goal By supporting PM and other project/task managers so that they can go on, common core platform technology and means (Platform Technology) that can build customized intelligent goal management systems according to the characteristics of the project/task in various fields. Tool).
The present invention can also be implemented as a computer-readable code on a computer-readable recording medium. The computer-readable recording medium includes all types of recording devices that store data that can be read by a computer system. Examples of computer-readable recording media include ROM, RAM, hard disk, USB, CD-ROM, and optical data storage devices. Web Service, Cloud Service, and other carrier waves (for example, transmission via the Internet) It includes things implemented in a form. In addition, the computer-readable recording medium may be distributed to a computer system or smartphone connected through a network to store and execute computer-readable codes in a distributed manner.
Although the preferred embodiments of the present invention have been illustrated and described above, the present invention is not limited to the specific preferred embodiments described above, and names of various data structures, data models, knowledge and information models, and techniques used in the present invention And abbreviations were used for convenience and clarity of explanation, and similar names or notations may be used. Therefore, anyone with ordinary knowledge in the technical field to which the present invention pertains 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 as a DB or modify it in a similar manner. Of course, such changes are intended to be within the scope of the description of the claims.

Claims (15)

It is the basis for building project/task management systems to support the'general manager of various projects or tasks' (collectively referred to as Project Manager (PM)) who want to set and achieve goals to perform their duties successfully. In the implementation method of the project/task target management platform composed of software programs running in

‘Knowledge’ such as goal management method or expertise required to establish and manage the execution plan of the project/task, and exist between raw data, processed data and data 'Information', such as relational, is continuously collected in cooperation with the PM during the start and execution of a project/task, and it is classified or classified according to the type and purpose of knowledge and information, and the correlation between them, and intelligent autonomy Compose the'Body of Goal Management Knowledge and Information (BOGMKI)' that is stored in a form for use in goal management,

Based on the knowledge and information contained in the BOGMKI,'all levels of detail (levels) that must be performed directly or indirectly to create a Deliverable to achieve the goal of the Project or Task or to reach the result State ) Of Tasks to Work or Work Packages to Activities' (collectively referred to as'Tasks') for monitoring and progress management,'Various Tasks assigned to Platform as tasks' Compose rules that express inference and reasoning, decision, and computational methods, and the procedure and process of the task required to perform the task. And, by calling (Invoke) and executing (Execute), the platform can autonomously or actively support target management,

The Rule is included as a part of BOGMKI, consists of a Condition Part and Action Part, or Left Hand Side (LHS) and Right Hand Side (RHS), and consists of an order or request (High Abstraction Level). Request) can be processed, and a logical explanation for the conclusions or results drawn by the Rule itself can be presented, and if a significant result is derived by the execution of the Rule, it is added to the BOGMKI and By increasing the information, learning and evolution are possible, and the'Super Rule' that can be executed by automatically continuously and repeatedly calling and executing, including the Timer Rule, which is called when a certain time arrives or time elapses. 'And

In order to construct the BOGMKI and Super Rues in cooperation with PM or platform implementation technical personnel, the platform provides a graphic input window, symbols representing unit knowledge and information, and tools that relate their relationship. Provides, and supports input by presenting the skeleton or templates of typical BOGMKI and rules according to the project/task field or type,

In the case of a project/task that requires time schedule management according to the progression time, a certain length of management unit time is selected for the convenience of management, and the execution time or duration of all detailed tasks Each unit time is expressed as a node chain or a Gantt Chart, and the default unit time is'Day', and can be used together by adjusting the precision in whole or in part according to the characteristics of each task and the required management precision. Establishes and manages the progress plan for each task and each unit time by using the Top-Down method and the Bottom-Up method in parallel, and optimizes the execution time or period of each task, or various preceding and follow-up relationships between tasks (Optimum ) Settings and coordination are searched and managed by Increment Decrement by the unit time,

Various events or risks that can occur randomly during the execution of each task are classified by type, and prediction, discovery or detection, evaluation and countermeasure establishment, action, result review and learning are performed for each event. The'Event And Risk (EAR) Handling Process', which includes the event and risk (EAR) handling process, is established, continuously and repeatedly observed according to the time precision set for each event, and an event is predicted or detected as early as possible. It absorbs the impact from the initial stage and shortens the length of the event chain formed by the spread of the event, and prepares in advance through scenario analysis for major events, and in the case of'Positive Event', it is used as an opportunity. by doing.

All detailed tasks, which must be performed for goal management, and may be thousands or more, depending on the project/task, are monitored continuously and precisely, 24 hours a day, throughout the whole period of goal management. The goal management technique that is managed, managed, and proceeded is used, and this is defined as a'SWEEP' (Successive Work and Event Evaluation and Proceeding) goal management technique,

As a means to systematically construct and utilize the'BOGMKI' and implement the SWEEP technique, each unit knowledge and information is represented as a node according to the type and characteristic of the collected knowledge and information, and knowledge and information A variety of'Knowledge and Information Models' specialized in the expression, storage and use of each knowledge and information, representing the relationship between them in Arc, are devised, defined, and constructed.

The Knowledge and Information Model defined and configured is a BREAKDOWN Tree (BDT) in the form of Tree Data Structure, which is configured to manage information that can be systematically or hierarchically classified or classified or subdivided into homogeneous or homogeneous detailed unit information. 'And, the entire duration or time of target management is divided into'Unit Time' based on task performance management of a certain length and subdivided, and each subdivided unit time is represented by a node, and the indicated nodes are preceded. / Depending on the successor relationship, the Gantt Chart is shown in the form of a continuous quadrangular node, or'IVY' is composed of a series of chains by connecting each node with an Arc, and handling various media flowing in a certain direction. 'VINE', which represents each facility or component or element or entity of the system as a node, and represents their interconnection as an Arc, and various mediums or objects In a system or network that is configured so that they can move in both directions, each facility, element, or entity that constitutes each system and network is represented as a node, and is the center of the configuration or connection of the system and network. In addition to the knowledge and information represented by the BDT, IVY, VINE, and BUSH, various operations, reasoning and reasoning, in addition to'BUSH', which is configured by selecting the central node of and representing the connection relationship of other nodes with an arc from the corresponding central node, Inference), Super Rule for expressing and implementing knowledge such as judgment, management actions and procedures, detailed attribute information of each node, and all other knowledge and information required for goal management are Tree Data Structure 'SHRUB' that is configured and stored in the form of, and the BDT, IVY, VINE, Tree as a stump to form a framework or foundation to further connect these plants, including'operations' to compose and utilize various'PLANTs' such as BUSH and SHRUB It further includes'STUMP' (Smart Total Unified Management Platform) in the form of data structure,

The plants are'grafted' to the STUMP, and the BOGMKI, which is formed by freely grafting the plants together according to the relationship between knowledge and information, is defined and named as'Super Tree' and used for goal management,

With the configuration of the'Super Tree', all nodes constituting the Super Tree are formed through an internal connection (adjacency) such as parent/child or predecessor/successor relationships according to the characteristics of the corresponding plant within each plant to which they belong. In addition to the relationship between knowledge and information, a relationship between knowledge and information is formed through an additional connection relationship with the nodes of the plants connected by the graft, so that all knowledge and information stored in the Super Tree is a node of the Super Tree. Even at the location, it is possible to freely access as surrounding knowledge and information (Context) and use it for reasoning and judgment, enabling the realization and application of the'SWEEP' goal management technique,

By applying the SWEEP goal management technique using the Super Tree, the platform assists and supports PM as a virtual staff or assistant, and by autonomously or actively performing the goal management of the project/task, the accuracy, speed, and continuity of goal management , Super Tree-based Project/Task intelligent goal management method, characterized by stably improving consistency, objectivity, efficiency and the possibility of successful achievement of the goal.

delete The method of claim 1,

The'BREAKDOWN TREE' (also expressed as'BDT') is homogeneous or homogeneous when classified or subdivided sequentially or hierarchically among information on each subject to be managed by each field of each Major Management Node constituting the STUMP. (Homogeneous) detailed unit information is composed to express, store and utilize information that can be broken down, and each detailed management target unit information generated by sequentially and hierarchically classifying or subdividing information on each management target It is represented as a node and is composed as an information model in the form of a tree data structure that connects the indicated nodes by an arc having parent-child relationship, and it is a Super Tree-based, characterized by defining and utilizing operations that can be performed on the model. Project/Task intelligent goal management method.
The method of claim 1,

The'IVY' refers to the duration of each detailed task to be performed over the entire execution time/period of the project or task to be set and managed, and the desired time precision level (Time The basic management unit time (Unit Time) is determined and subdivided according to the Resolution Level), and each subdivided unit time is expressed as a node, and these nodes are referred to from the'Start Node' and the'Finish Node' corresponding to the end unit time (or 'Last Node'), which is expressed and constituted as an information model in the form of a chain that is sequentially connected by arcs or in the form of a Gantt Chart represented by a continuous quadrangular node, and operations that can be performed on the model are described. Defined together, and with the desired time precision according to the progression time, schedule management, progress management, progress management, interdependency or precedence/sequence relationship (Preceding/ Succeeding Relation) Super Tree-based Project/Task intelligent goal management method characterized by using it for management, management of the operation status of various facilities to be operated, and management of various events and risks.
The method of claim 1,

The'VINE' refers to each facility or device (Facility) that constitutes systems of other functions, including various production processes or supporting systems that must be used or utilized to achieve the goal of the project/task. An Information Model that represents elements or entities as nodes, and represents the physical connection and handling medium or object flow direction as an arc to perform their interaction and function. It is expressed and composed as, defining the operation that can be performed on the model, and various production, manufacturing or manufacturing processes such as raw materials, semi-finished products, and products flowing in a certain direction, and various types such as cooling water, compressed air, and power. Modeling of process support systems and various circuits that handle media or energy, and inference and judgment on operating status or operating status based on interactions according to the function of facilities or devices and their connection relationships And Super Tree-based Project/Task intelligent goal management method, characterized in that it is used for display.
The method of claim 1,

The'BUSH' is a computer and peripheral equipment that performs bidirectional communication around a network or a bus, and, unlike other VINEs, data or medium that moves according to the selection and conditions of a starting point and a target point, or In a variety of networks or systems in which facilities, elements, or entities that can change the direction of objects are connected and configured, the facilities, devices, or entities are represented as nodes, and these It expresses and composes the connection relationship of the as an arc as an information model, and defines the operation that can be performed on the model together,

Select an arbitrary'Center of Universe (COU) Node' that is the center of the system configuration or connection among the above facilities, devices, or entities, and select the selected'COU' Node as the center of the network or system. The platform of the present invention and the platform of the present invention are based on the configuration by dividing into Configuration BUSH (Default) for storing and displaying shape information and Adjacency BUSH for searching for a path existing between any two nodes in the BUSH. Operational status or operation status based on the modeling of systems other than the target management system and the systems composed of VINE, and the functions of the facilities or elements constituting the model and interactions according to their connection relationship Super Tree-based Project/Task intelligent goal management method, which is used for related reasoning, judgment and display.
The method of claim 1,

In addition to the knowledge and information stored in the STUMP, BDT, IVY, VINE and BUSH itself, the'SHRUB' performs a Platform Task, which is a goal management task basically given to the platform, or performs an instruction or assignment given by a PM. In the form of a tree data structure that expresses all knowledge and information required to receive and process requests from other managers in Node and the connection relationship between Nodes and Nodes in Arc It is composed as a knowledge and information model of the model, and the operation that can be performed on the model is defined and utilized.

All of the above knowledge and information includes attribute information of all nodes of the STUMP, BDT, IVY, VINE and BUSH, and various arithmetic and logical operations, situation determination, cause tracking, countermeasure establishment, action implementation, and procedure progress. Explicitly describes the knowledge and information necessary for processing the Platform Task and the instruction or request of the higher level of abstraction by using the knowledge and information, the judgment and computation method, and the task execution procedure and process. Super Tree-based Project/Task intelligent goal management method comprising the Super Rule represented by.
The method of claim 1,

According to the need for target management, a random number of PLANTs are created for each type of the PLANT, and the Root Node or Start Node is connected to each node of the STUMP, and random nodes are also connected between the PLANTs. Associating and specifying the meaning or relationship of the connection together is defined and utilized as'Graft',

According to the graft, the nodes of the two plants to be grafted are in addition to homogeneous information and knowledge formed by parent-child relations or preceding/successor relations between nodes within the plant to which they belong. The relationship is formed with the heterogeneous information and knowledge of the PLANT, so that the surrounding information and knowledge that can be accessed and utilized increases, and the context information and knowledge in the whole Super Tree are increased. ) Super Tree-based Project/Task intelligent goal management method characterized in that the effect is achieved.
The method of claim 1

All nodes in each PLANT have a unique node name ('Node Name'or'Node Given Name') and a node number (Node Number) in the plant they belong to, and each node additionally has the root of the plant to which it belongs. It has'Node Full Name', a path name consisting of the path from the node to itself and its own'Node Given Name', and defines and uses it as the'PLANT Path Name' (PPN) of the node.

In addition, all nodes in the Super Tree are STUMP's Root Node, and at the same time have a Path from ROOT, which is the Root Node (expressed as'ROOT') of the Super Tree, and a path name including the node itself. Defined and utilized as'Super Tree Path Name' (STPN),

Among STPNs, the STPN that passes through the root node of the plant to which the node belongs is called'Original STPN', so all nodes in the Super Tree have one or more STPNs including the original STPN.

In addition, two arbitrary nodes in the Super Tree can each form a Path Name as a relative path starting from the other node to reach itself, and this is defined and utilized as'Relative Super Tree Path Name' (RSTPN), and'RSTPN' In the path constituting the path, the path part in the direction descending from the ROOT is called the'forward path', the path part in the direction going up toward the ROOT is called the'reverse path', and each RSTPN proceeds. It can also include a path that changes direction from a specific node or backtracks to the path that has passed during the process.

Therefore, the PPN, STPN, and RSTPN, which are path names to each node in the Super Tree, access each node's own information, information of neighboring nodes of the node, and attribute information of all nodes on the path ( Access) can be used as a means,

In addition, nodes representing the same facility or component, entity or object, and variables or values each belong to one or more other PLANTs and have different STPNs. It can exist separately, and in this case, it is referred to as'Alias Node',

When inference is made by using surrounding information and knowledge around a specific node, the node is designated as'COIN' (Center of Interest Node) to replace the original STPN of the node, and all neighboring nodes are the corresponding COIN as the starting node. It can be briefly expressed and accessed by RSTPN,

As the above STPN, PPN and RSTPN notation method, instead of using Arc between nodes, forward path is marked with Slash (/), and in the case of Graft Path, double slash (//) is used, and reverse ( Reverse) Path uses Back Slash (\), and Reverse Graft Path is marked as Double Back Slash (\\), and other symbols may be used as long as there is no confusion depending on the programming language implementing the platform. There,

In the notation of the paths, when approaching a specific node or reasoning or inference for goal management, the uniqueness of the path is maintained even if omitted among the nodes on the path, or when the omitted nodes can be identified. In E, the nodes can be omitted and expressed as a simplified path expression.

In addition, when comparing two paths to determine whether to match, if the path contains'*' as a wildcard notation, it can be matched with an arbitrary path including one or more nodes at the corresponding location, and if'&' is included, the corresponding Can be matched with any one node in the location,

When a variable node expression such as'?node' is used at a specific node location of a path, the actual node expression of the corresponding variable node location can be extracted from the matched relative path as the variable node value,

Super Tree-based, characterized by providing a means for storing knowledge and information by accessing all nodes in the Super Tree through various paths and methods, accessing, retrieving, or extracting Project/Task intelligent goal management method.
According to claim 7

The Super Rule is an objective or subjective task for handling instructions or assignments given by the PM to the platform, requests from project/task related people, and basic functions and tasks given to the platform,'Platform Task'. Express knowledge and information including method, process, and know-how, express and freely update the contents, knowledge and information of consistent composition In order to accommodate in the Super Tree as a model and use it for goal management, it is implemented as SHRUB,

The Root Node of the Super Rule has two child nodes, Top LHS Node and Top RHS Node, and Top LHS Node and Top RHS Node can each have an arbitrary number of nodes as child nodes, and each node constituting the Super Rule It has the number of child nodes, the'Evaluation' (or simply'Eval') method or condition of the child nodes, and the node's own'Eval Expression' as the attribute value of Node Attribute SHRUB(NAS),

Each super rule is explicitly called and executed by the agent in charge of the execution of the super rule, or when the fact included in the conditional part of the super rule is asserted by other agents or during the execution of the rule, it is invoked (Invoke ) And executed (Execute), and at the time of execution, the agent in charge starts from the Root Node and visits the nodes sequentially in a depth-first search (DFS) method, and the'Eval Expression' of the visiting node is evaluated and expressed as an Eval Expression. It performs judgment, operation, and operation, and in the case of an expression of a function name, calls and executes the function, visits all in the order of Preorder, Inorder, and Postorder, and evaluates the Eval Expression of the corresponding order at each visit. In the Super Rule, the'Internal Rule' can be included or other Super Rule can be grafted, so the Rule can be composed of a combination of modularized knowledge, and the arrival or schedule of a specific time Super Rule, including'Timer Rule', which is called every time the time interval elapses, can be called and executed regularly and repeatedly at any desired time or time interval. Variable expression is included in the Eval Expression of Nodes and Super Rule By configuring a template rule that can be executed and replaced with the variable values supplied when calling, the universality of the Super Rule can be improved, and a loop that repeatedly executes itself by including the'Return_to Root' operation in the Eval Expression can be configured. In case of using'Local Fact Assert'or'Go_to' operation, it can be executed by moving to the corresponding node location in the Super Rule. When visiting an order, the execution of the Super Rule is temporarily stopped at the location by using the'WAIT' Eval Expression, and you can wait until the Eval result of the child LHS Node of the corresponding node is returned, and the'Eval Expression' Super Rule execution can be forcibly terminated at the corresponding location by using'END', and the Super Rule execution is automatically terminated when the node visits and Eval is continued to the rightmost node and returns to the root. And

With the configuration of the'Super Rule', the content and flow of logical reasoning, judgment, procedure, and action can be explicitly expressed, and a logical explanation of the execution result is possible. It can be easily created, modified, or updated with the same SHRUB operation, and accordingly, it is a super for handling high abstraction level missions, instructions, requests, and other platform tasks composed of a number of detailed actions. Rules can be composed of a combination of subdivided functions with a'Divide and Conquer' strategy, and all nodes within Super Rule, Internal Rule, or Grafted Super Rule share a common context and have a consistent and focus. Execution of existing rules that lead to chaining according to the facts that are asserted and execute, and the relationship between each execution result and the ultimate purpose of the chained rules are unclear or distracted by allowing focused reasoning to proceed. The fundamental problem of the method can be improved, and a combination of frequently used conditions or actions can be expressed as a separate Super Rule, and jointly used through Rule Grafting to simplify the creation and execution of rules, and execution of the Super Rule. Significant knowledge or information acquired as a result is continuously added as a node to the Super Tree, so that the overall knowledge and information are continuously increased, learning and evolution effects are achieved, and the rule can be repeatedly executed. Therefore, even if the number of detailed tasks that must be accurately performed in seconds or less at the same time for progress management or progress management is reached, batch processing is possible by configuring and calling a few super rules. Super Tree-based Project/Task intelligent goal management method characterized by being capable.
According to claim 4

For tasks (also referred to as Work, Work Package, or Activity) in which the event whose performance progress (Real or Actual Progress) is delayed compared to the execution schedule progress (Execution Schedule Progress), the impact of the delayed event is as early as possible. The'Event Absorbing Tactic (EAT)' is used to minimize the formation of the'Event Chain', a series of events that occur through Absorb and Propagation. As a method, additional resources to be added to recover the delayed progress are incremented or decremented in an inputable unit or input standard unit within the inputable range, and corresponding increase or decrease in Deliverable and increase or decrease in cost. The'Gradual Resource Allocation and Cost Evaluation' (GRACE) technique is applied to explore the progress recovery period of the least cost by evaluating the change in the progress of the task being performed and the change in the duration of the task according to the increase or decrease of the target management unit time. ,

The GRACE method also increments or decrements the length of IVY, uses the top-down method and the bottom-up method in parallel, searches the duration of tasks with minimum cost, establishes a task execution plan, and progress progress Super Tree-based Project/Task intelligent goal management method, characterized in that it is used in the progress management of the platform to achieve the goal by continuously adjusting the plan to minimize the overall cost.
The method of claim 1

In order for the platform to receive and process instructions from PMs or requests from other administrators, a series of nodes in which each instruction and request is gradually specified and expressed as a node name, The path formed by the corresponding nodes and the properties of the nodes constituting the path are stored, and this is named as the'Order and Request Expression (ORE) STEM' of the corresponding instruction and request. , Super Tree-based Project/Task intelligent goal management method, characterized in that the ORE STEM is used to create and call a Super Rule to fulfill a corresponding instruction or request.
The method of claim 12,

Unlike conventional unilateral menu provision methods, where PM and other project related people need to know and find and use the paths and functions of Menu and Sub-menus one by one in order to search for desired information or use functions, PM directly wants the platform. 'Proactive And Smart Service' (PASS) method that gives instructions of the High Abstraction Level, assigns tasks or tasks, and supports other managers to directly request necessary matters from the platform I/O service of

With the provision of the PASS intelligent I/O service, the PM can request the platform to explain the reasoning action or judgment process performed by the platform, or the reason for reaching a conclusion, and the configuration contents of a specific Super Rule executed by the platform in SHRUB format. It can be presented as a target management system for each project/task built on the basis of this platform, without the need to learn how to use or receive separate training, and the number of tasks that need to be managed simultaneously and repeatedly Super Tree, characterized in that it supports the realization and application of the SWEEP target management technique of the present invention as it can delegate to the platform as autonomous and continuous precision management tasks with only a few commands or requests, even in the case of thousands or more. Based Project/Task intelligent goal management method.
The method of claim 1,

Super Tree-based according to the present invention The project/task intelligent goal management platform presents the basic information input window according to the target project/task field to establish and manage, and the field, name, final goal of the project/task, and'Deliverable''Project/Task Startup and Total Basic Information Collection Stage' (Project Manager (PM) receives overall basic information such as the scope of'State)' (collectively referred to as'Deliverable') and the total execution period. /Task Initiating and Basic Information Collection Stage),

Based on the entire basic information input in the'Project/Task Start and Total Basic Information Collection Stage', the knowledge and information necessary to implement an intelligent goal management platform that can perform goal management through intelligent judgment and reasoning are provided. The'Detailed Information Collection and Super Tree Constructing Stage' that collects, organizes and stores the Super Tree, and

Breakdown at the'Detailed Information Collection and Super Tree Configuration Step' and cooperate with PM, Scheduler and managers in charge of each task for all the tasks of the level of detail that need to be performed to achieve the goal, and exceptions for each task ( 'Baseline Duration' considering the possibility of occurrence of contingency), and based on the set Baseline Duration,'Execution Plan Progress by Unit Time' reflecting the quantitative amount of Deliverables to be completed or completed and resources available for input (Unit Time Execution Schedule Progress) is calculated, and the point at which the sum of the execution plan progress for each unit time becomes 100% is the'Execution Goal Duration' of the task, and the Baseline Duration and Execution Goal Duration The difference is set as the corresponding'Task Internal Buffer', and the Baseline Duration and Execution Goal Duration may be set to be the same according to the characteristics of the project/task.

For each task's Execution Goal Duration,'Milestones' indicating the specific progress or completion status of the task are set, and mutually Finish-to-Start, Finish between the milestones according to the preceding and subsequent relationships with the milestones of other tasks By setting the preceding and subsequent relations of -to-Finish, Start-to-Start and Start-to-Finish, Baseline Schedule and Execution Schedule are established for all detailed tasks, and corresponding Baseline Duration and Execution Goal Duration 'Task Scheduling Stage' that calculates

According to the'Execution Schedule' of each task established in the'Task Execution Plan Establishment Step', each time the task starts, Expected Resource Supply and the corresponding expected Deliverable Calculate the expected progress, and in the event of an'event' that is expected to be delayed, take measures in advance through resource supply or schedule adjustment, and continuously monitor the progress and progress of all tasks according to the progression time, and If an event occurs that interferes with the resource input and may affect the progress during execution, apply the'Event Absorbing Tactic (EAT)' to promptly respond, minimize its spread, and resolve the cause of the progress delay. By tracking and analyzing and accumulating as experience, utilizing it for goal management after the current unit time, performing additional instructions and assignments given by PM, and processing requests from other managers, all targets of target management A goal based on SWEEP (Successive Work and Event Evaluation and Proceeding) goal management technique that proceeds continuously, proactive and intelligently autonomously and precisely over the entire period/time of goal management for detailed-level tasks. 'Task Performing Stage' to manage and achieve

For all tasks of the level of detail that have managed progress in the'task execution step', final deliverables that satisfy the quality standard are completed or completed, and if there is a separate project/task owner, the deliverables are handed over to the corresponding owner. , It goes through the process of the'Project/Task Completion (Finishing) Stage', which achieves the goal of the entire Project/Task and terminates the Project/Task,

Super Tree-based Project/Task intelligent goal management method characterized by assisting and supporting PM of Project/Task and performing goal management tasks autonomously and actively.
It is the basis for building project/task management systems to support the'general manager of various projects or tasks' (collectively referred to as Project Manager (PM)) who want to set and achieve goals to perform their duties successfully. In the project/task target management platform composed of software programs running in

The target management system of a specific project or task built based on the Platform or Platform of the present invention is hardware-based for the execution of the Platform Task, which is a variety of tasks that the platform is assigned as a task. Depending on the scale, it is composed of PCs and Smart Phones for PM and other project-related persons, additionally Back-up Server, DB Server, Web Server and Cloud Server, various measurement and control equipment, and network equipment connecting them.

The above Main Server systematically distributes and processes Platform Task tasks,

The Project/Task General Management Department, which supports PM and is responsible for directing and supervising the Platform Task in all stages of Project/Task goal management,

It collects all the knowledge and information required for goal management by other management departments, is in charge of all printing tasks that the platform needs to export, and supports PM and other managers to directly input desired instructions or requests. An input/output management unit that provides input/output service in the'Proactive And Smart Service' (PASS) method,

According to the characteristics and fields of the project/task received as overall basic information, and the type and characteristics of the collected knowledge and information, each unit knowledge and information is represented as a node, and the relation between knowledge and information is expressed. As various'Knowledge and Information Models' specialized in the expression, storage and use of each knowledge and information represented by Arc, systematically/hierarchically homogeneous or homogeneous detailed unit information Breakdown or BREAKDOWN TREE (BDT) in the form of a tree data structure that is configured to manage information that can be classified or subdivided, and the entire duration or time of target management is managed to perform tasks of a certain length Each subdivided unit time is divided by the standard'Unit Time', and each subdivided unit time is expressed as a node, and the indicated nodes are represented by a continuous quadrangular node according to the preceding/successor relationship, or each node is an arc. 'IVY', which is connected by connecting with a series of chains, and constitutes a node, and each facility, component, or element or entity of the system handling various media flowing in a certain direction. In the'VINE', which is represented by representing their interconnected relationship as an Arc, and a system or network that is configured so that various mediums or objects can move in both directions, each system And each facility, element, or entity that composes the network is represented as a node, and an arbitrary central node that is the center of the configuration or connection of the system and network is selected, and the connection relationship of other nodes from the corresponding central node is represented by an arc. In addition to the'BUSH' constituting and the knowledge and information indicated by the BDT, IVY, VINE and BUSH, various operations and inferences (Reaso Super Rule for expressing and implementing knowledge such as ning and inference), judgment, management actions and procedures, detailed attribute information of each node, and all other knowledge and information required for goal management are tree As a stump to form a framework or foundation for connecting various'PLANTs' such as'SHRUB' and BDT, IVY, VINE, BUSH, and SHRUB. 'STUMP' (Smart Total Unified Management Platform), which is configured in the form of Tree Data Structure, and'Graft' the PLANTs to STUMP, and freely combines the PLANTs with each other according to the relationship between knowledge and information. Super Tree composition that manages the task of providing a skeleton in a typical form of'Super Tree' and supporting PM and other administrators to configure Super Tree through input and modification within the given authority. With the management department,

The above rules are cooperated with PM or Platform implementation engineer, and attribute information of all nodes of STUMP, BDT, IVY, VINE and BUSH, various arithmetic and logical operations, situation determination, cause tracking, countermeasure establishment, and action implementation And, by using knowledge and information for the process, the Platform Task and the reasoning and inference necessary to process the instruction or request of the higher level of abstraction, the judgment and calculation method, and the task execution procedure and process are explicitly stated. A knowledge base management unit that implements the Super Rule represented by, configures and stores the Rule BDT, and manages the management so that the saved Super Rule can be called and executed;

Establishment of execution plans of tasks that separately manage progress among tasks in Task BDT, completion plan of corresponding deliverables and resource input plan, cost calculation, progress calculation of deliverables and corresponding task progress calculation, resource input situation It manages the task of monitoring, calculating the actual cost, and coordinating the task execution plan. The top-down method and the bottom-up method are used in parallel to establish the task execution plan, and the length of IVY is incremented or decremented. , Project/ that uses the GRACE (Gradual Resource Allocation and Cost Evaluation) technique to minimize the overall cost and achieve the goal by exploring the duration of tasks with minimal cost, and continuously adjusting the plan according to progress progress Task progress management department,

Resource management department that monitors and manages the procurement or supply plan and input progress and performance of all resources to be invested to create deliverables that must be completed or completed in order to complete each task of Task BDT;

Various events that occur randomly during task execution,'Anticipation','Detect','Assessment and Countermeasure Establishment','Action' for each event ,'Eveny And Risk (EAR) Handling Process', which includes information for management through five processes of'Result Review' (Follow-up) and'Learning', and events that are considered important are managed according to the Prepare in advance through scenario analysis.In particular, in the event of a delayed task progress, additional resources to be added to recover the delayed progress are incremented or decremented within the scope of the input available and in the input standard unit. , By evaluating the change in the duration of the task according to the increase/decrease of the deliverable and the increase/decrease of the cost and the corresponding change in the progress of the task and the increase/decrease in the target management unit time, the minimum cost progress recovery period is explored An event management unit that applies an event absorbing tactic (EAT) strategy based on the GRACE technique that absorbs the impact early or performs a task of minimizing the spread,

Among the events, in particular, for various'risks', which are events that may delay the completion period of the entire project/task or the main task or make it difficult to achieve the goal, cooperate with the PM and other managers to identify the expected risks by type. Classified as a risk BDT, calculates the probability of occurrence and hazard rate, prepares preventive measures and countermeasures for each occurrence scenario to minimize the probability of occurrence, and minimizes damage by responding early when actual risks occur The risk management department in charge of the work done,

Stores all knowledge and information necessary to perform intelligent goal management tasks of Project/Task, including Super Tree configuration information, in a format such as DB, Spread Sheet, or XML File, and performs work to back-up and provide It is read-in every time the program is restarted, and by stably recovering or preparing the reasoning environment including the Super Tree, it maintains the continuity of goal management, exchanges information with other servers through DB, and shares information between agents. It is equipped with a database (DB) management department, which manages the work to enable

The tasks of each of the above management units are created in the form of threads or processes when the platform is running, and the'Manager Agent' that manages the target management tasks of the Project/Task, and the Project Manager Agent are created according to the characteristics and scale of the Project/Task. Super Tree Manager Agent, Knowledge-base Manager Agent, Progress Manager Agent, Resource Manager Agent, Event Manager Agent, Risk Manager Agent, I/O Manager Agent and DB Manager Agent, which are specialized agents in charge of each management department, are rule BDT. It is characterized in that the agent in charge executes and executes the super rule when each agent-only super rule stored in is executed or when the fact included in the conditional part of each dedicated super rule is asserted by another agent or during the execution of the super rule. Super Tree based Project/Task intelligent goal management platform.

Images