Patent application number | Description | Published |
20080300706 | System and method for real-time system control using precomputed plans - Features described herein relate to optimizing a job plan procedure for selecting a plan for executing a manufacturing job. A planner can receive a model of a system that is to perform a job, and may select a precomputed plan that is sufficient to perform the job. The precomputed plan is identified during a first portion of a planning period, and the remainder of the planning period may be utilized to search for and identify a better plan for executing the job. If a better plan cannot be identified by the end of the planning period, then the selected precomputed plan can be executed. | 12-04-2008 |
20080300707 | System and method for on-line planning utilizing multiple planning queues - Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution. In this manner, the unsent subqueues for each planning queue are maintained with substantially equal numbers of planned jobs ready for execution, which improves throughput by ensuring that all machines and/or associated components are kept busy. | 12-04-2008 |
20080300708 | Model-based planning using query-based component executable instructions - A method for planning machine control for a system includes determining one or more capabilities and one or more capability constraints for each component used to execute a plan for processing a job by the system. The plan is incrementally constructed based on the components, the one or more capabilities, and the one or more constraints. One or more sets of executable instructions are queried with incremental portions of the plan, wherein each set of executable instructions is associated with a different one of the components and represents the actions that are performed by its corresponding component, each incremental portion includes actions that are to be performed by its corresponding component, and each set of executable instructions executes the incremental portion it received. Upon receiving confirmation from each of the queried sets of executable instructions that indicates each of the components is able to perform the actions in the incremental portions, a final plan for processing the job is generated. | 12-04-2008 |
20080301690 | Model-based planning with multi-capacity resources - Systems and methods are described that facilitate performing model-based planning techniques for allocations of multi-capacity resources in a machine. The machine may be, for instance, a printing platform, such as a xerographic machine. According to various features, the multi-capacity resource may be a sheet buffer, and temporal constraints may be utilized to determine whether an insertion point for a new allocation of the sheet buffer is feasible. Multiple insertion points may be evaluated (e.g., serially or in parallel) to facilitate determining an optimal solution for a print job or the like. | 12-04-2008 |
20080317337 | System and method for decomposing a digital image - A system and method for decomposing a digital image is provided. A digital image is represented as a word-graph, which includes words and visualized features, and zone hypotheses that group one or more of the words. Causal dependencies of the zone hypotheses are expressed through a learned generative zone model to which costs and constraints are assigned. An optimal set of the zone hypotheses are inferred, which are non-overlapping, through a heuristic search of the costs and constraints. | 12-25-2008 |
20090006166 | Method for solving model-based planning with goal utility dependencies - The presently described embodiments provide a systematic approach for handling cost and utility dependencies together in PSP. In particular, the following are provided: an approach for representing utility dependencies between planning goals using the Generalized Additive Independence (GAI), combining utility theory and deterministic planning and, a novel heuristic framework combining cost propagation and IP encoding to capture mutual dependencies of goal achievement cost and goal utility. This leads to informative heuristic estimates guiding a variation of forward state space search planer that solves PSP problems described above. | 01-01-2009 |
20090268247 | SYSTEM AND METHOD FOR ON-LINE PLANNING UTILIZING MULTIPLE PLANNING QUEUES - Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution. In this manner, the unsent subqueues for each planning queue are maintained with substantially equal numbers of planned jobs ready for execution, which improves throughput by ensuring that all machines and/or associated components are kept busy. | 10-29-2009 |
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 |
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 |
20100053641 | USING BUFFERS TO SUPPORT UNCERTAINTIES IN MARKING ENGINE EXECUTION - A printing system includes at least one marking engine and a paper path which carries sheets of print media to the marking engine from an upstream direction and carries sheets of print media which have been marked by the marking engine in a downstream direction. A buffer system includes a sheet buffer in the paper path downstream of the marking engine and optionally includes another sheet buffer in the paper path upstream of the marking engine. The buffer system allows variability in the residence time of the marking engine to be accommodated by varying the residence time of sheets in the downstream buffer. | 03-04-2010 |
20110116715 | Computer-Implemented System And Method For Recognizing Patterns In A Digital Image Through Document Image Decomposition - A computer-implemented system and method for retrieving a digital image through document image decomposition is provided. A stored digital image is retrieved. Generic visual features are extracted. The features are grouped into a primitive layer including word-graphs that each include words and features. The words are grouped into a layout layer including zone hypotheses that each include one or more of the words. Causal dependencies between the word-graphs and the zone hypotheses are expressed through zone models that include a joint probability defining a pair of probabilistic models generated through a learned binary edge classifier. Each pair of probabilistic models is expressed as an optimal set selection problem including a set of cost functions and constraints. The optimal set selection problem is evaluated through a heuristic search of the cost functions and constraints and a non-overlapping optimal set of the zone hypotheses is provided that characterize the stored digital image. | 05-19-2011 |
20110238614 | AI PLANNING BASED QUASI-MONTECARLO SIMULATION METHOD FOR PROBABILISTIC PLANNING - A computer-based method and system for AI planning based quasi-Monte Carlo simulation for probabilistic planning are provided. The method includes generating a set of possible actions for an initial state, generating a set of sample future outcomes, generating solutions for each of the sample future outcomes, using an AI planner, generating a set of future outcome solutions that are low probability and high-impact, combining the solutions generated from each of the sample future outcomes with the future outcome solutions generated by the AI Planner into an aggregated set of future outcome solutions, analyzing the aggregated set of future outcome solutions, selecting a best action based at least partially on the analysis of the aggregated set of future outcome solutions, and outputting the selected best action to computer memory. | 09-29-2011 |