WO2021150039A1 - Procédé et plate-forme pour gérer un objectif intelligent de projet/tâche sur la base d'un super arbre - Google Patents

Procédé et plate-forme pour gérer un objectif intelligent de projet/tâche sur la base d'un super arbre Download PDF

Info

Publication number
WO2021150039A1
WO2021150039A1 PCT/KR2021/000846 KR2021000846W WO2021150039A1 WO 2021150039 A1 WO2021150039 A1 WO 2021150039A1 KR 2021000846 W KR2021000846 W KR 2021000846W WO 2021150039 A1 WO2021150039 A1 WO 2021150039A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
task
management
information
project
Prior art date
Application number
PCT/KR2021/000846
Other languages
English (en)
Korean (ko)
Inventor
이승철
Original Assignee
이승철
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 이승철 filed Critical 이승철
Publication of WO2021150039A1 publication Critical patent/WO2021150039A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06398—Performance of employee with respect to a job function
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G06Q10/063112—Skill-based matching of a person or a group to a task
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G06Q10/063116—Schedule adjustment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
    • G06Q10/1091—Recording time for administrative or management purposes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
    • G06Q10/1093—Calendar-based scheduling for persons or groups
    • G06Q10/1097—Task assignment

Definitions

  • 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, 'BOGMKI' (Body of Goal Management Knowledge and Information), a 'total aggregate of knowledge and information' by systematically collecting various data, processing data, and relationship information between data (collectively, 'information') Based on the knowledge and information stored in BOGMKI, by executing the rules that explicitly indicate the method or content of judgment or inference that are also included in BOGMKI, Execute, Basic goal management tasks, instructions from the PM, requests from other managers, and all managed tasks (also called Work or Activity) that must be managed and performed to achieve the given goal 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, which manages and proceeds as if scanning precisely throughout the entire execution process and period , it relates to the technology of building an intelligent platform that greatly enhances the
  • the Project Management Institute (PMI) is the main axis, and the knowledge, practices, and processes necessary for project management are gathered into the PMBOK (Project Management Body of Knowledge).
  • PMBOK Project Management Body of Knowledge
  • the types of various and vast amounts of knowledge and information required for each phase are classified into the 'Knowledge Management Area' and further subdivided into the detailed 'Process', and the collection and utilization It specifies the guideline of the method and recommends carrying out the project by applying it mutatis mutandis.
  • the basic management tasks of the Project/Task to be set and achieved are assigned as a task and performed by themselves, the general manager (PM) and other managers or performers are actively supported, and the set goals are We intend to devise a basic technology for implementing the Project/Task intelligent goal management platform that minimizes the overall cost and supports it to be achieved.
  • the PM or other managers receive and process the instructions and requests or suggestions from other managers, and the platform actively requests (requests) the decisions or actions to be made by the PM or other managers.
  • the project/task intelligence goal of the present invention to actively support the project manager (PM) and other managers who set and achieve goals, minimize the overall cost, and achieve the set goals
  • PM project manager
  • Platinum management platform
  • the type of information such as 'BREAKDOWN TREE (BDT)', 'IVY', 'VINE', 'BUSH' and 'SHRUB', as a specific means for enabling the collection, storage and utilization of the information.
  • BDT BREAKDOWN TREE
  • 'IVY' 'IVY'
  • 'VINE' 'VINE'
  • 'BUSH' 'SHRUB'
  • 'SHRUB' a specific means for enabling the collection, storage and utilization of the information.
  • 'Knowledge and Information Models' which are various 'PLANTs' specialized in the storage and utilization of the information, were devised and defined, and the basic framework of the overall goal management information composition.
  • 'STUMP' Smart Total Unified Management Platform
  • 'graft' the PLANTs to STUMP
  • PLANT PLANT according to the relationship between information
  • the 'Body of Goal Management Knowledge and Information (BOGMKI)' is constructed according to the characteristics of the Project/Task to establish and manage goals by freely combining them with each other, and then create a 'Super Tree' ' to define, obtain, and use.
  • 'Super Tree' accepts and stores all information necessary for inference and judgment for goal management of Project/Task to set and achieve goals,
  • bidirectional paths are provided through nodes of PLANTs connected by grafts, so that all information stored in the Super Tree is related to the surroundings at any location in the Super Tree.
  • information Context
  • All knowledge and information stored in the Super Tree to achieve the goal of a specific project or task that sets goals is defined as 'Big Information'.
  • 'SWEEP' is also devised in the present invention and precisely and continuously monitors and manages the progress of all detailed tasks and event occurrences at every moment throughout all stages of project/task goal management.
  • '(Successive 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 the assigned tasks.
  • a goal management task to be performed regularly or repeatedly can be assigned as a basic task of the platform, cooperate with the Project Manager (PM), and By executing instructions, receiving and processing requests from other managers of the Project/Task, and actively responding to various exceptions or events that occur in the goal management process, the Project/Task It becomes possible to implement an intelligent autonomous goal management platform that can greatly improve the achievability of goals.
  • PM Project Manager
  • the platform autonomously or actively performs goal management based on the SWEEP goal management technique, which manages all the objects to be managed as if they are continuously and precisely scanned over the entire goal management process and period/time. It can greatly improve speed, continuity, consistency and objectivity. In addition, it is possible to detect and respond to various events or risks that may impede the achievement of the goal early, issue an Alert or call attention to relevant parties, and delay progress. In this case, it is possible to build an intelligent goal management system for Project/Task that can absorb or minimize the impact as much as possible.
  • AI artificial intelligence
  • the basic principle of this platform can contribute to the enhancement of competitiveness in the field of artificial intelligence (AI), which is emerging as a core technology of the 4th industrial revolution, and ultimately, various areas of human activity to set and achieve goals. It can be widely applied and applied as a common base technology for the construction of various intelligent goal management systems that support the achievement of goals at the lowest overall cost.
  • AI artificial intelligence
  • FIG. 3 is an exemplary configuration diagram of ORE (Order and Request Expression) Generation BDT
  • VINE is an exemplary diagram of the configuration of VINE
  • NAS Node Attribute SHRUB
  • the target management system of a specific project or task constructed based on the Platform or Platform of the present invention is hardware, the Main Server, and the characteristics of the Project/Task and Depending on the size, it can be composed of PCs and Smart Phones for PMs and other project related persons, in addition to Backup Server, DB Server, Web Server and Cloud Server, various measurement and control facilities, and network facilities connecting them. ,
  • the Project/Task General Management Department which supports the PM and is responsible for directing and supervising the Platform Task throughout all stages of Project/Task goal management,
  • Input/Output management unit that provides input/output service of 'Proactive And Smart Service' (PASS) method
  • each unit of knowledge and information is represented as a node, and the relationship between knowledge and information is expressed as a node.
  • Various 'Knowledge and Information Models' that are specialized in the expression, storage and utilization of each knowledge and information, represented by an Arc, are systematically/hierarchically homogeneous or homogeneous detailed unit information.
  • Breakdown or BREAKDOWN TREE in the form of Tree Data Structure, which is configured to manage information that can be classified or subdivided, and manages the entire execution period (Duration) or time of target management to perform tasks of a certain length
  • the standard 'unit time' is divided into subdivisions, each subdivided unit time is represented by a node, and the indicated nodes are shown in the form of a continuous quadrilateral according to the precedence/successor relationship, or each node is in the form of an Arc 'IVY', which is connected to form a series of chains and constitutes, and each facility, component, or element or entity of a system that handles various media flowing in a certain direction, is a Node.
  • 'VINE' which is represented by , and their interconnections are represented by Arc, and in a system or network configured so that various media or objects can move in both directions, each System and each facility, element, or entity constituting the Network is represented by a Node, an arbitrary central node that is the center of configuration or connection of the corresponding System and Network is selected, and the connection relationship of other nodes from the corresponding central node is represented by an arc.
  • 'STUMP' Smart Total Unified Management Platform
  • 'grafting' the PLANTs to the STUMP and freely grafting between the PLANTs according to the relationship between knowledge and information
  • a Super Tree configuration that manages tasks that support the construction of a Super Tree through input and modification within the given authority by PMs and other administrators by presenting a skeleton in the typical form of 'Super Tree' management and
  • a knowledge base management unit that implements the Super Rule represented by , configures and stores Rule BDT, and manages the stored Super Rule so that it can be called and executed;
  • a resource management unit that monitors and manages the procurement or supply plan of all resources to be put in to create deliverables that need to be completed or completed to complete each task of Task BDT, and the progress and performance of input;
  • 'Prediction' Anticipation
  • 'Discovery' Detect
  • 'Assessment and Countermeasure Establishment' 'Action' for various events that occur randomly during task execution
  • 'Result Review' Frollow-up
  • 'Learning' are managed according to the 'Eveny And Risk (EAR) Handling Process', which includes information for management in five processes. Prepare in advance through scenario analysis. In particular, when an event that delays task progress occurs, additional resources to be added to recover the delayed progress are incremented or decremented by inputable units or input standard units within the inputable range.
  • risk BDT is calculated, the probability of occurrence and the hazard rate are calculated, and preventive measures to minimize the probability of occurrence and countermeasures for each occurrence scenario are prepared.
  • the tasks of each management unit are created by the 'Manager Agent', which is created in the form of a Thread or Process when the platform is running, and is in charge of the project/task goal management tasks, and the Project Manager Agent is 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, Rule BDT Method or form in which the agent in charge executes the Super Rule and executes the Super Rule stored in the Agent, or when the fact included in the conditional part of each exclusive Super Rule is asserted by another Agent or during the execution of the Super Rule can be carried out with
  • BOGMKI Abbreviation for Body of Goal Management Knowledge and Information. It is a 'total aggregate of goal management knowledge and information' that is collected and composed to achieve the goal of a specific project or task that sets goals.
  • Information For a specific project or task that sets goals, raw data and processed data collected to achieve the set goals based on knowledge. Attribute information of data, and relational information existing between data as a generic term (the Knowledge and Information are collectively expressed as Information)
  • Deliverable A generic term for the outcome or result status of a project or task that sets goals
  • Task A generic term for Work, Work Package, and Activity to be performed for the creation, completion or completion of Deliverable
  • Platform Task Tasks performed by the Platform itself to handle the instructions given and given by the PM to the Platform for goal management, requests from other managers, and basic functions or tasks of the Platform
  • Graft An operation that connects the Root Node, Start Node, or arbitrary Node of the same or heterogeneous PLANT to the Node of one PLANT, and specifies the interrelationship.
  • STUMP Smart Total Unified Management Platform, which is configured to provide a foundation for the Super Tree configuration, and its root becomes the Super Tree's ROOT, and is a knowledge in the form of Tree Data Structure that is defined along with manipulation. and Information Model (or 'Information Model' for short)
  • BDT An abbreviation of Breakdown Tree. It is composed to manage information that can be broken down into detailed unit information of the same type or homogeneity when systematically/hierarchically classified or subdivided among target information to be used for goal management.
  • Knowledge and Information Model in the form of Tree Data Structure that is defined along with manipulation
  • VINE (vine): Various production, manufacturing or manufacturing processes that handle raw materials, semi-finished products, and products flowing in a certain direction, and a support system that supplies various media or energy such as cooling water, compressed air, steam and power
  • each facility, component, or element or entity constituting the process or system is represented by a node, and the process or entity is represented by a node.
  • a Knowledge and Information Model that defines the interconnection relationship between these facilities, devices, elements, or entities by representing them as arcs, along with the flow of these processes or media or objects handled by the system, and defines along with the operation.
  • BUSH Various types of systems configured so that data, medium, or objects can move in both directions by connecting equipment, elements, or entities to perform a specific purpose function.
  • System System
  • System Network
  • each facility, element or entity is represented as a Node, and their connection relationship is represented by arcs to form and define the Knowledge and Information Model along with the operation.
  • SHRUB In addition to knowledge and information represented by STUMP, IVY, VINE, and BUSH, various calculations, reasoning and inference or judgment, management actions and procedures indicating and implementing rules, and detailed attributes of specific information (Attribute) Knowledge and Information Model that organizes and stores information and tables, lists, stacks, and queues for various records in the form of a tree data structure, and defines along with manipulation
  • PLANT collectively refers to STUMP, BDT, IVY, VINE, BUSH, and SHRUB
  • NAS An abbreviation of Node Attribute SHRUB, which systematically/hierarchically classifies, subdivides, and stores 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
  • the node in each individual PLANT has a path from the Root Node to itself and the node name indicated as a path composed of its own 'Node Given Name' As a 'Node Full Name', it can be used for reasoning and inference by accessing all nodes on the path including the node itself and attribute information of nodes, and the uniqueness of the name is maintained. Abbreviated notation is possible within the range
  • Node Number A number assigned to each Node by reflecting the structural characteristics of the corresponding PLANT for each individual PLANT.
  • STPN Super Tree Path Name
  • 'ROOT' Root Node
  • STPN Super Tree Path Name
  • Each node in the Super Tree has a path from the Root Node (expressed as 'ROOT') to itself and the node's own Node Name.
  • a node name expressed as a path it can be used for inference by accessing attribute information of all nodes and nodes along the path, including the node itself, and can be abbreviated as long as the uniqueness of the name is maintained.
  • RSTPN Super Tree Relative Path Name
  • Relative Super Tree Path Name as an abbreviation of Relative Super Tree Path Name, the name of each node expressed as a relative path from each other to itself between any two nodes in the Super Tree, or from any other node A node name indicated as a relative path from the start to itself, or a node name of neighboring nodes expressed as a path from a specific node as a central node (COIN) to each neighboring node, within the range where the uniqueness of the name is maintained.
  • COIN central node
  • Alias Node For a specific Node, it belongs to another PLANT but represents the same facility or component, entity or object, and variable or value as the node. Node
  • COIN Central Interest Node
  • Center Of Interest Node Abbreviation for Center Of Interest Node, the Node that is currently the center of interest or inference
  • Eval An abbreviation for 'Evaluation'. When a specific node name is evaluated, the Eval Expression included in the node itself or in its properties is evaluated and the result is returned.
  • Unit Time A unit of the basic elapsed time or period selected for the convenience of goal management. Default is 'Day', and it can be freely changed to other time units according to the desired time management precision.
  • BEAR Mark The Progress Management IVY of each task has at the end, and it is a mark that is displayed at the location of the Finish Node indicating the various execution durations of the task.
  • the task execution base period (Baseline Duration(B)) , Execution Goal duration(E), Anticipated Completion Duration(A), and Real completion Duration(R), respectively.
  • SMART An abbreviation of Schedule and Milestone Adjustment Record Table. To store and manage the adjustment history of Schedule and Milestones of each task, it is composed of SHRUB and is grafted 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 the completion status, and a state that becomes an important meaning or turning point that can be given a corresponding progress value (%)
  • the Rule is composed of a combination of modularized knowledge, while sharing common context information (Context), consistent and focused By enabling this focused reasoning and inference, judgment, execution of procedures or methods, and calculations to be performed, high abstraction level tasks, instructions, requests, and platform task processing and Rules that make implementation possible
  • ORE STEM A specific instruction or task given by the PM, or a request from other managers and the basic task (assignment) of the platform, using the ORE Generation BDT, the path and the nodes on the path that are sequentially selected from the ORE Generation BDT It is an abbreviation of Order and Request Expression STEM (stem of command and request expression) expressed with attribute values. It is also briefly expressed as 'STEM', and as a specific path of ORE BDT, Eval of Graft and Node is possible, Provided as execution environment information to the Rule called to perform instructions, tasks, requests and tasks
  • ORE Table An abbreviation of Order And Request Table.
  • the ORE STEM which indicates the instructions given by the PM to the platform, the tasks given to the platform, requests from other managers, and the basic tasks given to the platform, and the corresponding instructions, tasks, requests and tasks.
  • Event Any situation that occurs randomly during the task execution process. It is divided into Positive Event, Negative Event, and Neutral Event according to the effect on task progress, and it is divided into Local Event and Global Event according to the scope of the affected tasks. , Serious events are classified as Risk, and depending on the field and characteristics of the Project/Task, the arrival or elapse of a specific time, the entry into each stage of the Project/Task, instructions or assignments from the PM, and requests from other managers The occurrence of a situation is also treated as an event, and when the Event Detection Rule detects a specific event, it calls and executes the rules that can cope with the event according to the Event And Risk (EAR) Handling Process.
  • EAR Event And Risk
  • Event and Risk BDT An abbreviation of Event and Risk Table.
  • STPN Event and Risk Table
  • EAT An abbreviation of Event Absorbing Tactic. It is an event absorption strategy to prevent the impact of various negative events occurring during the goal management process at an early stage or to minimize the ripple effect.
  • EMART An abbreviation of Event Monitoring And Recording Table. A table composed of SURUB to monitor and manage events that occur during task execution.
  • GRACE An abbreviation of Gradual Resource Allocation and Cost Evaluation.
  • the resource to be input is incremented or decremented by input unit within the input range, and the optimal task execution period ( Duration) or in the process of applying the Event Absorption Strategy (EAT), a technique to search for a period/time that can recover progress or situation with minimum cost or effort
  • Semantic Primitive Basic terms and expressions defined as unit keywords for expressing and processing all operations, rules, and platform tasks performed in the Super Tree (Basic Terms and Expressions)
  • NOA Abbreviation of Nature Of Activity, specific activity, task, or specific action content indicated by the name of the node and the node in the Super Tree.
  • ANT Abbreviation of absolutely Needed Time. Feasible The shortest necessary time or period that cannot be shortened further by mobilizing all possible efforts, means, or resources.
  • PASS Active Autonomous Service: An abbreviation of Proactive And Smart Service. Instead of unilaterally providing Menus, Submenu, or Tools and allowing PMs or other administrators or users to find and use necessary functions, High Abstraction Level ), an intelligent active autonomous service providing method that can directly issue or request instructions or commands to the platform
  • Super Forest Knowledge and Information Model in the form of a tree data structure with multiple super trees as subtrees
  • SWEEP An abbreviation of Successive Work and Event Evaluation and Proceeding. It is a goal management technique that processes all tasks and events to be performed or processed in order to achieve the set goal precisely, continuously, continuously and autonomously ( Complete definitions and explanations of abnormal terms and abbreviations)
  • the project/task intelligent goal management platform of the present invention sequentially classifies and subdivides the objects to be managed in order to achieve the goal for the project or task that sets the goal ('Vertical Breakdown Task Plane') '), the entire project/task execution period (referred to as 'Horizontal Progressing Time Axis') divided into a series of management unit times according to the established management schedule (referred to as 'Horizontal Progressing Time Axis'). And it uses a three-dimensional (3-Dimension) goal management technique that manages and proceeds as if skimming precisely, and it is defined as 'SWEEP' (Successive Work and Event Evaluation and Proceeding) intelligent goal management technique.
  • 'SWEEP' Successessive Work and Event Evaluation and Proceeding
  • the project/task intelligent goal management platform of the present invention represents and supports the PM as a Virtual Project Manager (VPM) based on the SWEEP goal management technique throughout the entire process of project/task goal management,
  • VPM Virtual Project Manager
  • the method and expertise that can manage the set goal precisely and intelligently (collectively, ‘knowledge’) ') and, based on the collected knowledge, usually large-scale, raw data, processed data, and relational information (relational information that exists between data) needed to establish, manage, and achieve goals.
  • knowledge usually large-scale, raw data, processed data, and relational information (relational information that exists between data) needed to establish, manage, and achieve goals.
  • 'information' is collected and used.
  • Project/Task This is a flowchart showing the goal management task execution procedure of the intelligent goal management platform.
  • the project/task intelligent goal management platform supports the general manager of the project/task or the project manager (PM) (collectively, 'PM') through the following five-step process, and performs goal management tasks autonomously and actively. .
  • PM project manager
  • 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, simply 'Project/Task') to be established and managed is presented, and the project/task field, name, final goal,
  • the overall basic information such as the scope and total execution period of 'Deliverable' or 'State' (hereinafter collectively referred to as 'Deliverable') is input from the Project Manager (PM).
  • Step 2 Detailed Information Collection and Super Tree Constructing Stage (S101, S102)
  • the project which has been configured by field in advance using the platform implementation method of the present invention and specialized knowledge for each field of the project/task, / Task field Super Tree Basic (Basic) or Reference (Reference) construction skeleton (Skeleton) is selected and presented.
  • Basic Basic
  • Reference Reference
  • Quantitative information or quantification of information for classifying or subdividing hierarchically/sequentially (S102), and a result or result state to be completed for each task (hereinafter collectively referred to as 'Deliverable') as the execution scope of each task. It basically includes specialized knowledge and information such as resources, cost, and budget that need to be put in to complete the deliverables.
  • the total number of tasks may be one
  • the activity may be not only a physical activity but also an intellectual activity
  • the Deliverable is a specific state as well as a quantity that can be expressed in a unit of measurement.
  • the resource to be input specifies quantity and quality together
  • the expert knowledge and method are the task execution method, execution strategy, and situation necessary to successfully achieve the goal. Including state judgment knowledge, inference and reasoning ability, know-how, heuristics, and brief task execution period knowledge.
  • the converted unit time execution plan allocates resources so that it goes ahead of the standard plan, and the point when the sum of each unit time execution plan becomes 100% is the 'Goal Duration' of the task.
  • Step 4 Task Performing Stage (S104)
  • each time the task starts at each unit time the expected supply resource and the resulting expected deliverable and Estimate the corresponding expected progress. If a delay in progress is expected, take measures in advance, and continuously monitor the progress and progress of all tasks according to the progress time. When an 'event' that interferes with resource input and may affect the progress of the task occurs, respond immediately.
  • an 'event absorption strategy' Event Absorbing Tactic (EAT)
  • GRACE Visual Resource Allocation and Cost Evaluation
  • 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 above five-step process, and performs the goal management task autonomously and actively.
  • PM Project Manager
  • the above five-step goal management process was mainly explained by the Plant Engineering/Procurement/Construction (EPC) Project or the production management task in the Smart Factory, but in addition to the corporate management, organizational management, energy management, and smart computer From the implementation of the Operating System, to the management of goals and strategies or operations of various games or sports, stock investment, election management, and personal goal management, a wide range of human beings who want to set and achieve goals It can be applied and applied in the field of activity.
  • EPC Plant Engineering/Procurement/Construction
  • the PM may be other CEO, general manager, supervisor, or individual, and may establish an execution strategy instead of a task execution plan, and the task execution period (Duration) can be given as the time until a specific time or state is reached, and the task's progress management can be parallel or replaced with state management.
  • VPM Virtual Project Manager
  • PM Chief Manager
  • Root Node representing the overall and unique Starting Point or Entry Point of the Project/Task goal management is created (201).
  • the 'optimal/minimum' cost is also appropriate for factors such as environment, quality, benefit, safety and security according to the characteristics and goals of each Project/Task. It means the overall minimum cost that is reflected in the total cost by allocating the determined weight value.
  • a Knowledge and Information Model in the form of a tree data structure using the main management nodes as child nodes of the Root Node is created, and this is defined as 'STUMP' (Smart Total Unified Management Platform). do (203).
  • the STUMP is built to form a framework that explicitly enumerates all major fields or divisions to be performed for project/task goal management and establishes the overall information storage and management system. do.
  • the Major Management Nodes can each have Minor Management Nodes subdivided into detailed management actions as child nodes, and STUMP is based on not exceeding 3 levels for clarity of overall information and management system.
  • Tree Data Structure composed to manage information that can be broken down into detailed unit information of the same type or homogeneity when classified or subdivided systematically/hierarchically among target information to be used for goal management 'BREAKDOWN_TREE' with 'BDT' (hereinafter referred to as 'BDT').
  • the entire execution period (duration) or time of the target management is divided and subdivided by the management standard 'Unit Time' of the time precision desired to be managed, and each subdivided unit time is indicated by a Node, and the start unit time From the 'Start Node' indicating the end unit time to the 'Finish Node' (or 'Last Node') corresponding to the end unit time, it is configured by sequentially connecting and forming an arc, and defining it along with the Operation Over time/period, schedule management of each task to be performed, progress management, progress management, interdependency or precedent/successor relationship management, operation status management of various facilities to be operated, and various events
  • Event Event
  • Risk Risk
  • each facility, element or object is represented by a Node, and according to the shape of the system or network, the 'BUSH' has a structure representing the interconnection relationship between these facilities, elements or objects by Arc.
  • the platform is basically required to carry out the given goal management task, fulfill the instructions from the PM, or process requests from other managers.
  • 'SHRUB' with a Tree Data Structure structure to store all information and knowledge required for this purpose and use it for reasoning.
  • 'STUMP', 'BDT', 'IVY', 'VINE', 'BUSH', and 'SHRUB' are collectively defined as 'PLANT' (204).
  • Root Node, Start Node, or arbitrary nodes can be continuously and repeatedly grafted (208, 209), and through the graft, each node can access, search, and In addition to the traversal path, a path that can be accessed, searched for, and moved to other nodes belonging to the PLANT through Graft is additionally created.
  • the 'Body Of Goal Management Knowledge and Information' (Body Of Goal Management Knowledge and Information: 'BOGMKI') composed of all the PLANTs grafted to the STUMP and STUMP is defined as a 'Super Tree'.
  • a unique node name ('Node Name' or 'Node Given Name') and a node number are given to all nodes in each PLANT.
  • Node numbering is assigned by constructing a numbering system that can determine the total number of nodes in the relevant PLANT and the relative position of specific nodes in the PLANT according to the type of PLANT.
  • each node additionally has a 'Node Full Name' consisting of a path from the root node of the plant to which it belongs to itself and its 'Node Given Name', which is the 'PLANT Path Name' of the node. ' (PPN).
  • the 'Graft' is made by storing the PPN (PLANT Path Name) of the other node as a graft attribute value in the nodes of both parties to the graft, and mutually 'Grafting Parent' and 'Grafting Child' according to the direction of the graft. relationship is established, and 'Graft Path', a relative path that can access node information of other grafted PLANTs, is formed from both nodes, centering on each node.
  • the 'Root Node' or 'Start Node' of all PLANTs except STUMP can be grafted to the Root Node or any node of another PLANT, and if necessary, any node of any PLANT is also grafted to any node of another PLANT. can do.
  • the type of graft is determined according to the relationship between the information formed by the graft.
  • Typical types of Graft include, but are not limited to, the relationship of providing detailed or attribute information to main information; physical antecedent/successor linkages; temporal antecedent/successor relationship; antecedent/successor relationship or dependency relationship of a logical condition; Relationship between physical main information and sub information; information relation that is identical to (Identical) to equivalent (Equivalent); The relationship between the task and the method of performing the task, knowledge, and expertise/techniques or know-how; and may be added or omitted depending on the field and characteristics of the Project/Task.
  • the graft has a direction 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 information utilization for goal management.
  • all grafts in the Super Tree can be made statically or dynamically in the process of goal management or reasoning, and these are called 'Static Graft' and 'Dynamic Graft', respectively.
  • 'Dynamic Graft' the graft may be canceled (hereinafter referred to as 'Degraft') after the purpose or use of the graft is terminated.
  • All nodes in the Super Tree have a path from the Root Node (expressed as 'ROOT') of the Super Tree to itself and a path name including the node itself, which is called 'Super Tree Path Name' (STPN). Therefore, the STPN of all nodes except the STUMP Node includes one or more ‘Graft Paths’.
  • STPN Super Tree Path Name
  • the node will have the original STPN that includes the root node of the PLANT it belongs to in the path, as well as the STPN passing through the grafted node.
  • the STPN that goes through the Root Node of the PLANT to which the node itself belongs is especially called 'Original STPN'.
  • each node may have one or more STPNs, and a desired STPN may be selected and utilized according to the surrounding information (Context) required in the reasoning process using the corresponding node.
  • Context surrounding information
  • the name of the arbitrary node is indicated by including the PPN of the node in parentheses.
  • RSTPN Super Tree Path Name
  • 'Relative Super Tree Path Name In the Path constituting the 'RSTPN', the Path part in the direction coming down from the ROOT of the Super Tree is called the 'Forward Path', and the Path part going up the ROOT is the 'Reverse Path' (Reverse Path).
  • Each Super Tree Relative Path Name can change direction at a specific node or backtrack to a past path during the process, so it can include both Forward Path and Reverse Path.
  • the original STPN of the node is defined as a 'center of interest node' or 'COIN' (Center of Interest Node). Therefore, information around a specific node can be easily accessed through RSTPN centered on the COIN by designating the node as a COIN.
  • the following is a method of notation of the STPN, PPN and RSTPN, which is a node path for storing, accessing, retrieving, extracting, or searching information in each node of the Super Tree.
  • Slash ('/') is used instead of Arc for the convenience of notation of forward paths between nodes.
  • the Graft Path it should be marked with a double slash ('//').
  • Back Slash (' ⁇ ') to indicate a reverse path
  • Double Back Slash (' ⁇ ') for a reverse graft path.
  • other symbols may be used for the Path notation as long as there is no confusion depending on the programming language implementing the platform.
  • Paths for accessing each Super Tree Node in the case of accessing the node or making inferences (reasoning or inference) for goal management. Nodes that can be omitted are omitted and can be expressed as a simplified path expression. Also, when determining whether to match by comparing two paths, if the path includes '*', which is a wildcard notation, it can match any path including one or more nodes at the corresponding location, and if '&' is included, it is random.
  • variable node expression such as '?node_variable' is used at a specific node location in the path, the actual node name of the variable node location can be extracted as the variable node value from the matched relative path.
  • the expression of the corresponding graft path is 'PPN//(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)'.
  • the 'action' for the Super Tree and each PLANT or PLANT Nodes is called an 'Operation' that can be performed on the corresponding PLANT.
  • 'Operation' in the Super Tree is divided into 'Common Operation', which can be applied to all plants in the Super Tree as a whole, and 'Exclusive Operation', which can be applied separately for each plant, and has the same name. Even with the manipulation of , the application method may vary depending on the applied PLANT.
  • the names of all operations defined in Super Tree can be expressed by changing the order and case of the 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 operation are defined by the platform implementation engineer, manager, or PM according to the characteristics of the project/task.
  • Each operation is implemented using 'Rule' to express its details, exclude the creation of black-box, and freely and flexibly adjust or update.
  • the 'Create_Super_Tree' presents a typical basic Super Tree structure or skeleton of the Project/Task field configured in advance when basic information is input in order to configure a new Project/Task goal management system, and freely displays 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 plant type to be created under the selected Super Tree Skeleton, and freely creates, adds, and deletes the nodes of the plant on the graphic, creates the plant, and adds it to other plants. This is an operation for grafting.
  • the 'Create_Node' presents the typical and basic Node of the designated PLANT and the skeleton of the attribute SHRUB (Node Attribute SHRUB (NAS)), 'instantiates' it into a specific node, and inserts or connects to the corresponding PLANT (Insert) It is an operation to enable connect).
  • the 'Insert_Node' is an operation to connect the created node to the corresponding PLANT
  • the 'Delete_Node' is an operation to delete the selected node from the PLANT.
  • 'Insert_Node' or 'Delete_Node' operation includes connection or disconnection processing operation of neighboring nodes of the corresponding node depending on the type of PLANT.
  • the 'Graft' operation is an operation that connects the same or heterogeneous PLANT to the selected PLANT
  • the 'Degraft' is an operation that separates the grafted PLANT.
  • the 'Prune' operation is an operation to delete all descendants and subsequent nodes including the selected node
  • the 'Node_search' is an operation to search for a node with a desired condition in the entire Super Tree or in a specific PLANT.
  • Basic Semantic Primitives include 'Graft' and 'Degraft' for manipulation of interconnecting or separating PLANTs to form and terminate relationships between information, 'Visit' for visiting specific nodes, and specific nodes I 'Evaluate' (or 'Eval' for short) to return the specific property value of the node, and when a specific variable value is set, the 'fact' is announced to satisfy some or all of the prerequisites as the corresponding fact.
  • 'Assert' that allows you to 'Invoke' and 'Execute' (also expressed as 'Fire' or 'Trigger') a 'Rule' that is Satisfied.
  • Each attribute node of NAS basically includes the node's own PPN, the node's child or subsequent nodes, the number of 'Adjacent Nodes' and Node Name List, the number of Grafts, the type of Graft, and the Grafting Parent Nodes. It stores attribute information such as PPN List and PPN List of Grafting Child Nodes. Therefore, the properties of all nodes can be accessed through the 'STPN' including the NAS Graft Path of the node in the Super Tree or the 'RSTPN' starting from the node. You can continue to graft other PLANTs to each node of the NAS.
  • the 'Node_Visit' is an operation of visiting or selecting corresponding nodes in order to perform a desired operation on a specific node. If each node in the Super Tree is a variable expression that can have a value, the node itself can be used as a variable.
  • the 'Node_Eval' is an operation to return a variable value of a corresponding node when a specific node is evaluated. If the node itself is not a variable node, the value to be returned when 'Node_Eval' can be stored by including 'Value', Node, or 'Eval Expression' Node in the attribute node.
  • the 'Value' node has a value to be returned directly upon Node_Eval
  • the 'Eval Expression' node has an 'Eval Expression' in the form of a List that allows a value to be returned through logical or arithmetic operation upon Eval as a value.
  • the first element of 'Eval Expression' is usually an arithmetic operator or 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 for expanding the visited node and is again 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 as much as a level (Level) that specifies a child node or a subsequent node of the corresponding node within the PLANT belonging to the selected node according to the structure of the corresponding PLANT. Therefore, if you want to display only the child or subsequent nodes of the selected node, use 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 for indicating all descendant nodes or successors below or after the corresponding node in the PLANT belonging to the selected node according to the structure of the corresponding PLANT.
  • a node represented by collecting or condense a facility or element of a complex structure into one node is defined as a 'Compound Node', and the 'Compound_Node_Expand' refers to the compound node of the node. It is an operation that expands or expands a PLANT representing a detailed configuration. At this time, if the expanded PLANT has a homogeneous structure with the PLANT to which the original composite node belongs, the entire expanded PLANT can be inserted into the original PLANT to replace the composite node. The expanded PLANT is shown by grafting.
  • the 'Node_Graft_Expand' is an operation that shows the entire PLANT to which the node belongs on the display that shows only the grafted node to briefly represent the graft.
  • the 'Node Shrink' is an operation of collecting necessary information from all descendant nodes or subsequent nodes of the selected node, storing it as an attribute of the selected node, and pruning all descendant nodes or subsequent nodes.
  • the aggregation of the information means selecting specific attributes, statistically processing, or logically combining and determining.
  • the 'Path_generate' includes a variable expression node such as '?node' or a wildcard expression such as '*' or '&' in the Path of the STPN to generate a general-purpose STPN that can be matched with the STPN of a plurality of nodes
  • 'Path_Instantiate' is an operation for substituting all variable expression nodes in the general-purpose STPN with actual node names to instantiate the corresponding STPN to enable Node_Eval as a specific Node Name.
  • the Super Tree operations may be added or omitted according to the characteristics of the Project/Task.
  • the expression of the name of each operation may be indicated by changing the position of the verb and noun expression or capitalizing for the content and emphasis of the operation or according to a specific use.
  • Each node value is manually input through a keyboard or smart phone, is automatically input through a sensor, a measurement system, or other server or the Internet, or calculated by arithmetic or logical operation of other input node value(s), or Calculation by calling or introducing existing algorithms, statistics or arithmetic S/W packages or tools such as , Linear Programming, Dynamic Programming, Search, Sorting, etc., or applying 'Rule' to the above node values It can be obtained by judgment through reasoning or inference.
  • the method of configuring the STUMP forming the framework or foundation of the Super Tree is as follows.
  • ROOT Node which is the root node of the Super Tree and the root node of STUMP at the same time
  • the name, content, goal, and 'Project/Task Charter SHRUB' (211) including all basic information such as execution subject or owner, PM or general manager, execution period, total budget and location, and monitoring progress along the entire project/task progress period
  • 'Master Calendar-mapped Progress Management IVY' (212) and 'Master Event BDT', which will be described later, are grafted.
  • the goals of the above Project/Task can be the completion date or construction period, scale or 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 output, quality, and target cost for each product.
  • 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 convenience
  • energy management task it can be an energy-saving and It can be cost savings
  • in the case of a computer operation management task it can be a response time, security level, and usability index
  • in the case of a sports goal management task it can be a win rate, a win, or a win.
  • a stock investment goal management task it may be the target amount of investment return
  • in the case of an individual goal management task it may be the acquisition of a specific qualification or the achievement of a set goal.
  • the duration of the project or the entire task to be managed is expressed as a 'detailed task' (also expressed as 'Work', 'Work Package', or 'Activity' depending on the Project/Task) 'Time Management Node' (210) for creating and scheduling, day of week, public holiday, and main event information and time-related information for each calendar date; ‘Deliverable Management Node’ (213) for managing the final goal of the Project/Task and the deliverable or result state (hereinafter collectively referred to as ‘Deliverable’) generated as a result of performing each task; ‘Task Management Node’ (214) for managing the overall and detailed tasks that must be performed directly or indirectly to complete or produce Deliverable, which is the result or state of achieving the goal of Project/Task; ‘Resource Management Node’ to manage all resources that must be put in to complete or produce Deliverable; ‘Facility Management Node’ (215) for managing system facilities such as
  • Each Major Management Node may be subdivided into a plurality of detailed Major Management Nodes and replaced, or may have subdivided detailed Management Nodes as child nodes.
  • the Task Management Node is, depending on the characteristics of the Project/Task, 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 subdivided like the and Commissioning Node and divided into separate Major Management Nodes, or all can be configured as child nodes of the Task Management Node. In the case of Smart Factory establishment and operation task, it can be subdivided into Production/Manufacturing Facility Management Node, Production/Manufacturing Process Monitoring Management Node, and Inventory Management Node.
  • 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, and In case of operation task, 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 for managing maximum demand power, and You can also configure the same Management Nodes to replace Task Management or as child nodes that subdivide Task Management Nodes.
  • each Class In order to store and utilize information that can be broken down into detailed management target information of the same type or homogeneity when classified or subdivided sequentially or hierarchically among the information on the target to be managed by field of each Management Node of STUMP, each Classifies or subdivides management objects sequentially or hierarchically, and constructs a Tree-type Knowledge and Information Model that represents each generated detailed management object information as a node and connects them with an arc having parent-child relationship, and creates a 'Breakdown Tree' (hereafter ' BDT').
  • Each BDT is configured to include 100% and only 100% of the target for each level (also called 'The 100% Rule' in the Project Management Community.), and for this purpose, there may be a target missing from the classification.
  • the 'Rest-of-All' Node (hereinafter 'ROA' Node) is added to symbolically represent all remaining objects in addition to the explicitly indicated child nodes. % should be included.
  • each node of the BDT for each management object configured as described above is grafted to the STUMP node representing the management of the relevant field or division.
  • each node of the BDT may be grafted with other PLANT Nodes in the Super Tree related to the corresponding object.
  • a typical BDT constituting the goal management platform each created by hierarchically classifying or subdividing the entire and all detailed actions or tasks to be performed in order to achieve or complete the final goal of the project/task during the planning period.
  • 'Task BDT' which represents the task at the detail level as a node, and grafts it to the STUMP's Task Management Node
  • ‘Deliverable BDT’ that hierarchically breaks down deliverables that need to be completed or achieved as a result of the execution of the corresponding task for each task of the task BDT during the target planning period, and represents them as nodes, and grafts them to the Deliverable Management Node of STUMP
  • ‘Master Event and Risk BDT’ which classifies all possible events and risks in the course of implementing the goal management task, classifies them by type, and displays them as nodes, and grafts them to the STUMP’s Event Management Node; All facilities that need to be used as part of the resource to achieve the goal according to the project/task or all target
  • 'Cost Estimation Standard BDT' which is stored as and grafted to STUMP's Resource Management Node, classifies all nodes included in 'Platform BUSH' indicating the configuration of H/Ws constituting the platform itself by function, and classifies STUMP's Platform and 'Platform Facility BDT' to graft to Super Tree Management Node;
  • each year including the entire project/task period is the child node of the root node, and month, day, hour for each year 'Project/Task Calendar Time BDT', which hierarchically breaks down the back and grafts it to the Time Management Node of STUMP;
  • 'Super Tree PLANT' that classifies all the PLANTs composing the Super Tree by type, composes a BDT whose name is a Node, grafts the Root Node of the corresponding plant to each Node, and grafts it to the Platform and Super Tree Management Node of STUMP BDT'
  • it is composed of nodes that classify and subdivide all projects/tasks to compose the Super Tree by field, and the upper 'Super Tree BDT' that grafts the Supter Trees composed of the stars of the corresponding Project/Task can be constructed at each node.
  • the Knowledge and Information Model composed 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 to manage multiple projects/tasks.
  • 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.
  • the level of detail indicated by the task includes the detailed task as part of the same name, and the platform autonomously and bidirectionally determines the type, amount, and cost of resources to be invested for deliverables created as a result of performing the detailed task. and subdivide it to the level at which it can be calculated. If the detail level of the activity can be managed without separate progress management, it is managed by including it in the attribute information of the detailed task without further subdividing it.
  • the 'Peripheral Voltage Installation Construction' task is subdivided into 'Survey', 'Excavation', 'Form', 'Rebar', ' Anchoring', 'Concrete', 'Concrete Curing' and '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 detailed task is the amount of deliverable (quantity or state) corresponding to all or part of the progress to be generated as a result of performing the task.
  • the type, quantity and cost of the resource to be input can be calculated using the part count information, and conversely, it can be completed or created according to the amount and cost of the resource to be input as an input unit. It is also possible to calculate the task progress value corresponding to the amount or state of the deliverable.
  • 'VINE Facility BDT' or 'BUSH Facility BDT' that classifies facilities or devices by process, system, or circuit represented by each VINE and BUSH is configured and grafted to the root node of the VINE or BUSH.
  • Every facility or space represents the facility or space, designates a standard location, and calls it a “representative point” of the facility or space.
  • 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' coordinates and orientation information in the reference coordinate system as attributes.
  • the highest coordinate system serving as the overall reference, that is, the coordinate system of the Root Node of the Coordinate Management BDT is defined by setting the lower left corner point of the entire project site plan as the origin and defining the 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 also be used as a TAG of the corresponding control point on the platform.
  • additional information such as the unit of the corresponding TAG value, communication protocol and address as properties of the corresponding Leaf Node, it is possible to mark the TAG simply and clearly compared to the usual TAG expressions expressed as a chain of a number of abbreviations codes, and Nodes and attribute information can be used for inference related to the corresponding TAG.
  • Master Event and Risk BDT are largely divided into negative events, positive events, and neutral events according to their impact on goal achievement, and unless otherwise specified, default means negative events.
  • Master Event and Risk BDT is composed of gathering events that may occur during the execution of each task composing Task BDT.
  • Typical resource types constituting the Resource BDT include Manpower, Capital (Budget, Money), Material, Equipment, Facility, Energy, and Time.
  • Manpower In particular, in the case of the Convenient and Secure operation goal management task of a computer or smartphone, it includes Processor, Memory, Peripheral and Network as main resources, and in the case of the stock investment goal management task, it is Money. .
  • the BDT If there is a separate Management Node for each resource type in the STUMP, the BDT is configured for each resource and directly grafted to the corresponding Management Node. Otherwise, it is configured by including it as a subtree of the resource BDT.
  • a project/task that requires the participation and cooperation of multiple personnel, it includes the project manager (PM), general manager, all team members, and project/task-related persons (project owner, owner agency personnel, subcontractor, etc.) Stakeholder'.) is represented as a hierarchical tree by specialized field, department, or department in charge, and each task, identity, authority, duty, qualification or capability, and career standard information , 'Manpower BDT' is configured to store all information necessary for goal management, such as individual actual product information and the ability to generate specific deliverables, as attributes, and grafted to the child node of STUMP's Resource Management Node, or Manpower Management to STUMP. When creating a node separately, graft directly to the node.
  • PM project manager
  • general manager all team members
  • project/task-related persons project owner, owner agency personnel, subcontractor, etc.
  • Project/task-related persons project owner, owner agency personnel, subcontractor, etc.
  • Stakeholder'. is represented as a hierarchical tree by specialized field
  • the manpower may be composed of a manager, players, support personnel, and personnel of opposing teams, and in the case of an individual's specific goal management task, support or force to achieve goals for oneself and those around him including manpower who can do it.
  • Each Day Node of the Project/Task Calendar Time BDT has, as its attribute values, the day of the week, sunrise and sunset times, forecast and actual weather information, and public holiday information.
  • the 'ORE Generation BDT' receives an order from the PM, a task given, a request from other Project/Task related parties, and a basic task given to the platform (collectively, 'Platform Task'). In order to express and implement it, it is structured as follows. ⁇
  • the candidate group of SPs (Semantic Primitives) is presented as child nodes as keywords expressing the corresponding instruction or request, so that the PM can select or directly input it.
  • SPs Semantic Primitives
  • a specific child node is selected from the presented candidate group, detailed expressions, contents, or values that need to be selected or input as properties of the selected child node are presented as defaults and can be selected or directly entered.
  • the candidate group and attributes of the child nodes of the next level generation of the expression that can materialize the instruction or request indicated by the SP again according to the selected SP child node are presented so that they can be input. is repeated and specified by increasing the Level until the expression of the corresponding instruction or request is completed.
  • the 'ORE Generation BDT' is configured to indicate and store specific instructions or requests given to the platform as the path from the 'ORE Generation BDT' to the Leaf Node and the properties of the nodes on the path. All candidate nodes and attributes presented in each level 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 corresponding leaf node, but the context as the entire path and the properties of each node and node included in the path. It represents the expression of assignment or request, and such Path expression is defined as 'direction and request expression stem' ('ORE STEM' or 'STEM' for short).
  • the PM can directly input the node name for each depth, or select the node names available at the current depth based on the input up to the previous depth in alphabetical order.
  • the drop-down menu listed can also be presented for selection.
  • the PM directly presents an input window or presents a drop-down menu to receive input and save it as a property of the node.
  • the STEM input is performed by executing 'STEM_Generation_Rule'.
  • FIG. 3 is an exemplary diagram showing the configuration of the ORE Generation BDT. Examples of the types of typical candidate nodes presented for each Depth of ORE Generation BDT and the values or expressions of nodes indicated by the properties of each node are as follows.
  • Semantic Primitive (one of the Leaf Nodes of SP BDT.
  • Attributes content of the instruction or request, execution time, repeatability, method (PC, smart phone, etc.) and format (Table, PLANT) (304) of reporting when reporting is required
  • Depth 2 Node Object of instruction, task and request action: Object or object state or specific attribute value (Node of Super Tree)
  • BDT or subtree of BDT including the target
  • Depth 3 Node The state of the selected object or a specific property value (STPN indicating the corresponding Variable) (306)
  • 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
  • Each STEM constituted 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' that is grafted to the root node of 'ORE Generation BDT'.
  • An example of the configuration of ORE STEM is shown in the description of Rule SHRUB to be described later.
  • STEMs Orders, tasks, and requests that need to be performed regularly or frequently among STEMs are called 'Regular Order and Request (ROAR) STEM', and are separately stored in the RAOR Table, and a Timer whenever the time or interval to be performed arrives. It calls and executes the relevant Rule as a Rule.
  • ROAR Registered Order and Request
  • STEMs STEMs in which Path Nodes are the same and only the properties of each Node are different are called 'homogeneous STEM'.
  • the same Template Rule is used, and the detailed information to be provided to the Rule for inference is supplied from the attribute values of the STEM.
  • the STEM composed as described above is given a name as the path of the instantiated ORE Generation BDT, and the BDT node of the corresponding name of 'STEM Classification and Depository BDT', which classifies and subdivides the STEM by field, type, and content, as a node. Graft it.
  • the 'STEM Classification and Depository BDT' is each grafted to the node of the corresponding STEM name of 'Super Tree PLANT BDT'.
  • Each STEM is capable of 'Assert' as a 'fact' of the action of making the relevant instruction, task, and request as a whole, and a 'Rule' explicitly indicating specific methods and procedures for the implementation of the instruction, task and request. It is executed by Invoke and Execute. All rules are implemented as ‘Rule SHRUB’, which will be described later.
  • Node Attribute SHRUB (NAS) that systematically/hierarchically classifies or subdivides and stores information on attribute values of the corresponding node can be configured to graft the Root Node.
  • major properties include, in the case of Facility BDT Node, facility specification, symbol, image, location, orientation, 3D model, accumulation, operation method, operation history, energy consumption, reliability, actual efficiency, various Performance indicators, etc., and in the case of a Task BDT Node, it has a 'Nature of Activity' (NOA) attribute node, and the subject and qualifications of the action required to perform the task, the necessary action, and the Descendants including specific content information of task execution actions such as target deliverable, necessary equipment or equipment, materials, energy, and execution time are created, or a separate NOA SHRUB is configured and grafted to the NOA attribute node.
  • NOA 'Nature of Activity'
  • operations such as 'Node_Level_Shuffling', 'DFS_Next_node_Search' and 'BFS_Next_node_Search' are configured.
  • the 'Node_Level_Shuffling' is an operation of reconfiguring the classification system by reversing the level positions between parent nodes and child nodes according to the purpose of using the BDT.
  • each BDT if it is necessary to enumerate all the nodes it belongs to, or to sequentially visit each node and eval, use a search algorithm such as Depth First Search (DFS) or Breadth First Search (BFS). use.
  • the 'DFS_Next_node_Search' and 'BFS_Next_node_Search' are operations that visit the nodes of the target BDT in DFS or BFS order for each operation and return the node of the next visited location.
  • each task constituting Task BDT is subdivided into 'Unit Time' to perform tasks of a certain length, and each subdivided unit time is represented by a Node, and the start unit time is From the 'Start Node' (401), which is indicated, to the 'Finish Node' (or 'Last Node') 402 corresponding to the end unit time, the Knowledge and Information Model is sequentially connected with an arc, and this is 'IVY' to be defined as
  • the unit time is selected according to the characteristics of each task and management convenience, and can be selected from Day, Hour, Minute, Second or Week, Month, and Quarter.
  • the default value is 'Day', and other units Time can be created by 'Expand' or 'Shrink' (also expressed as 'Condense' or 'Collapse') of the 'Day' node, and 'Day' will be described below.
  • 'Expand' or 'Shrink' also expressed as 'Condense' or 'Collapse'
  • the target management unit time of the time is set by 'Expand' from 'Day' to 'Second', and the precision of management can enhance
  • 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 in the corresponding period (Duration). If the task to be performed is a situation monitoring and management task, it is grafted as 'State Monitoring and Management IVY'. A unique name is given to each IVY, and if it is difficult to assign a unique name separately, the IVY is distinguished by a Path expression including the Grafted Parent Node.
  • Each node of IVY is given a series of node numbers starting with the 1st (or 1st) Start Node, and the node number is used as a node 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 nature of the IVY node name, and the Node Number of the Last Node becomes the length of the IVY and the duration of the task at the same time (402, 406). ).
  • each Day node of IVY represents only the pure time length regardless of the day of the week, weekend, or holiday of the Calendar, this is called 'Net Duration' IVY(407), and in case of a specific date of the Calendar, it is called 'Calendar- Let's say mapped'IVY(403, 404, 408).
  • the above 'Net Duration IVY' is mainly used when establishing the schedule based on the Net time/period required to perform the task.
  • the Start Node of Net Duration IVY is the calendar date to start the task.
  • 'Forward Mapping' and 'Forward Mapping' (409), which maps and deploys the remaining nodes in all directions according to the work or working hours policy by day, day of the week, and holidays, and ', which maps Finish Nodes to the Deadline and maps them in the reverse direction.
  • each task execution schedule can be mapped by first configuring Net Duration IVY and selecting one of the above three calendar mapping methods, or directly from the beginning, it can be configured with Calendar-mapped IVY.
  • the IVY can be constructed in which both the start date and the completion date are fixed on a specific calendar date from the beginning due to the nature of the task, such as the achievement of the annual production target or the annual energy saving target.
  • 'Master Calendar_mapped Progress Management IVY' (408) including 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 attribute information includes the date, day of the week, weather, sunrise and sunset times, instructions and implementation results from the PM to the target management platform on that day, and other Project/ In order to store and display information related to the overall progress of the project/task, such as the request and processing results of the task related persons, the day and cumulative total progress plan, light performance, and the processing status of various events and risks that occurred on the day do.
  • Each task's 'Task Progress Management IVY' includes its own 'Self Node Number' (412) indicating the elapsed days from the start date of the corresponding task, and the 'Master Node Number' (413) indicating the elapsed days from the entire project start date.
  • the calendar date-related information of the day By having as an attribute, it is possible to know the calendar date-related information of the day, the number of days elapsed from the start date of the entire project/task, and the relative progress relationship with other tasks, and the preceding and subsequent relationship with other tasks.
  • Setting and task progress buffer management can be performed simply by comparing serial numbers.
  • each node of IVY represents the variable value of the corresponding unit time or the average value of the variable during the unit time.
  • 'Sparse IVY' in which only nodes having significant) information are selectively or explicitly displayed and the remaining nodes are omitted, and 'Shorter configured by expanding a node of a specific unit time IVY into a lower detailed unit time node 'Unit Time Expanded IVY' and 'Longer Unit Timeshrinked IVY' composed by aggregating the upper long unit time nodes, and for recording the time and number of occurrences of irregular events such as data acquisition, equipment failure, wage increase, and material price increase.
  • 'Arbitrary Interval IVY' 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 establishment of a task execution schedule, trend analysis of specific variables, correlation analysis, and comparison analysis.
  • IVY Exclusive Operations defined and applied by IVY include 'Reference_IVY_display' 'Top_down_Scheduling', 'Bottom_up_Scheduling', 'IVY_node_increment', 'IVY_node_decrement', 'IVY_shift', 'IVY_split', 'Calendar_mapping', 'Calendar_mapping', Examples such as 'Absolutely Needed Time (ANT)_estimation', 'IVY_node_Expand', 'IVY_node_Shrink', 'Progress_estimate', 'Buffer_setting', 'Milestone_sliding', '4D_display', and 'Present_Time_Line_set', may be given.
  • ANT Absolutely Needed Time
  • the 'Reference_IVY_display' is an operation to present an IVY of a basic length to generate an IVY
  • 'Top_down Scheduling' is an operation to assign progress to each unit time in a top-down manner for a predetermined duration
  • ' Bottom_up Scheduling' is an operation to set the overall duration in the Bottom_up method by calculating and taking the progress of each unit time.
  • 'IVY_node_increment' and 'IVY_node_decrement' are operations that increase or decrease the node length of IVY by one
  • 'IVY_shift' is an operation that moves the calendar mapping position of the entire IVY back and forth before the start of the task.
  • 'IVY_split' is an operation that continuously proceeds with two or more subsequent IVYs to divide one IVY into two or more tasks during task progress, and 'Calendar_mapping' converts the configured 'Net Duration IVY' into 'Calendar_mapped IVY'. It is an operation to switch, 'IVY_graft' (414, 415, 416, 417) is an operation to perform a graft to establish a precedence/successor relationship between IVY nodes, and 'ANT_estimation' is to reduce further from the present point to the end of the task. It is an operation to calculate the Absolutly Needed Time.
  • 'IVY_node_expand' is an operation for grafting a specific IVY node by expressing it as 'Unit Time Expanded IVY', which is a lower detailed unit time node IVY
  • 'IVY_node_shrink' is an operation to graft a specific IVY node into an upper long unit time node IVY.
  • 'Progress_estimate' is the operation to calculate the progress of a specific IVY Node and the cumulative progress up to the IVY Node
  • 'Buffer_setting' is the Progress Management IVY of Tasks with antecedent/successor relationship
  • 'Milestone_sliding' is an operation to move the node position of Milestones back and forth according to the change in task progress
  • '4D_display' is the operation to set or adjust the slack days by connecting the nodes of It is an operation that displays the progress status of the task as it progresses
  • 'Present_Time_Line_set' (418) sets the unit time node including the current time as the present node and the previous node as the past node.
  • the current node can be expanded into IVY including the current node, past node, and future node in detailed time units.
  • Each facility, element, or entity constituting a production process or a system of a specific function is represented as a node, and the physical connection and A data structure representing the flow direction of the handled medium or object is defined as 'VINE' by composing an arc.
  • the direction of the arc is determined according to the direction of the flow of an object such as a product having a physical form or a medium such as solid, liquid, gas, current, or signal handled by the process or system.
  • an object such as a product having a physical form or a medium such as solid, liquid, gas, current, or signal handled by the process or system.
  • a Graft when it is partially bidirectional, the reverse connection is indicated by a Graft.
  • VINE examples of typical VINE are the production process of the target plant or factory that must be constructed or operated to achieve the set goals of the project or task, or support systems such as power system, steam system, compressed air system, cooling water system, and air conditioning system.
  • support systems such as power system, steam system, compressed air system, cooling water system, and air conditioning system.
  • each facility (Equipment/Facility) of the corresponding process or support system is represented as a node, and 'VINE' representing the connection relationship between Preceding and Succeeding between each facility as an arc.
  • 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 intermittent process, it may be short or may consist of one facility.
  • VINE As a special VINE, a VINE representing the flow of logic can be configured, and in this case, it is separately called 'Logical VINE'.
  • Logical VINE include Flow Chart for Computer Programming, Start-up/Shut-down Sequence of process equipment or systems, Block diagram indicating the product production process of the process, and specific events according to Interlock Logic. of propagation routes, and the like.
  • nodes constituting the VINE virtual 'Root Node' to 'Start Node' symbolically representing the starting point of the VINE (501), and one or more child nodes or subsequent nodes (Succeeding).
  • the measurement and control circuits required for each of the above processes, systems and facilities are also composed of separate VINEs, with common power (P: Source) and Ground or Neutral (N: Sink), measuring instruments, sensors, transducers, actuators, controllers, each terminal terminal and Terminal points, various relays and relay contacts, electromagnetic switch and switch contacts, various switches, and circuit elements such as display lamps (hereinafter collectively referred to as 'element' or 'measurement and control equipment') are represented as nodes.
  • the connection cable between elements is not separately indicated if there is no need to use or manage the specification or distance for target management.
  • a unique name is given to each Vine (512, 513), the name of the Start Node is used as the name of the VINE, and the number of the Virtual Start Node is 0.
  • Each node in the VINE is also given a unique name and node number within the VINE.
  • the node numbering system assigns serial numbers according to the characteristics of the process or system represented by VINE or is configured in the form of indicating precedence/subsequent relationships.
  • the PPN of each node can be simplified as much as possible to a level where uniqueness is maintained, and the simplest PPN form can be 'VINE_Name/*/Node_Name'.
  • a specific BDT for the VINE that systematically classifies the VINE facilities by type is configured and grafted to the root of the VINE. All leaf nodes of the VINE-only BDT are also included in the Master Facility BDT, and the mutual classification system can be different from the Master Facility BDT. In this way, when a node representing the same facility or variable belongs to a different plant, it is called an 'Alias Node'.
  • Each node of the VINE can be grafted by constructing a 'NAS' (Node Attribute SHRUB) that systematically classifies the attributes of the corresponding equipment or device and stores them as the values of the nodes.
  • All VINE nodes have basic properties of connected front and rear facility information, i.e., the number of Preceding Nodes and PPN and Succeeding Nodes and PPN, the total number of grafts, PPN of grafted nodes, and Alias Node information. store as a value.
  • VINE Nodes representing the production process or system
  • the location coordinates and orientation on the drawing or monitor screen representing the physical location coordinates and orientation of the facility, schematics or physical layout, 3D Model, Symbol and Magnitude, antecedent facility(s) of the facility, inputs and outputs connected to the outside, and applicable measures such as changes in the physical or chemical state of a medium or product within or passing through the facility.
  • Facility function or role information operating method and operating condition monitoring standards of the facility, real-time operation and operation status information, installed instrument information and real-time measurement values, 'control logic information', causes and types of various alarms, failures Information on the cause and type and ripple range of trips, start/stop sequences, 'types of input energy' by equipment and standards and actual values for each type, reliability, calculation methods and actual values of various performance indicators, operation history and Attribute values such as reliability information are additionally stored.
  • the attribute information to be saved may be different for each alias.
  • the 'control logic information' may be stored by grafting the VINE representing the control logic circuit of the corresponding facility to the node of the corresponding property name of the corresponding facility.
  • the VINE node provides information such as 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. (Scope) and save as needed.
  • the 'type of input energy' for each facility includes basic energy such as electric power, coal, oil and gas, and secondary energy such as steam, compressed air, vacuum, cooling water, fruit, cold air, and heat generated by basic energy. includes all energy.
  • the target management platform 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 target management platform to respond to the operation or operation status of each component facility or device of the process, system, or circuit represented by the VINE. It is possible to evaluate the feasibility and appropriateness of the system, logically trace the cause and spread of abnormal situations such as various alarms and trips, and it is also possible to estimate the loss of pipelines or lines. . Therefore, VINE enables the realization of the 'Digital Twin' of the process or system to be represented.
  • Root Node which symbolically represents the starting point of the process, leading to the main facility nodes, and designating one main path to the Last Node, connecting the facility nodes along the main path Proceed with the configuration of VINE. If a branch point is encountered during the process, a ‘branch point node’ is created at the branch location. In each branch node, the number of subsequent nodes and node name are stored as attribute values, and 'branch stack' is additionally set.
  • the node name of the path to be traced later is PUSHed and stored, and Preorder Continue with the Depth First Search (DFS) search method of , creating the following subsequent facility nodes along the main path.
  • DFS Depth First Search
  • 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), and the main process and confluence also flows through the graft (522).
  • the root nodes are grafted to the root node of the main process VINE, and the relationship between the main process and the supporting system is expressed as a property of the graft (523), and the facilities of the supporting main process are also grafted through the graft. shown (524, 525).
  • PPN of normal VINE Nodes Since the PPN of normal VINE Nodes is long, only the 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 form of PPN can also consist of only two explicit nodes such as 'VINE_Name/*/Node_Name'.
  • Equipment connected in parallel such as self-generation equipment for emergency power, solar power equipment, and energy storage system (ESS), forms a separate VINE and connects it to the junction with a graft.
  • An example of the junction node may include a facility node such as an automatic transfer switch (ATS) or a closed transition transfer switch (CTTS).
  • ATS automatic transfer switch
  • CTS closed transition transfer switch
  • Examples of typical operations applied to VINE are 'analyze_Trend', 'check_Consistency', 'display__Schematics', 'display_VINE', 'display__3D_Layout', 'display_4D_Layout', 'estimate_Losses', 'estimate_Operational_Cost', 'estimate_'
  • There are a number of operations such as ', 'find_Bottleneck', 'monitor_Idling_Facility', 'monitor_Operating_State', 'monitor_Start-up_Sequence', 'monitor_Shut_down_Sequence', 'monitor_Performance', 'expand_Compound_Node_Sequence', 'monitor_Performance', 'expand_Compound_Node_Node',
  • the operation monitor_Power_Quality' 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'.
  • the BUSH aims to indicate all remaining systems and networks that are not included in the definition and characteristics of the VINE described above. Typical examples include various Computer Networks, Processors, Memory, Disks, Ports, Keyboards, Monitors, and various peripherals connected to the center of the Computer Network, Computer Internal Configuration, Bidirectional Communication Measurement and Control Circuits, Various Traffic or Road Networks, and BUSH, which stands for National Electrical Power System.
  • Examples of the above equipment or elements constituting the Node of BUSH include, in the case of a computer network system BUSH, various servers, PCs, network equipment, and measurement and control equipment.
  • various servers PCs, network equipment, and measurement and control equipment.
  • DB Server Web Server
  • ERP Server MES Server
  • SCADA Server SCADA Server
  • PI Server PI Server
  • PC Network Switch
  • Router Access
  • Various network equipment such as points and routers, proprietary network for lower measurement and control equipment, data collection and control equipment such as DCS or PLC for measurement/control, and various on-site control panels connected to these equipment for measurement/control , sensors, measuring instruments, transducers and relays, their connecting points, and facilities connected to ports of the main server and other servers.
  • the national power grid system BUSH there are power plants, transmission line facilities, distribution line facilities and loads.
  • the server node or PC node can be deployed or expanded with a detailed configuration BUSH as a 'Compound Node'.
  • the processor, bus, memory, hard disk, and peripheral devices can be configured as an entity, that is, a detailed BUSH as a node, and can be expanded and included as a part of the original BUSH or grafted to the corresponding Compound Node.
  • a detailed BUSH as a node
  • DCS's internal circuit or logic designate the PLC or DCS as a Compound Node and expand it to VINE or BUSH depending on the circuit configuration type to use the PLC or Graft to DCS node.
  • connection relationship between the facilities or elements includes wired and wireless connections, and when necessary for goal management, it is explicitly indicated as a Node similarly to a pipe or cable in VINE, and other connected facilities or elements Include or omit in the node's properties.
  • BUSH includes 'Configuration BUSH', which is configured according to the shape or schematic of the system to be displayed, and 'Adjacency BUSH' to indicate 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.
  • a Root Node symbolically representing the starting point of BUSH is set, and among the above facilities or elements, an arbitrary 'Central Node' (Center of Universe (COU) Node) that becomes the center of configuration or connection of the system. Select to make it a Level-2 child node of the Root Node.
  • facilities or elements directly connected to the COU Node are used as Level-3 child nodes of the COU Node, and facilities or elements connected to each child node are continuously searched in a breadth first search (BFS) method. Create child nodes and proceed.
  • BFS breadth first search
  • a searched node encounters a node that has already been created while other nodes are in progress, it is connected to a Graft rather than a child node, and the corresponding node stops further search to prevent cycle formation. After proceeding as above, it returns to the COU Node and if there are no more facilities or elements to be searched connected to the COU, the corresponding ‘Configuration BUSH’ is completed.
  • 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 as Level-3 child nodes of each Level-2 node.
  • the 'Adjacency BUSH' is distinguished from a traditional tree in that the parent-child relationship is reversed since the same Level-2 nodes can have different Level-2 nodes as mutual child nodes while having a tree structure.
  • each node is complexly connected like many-to-many, and the physical shape or configuration does not provide additional information for goal management, only 'Adjacency BUSH' can be configured without separately configuring 'Configuration BUSH'.
  • the configured BUSH is grafted to STUMP's Master Facility Management Node.
  • each node of the BUSH is also composed of a dedicated BDT for the BUSH that is divided or subdivided by type or division and grafted to the root node of the BUSH.
  • Each node of BUSH is grafted with Node Attribute SHRUB (NAS), which stores and manages the attribute information of the node.
  • NAS has serial number, address, name, function, specification, symbol, shape or isometrics, physical location, location on the drawing or screen, child node of the corresponding Node.
  • adjacent nodes and graft information are stored.
  • For each node name in the case of Computer Network System BUSH, common names such as COU, Server, PC, Network Switch, Router, and Bus are used as part of the Node Name so that the function or characteristics of the corresponding node can be distinguished.
  • a server 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 interworking with the same server type or function and other various project management tools, design integration tools, and engineering software, the data content exchanged with the mutual data communication method or protocol is stored as an attribute value.
  • service information such as Web Service, FTP, Email, ERP, MES, FMS, SCADA, PI Server, EDMS (Electronic Document Management System), ECMS (Enterprise Content Management System)
  • EDMS Electronic Document Management System
  • ECMS Enterprise Content Management System
  • the configuration of the platform of the present invention which is built for project/task goal management, is also represented as BUSH and included in the Super Tree so that it can be managed together, thereby managing the configuration, function and performance of the platform itself, as well as interworking with other servers. and unification of goal management tasks through information exchange.
  • monitor_Response_Time' 'monitor_Page_Fault', 'monitor_Port', 'monitor_Program_Behavior', 'monitor_Virus', 'monitor_Hacking', 'monitor_User-behavior', 'serve_User_request', 'optimize_Size_optimize ', 'Set_User_request', 'optimize_Size_optimize_Workmoning_ You can add detailed operations such as 'monitor_Background_Program' and 'monitor_System_Call'.
  • each operation is the same as the operation name, and the specific content and execution method may be different according to the field and characteristics of the Project/Task.
  • the 'trace_Path' may be defined as an operation for searching all paths (except Cycle) existing from a random Start Node to a Arbitrary Destination Node in BUSH, and Adjacency BUSH As it expands, it can be performed 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 Loop variable 'i' to 2.
  • Step 2 For each Level (i+1) child node of the set Level i node
  • the corresponding child node is the starting node or a node already included in the PPN path from the parent node of the previous higher level or the starting node to the current child node, the corresponding child node is pruned.
  • the 'Plant Path Name' (PPN) from the departure node to the destination node is included as one of the found relative paths.
  • the path search in step 3 is performed in the depth-first search (DFS) method, and in step 2 (1), cycling in the search process is naturally excluded.
  • the minimum cost path can be easily found by allocating a cost or distance to each arc and pruning the path that is more expensive than the previously discovered minimum cost during path search.
  • the expanded Adjacency BUSH in order to track all the routes from the arbitrary departure node to the destination node in the BUSH is called 'Expanded Adjacency BUSH'.
  • the three-step execution method of the 'trace_Path' operation is also implemented as a 'rule' to be described later in order to explicitly indicate the contents.
  • FIG. 6 and 7 show examples of the configuration of a Node Attribute SHRUB (NAS) and a Rule SHRUB, respectively.
  • NAS Node Attribute SHRUB
  • Rule SHRUB a Rule SHRUB
  • All of the above knowledge and information includes attribute values of all nodes of STUMP, BDT, IVY, VINE and BUSH, various arithmetic and logic operations, situation determination, cause tracking, countermeasure establishment, action implementation and procedure progress Reasoning and Inference necessary to process basic tasks of the platform, tasks given or given by the PM, and requests from other managers by using the knowledge and information for and rules as a way to make judgments.
  • NAS Node Attribute SHRUB
  • Each attribute node composing NAS can directly store the corresponding attribute value, connect child nodes that subdivide the attribute, and graft other PLANTs related to the attribute.
  • Task Node of each level of detail in Task BDT includes 'Nature of Activity (NOA) Node, ' Progress Management Node', 'Deliverable Management Node', 'Resource Management Node', 'Cost Management Node' and A NAS including nodes such as 'Event Management Node' can be grafted, and each attribute node can have child nodes that subdivide the attribute or can be grafted by configuring a separate Management SHRUB containing the detailed attributes. there is.
  • a Task Management SHRUB for managing the entire task and common information such as the execution period, budget, specific content, present situation data, Time Tag, and the person in charge of the task. can be grafted.
  • 'Progress Management IVY' for managing the progress of the corresponding task is also grafted, and NAS is also grafted to each node (assuming 'Day Node') of the grafted 'Progress Management IVY' (601).
  • the NAS that is grafted to each IVY Node of 'Progress Management IVY' has a 'Self Information Node' (for managing the information of the Day Node itself such as Project (Master) Node Number (602) and Graft information of the 'Day' Node again.
  • IVYs of detailed time units such as 'Hour' IVYs (217, 419, 609) and 'Minute' IVYs are provided to nodes that need to manage detailed progress or status according to the progress time among the Management attribute Node nodes.
  • Graft, and the NAS is also grafted to each node of the IVYs of the detailed time unit (610), and details such as the number of times (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 attribute 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 previously established total progress, and the actual available resource status of the day at the start of the day.
  • each node of Facility BDT, Resource BDT, each VINE dedicated BDT and BUSH dedicated BDT also grafts NAS including target management related information, progress and schedule, and IVYs for operation status monitoring management.
  • 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 expressed as a SHRUB whose Level is increased as much as the descending depth.
  • 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 indicate each column of the corresponding row. Therefore, the number of child nodes of the root node becomes the number of rows. Tables or arrays of 3-D or higher are constructed in the same way by increasing the level of SHRUB.
  • the Node Name (including Given Name, PPN, STPN and RSTPN) itself can have a value as a variable, and the value is stored by including the 'Value' Node in the NAS of the corresponding Node. You can save or save 'Expression' that can be evaluated including 'Eval Expression'Node' in the form of List.
  • the 'Node_Eval' evaluates a specific Node Name, it returns the value that the corresponding Node has as a variable, or returns the value of the Value Node included in the NAS of the corresponding Node, or the 'Eval Expression' Node Expression Evaluate (simply 'Eval') to return a value.
  • 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 from a sensor, instrument, other servers or managers
  • 'Expected Value' is a value that is logically expected or determined
  • 'Consistency' is a value that is substantially identical to the above two values It has a value of Yes, No, or Null (don't know) as a result of determining whether or not to do it.
  • the 'Rule_generate' operation is a 'to indicate and implement a specific method (Methodology) and knowledge (Knowledge) for handling the instructions given from the PM, requests from team members or other managers or related parties, and basic tasks or functions of the platform. It is an operation that composes 'Rules' with SHRUB.
  • All rules are objective (Objective) or subjective (Subjective) methods or policies for handling the instructions or assignments given by the PM to the platform, the requests of project/task related parties, and the basic functions or tasks of the platform, Arithmetic or logical operation, inference (Inference and Reasoning) or judgment according to a set standard, Process or Procedure, Strategy or Operation (Tactic or Operation) and Know-how, including knowledge ( As an expression of knowledge) and information, the contents are expressed explicitly and freely updated, and included in the Super Tree as a consistent structure (Consistent and Unified Framework) and used for goal management as a SHRUB of the Super Tree.
  • the SHRUB representing the Rule is called ‘Rule SHRUB’ or simply ‘Rule’, and the name of the Rule is the same as the name of the Root Node of Rule SHRUB. Therefore, the aforementioned SWEEP technique and GRACE technique are all implemented and executed as a Rule.
  • Rule SHRUB's Root Node (701) is a 'LHS (Left-hand Side) Node' (702) as a Condition Part and a 'RHS (Right-hand Side) Node' (703) as an Execution Part (Action or Execution Part) It has two child nodes.
  • the LHS and RHS are 'Condition Part' and 'Execution Part', or 'Premise Part' and 'Conclusion Part', or 'Antecedent Part', respectively. and 'consequent part'.
  • 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. do. If the conditional part of the Rule includes only one condition, the LHS Node is not created explicitly, and the corresponding Node itself becomes an 'Implicit' LHS Node, that is, a Condition Node. If the execution unit includes only one action, it becomes a separate RHS Node. Without creating a node, the corresponding node itself can be an implicit RHS node, that is, an action node.
  • a Rule having only one LHS Node and RHS Node is especially called a 'Simple Rule'.
  • 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 directly included internally is called the ‘Internal Rule Node’, and the ‘Internal Rule Node’ also has the LHS Node (705) and the RHS Node (706) as child nodes as the root of the Rule.
  • the Rule Node for grafting additional external rules is called 'Rule Graft Node' (707).
  • 'Rule SHRUB Node' constituting the Rule
  • the types of 'Rule SHRUB Node' constituting the Rule include '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 Node('Performing Node') ' or 'Acting Node')'.
  • Node' may be divided 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 'Rule Node' for short) also has properties like other SHRUB Nodes (708, 709), the number, name, and 'Eval Expression' of the corresponding node (710, 711), Includes node value, logical condition to be satisfied between child nodes, and graft information. Examples of the logical condition include 'AND', 'OR' and 'ALL'. The above 'All' is defined as a logic to Eval 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 logical operator, or an SP expression that indicates a specific action, and when it is linked with other S/W packages or tools such as statistics or math software packages, it may be a function name of the package or tool.
  • Below the second element is composed of one or more Arguments such as STPN or STPN Template to indicate the target and value of the corresponding operation or action or to store the result value.
  • Lists can also be nested.
  • Examples of typical SPs indicating the behavior used in the Eval Expression in the List form include 'Assert', 'Return_to', 'Go_to', 'Exit', 'End', 'Set_as', 'Put_in', 'Take_next', ' Take_nth', 'Wait', etc.
  • Eval of List the corresponding operation or instruction is directly executed.
  • the 'Rule_generate' is an operation to create a Rule, and the Rule is created by composing Rule SHRUB as follows: (The properties of each Rule Node are expressed with braces, and the comment is a parenthesis. ) will be described in
  • Root Node ⁇ Attribute Call condition of the Rule; STPN or STEM of the node including information to be provided for Rule execution; Number of node variables to be substituted and node variable expression, or specific PLANT name; Return method of Rule execution result (return means, presentation method and format, STPN or PLANT name that stores the value to be returned (including List, Table, etc.)); Each Eval Expression when visiting the node's own Preorder, Inorder, and Post Order); Graft information; Expression of description of execution contents when executing Rule ⁇
  • Step 2 LHS Node and its Children Nodes ⁇ attributes: the type of the node itself (refer to the type of Rule SHRUB Node above); Each Eval Expression when visiting the node's own Preorder, Inorder, and Post Order (Includes Eval conditions (AND, OR, ALL, etc.) of child nodes, but only Preorder Eval Expression exists if there are no child nodes); 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 node itself; Each Eval Expression when visiting the node's own Preorder, Inorder, and Post Order (Includes Eval conditions (AND, OR, ALL, etc.) of child nodes, but only Preorder Eval Expression exists if there are no child nodes); number of child nodes; names of child nodes; number and type; Eval condition of child nodes (AND, OR, ALL); Graft information ⁇ ⁇
  • substitution information of variable nodes Assert of Instantiate Fact (712), reporting method of execution result (form and content, means (monitor, Smart Phone, Alarm)), Loop command (Return_to, Go_to, Local_Fact_Assert)), the end of the Local Loop (Exit), the determination of the next visited child node, and an end condition and end command (END) of Rule execution (713).
  • Eval Expression expression of Rule Node includes '?task', '?facility', '?resource', '?time' or '?day' for flexible matching with asserted facts or general use of rules.
  • Wildcard expressions such as '&' that can match 'Variable Name Node' expressions, one arbitrary node expression, or '*' that can match one or more Node Names, or '/ It can include Path ellipsis such as ../'.
  • the 'Rule_invoke' is an operation called to execute the Rule.
  • the Rule is a 'Time Driven Invoke' that is called when a certain time arrives or an interval of a certain time, 'Event Driven Invoke' that is called when an event occurs, and the cause is identified. It is called in the same way as 'Goal Driven Invoke' for calling.
  • the 'Event Driven' is also called 'Fact Driven' or 'Data Driven' and mainly uses a Forward Reasoning method
  • 'Goal Driven' is also called 'Object Driven', and is mainly inferred by a Backward Reasoning method.
  • the SWEEP goal management technique is based on the 'Time Driven' method in which most of the duties or platform tasks to be performed are continuously and repeatedly performed according to the time or time interval set for each task or task. Facts are processed in the 'Event Driven' or 'Goal Driven' way at the time of occurrence.
  • the 'Rule_execute' is an operation of 'executing' the Rule by sequentially visiting each Rule SHRUB Node of the invoked Rule from the Root Node and 'Eval'.
  • Rule execution is mainly for the performance of basic tasks or functions of the platform, the processing of the goal management tasks to be repeatedly processed regularly or continuously and continuously at a specific time, and the execution of the PM's instructions or tasks given by the PM. , It is intended to handle inquiries, requests, suggestions, mutual information and opinions exchanges and consultations from project/task-related persons, and to handle events or risks that occur frequently.
  • the Timer Rule may be set to be called when a time when a specific condition is satisfied arrives.
  • the platform presents the basic Skeleton and Template Rules of the Super Tree composed for each field and characteristic. support operation.
  • a 'Project Manager Agent' in charge of the function 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 soon as it is created. .
  • the 'Knowledge-base Manager Agent' manages the generation, update, and invocation of rules, and supports other agents to execute the rules and perform their duties.
  • the Knowledge-base Manager Agent supplies STPN and STEM that are the relevant Template Rule and Rule specific execution environment (Execution Context) in Rule BDT and calls it. It supports one Agent to instantiate and execute the relevant Template Rule.
  • Each Agent sequentially visits from the Root Node of the called Rule and executes the Rule according to the result of Eval while evading the ‘Eval_Expression’ of the visited Rule Node.
  • Visiting Rule Node is based on Eval by visiting the Rule SHRUB in the order of Depth First Search (DFS). Agent calls the node currently visiting for Eval as 'Present Eval Node' (PEN).
  • Eval result of the 'Eval Expression' examples include True/False or Y/N return, operation execution, situation determination, Fact Assert, and Physical or Abstract action to be performed with Eval Expression. .
  • the generation, invocation, and execution of rules have been described above, and the ‘Rule Generation Rule’ is configured to support the creation and input of rules.
  • the rules that perform basic tasks and functions of the platform or process various expected events are implemented together by a platform construction engineer and an expert in the relevant field when building the platform according to the characteristics of the project/task.
  • the rules for executing the instructions and requests of PMs or other managers in the task execution process are based on the STEMs created with 'ORE Generation BDT' using the 'STEM' Generation Rule. Configure interactively.
  • the rules to be created are divided and subdivided by the application purpose, field or type of the rule, or by the agent in charge of calling and executing the rule, and grafted to the node of the corresponding Rule name of 'Rule BDT' and subdivided.
  • BDT' is grafted to 'Rule BDT Node' composed of child nodes of 'Platform and Super Tree Management Node' of STUMP. .
  • the composing Rule is implemented as a Template Rule including variable node expression for general use.
  • the 'Eval Expression' of the conditional node for the execution of the Rule becomes like (EQ ?task//?day//Daily_progress_state 'Delay') (710).
  • the Eval Expression includes node variables '?task' and '?day', '?day' is replaced with the IVY Node Number of the day, and all tasks of Task BDT are searched depth first (DFS). ) method and replacing '?task' with the actual Task Node Name, the STPN is instantiated as 'Task-i//kth_day//Daily_progress_state', and 'Return_to Root' operation (712) Return to the Root and start executing the Rule again.
  • the Root Node 701 has a Top LHS Node 702 and a Top RHS Node 703, and both the LHS Node and the RHS Node may have any number of child nodes, and each Nodes, that is, 'Rule SHRUB Node' have the number of their child nodes and 'Eval' method or condition as NAS attribute values, and the Root Node and each Rule SHRUB Node attribute and Eval Expression include STPN and STEM information. It is possible to represent and utilize the execution environment (Context) of the Rule, 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 a Template Rule to increase the versatility of the Rule. It is defined as a 'Super Rule' to improve the rules and to configure the rules so that they can be repeatedly executed by themselves.
  • Super Rule can include LHS and RHS repeatedly in both LHS and RHS, and Rule execution proceeds from left to right in the DFS method.
  • 'Return_to Root' operation in Node's Eval Expression it is possible to compose a loop that re-executes a Rule, and forms a local loop within the Rule by using 'Loacal Fact Assert' or 'Go_to' operation or any position It can be executed by moving to , and if the 'WAIT' Eval Expression is used when visiting a specific node in order, the execution of the rule is temporarily stopped at that location and the child LHS node waits until the fact included as a condition is asserted. If the 'Eval Expression' is 'END', the execution of the Rule is forcibly terminated at the corresponding position, and it is automatically terminated when it returns to the Root by Evaling to the Rightmost Node.
  • 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 or It can be modified or updated, and accordingly, by subdividing and modularizing the reasoning and inference behavior for the execution of high abstraction level tasks, instructions, requests, and platform functions into a 'Divide and Conquer' strategy, All Nodes in Super Rule, Internal Rule, or Grafted Rule share common context information and allow consistent and focused reasoning to proceed. Segmentation and modularization are possible up to the level of each node, and the reasoning or judgment process and content can be freely adjusted or modified with Insert and Delete of nodes.
  • 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 through the STPN.
  • Nodes that store information can be added by utilizing existing nodes or creating new nodes. For information that is used temporarily or temporarily, or necessary information, prune or degraft the nodes after use, and prune or degraft the nodes after use. Nodes whose direct or indirect paths with ROOT are cut perform garbage collection to reclaim memory.
  • 'Dynamic Pruning' the Instantiated Rule
  • the Super Rule is, as a whole, in the field of various projects/tasks to set and achieve goals, Investigation or Search and Confirmation of one or more specific information through reasoning (Inference or Reasoning), progress management, monitoring of the situation, creation of information, estimation, comparison, judgment or decision of the situation, analysis, prediction or forecast, explanation (Explanation), report (Report) and presentation (Display), strategy establishment (Strategy), request (Request), recommendation (Recommend), and necessary measures (Measure) or action (Perform) directly or indirectly (Perform) such as It enables actions to be expressed and executed as a Rule, and to explain the reason for inferring a specific action using the path or process of inference.
  • reasoning Inference or Reasoning
  • Progress Management monitoring of the situation, creation of information, estimation, comparison, judgment or decision of the situation, analysis, prediction or forecast, explanation (Explanation), report (Report) and presentation (Display), strategy establishment (Strategy), request (Request), recommendation (Recommend), and necessary measures (Me
  • the Super Tree is constituted so that all information necessary for the invocation and execution of Rue is included in the Super Tree, and all new and significant information among the information obtained as a result of Rule execution is the context of the relevant information within the Super Tree. Node is added and stored in a suitable location in the . Therefore, the learning effect of growing the Super Tree as a BOGMKI, a collection of knowledge and information, is achieved.
  • the configuration method of the above-mentioned Super Rule allows the instructions of the High Abstraction Level to be directly issued to the platform, assigned as a task, or requested as a service. Accordingly, unlike the conventional unilateral menu provision method (Paradigm), where the path and function of menus and sub-menu must be read and used one by one for the search or function of information desired by the PM or other project related parties, the PM provides the platform with SWEEP goal management is possible by giving desired instructions, assigning tasks or tasks, and other managers directly requesting necessary matters from the platform, enabling continuous precise management even when there are countless tasks to be performed and managed at the same time. Support to enable the application of the technique.
  • the I/O service providing method that supports the direct issuing or requesting of high abstraction level instructions, commands or requests to the platform is referred to as 'Proactive And Smart Service' (PASS). )) method.
  • PASS 'Proactive And Smart Service'
  • the goal management platform of the present invention uses the Super Tree as BOGMKI (Body Of Goal Management Knowledge and Information), which is a collection of all information and knowledge required in the entire process of project/task goal management.
  • BOGMKI Body Of Goal Management Knowledge and Information
  • Organized and configured Super Tree is intelligently autonomously and actively utilized based on Super Rule, systematically classified and subdivided, and task (Work, Work Package, or Activity) of all levels to be performed to achieve the goal ), the target management action (referred to as the 'Platform Task') that monitors and manages progress and progress is continuously and repeatedly performed according to the selected time precision.
  • the target management action referred to as the 'Platform Task'
  • additional information or knowledge required by the platform is continuously collected, randomly occurring events or risks are predicted and dealt with early, and the response result information is added as a node of the Super Tree as experience.
  • SWEEP Successessive Work and Event Evaluation and Proceeding
  • All 'Platform Task' is implemented as a Rule to express its details explicitly, and it is executed by executing the Rule, and all information necessary for goal management and any information that is generated in the goal management process and needs to be stored All information is stored and utilized as nodes of the Super Tree.
  • 'Project Manager Agent' is created in the form of Thread or Process.
  • the Project Manager Agent is responsible for and supporting each functional area of the platform as soon as it is created, 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 calls and executes the ' Project/Task Initiation Rule' and presents the 'Basic Information Input Window' where basic information related to Project/Task can be input, the name and contents of the Project/Task , final goal, ' final deliverable or state (collectively 'Deliverable'), performing entity or owner, Project Manager (PM) or general manager (collectively 'PM'), execution period, overall budget and 'Project/Task Charter SHRUB' 211 is configured by receiving all basic information such as location and input from the PM.
  • Additional basic information is requested and received according to the characteristics of the project/task. 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), the scope of the project and related regulations. Target deadline can be mentioned, and in the case of energy management task, energy use baseline and calculation basis for each energy to be reduced, routine and non-routine adjustment items, and energy savings calculation method can be mentioned. In the case of power system operation and management task, target power supply reserve ratio, frequency change rate, and voltage change rate are mentioned. In the case of computer operation management task, average response time, virus infection prevention or hacking protection and One example is the goal of maintaining the same security.
  • the input window contains expressions such as 'What can I do for you?' and 'Please input your order or request.' Allows you to freely enter instructions or requests, and automatically completes the rest of the drop-down menus such as 'Create New Project/Task' and 'Continue Project/Task (Name)' when entering some text. Provides input support service. According to the name and field of the Project/Task to build an intelligent autonomous goal management system, Gyan-Woo who will give the 'Create New Project/Task' instruction, the template of the 'Project/Task Charter SHRUB' in the relevant field, which is pre-configured by field, is the root.
  • ⁇ is presented in a vertical or horizontal tree structure, and provides a GUI for selecting, adding, or deleting nodes.
  • a specific node is selected with a mouse, the corresponding node value is directly input or a template of 'Node Attribute SHRUB' (NAS) is presented so that it can be entered as an attribute value.
  • NAS 'Node Attribute SHRUB'
  • Name 'Continue Project/Task
  • the Super Tree stored in DB, Spread Sheet, or XML File is read and the previous target management progress context or environment is restored.
  • the input window may also receive a verbal input of a simple expression.
  • the 'Detailed Information Collection and Super Tree Constructing Stage' ( S101) is entered.
  • the Sper Tree Manager Agent is a Super Tree for goal management in the selected Project/Task field from among the skeletons of the Super Tree for each Project/Task field that the platform builder has configured and saved with the help of experts in each field. Select and present Skeleton of
  • the Skeleton of the Super Tree presented above when implementing the Framework of the Platform in the relevant Project/Task field, the Platform Implementation Engineer and the experts in the relevant field provide typical basic data related to the Project/Task execution, processed data information, and the relationship between information , Expertise, Know-how, Expertise, and Method are collected to compose various PLANTs, and these PLANTs are grafted according to their interrelationships.
  • the PM cooperates with the Platform, and configures a detailed Super Tree for project/task goal management by modifying or customizing in detail according to the management policy that sets the proposed skeleton and the task execution strategy.
  • the PM starts the detailed configuration of STUMP, which is the basic framework of Super Tree, together with the Platform.
  • the 'Project/Task Charter SHRUB' (211) and the entire Project/Task execution period are set in the ROOT Node, which is the root node of the Super Tree and the root node of the STUMP at the same time, in Unit Time. ) by dividing (Default is 'Day'), 'Master Calendar_mapped Progress Management IVY' (212) is created and grafted to monitor and manage the progress of goal management by connecting it to a series of nodes.
  • each PLANT such as NAS, BDT, IVY, VINE, BUSH, and SHRUB are constructed using the Skeleton of the Super Tree and the templates of the PLANTs provided and Grafted to compose the Super Tree.
  • the composition and graft of each PLANT provides a graphic input GUI such as creating a node and connecting it by dragging with a mouse, and supports not only individual nodes but also all or part of the PLANTs, connected or grafted by selecting and dragging.
  • VINE configuration a typical basic configuration frame or skeleton is presented for each type of VINE according to the characteristics of the Project/Task.
  • the symbols of each facility and device node are provided as a menu, and if the PM or manager in charge connects or replaces them by dragging them, the nodes and arcs of the VINE are created and configured.
  • Schematic Drawing and Physical Layout Drawing are also composed at the same time.
  • the default property information of the relevant equipment 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 received through other servers or the Internet.
  • the event propagation information includes events that are automatically spread according to the configuration of the interlock logic of the corresponding facility when a specific event occurs.
  • the configuration of the VINE like the configuration of other PLANTs, is implemented as a rule to express its contents explicitly and to allow free modification and update.
  • the 'control logic information' of the entire process or system or each facility is stored by composing a VINE representing the corresponding control logic circuit, directly to the process, system or facility node, or by grafting it to the control logic property node of the NAS.
  • the 'Task Scheduling Stage' (S103) is entered.
  • the Progress Manager Agent sends the entire 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).
  • 'Tasks' are classified hierarchically/sequentially by field or division, subdivided, presented Task BDT, and asked the PM to select the desired Task Node.
  • ‘Baseline Progress Management IVY’ is presented, which indicates the ‘Baseline Duration’ of the task that is pre-configured and grafted to the corresponding Task Node.
  • Each node of IVY that is, the standard unit time, defaults to 'Day' and will be described below based on 'Day'.
  • the selection of the standard unit time can be selected differently depending on the characteristics of the project/task, and each IVY node is developed into sub-detail IVY nodes represented by the detailed unit time 'Hour', 'Minute' and 'Second' nodes as needed. (Expand) is possible, and IVY composed of expanded nodes is grafted to the corresponding parent node.
  • the entire 'Day' Node IVY is assembled into 'Week', 'Month', 'Quarter', and 'Year' nodes, which are the upper unit time, to form a shortened IVY, and the shortened IVY start node (Start It can also be grafted to Node).
  • IVYs There are two types of IVYs: 'Net Baseline Progress Management IVY' and 'Calendar-mapped Baseline Progress Management IVY'.
  • the PM Scheduling Engineer
  • each Qualified Task Manager You can choose. According to the characteristics of the task, first establish the task progress plan with 'Net Baseline Progress Management IVY', then set the work policy for weekends and holidays, and then develop the 'Calendar-mapped Baseline Progress Management IVY' based on the schedule calendar date. Alternatively, you can create a progress plan with 'Calendar-mapped Baseline Progress Management IVY' after designating a start date on the calendar from the beginning.
  • mapping to the calendar includes 'Forward Mapping', 'Reverse Mapping' and 'Bi- There are three methods of 'directional mapping'. When the task is continuously performed without weekends or holidays, the lengths of the two IVYs are the same. In addition to the 'Self Node Number' (412), each node of 'Calendar Mapped Baseline Progress Management IVY' indicates the number of days elapsed from the start date of the entire project and sets the 'Project Node Number', the Node Number of Master Progress Management IVY, as an attribute value. (413)
  • the IVYs are presented in the form of a Gantt Chart in which each node is represented by successive quadrilateral nodes on a chart with the entire project/task execution period as a horizontal axis, or in the form of a chain in which each node is represented by a small circle.
  • the horizontal axis represents pure period/time
  • the horizontal axis represents the calendar period along with the date, day of the week and holidays.
  • the target period or deadline for completion is the Baseline Duration.
  • the Baseline Duration In the case of the factory's annual production target achievement task, one year becomes the baseline duration.
  • each fiscal year or quarter can be set as the Baseline Duration, and if a separate period or deadline is not set, the period judged to be appropriate in consideration of exceptions (Contingency) that may occur during the execution of the project/task is the Baseline Set to Duration.
  • the Baseline Duration can be set for each session in the case of PC operation, from the start time of preparation to the end time of the main match in the case of game or sports management, and from the start date to the end date of each semester in the case of educational goal management.
  • a graph for creating and inputting a progress schedule with the horizontal axis as period or time and the vertical axis as progress value is presented together with the elapsed time of the Baseline Duration of the selected task. That is, the 'Task Finish Point' is indicated at the position where the Progress Value becomes 100% in the Last Node of 'Net Baseline Progress Management IVY'.
  • the 'unit time baseline progress plan value' and the 'unit time baseline cumulative progress plan value' are respectively calculated.
  • the calculation of the progress plan value is set by batch calculation in a top-down method using the S-Curve function (Sigmoid function) or Linear function, or by receiving input from a separate file such as a Spread Sheet.
  • S-Curve function Sigmoid function
  • Linear function a separate file
  • each detailed task is assigned a weight value that makes the total sum to 1 according to its importance, and the progress plan value of each detailed task is assigned to the detailed task.
  • the progress plan value of the upper task is calculated as the sum of the values multiplied by the assigned weight value.
  • the quantity or state of completion of the deliverables corresponding to the progress value of each task (hereinafter collectively referred to as the 'completed value') and the corresponding progress value, and the quality or ability ( It is performed as a Rule to specify and indicate in detail the conversion between the input quantities (quantity) of each resource (Capability), capacity (Capacity) or efficiency (Efficiency), and the content and method of conversion.
  • the detailed progress value of the task is calculated from the quantitative value of the progress of each deliverable. Accordingly, in principle, the subjective judgment and input of the task manager is excluded from the progress value calculation and objectivity is maintained so that the platform can autonomously or actively perform task execution plan establishment and progress management.
  • 'Power facility' is an example of the main detailed deliverable among the completed power plant deliverables, and again, 'main transformer installation and completion status' is taken as one of the detailed deliverables of the power facility deliverable as an example can
  • the 'peripheral voltage installation and completion status' Deliverable can be completed by performing the 'peripheral voltage installation construction' task as in the example of the above-described Task BDT, and the 'peripheral voltage installation construction' task is the basic design ( When Basic Design) is completed, it can be started, and subdivided into 'Survey', 'Excavation', 'Formwork', 'Rebar', 'Anchoring', 'Concrete', 'Concrete Curing'
  • a series of detailed tasks such as 'TR body installation', 'Conservator and Bushing assembly', 'Nitrogen filling and oil filling', 'Cabling', 'Instrumentation and Control Wiring', 'Test and Commissioning' that can be performed after transport or Work, Work Package, or Activities (collectively referred to as 'detailed task'), and the completed product or state of completion obtained as a result of performing each of the subdivided detailed tasks corresponds to 100% of the deliverable progress of the task, and , the progress of the upper task is calculated by quantitatively transforming the progress of the detailed task from the quantitative progress value of each deliverable, and combining the weighted progress of the detailed tasks calculated by the progress of each subdivided task and the assigned weight. Calculate.
  • each detailed Resource Node of Resource BDT which is composed by classifying and subdividing the required resources by type or division according to the characteristics of the Project/Task, the quantity and cost information of the deliverables that can be created for each input unit of the corresponding resource (quantity) and cost information and Save the STPN of the tasks that require the resource as attribute information, and graft the 'Supply Management IVY' of the resource.
  • the contract, transport, warehousing, delivery, and inventory status of the corresponding resource, and the procurement status such as the planned input amount and cost for each input task, and the actual input amount and cost are stored as attributes.
  • the NAS node that stores the input plan amount information for each input target task of the 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 specific of the corresponding input target task
  • the NAS node that stores the input schedule information of the corresponding resource of the job has a 'Task Oriented STPN' where the Task Name Node is higher in the Path than the Resource Name Node, and both nodes have the same value, thereby becoming a mutual alias,
  • the value input to one node is automatically set as the value of another alias at the same time.
  • the amount of each type of resources to be put in to achieve the 'unit-time Baseline Deliverable completion plan' of each deliverable and the cost are calculated based on the Cost Estimation Standard information.
  • the POM information is subdivided by types of deliverables to construct, store, and utilize 'PomSum BDT' including information on the amount and cost of resources to be input to complete the unit deliverable.
  • 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 input to perform a project/task for target management.
  • Typical resource types include manpower, material, equipment, energy, facility, and time.
  • the information related to each unit time is stored in the NAS of the corresponding IVY Node, and the information related to the entire period is stored as attributes in the NAS of the Root Node of the IVY and the NAS of the corresponding Task Node.
  • the corresponding preparation time and resources can be quantitatively calculated and considered as part of the deliverable and included in the progress of the deliverable.
  • the progress corresponding to the preparatory work is rolled back to 0 and the resources invested in the preparatory work are regarded as loss.
  • Examples of basic major resources required for project/task progress include manpower, budget, and time.
  • the production management task of the Smart Factory it can be the amount of production that satisfies the quality standards and cost for the target period for each product, and in the case of the energy management task, , energy, energy supply facilities, energy use facilities and space, and in the case of computer operation and management tasks, Processor, Memory, Hard Disk, Peripherals, File, Process, and network facilities.
  • the corresponding cumulative completion A separate name and serial number are given to the planned quantity, and this is called 'Milestone'. Therefore, each Milestone has a corresponding progress value, and therefore, if the progress is accelerated or delayed, the location of each Milestone is moved back and forth accordingly to change the corresponding Milestone Node, which is called 'Milestone Sliding'. Also, in the Progress Management IVYs of each task, the node whose progress value corresponds to a specific Milestone is called the 'Milestone Node' of the corresponding Milestone.
  • a technique of incrementing or decrementing the length of IVY and searching for an optimal duration is called a 'GRACE' (Gradual Resource Allocation and Cost Evaluation) discovery technique.
  • the 'unit time actual resource input plan' considering the actual input unit of each resource to be input, the PM or other managers Decide together with the company or execute the Rule to make autonomous decisions and present the decision to the PM or other managers. For example, if the input resource is manpower, even if the baseline input amount is calculated as a real number including a decimal point, if the actual input unit should be an integer Man-day, use the Man-day integer value with the decimal point raised as 'Unit Time Actual Resource Input'. determine the 'planned amount'.
  • the 'unit time deliverable actual completion target plan' is calculated by inversely calculating the deliverable in unit time with the '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 delivery progress goal 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 cumulative plan value’.
  • the point at which the 'accumulated plan value of unit time execution progress' becomes 100% is the 'Execution Goal Duration' of the corresponding task.
  • a Progress Management IVY fixed to the Baseline Duration length is created, and a 'B' mark is placed at the Last Node position to indicate the Baseline Duration (420).
  • 'E' is displayed on the corresponding node of the Progress Management IVY to indicate that it is the Last Node of the Execution Goal Duration (421).
  • the 'E' node 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, and it is used in the 'Task Internal Buffer' (422) of the corresponding task. ) is called
  • the Anticipated Completion Duration is continuously calculated based on the progress of the task, and an 'A' is marked on the node at the corresponding location to indicate that it is the Last Node of the Anticipated Completion Duration (423).
  • 'R' is marked on the Last Node of the Real Completion Duration to indicate that it is the Last Node of the Real Completion Duration.
  • the position of the 'A' node may be continuously changed according to the progress of the task during the task execution process, and if the completion period of the corresponding task is expected to be delayed, it may be displayed by extending the IVY behind the 'B' node, and once the task , the 'Task Internal Buffer' becomes a spare or delay period between the 'B' node and the 'A' node.
  • the four Duration Marks displayed at the end of Progress Management IVY of each task are called 'BEAR' Marks (424) possessed by the IVY, and are stored as attributes of the corresponding Node, and the base period and execution goal of each task Period, expected completion period and actual completion period.
  • the precedence/successor relationship between tasks is set as a graft between nodes corresponding to the Milestone progress of Progress Management IVY of the tasks, that is, between the Milestone Nodes.
  • the predecessor/successor relationship between tasks is a normal Finish-to-Start Graft that grafts the Last Node of the preceding IVY to the Start Node of the subsequent IVY, and transfers a specific Milestone Node after the Start Node of the preceding IVY to the Last Node of the subsequent IVY
  • a Start-to-Finish Graft that is grafted to a specific Milestone Node in the subsequent relationship of a Start-to-Start Graft that is grafted to a specific Milestone Node after the Start Node of the preceding IVY to the Start Node of the subsequent IVY, and the Last of the preceding IVY
  • each IVY may have one or more antecedent/successor relationships among four antecedents or four subsequent relationships in antecedent/successor relationships with other IVYs, and may also have antecedent/successor relationships with one or more other IVYs.
  • Each of the preceding/following grafts has a buffer period equal to the unit time obtained by subtracting 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, and the same Regarding the buffer, it is called 'Feeding Buffer' from the position or point of view of the preceding task, and it is called 'Receiving Buffer' from the position or point of view of the subsequent task.
  • Each of the above buffers is managed in two types: a 'Net Buffer' indicating a net spare period and a 'Calendar Buffer' indicating the date and period of a specific calendar at the same time.
  • the length of 'Calendar Buffer' is the same as or longer than that of 'Net Buffer' according to work or work policy on weekends and holidays.
  • the preceding task is called ‘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 becomes the Critical Path over the entire execution period of Project/Task.
  • 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 is advanced by the length of the shortest 'Task Receiving Buffer'.
  • 'Early Start' is possible. Even when 'Early Start' is possible, if there is a Milestone with a length of 0 in the Receiving Buffer, if the Milestone of the corresponding preceding task cannot be advanced, 'Early Finish' cannot be reached.
  • the antecedent/subsequent relationship between each task of Task BDT is, in the case of Plant EPC Project or Factory Production Management Task, material procurement tasks for the supply of materials, parts, or raw materials that can reach hundreds to thousands or more, and construction or production It can also be formed between the nodes of Progress Management IVY and Operation Management IVY of tasks, and can be used for smooth material procurement management.
  • the production management task when starting/stopping the main process or supporting system, it is also set between Operation Management IVYs of each facility or system to proceed with the startup sequence that requires multiple devices and systems to be operated sequentially and simultaneously. Therefore, it can be used to manage the appropriate Leading Time and to monitor whether the startup sequence is proceeding normally.
  • the Task Schedule establishes the detailed task or activity level (Level) selected from among the task nodes of TASK BDT according to the characteristics and scale of the project/task.
  • the optimal IBT Invitation to Bid
  • RFP Request for Proposal
  • the optimal IBT Invitation to Bid
  • RFP Request for Proposal
  • Engineering and Construction It can also be used to calculate the appropriate bid amount considering the resources and costs that companies can mobilize for a specific IBT or RFP, review whether to bid, and prepare a proposal.
  • the fourth stage is entered and the goal of the Project/Task Start management and proceed.
  • the ultimate purpose of all Project/Task goal management is to achieve the set goal as a plan or higher performance. Therefore, the core of all goal management activities (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
  • the method of performing each task is mainly explained by progress management in the Plant EPC Project or Smart Factory production management task.
  • the degree of PM's involvement in progress management and the level of platform autonomy are Project/ It can be tuned 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.
  • the method and principle of progress management described 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 compared to the plan is called the ‘progress rate’.
  • the platform tells the managers in charge of the task the planned amount of resources required to implement the task's execution schedule, and the corresponding deliverable estimate. Present the completion amount and progress and the expected progress of the corresponding task, and request input of the 'actual input plan resource amount' that has been secured and put in at the start of the unit time and the 'expected deliverable completion amount' that is expected to be completed to receive the input and receive confirmation from the upper-level manager of the car.
  • the platform separately calculates the 'Estimated Deliverable Completion Volume' with the 'Actual Input Plan Resource Amount' input by itself using the part count information stored in the 'Cost Estimation Standard BDT', and calculates the 'Estimated Deliverable' input by the task managers. Comparison with 'Complete'. If the difference between the two estimates is large, discuss the need for adjustment of the POM information, including the temporary adjustment of the premium rate, with the managers. In the case of an agreement to adjust, the relevant POM information is corrected, and the revision history including the 'application period' of the modified POM is recorded as an attribute of the node storing the POM information.
  • the 'application period' may be temporary or it may be the entire remaining execution period of the task, and the platform uses the adjusted 'Execution Schedule' values of all the 'Execution Schedule' values of the unit time nodes of Progress Management IVY during the application period. It is recalculated and presented to the managers for consent. If the manager agrees, the length of IVY, the location of the Milestone, and the change in buffer size with the preceding/following related tasks are presented and confirmed to the managers including the PM.
  • the estimation of the expected progress for a specific unit time as described above is called ‘Unit Time Progress Forecast’, and the estimation of the expected progress of the entire task is called ‘Task Progress Forecast’.
  • An 'A' is marked at the IVY node position of the task expected completion period determined according to the Task Progress Forecast to indicate that it is the last node of the Anticipated Completion Duration (423).
  • the platform continuously collects all information necessary and collectable for goal management from sensors, measuring instruments, cameras, other servers, the Internet and IOT, and monitors and manages the progress and progress of tasks.
  • the information collection includes inputs received by requesting from PMs or other managers if necessary.
  • all events that may occur in each task are sorted by type or type. Classify by type to compose 'Event and Risk BDT' for each task and graft it to the 'Event Management Node' of NAS for each task.
  • Each event is divided into Positive Event, Negative Event, and Neutral Event according to the effect on goal achievement. If not specified, it means a negative event as default. Among the negative events, an event with a particularly large impact is called a risk.
  • Positive Events include, for example, early achievement of a specific target milestone, the ability of real manpower to be more efficient and skilled than standard product counting, and a reduction in raw material prices.
  • Neutral Event means an event that does not particularly affect the progress or progress of a task.
  • the node with the name of the rule that stores the 'event management procedure' information to cope with the event is grafted to the node with the name of each event of the Event and Risk BDT grafted to the NAS of each task.
  • Configure Rule BDT so that Alias Node exists, and Graft Template Rule that can perform 'event management procedure' of the corresponding event on the Alias Node.
  • the 'event management procedure' information includes 'anticipation', 'detection', 'assessment and countermeasure establishment', 'action', 'result review' ( follow-up) and information for management in five processes of 'Learning' are included, and the five processes are called 'Eveny And Risk (EAR) Handling Process'.
  • the EAR Handling Process is implemented as a Rule to explicitly indicate its contents and to freely update or modify it.
  • the possibility of the occurrence of the corresponding event is checked, and in the case of an important event, the probability of occurrence of the corresponding event is calculated.
  • An example of calculating the probability of occurrence of an event is periodically calculating it using the Weibull distribution, which is a multi-parameter probability distribution that can include various distribution types. Distribution parameters such as Characteristic Life and Shape parameters are calculated using MLE (Maximum Likelihood Estimate) and Newton-Raphson Method, and for periodic calculation, a small number of data, time data for which an event does not occur, or Suspended Data and Censored Data, which are data whose collection is stopped at any time, are also included in MLE for calculation.
  • the frequency of event occurrence can be estimated through Poisson Arrival analysis. When the probability or possibility of a specific event exceeds a certain level, the PM and the corresponding task managers are notified, and the rest of the EAR Handling Process is continued.
  • the information input means for monitoring and discovering the corresponding event is specified.
  • 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 a person in charge.
  • the 'Detect' process when a specific variable value is set as an information input means for monitoring a corresponding event, the corresponding fact is asserted, the occurrence of the corresponding event is confirmed as a responsible rule, and the subsequent management procedure is entered.
  • the established measures are implemented, and in the 'Follow-up and Learning', the event response result is evaluated, statistics such as the frequency of occurrence are calculated, and the event processing process and results are shared with the relevant Super Tree's PLANTs. It is stored in PLANT Nodes to accumulate and learn as experiences.
  • an 'Event Monitoring And Recording Table (EMART)' is configured, and the Root Node is grafted to the Root Node of the Master Event BDT.
  • the EAR Handling Process will be explained mainly with the 'progress delay event', which is an important event in goal management of most projects/tasks.
  • a typical cause of delay is the lack of resource input in terms of quantity or quality, including manpower.
  • the occurrence of events such as power outages, major equipment failures, line stoppages, and bad weather also spreads as an event of insufficient resource input and causes a delay in progress.
  • the expected completion amount of deliverables at the end of the current unit time is compared with the planned amount, and if there is a difference by more than a significant level, the 'progress delay of the task' at that point Assert the 'event occurrence' (Anticipation) situation as a fact and enter the EAR Handling Process.
  • 'Event Chain' a series of events that ripple and occur
  • Event Chain Method has been proposed and used as the main method for coping with it.
  • the 'EAT (Event Absorbing Tactic)' event absorption strategy is used to absorb the ripple situation as early as possible or defend before a specific Milestone point so that the chain itself is not formed when an event occurs. do.
  • the progress rate of the task is calculated.
  • the achievement or performance status at the time of completion of the task is called 'Task Total Deliverable'
  • the achievement or performance status corresponding to each unit time is called 'Unit Time Deliverable'
  • the cumulative performance up to each unit time is called 'Unit Time Deliverable'.
  • the performance status is called 'Cumulative Deliverable'
  • the performance compared to each plan is called the 'Progress Rate' of the deliverable.
  • the total, unit time, and cumulative progress of each task are expressed as the progress rate of the deliverables.
  • each weight is assigned and summed to calculate the progress rate of the entire deliverable.
  • the person in charge of each task or manager does not directly input the performance progress value through subjective judgment.
  • objective evidence such as video or specific status or quantity must also be specified and input, and the next high-level manager or Scheduling Engineer (also called ‘Scheduler’) should confirm the accuracy of the input.
  • the nodes including the present time are called the present nodes, and the nodes corresponding to the past time are called the past nodes.
  • a node corresponding to a future time is called a future node.
  • All IVYs include only one Present Node, and therefore, all of the Present Node, Past Node, and Future Node may be included in the lower detailed unit time IVY generated by developing the corresponding Present Node.
  • Current status monitoring and progress management information is stored as properties of Present Nodes.
  • the situation monitoring and progress management information stored as attribute information of Past Nodes is utilized for trend analysis, progress prediction, and event occurrence probability calculation in the current node, accumulated as experience, and learned.
  • An example of a method for predicting the probability of occurrence of an event is the use of the aforementioned Weibull distribution.
  • the progress status of each task is 'Fast', 'Normal', 'Delay', 'Delay-Hi' or 'Delay-Hi-Hi' ', and if it is judged to be more than 'Delay', the progress delay event of the corresponding task is detected, and the subsequent EAR Handling Process is entered.
  • a progress delay event of one task may lead to the occurrence of a progress delay event of subsequent tasks, and a chain of events is formed at this time.
  • a Template Rule that includes (EQ ?task//?day//?h//Progress_State 'Delay') in the LHS, ?day to 'Today', ?h is 'h11', ?Task is replaced with each task extracted by visiting Task BDT with DFS, and while determining the progress status by instantiate rule, reaching Task-A, the LHS condition (EQ Task-A// Today//h12//Progress_State 'Delay')) If the Eval result 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 delay in progress of all tasks is the lack of deliverable completion or completion status due to the occurrence of an Insufficient Supply event, which is the quantity or quality of input resources. Therefore, in the SWEEP technique that monitors the supply status of each resource regularly and continuously, the progress delay event of a specific task has already occurred as a follow-up event through Event Driven Reasoning at the time of occurrence of the event in which the resources to be put into the task are insufficient. Anticipation is expected.
  • the current unit time 'Day' Node (Default) is set to ' of the sub-detailed unit time'.
  • Hour' Node IVY it can be deployed continuously as 'Minute' Node IVY and 'Second Node IVY' to monitor and manage, and 'Degraft' the IVY after use.
  • the management unit time is mainly 'Day', and in the case of each task manager, 'Day' nodes can be deployed to manage 'Hour' as a unit time.
  • the possibility of recovering progress by increasing the input resource without extending the duration of the execution schedule of the task as much as possible is explored as follows.
  • the deliverable completion plan of ‘Next Unit Time’ is increased as much as the cumulative deliverable on the day of production or completion that is insufficient compared to the execution plan.
  • the resources to be added are increased by each input unit within the input possible range, and the amount of deliverable completion is increased until the corresponding task progress is recovered.
  • the calculation of the amount of resources to be input to additionally create or complete the deliverable amount is a resource BDT that is grafted on the NAS of each task and includes resource information required for the task, and an alias of each resource name of the resource BDT.
  • the information contained in the NAS of the Resource Node of the same name in the Master Resource BDT is utilized.
  • Each Resource Node of the Master Resource BDT has information related to the corresponding resource-related common information, product count information for resource input, quality assessment of resources, and a method of integrating resources in the NAS.
  • the deliverable progress may be 0% even if the auxiliary workers go to work, and the manpower of the auxiliary workers is dedicated If you don't, you lose everything.
  • the deliverable progress is determined to be 50%, and the manpower for the rest of the time is all are lost.
  • the resource is quantitatively input normally, if the quality deteriorates, the progress of deliverable may be delayed. Therefore, the appropriateness of the resource quality is evaluated by executing the 'Resource Quality Assessment' related rules.
  • '1-Unit-Time Recovery' If recovery is possible during the 'next unit time', that is, 1 unit time by incrementing the resources, it is called '1-Unit-Time Recovery', and an increase in the total cost is calculated. When calculating the cost, overhead and fixed costs are also taken into account. Next, the recovery period is incremented, the increase in resources is allocated to the incremental recovery period, and the total cost of '2 unit time recovery' is calculated. Comparing the cost required for the above '1 unit time recovery' and '2 unit time recovery', if the cost increases, return to the '1 unit time recovery' (Backtrack) and decide the '1 unit time recovery' plan as the progress recovery plan do.
  • the cost is calculated by continuously incrementing the recovery unit time one by one as long as the cost is reduced.
  • the previous unit time is determined as the progress recovery planning period, and the execution plan is executed with the additionally allocated resources and the increased unit time progress. It is established and confirmed by agreement with the PM and the corresponding task manager.
  • the unit time is continuously incremented until recovery is possible, and the resource is continuously incremented within the available input range.
  • the total cost is calculated, and the cost is calculated by continuously incrementing the unit time.
  • the previous unit time is determined as the progress recovery planning period, and the execution plan is executed with the additionally allocated resources and the increased unit time progress. It is established and confirmed by agreement with the PM and the corresponding task manager.
  • the 'impact' in the unit time node at the time of occurrence due to the progress delay event is 'spread' up to the minimum cost progress recovery unit time node and it can be considered as 'absorbed', It's called 'absorbing'.
  • the time until the first unit time to recover progress is a time that cannot be shortened any more, regardless of the reosurce or cost input at the present time, even if all possible means are mobilized and effort is made, and this is the 'absolutely shortest time required' (absolutely the shortest time required). Needed Time (ANT)).
  • the PM or the corresponding task manager may advance the minimum cost progress recovery period up to the maximum ANT.
  • the length of the 'Receiving Buffer' with the Milestones of the tasks preceding the current task starts to increment, and the length of the Buffer whose Receiving Buffer length was 0. Increment of the preceding task creates room for its progress up to the corresponding preceding Milestone, creating room for use as an Opportunity.
  • the resource is incremented or decremented as an input unit and '1 unit time'
  • the task execution plan period is shortened up to the unit time by searching for the unit time that maximizes the overall cost reduction, and the PM and the task manager are agreed upon and implemented.
  • the Milestones slide in the direction of the Early Unit Time node, the length of the Feeding Buffers is incremented, and the length of the Receiving Buffers is decremented. If a receiving buffer whose length is less than 0 is created, the progress of the preceding task cannot be accelerated so that the other Milestone can also slide to an earlier unit time node, the progress of the current task cannot be advanced any more.
  • the Milestone that is fixed on a specific calendar date and set as a Deadline is called a 'Deadline Milestone', and 'Milestone Sliding' that moves the corresponding Milestone backward is prevented from occurring.
  • 'Milestone Sliding' is subordinated to and determined.
  • the Progress Management IVY When the Progress Management IVY is displayed on the monitor, the location of the Milestones is displayed, the length of the buffers are also displayed in the form of IVY, and when the buffer length increases or decreases according to the progress delay, it is presented so that the increase or decrease in the number of nodes can be visually confirmed.
  • 'PASS' I/O service is provided.
  • the 'Schedule and Milestone Adjustment Record Table' (SMART) for each task is configured as a SHRUB and grafted to the Start Node of Progress Management IVY of the task to store and manage the adjustment history of all Schedules and Milestones.
  • the resources to be input are incremented or decremented in the input unit within the input possible range, and the progress recovery period unit time node is incremented or decremented accordingly.
  • the technique to search for the progress recovery period of the minimum cost in the state is called the 'Gradual Resource Allocation and Cost Evaluation' (GRACE) optimal period search technique.
  • the amount of deliverable or the increase and decrease of the progress corresponding to the desired task progress change, the increase and decrease of the amount of resources that must be input for the increase or decrease of the deliverable progress, and conversely, the increase and decrease of the amount of input resources, and the deliverable
  • the progress recovery process is implemented as a Super Rule, and the platform autonomously sets up a progress recovery plan to be able to perform All information necessary for all the above 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 opportunity along with coordination of the progress plan of the tasks in the preceding/following relationship with the corresponding task.
  • the GRACE technique is also utilized to discover and establish an execution plan for performing each task at the minimum cost for all tasks of Task BDT.
  • the amount of input available resources and the progress recovery period (Time) are set as constraints, and LP (Linear Programming), DP (Dynamic Programming), or Complementary Slackness
  • LP Linear Programming
  • DP Dynamic Programming
  • Complementary Slackness The optimal period can be explored by implementing the KT (Kuhn-Tucker) optimization technique that applies inequality constraints such as Condition as a Rule or linking it as a separate Tool Package.
  • the EAR Handling Process is entered at the time the event is discovered for events that need to be dealt with immediately after the situation occurs.
  • events that require immediate response are, for example, the interruption of major material procurement in Plant EPC management or the occurrence of a design change in major construction, delay in procurement of major facilities, interruption of raw material supply at the plant and suspension of major facility failures, and computer operation and management tasks. Examples such as excessive slowdown of computer speed or detection of virus intrusion and hacking attempts, loss or crisis of loss in sports supervision, and sharp decline in the stock price of investment stocks in stock investment task.
  • the attributes of each Day Node of IVY include the total amount of raw materials that are different from the production plan for the day, the starting stock on the same day, the input and ending stock on the same day, the raw material quality and loss rate, the expected exhaustion date, the order quantity on the same day, the intermediate order inspection, and the stock amount information. value, and the raw material node stores the price and price change forecast information of the raw material as an attribute value. It continuously checks the current inventory, order, and stock status at the start and end times of each unit time during production and at a certain time during the process to prevent the occurrence of an event to stop the supply of raw materials.
  • the GRACE technique is used to increment or decrement the purchase date and lot size and search.
  • STPN used as information used for discovery include '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.
  • the amount of input planned 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 'resource_p' inventory shortage event' can be discovered 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 the LHS.
  • the VINE indicating the process In a situation where the measured values of Flow and Pressure, which are the Operating State monitoring attribute nodes included in the NAS of the corresponding Pump Node of Detect).
  • the Node indicating the Motor Name that drives the corresponding Pump is an Alias and has a Node having the corresponding Motor Name in the VINE of the power supply system.
  • the PPN of the motor includes a circuit breaker (CB) node as a leading node, which is responsible for turning on and off the corresponding motor, and the secondary current of the breaker is determined from the state attribute value of the NAS of the breaker. 0, and it can be seen that the current position of the corresponding CB is in an open state.
  • CB circuit breaker
  • the coolant pump trips because the coolant tank level is Low-Low, which is the cause of the insufficient suction head. can be tracked.
  • the trip of the cooling water supply pump starts from the 'cooling water tank level Lo-Lo' alarm, and the trip relay of the cooling water supply pump is excited due to the closing of the contact of the corresponding limit switch, the breaker of the pump motor is opened and the pump trip It is also discovered as a process leading to a situation, making it possible to review the consistency of the situation that has occurred.
  • the reasoning that starts from the Pump Trip result and traces the cause proceeds with Backward Reasoning, and the reasoning that checks the resulting situations starting from Tank Level Lo-Lo proceeds with Forward Reasoning.
  • the above series of tracking processes and methods are implemented as a Template Super Rule, and are performed for the same purpose and context of tracking the cause of a specific pump trip, and can be similarly used for trip or alarm tracking of most pump equipment. All information necessary to execute the above rules is included in the Super Tree.
  • the event that has been confirmed to occur is recorded in the 'Event BDT' that is grafted on the NAS of the task, in the Event Table SHRUB that is grafted on the NAS occurrence history record node of the node of the corresponding event name, and the Root of the Master Event BDT. Collect and record in 'EMART' to be grafted on.
  • This platform also allows PMs to directly give high abstraction level instructions or assign tasks to the platform through the STEM configuration, and other managers and team members can also inquire, request information, and request support. , opinions and suggestions can also be entered directly on the keyboard, orally, or through a smart phone. Therefore, the method of use is fundamentally different from the conventional software systems and tools where users have to learn, find, and use the paths and functions of menus or submenu presented in a hierarchical structure.
  • frequently input instructions or requests are stored separately by composing the 'Frequent Order and Request Table' (FORT) and instructing the platform to implement even with keyboard input or verbal commands of shortened expressions such as 'F1' and 'F2'.
  • FORT 'Frequent Order and Request Table'
  • the PASS intelligent service method provided by the I/O Agent executing the dedicated rule autonomously performs the tasks assigned by the platform as a Platform Task in the process of Super Tree input and modification, task plan establishment and adjustment, and event processing. You can explain the execution process, and continuously report the rules that the Platform calls and executes, and confirms whether the Platform operates normally. In addition, by presenting nodes or various symbols representing each unit information, when PMs or other managers move, connect or separate nodes or symbols selected by the mouse to the desired location, the relationship between the corresponding information is automatically updated in the Super Tree. A GUI is also provided.
  • the Platform Task is a project/task such as delivery of instructions given by the 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 services to facilitate the flow of task progress.
  • the platform also supports facility operation for smooth goal achievement when facilities need to be operated for project/task execution. For example, in the case of a production plant, automatic control at every moment is usually handled by an automation system or SCADA (System Control and Data Acquisition), so the target management platform interworks with them to provide information necessary for target management at the required time interval. Collect and use The TAG of the collected measurement values is converted to the corresponding STPN and stored in the Super Tree.
  • SCADA System Control and Data Acquisition
  • An example of a typical high level abstraction level instruction given to the platform or a task or request expression given to the platform is '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 ⁇ '
  • ⁇ Bracelet ⁇ represents
  • the task performing step (Task Performing Stage) (S104) is completed, finally, the final step 'Project/Task Completing Stage' (S105) is performed.
  • the 'Project/Task completion stage' all deliverables that are actually completed for all levels of Task BDT are evaluated and confirmed by comparing them with the established goals and plans, and if there is a customer or owner separately Take over all Deliverables that need to be taken over, store and accumulate experience in the Super Tree as professional knowledge and methods for learning (learning), upgrade the Super Tree as Big Information, and perform similar tasks in the future.
  • an intelligent goal management system for Project/Task it enables to provide a platform with improved capabilities and ends goal management.
  • the annual production target is achieved with the desired cost and quality for each product.
  • achievement of the operating profit target in the case of a company, achievement of the operating profit target, in the case of an energy management system (EMS) for energy saving, routine and non-routine adjustment factors generated in the energy use process to the baseline value (Adjustment) ) reflected in the baseline, achievement of annual energy consumption or cost reduction goals, safe operation and convenient use from viruses or hacking for a certain period of time in case of computer operation and management, victory in various sports management and supervision, or acquisition of championship;
  • Successful target management can be evaluated in the case of achievement of target investment return in stock management, acquisition or passing of a specific qualification.
  • the intelligent platform of the present invention is based on the 'SWEEP' goal management technique, for all detailed level tasks targeted for goal management, over the 'goal management period/time'.
  • This Super Tree-based Project/Task's intelligent goal management platform (simply 'Platform') consists of the Main Server, PMs and Project Teams other than PMs, Middle Managers, Owners, Agents, Supervisors, Subcontractors, Managers, Supervisors, PCs and Smart Phones for all Project/Task stakeholders (collectively, 'Stakeholders') such as individuals, and additional physical or functional Back-up Server, DB Server, Web Server depending on the characteristics and size of the Project/Task and Cloud Server, various measurement and control facilities, and network facilities connecting them.
  • the target management system of a specific project or task built based on the Platform or Platform of the present invention is implemented on the H/W centered on the Main Server. shows an example of
  • the platform of the present invention is functionally a Project/Task general management unit 801, Input/Output management unit 802, Super Tree configuration management unit 803, 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 tasks of all management departments including the Project/Task general management unit 801 are collectively managed by the Master Agent, and depending on the size and characteristics of the Project/Task, professional agents in charge of each management department are additionally created and management is delegated. to share Hereinafter, the functions or duties of each management unit are described.
  • the project/task general management unit 801 supports the PM and is responsible for general commanding and supervising the platform task throughout all stages of project/task goal management.
  • the project/task general management unit 801 collects and stores information and knowledge necessary for goal management, and uses it to establish goals and schedules for the entire and each detailed task, and based on the continuously collected information, various Dealing with events or contingencies, continuously aligning short-term, medium-term, and long-term plans and goals, and achieving the established goals at 'minimum overall cost', and instructions given by the PM as a platform task It carries out the given task, provides information for task performance to all project/task stakeholders including the PM, delivers the instructions the PM gives to other managers, and follows-up, and It supports communication, exchange of opinions, coordination, and aggregation among stakeholders), and is responsible for convening direct or indirect meetings, and reporting and processing requests from other managers to the PM.
  • the 'all project/task related parties' include PMs, team members, middle managers or site managers (referred to as 'other managers'), project owners, owner representatives, subcontractors, and other related parties.
  • the above 'minimum overall cost' refers to the weight of each item when it is necessary to consider quality, convenience, safety, environment and security in addition to the direct cost and O/H required to complete or complete the deliverable of the project/task. It means the cost that minimizes the total cost reflecting the cost converted to 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 needs to export.
  • the above information is collected through PMs, project/task persons who are authorized to input specific information, measuring instruments, sensors (including IOT sensors), DCS, PLC, and other servers or the Internet.
  • the measured values or sensor values input to the external TAG are converted by mapping to the corresponding STPN in the Super Tree, and conversely, the output value converts the STPN to the corresponding external TAG value.
  • the STPN of the Super Tree can be directly used as a TAG.
  • the knowledge-base and DB are accessed to present and display the progress or operation status of the project/task, and from the PM and other managers Provides a GUI that enables 'PASS' service to receive instructions or requests, display reports, and establish and coordinate task schedules with PMs.
  • the input/output function is provided directly or through Web Service or Cloud Service, and includes both wired and wireless input/output.
  • the GUI presents the nodes of Progress Management IVY indicating the relevant period and IVY indicating each unit time in the form of a Gantt Chart or a series of Chains that represent each node. It supports the planning, coordination, and progress management of tasks by enabling the selection of positions of Increment, Decrement, Split, Merge, Expand, Shrink, Shift, Milestone and setting of precedence/successor relationships on the top. All operations for other PLANTs are supported by clicking and dragging the mouse on the display. Typical operation support includes GUI provision for Node Insert, Node Delete, Node Expand, Super Tree Skeleton Display, PLANT Display, Graft, STEM Generation, Rule Generation and State Monitoring.
  • the display allows selection and scrolling of accumulation, and the logical connection of all BDT, IVY, VINE, BUSH, SHRUB and Super Tree, and the physical layout and schematics of processes or supporting systems and facilities or spaces indicated by VINE or BUSH. , 3D Drawings, and 4D Display that shows the status change according to the progressing time, and also includes monitor, drawing, and coordinate management in the field to support this, and management of various symbols. Even in the case of a project/task with hundreds or thousands of tasks to be carried out at the same time, the monitoring results of the progress and progress of all tasks or the operation of the facility are displayed, and the situation can be grasped visually and immediately. You can use the Sector Graph that is structured in a hierarchical structure to present it. (See Korean Patent 10-1233264)
  • the PM and other managers have to memorize the menus and sub-menus unilaterally presented, find them one by one, learn the meaning of various selection items, and use them, ORE Using Generation BDT, it provides 'Proactive And Smart Service' (PASS) type I/O service that allows PMs and other managers to directly input desired instructions or requests.
  • PASS 'Proactive And Smart Service'
  • the I/O management department allows PMs or other administrators to input instructions or requests for 'What can I do for you?', 'What do you want?', 'Please input your Order or Request.
  • the ORE Generation BDT When inputting, if you input the first part of the text, the ORE Generation BDT is used to present the options of the remaining expected texts as a drop-down menu so that you can easily select and complete them.
  • One instruction or request is represented by STEM, and a Template Rule that can handle the instruction or request is configured, stored in Rule BDT, and executed by instantiate execution.
  • the Super Tree configuration management unit 803 presents a typical Super Tree basic frame (Skeleton) according to the characteristics and fields of the Project/Task that is input as the entire basic information (S100), so that PMs and other managers are given It manages tasks that support the construction of Super Tree through defined operations such as input, modification, and graft within the authority. In addition, branches or plants that are pruned or degrafted are also responsible for recovering the allocated Super Tree-related resources by performing garbage collection when the connection with the ROOT is cut off. In case of managing multiple Projects/Tasks, Super Forest configuration with each Super Tree as a Subtree is supported.
  • the Knowledge Base management unit 804 cooperates with the PM or Platform Implementation Engineer, and uses Semantic Primitives to configure the Super Tree, perform operations on the Super Tree, perform platform tasks, give instructions to the platform, and assign tasks And it implements the expertise and methods necessary for the execution of the request as a Rule or Template Rule, configures and stores the Rule BDT, and manages the stored Rules so that they can be called and executed.
  • Project/Task progress management unit 805 establishment of an execution plan of tasks separately managing progress among the tasks on Task BDT, establishment of a completion plan and resource input plan of the corresponding Deliverables, cost calculation, progress calculation of Deliverables, and It is in charge of calculating the progress of the corresponding task, monitoring the resource input status, calculating the actual cost, and coordinating the task execution plan.
  • the establishment of the task execution plan uses the top-down method and the bottom-up method in parallel, and by using the GRACE method, the task execution plan that minimizes the overall cost is established, and continuously adjusted according to the progress, and the overall responsible for achieving goals with minimal cost.
  • the resource management unit 806 monitors and manages the procurement or supply plan and input progress and performance of all resources to be input to create Deliverables to be completed or completed to complete each Task of Task BDT.
  • the event management unit 807 manages various events that occur randomly during task execution, and prepares in advance through Scenario analysis for events determined to be important, in particular, the task progress is When a delayed event occurs, the EAT strategy based on the 'GRACE' (Gradual Resource Allocation and Cost Evaluation) technique is applied to absorb the impact early or to minimize the impact.
  • an event that may delay the completion of the entire project/task or major task or make it difficult to achieve the goal is defined as ‘risk’.
  • 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 perform preventive measures to minimize the possibility of occurrence and Prepares countermeasures for each occurrence scenario, and manages work to minimize damage by responding to actual risks early.
  • the Database (DB) 809 management unit stores all information necessary to perform the intelligent goal management task of Project/Task, including Super Tree configuration information, in a format such as DB, Spread Sheet, or XML File, and Back -up and provide tasks, read-in every time the program is restarted, and stably recovers or prepares the reasoning environment including Super Tree to maintain continuity of goal management, and to communicate with other servers through DB It manages the work of making it possible to exchange information or to share information between agents.
  • Super Tree configuration information in a format such as DB, Spread Sheet, or XML File
  • this Super Tree-based Project/Task intelligent goal management platform technology provides the PM or general manager with an integrated overall management means for each project or task to set and manage goals, and It carries out the tasks given by the PM and the instructions from the PM, supports the establishment of the optimal goal achievement plan, continuously and precisely monitors and manages the progress and progress of the project/task, and negative events that occur in the process.
  • the impact can be minimized, preventing or shortening the creation of the event chain due to the spread of events, and maximizing the opportunity to achieve the set goals while minimizing the overall cost.
  • Common core platform technology and means that can build customized intelligent goal management systems according to the characteristics of the project/task in various fields by supporting PMs and other project/task managers tool) is provided.
  • the present invention can also be implemented as computer-readable codes on a computer-readable recording medium.
  • the computer-readable recording medium includes all kinds of recording devices in which data readable by a computer system is stored. Examples of computer-readable recording media include ROM, RAM, hard disk, USB, CD-ROM, optical data storage, etc. It also includes those implemented in the form.
  • the computer-readable recording medium may be distributed in a network-connected computer system or smart phone to store and execute computer-readable codes in a distributed manner.
  • This punishment includes not only large-scale construction projects such as various Plant EPC, Ship Building, Building Construction and other Infrastructure Construction, but also construction and operation of Smart Factory, establishment of Smart and Secure computer operating system, business management, energy management, Intelligent goals that can greatly improve the possibility of achieving successful goals in various and complex tasks ranging from operation and management of various public and private organizations to various games, sports, stock investment, election and individual goal management. It can be used as a base technology for building a management system.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Educational Administration (AREA)
  • Tourism & Hospitality (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Mining & Analysis (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

La présente invention concerne une technologie de construction d'une plate-forme intelligente, selon laquelle : la plateforme se voit attribuer, en tant que mission, une tâche de gestion d'objectifs concernant des projets ou des tâches pour lesquels des objectifs doivent être configurés et accomplis ; la plateforme reçoit une instruction d'un chef de projet (PM) ou d'un directeur général ; et, en ce qui concerne toutes les tâches (également appelées travaux ou activités) à gérer, qui doivent être gérées et accomplies pour atteindre les objectifs, la plate-forme effectue la gestion des objectifs de manière autonome et proactive sur la base d'une technique de gestion des objectifs par « évaluation et déroulement successifs des travaux et des événements » (SWEEP) par laquelle l'ensemble du processus à exécuter est géré et conduit de manière précise, améliorant ainsi sensiblement la précision, la rapidité, la continuité, la cohérence et l'objectivité de la gestion des objectifs. Dans la présente invention : des modèles de connaissances et d'informations concernant diverses « plantes » spécialisées dans le stockage et l'utilisation de connaissances et d'informations correspondantes selon le type et les caractéristiques des connaissances et des informations, telles que « arbre de dissociation (BDT) », « lierre », « vigne », « buisson » et « arbuste », sont envisagés et définis ; en outre, une « plate-forme de gestion unifiée totale intelligente » (STUMP) est définie et construite en tant que souche pour former un cadre ou une fondation de construction de connaissances et d'informations de gestion objective intégrée ; les plantes sont « greffées » à la souche ; les plantes sont aussi librement greffées les unes aux autres selon la relation entre la connaissance et l'information ; et un « super arbre » est défini et mis en œuvre en conséquence en tant que « corps de connaissances et d'informations de gestion des objectifs (BOGMKI) » conformément aux caractéristiques des projets/tâches pour lesquels les objectifs doivent être établis et gérés.
PCT/KR2021/000846 2020-01-25 2021-01-21 Procédé et plate-forme pour gérer un objectif intelligent de projet/tâche sur la base d'un super arbre WO2021150039A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020200009577A KR102184182B1 (ko) 2020-01-25 2020-01-25 Super Tree 기반의 Project/Task 지능 목표관리 방법 및 플랫폼
KR10-2020-0009577 2020-01-25

Publications (1)

Publication Number Publication Date
WO2021150039A1 true WO2021150039A1 (fr) 2021-07-29

Family

ID=69569770

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2021/000846 WO2021150039A1 (fr) 2020-01-25 2021-01-21 Procédé et plate-forme pour gérer un objectif intelligent de projet/tâche sur la base d'un super arbre

Country Status (2)

Country Link
KR (1) KR102184182B1 (fr)
WO (1) WO2021150039A1 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112418599A (zh) * 2020-10-15 2021-02-26 重庆市科学技术研究院 一种基于指标集的企业成长路径规划方法及系统
CN112738278A (zh) * 2021-02-08 2021-04-30 上海凯盛朗坤信息技术股份有限公司 一种智能工厂全自动生产线监控系统
CN114615678A (zh) * 2022-03-18 2022-06-10 重庆邮电大学 一种基于动态树形网络流量模型的构建方法
CN114723411A (zh) * 2022-04-18 2022-07-08 中国电建集团华东勘测设计研究院有限公司 一种大型复杂项目任务分解方法和信息化管理系统
CN116560948A (zh) * 2023-07-07 2023-08-08 建信金融科技有限责任公司 一种数据处理方法和装置
CN116680064A (zh) * 2023-08-03 2023-09-01 中航信移动科技有限公司 一种任务节点的管理方法、电子设备及存储介质
WO2024031191A1 (fr) * 2022-08-10 2024-02-15 Mavryck Inc. Systèmes et procédés de gestion de projet et de programme au moyen d'une intelligence artificielle
CN117611101A (zh) * 2023-12-15 2024-02-27 济南中建建筑设计院有限公司 一种工程设计项目流程管理系统及其方法

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11263571B2 (en) * 2019-03-21 2022-03-01 Hartford Fire Insurance Company System to facilitate guided navigation of direct-access databases for advanced analytics
WO2022139198A1 (fr) * 2020-12-21 2022-06-30 금오공과대학교 산학협력단 Système et procédé de gestion de planification d'une centrale électrique sur la base d'un réseau neuronal artificiel
KR102312738B1 (ko) * 2020-12-23 2021-10-14 주식회사 영신 스마트 건설안전 통합관제 시스템
US20220358259A1 (en) * 2021-05-04 2022-11-10 Procore Technologies, Inc. Construction Knowledge Graph
CN113378893B (zh) * 2021-05-21 2024-04-09 商汤集团有限公司 数据管理方法及装置、电子设备和存储介质
CN113450049B (zh) * 2021-06-02 2024-05-24 北京迈格威科技有限公司 一种出库站点确定方法、装置及存储介质
CN113743747B (zh) * 2021-08-17 2024-02-06 广州工业智能研究院 一种车间环境下的多agv协同调度方法及装置
CN113688039B (zh) * 2021-08-20 2023-10-31 成都天奥测控技术有限公司 一种基于数字孪生的自动测试系统仿真验证方法
US11763223B1 (en) 2022-05-18 2023-09-19 Realization Technologies, Inc System for generating and maintaining a resource deployment map over a communications network
CN115511132B (zh) * 2022-10-19 2023-08-11 太原海通智慧信息技术有限公司 基于发电厂的设备巡点检管理平台及系统
CN116342076B (zh) * 2023-05-30 2023-08-01 山东建筑大学设计集团有限公司 一种工程信息管理系统以及管理方法
CN118195425A (zh) * 2024-05-14 2024-06-14 成都工业职业技术学院 基于三维建模的教学任务评分方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110066439A (ko) * 2009-12-11 2011-06-17 현대로템 주식회사 프로젝트 관리방법
US20120072251A1 (en) * 2010-09-20 2012-03-22 Cristian Mircean Method, management procedure, process, an instrument and apparatus for delay estimation and mitigation of delay risks in projects and program
KR20160076927A (ko) * 2014-12-23 2016-07-01 이승철 섹터그래프로 구성한 시계모양의 에너지 사용상황 제시 기법과 나무자료구조를 활용한 에너지관리시스템
KR20170129485A (ko) * 2016-05-17 2017-11-27 이승철 MACRO/MICRO 지능 Total 에너지관리시스템 및 방법
EP3388986A1 (fr) * 2017-04-11 2018-10-17 Accenture Global Solutions Limited Plateforme de gestion de projets de bout en bout avec intégration d'intelligence artificielle

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110066439A (ko) * 2009-12-11 2011-06-17 현대로템 주식회사 프로젝트 관리방법
US20120072251A1 (en) * 2010-09-20 2012-03-22 Cristian Mircean Method, management procedure, process, an instrument and apparatus for delay estimation and mitigation of delay risks in projects and program
KR20160076927A (ko) * 2014-12-23 2016-07-01 이승철 섹터그래프로 구성한 시계모양의 에너지 사용상황 제시 기법과 나무자료구조를 활용한 에너지관리시스템
KR20170129485A (ko) * 2016-05-17 2017-11-27 이승철 MACRO/MICRO 지능 Total 에너지관리시스템 및 방법
EP3388986A1 (fr) * 2017-04-11 2018-10-17 Accenture Global Solutions Limited Plateforme de gestion de projets de bout en bout avec intégration d'intelligence artificielle

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112418599A (zh) * 2020-10-15 2021-02-26 重庆市科学技术研究院 一种基于指标集的企业成长路径规划方法及系统
CN112418599B (zh) * 2020-10-15 2023-02-10 重庆市科学技术研究院 一种基于指标集的企业成长路径规划方法及系统
CN112738278A (zh) * 2021-02-08 2021-04-30 上海凯盛朗坤信息技术股份有限公司 一种智能工厂全自动生产线监控系统
CN114615678A (zh) * 2022-03-18 2022-06-10 重庆邮电大学 一种基于动态树形网络流量模型的构建方法
CN114615678B (zh) * 2022-03-18 2023-05-26 重庆邮电大学 一种基于动态树形网络流量模型的构建方法
CN114723411A (zh) * 2022-04-18 2022-07-08 中国电建集团华东勘测设计研究院有限公司 一种大型复杂项目任务分解方法和信息化管理系统
WO2024031191A1 (fr) * 2022-08-10 2024-02-15 Mavryck Inc. Systèmes et procédés de gestion de projet et de programme au moyen d'une intelligence artificielle
CN116560948A (zh) * 2023-07-07 2023-08-08 建信金融科技有限责任公司 一种数据处理方法和装置
CN116680064A (zh) * 2023-08-03 2023-09-01 中航信移动科技有限公司 一种任务节点的管理方法、电子设备及存储介质
CN116680064B (zh) * 2023-08-03 2023-10-10 中航信移动科技有限公司 一种任务节点的管理方法、电子设备及存储介质
CN117611101A (zh) * 2023-12-15 2024-02-27 济南中建建筑设计院有限公司 一种工程设计项目流程管理系统及其方法
CN117611101B (zh) * 2023-12-15 2024-04-26 济南中建建筑设计院有限公司 一种工程设计项目流程管理系统及其方法

Also Published As

Publication number Publication date
KR102184182B1 (ko) 2020-11-27
KR20200015642A (ko) 2020-02-12

Similar Documents

Publication Publication Date Title
WO2021150039A1 (fr) Procédé et plate-forme pour gérer un objectif intelligent de projet/tâche sur la base d'un super arbre
Chan et al. The development of intelligent decision support tools to aid the design of flexible manufacturing systems
Efthymiou et al. On knowledge reuse for manufacturing systems design and planning: A semantic technology approach
KR20030019449A (ko) 지능형 공급 체인 협력을 위한 방법 및 시스템
Li et al. Survey of integrated flexible job shop scheduling problems
KR20070015368A (ko) 활동 관리 시스템 및 관리 방법
Koh et al. Translating knowledge of supply chain uncertainty into business strategy and actions
Farsi et al. An optimisation framework for improving supply chain performance: case study of a bespoke service provider
Latif et al. A simulation algorithm of a digital twin for manual assembly process
Masood et al. Future-proofing the through-life engineering service systems
Golenko-Ginzburg Controlled alternative activity networks for project management
Aadithya et al. Lean manufacturing in fabrication industry: literature review and framework proposal
Shirazi et al. iCoSim-FMS: An intelligent co-simulator for the adaptive control of complex flexible manufacturing systems
Hall Operations research techniques for robotics systems
Chen Activity‐based approach to justification of advanced factory management systems
ElMaraghy et al. On-line simulation and control in manufacturing systems
Biffl et al. Software Engineering Risks from Technical Debt in the Representation of Product/ion Knowledge.
Joshi et al. Industrial Automation: Learn the current and leading-edge research on SCADA security
KR100475364B1 (ko) Ｅｒｐ 신속 구축 시스템 및 그 구축 방법
Vlacic et al. Applying multiattribute-based group decision making techniques in complex equipment selection tasks
WO2024047895A1 (fr) Système de gestion d'incident et procédé de gestion d'incident
Kobayashi et al. Workflow business template for application processes in administration department
Vach et al. Management of a company-wide module pool for modular plants
Dewan et al. Workflow redesign through consolidation in information-intensive business processes
Azevedo et al. An order planning system to support networked supply chains

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21744152

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 15.12.2022)

122 Ep: pct application non-entry in european phase

Ref document number: 21744152

Country of ref document: EP

Kind code of ref document: A1