Patent application number | Description | Published |
20100010654 | METHODS AND SYSTEMS FOR PERVASIVE DIAGNOSTICS - Model-based production control systems and methods are presented for constructing plans for controlling operation of a production system with a plant having a plurality of resources to achieve one or more production goals, in which a planner constructs plans for execution in the plant based on production goals while balancing both production objectives (e.g., production cost, production time) and diagnostic objectives (e.g., diagnostic cost, information gained, repair cost), and a diagnosis engine determines a current plant condition based on a previously executed plan and corresponding observations from the plant, and provides expected information gain data to the planner, with the planner generating a plan that will achieve a given production goal and is improved for one or more diagnostic objectives and the expected information gain data. | 01-14-2010 |
20100010657 | METHODS AND SYSTEMS FOR ACTIVE DIAGNOSIS THROUGH LOGIC-BASED PLANNING - A control systems and methods are presented for controlling a production system, in which a model-based planner includes a formulation, such as a SAT formulation representing possible actions in the production, with a solver being used to provide a solution to the formulation based at least partially on production and diagnostic goals and the current plant condition, and a translation component translates the solution into a plan for execution in the plant. | 01-14-2010 |
20100010845 | METHODS AND SYSTEMS FOR CONSTRUCTING PRODUCTION PLANS - Systems and methods are presented for constructing production plans to achieve one or more production goals, in which a diagnosis engine determines the production plant condition based on a previously executed plan, observations from the plant, and a plant model, and formulates a heuristic based on a diagnostic objective, and with a planner to performing a partial-plan search using the heuristic to construct the plans that will concurrently achieve at least one production goal and facilitate the diagnostic objective. | 01-14-2010 |
20100010952 | METHODS AND SYSTEMS FOR TARGET VALUE PATH IDENTIFICATION - Target value search methods and systems are presented for solving a target value path problem to identify a path or paths in a graph in which a connection graph is created and upper and lower bound values are determined for each node in the connection graph, and a first best search is performed to identify a path or paths from a starting node to a goal node having a path value closest to the target value. | 01-14-2010 |
20100011255 | METHODS AND SYSTEMS FOR CONTINOUSLY ESTIMATING PERSISTENT AND INTERMITTENT FAILURE PROBABILITIES FOR PRODUCTION RESOURCES - Production control systems and methods are presented for estimation of production resource failure probabilities in which a set of four count values are maintained and updated for each resource including a first count value m | 01-14-2010 |
20100030373 | INTELLIGENT PRODUCT FEED SYSTEM AND METHOD - Intelligent product feed systems and product transport methods are presented in which an array of variable speed transport modules is positioned between an input transport mechanism and an output mechanism, with the individual module speeds being controlled by a model-based planner to transport products delivered in an uncertain fashion by the input transport mechanism to the output mechanism synchronized and oriented according to a specified product configuration. | 02-04-2010 |
20110004581 | Depth-First Search For Target Value Problems - A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database. | 01-06-2011 |
20110004625 | Multi-Interval Heuristics For Accelerating Target-Value Search - Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include one or more intervals. Thereafter, a best search is performed to identify a path, or paths, from a starting vertex to a goal vertex having a path value closest to a target value. | 01-06-2011 |
20110060750 | MAX-VALUE-FIRST SEARCH FOR TARGET VALUE PROBLEMS - The present application relates to systems and methods for determining at least one target path from a start vertex to a goal vertex within a directed acyclic graph. The systems and methods use a target value search (MFTVS) of a directed acyclic graph. The MFTVS includes beginning with a start vertex as a current prefix and progressing through selected prefixes. The MFTVS further includes determining a selected prefix from successor prefixes of the current prefix according to a selection rule. The selection rule is one of selecting the successor prefix having a highest path value and selecting the successor prefix having a lowest path value. The MFTVS further includes setting the current prefix to the selected prefix until a frontier of a blind spot is encountered. The frontier of the blind spot is defined by an evaluation function. | 03-10-2011 |
20120246193 | DEPTH-FIRST SEARCH FOR TARGET VALUE PROBLEMS - A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database. | 09-27-2012 |