Abstract: 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.

Abstract: Disclosed herein is a method for deriving node localization information within communication networks having a plurality of nodes, which are separated by node paths. The method includes estimating the shortest path between multiple pairs of nodes in the network and constructing a matrix encompassing the estimated shortest paths. Multidimensional scaling is then applied to the matrix and the largest eigenvectors of the transformed matrix are identified. From this is constructed a relative map of the location of the pairs of nodes within the network by utilization of the eigenvectors.

Abstract: A combinatorial search method implemented in a computer control system utilizes on-line state-space planning of operations for multi-step production processes. The planner considers various possible combinations of actions, searching for one that correctly transforms the initial state of the object into the specified desired final state. Each combination of actions the planner considers is called a search node, with each node containing a plan representing a series of actions of various machines on a single object and also containing the predicted state of the object with those actions applied either forward or backward. The method includes determining which of the search nodes to extend further at each search iteration and if the object state in the chosen search node conforms to the desired state of the object, or whether actions should be added to the node's plan.

Abstract: A system that re-plans jobs based at least in part on user preferences in response to system component errors includes an exception handler that receives an exception from one of a plurality of components executing a plan to process a job. The system further includes a planner that creates a new plan for the job based at least in part on a model-based planning technique and at least one user preference.

Abstract: A method for obtaining solutions to combinatorial problems by way of a discrete state-based search approach utilizes a node evaluation function based both on solution quality and distance in search steps to a goal. The method considers the problem as finding the shortest path between an initial state and a goal state in a large graph and performs solution evaluation utilizing computation time balanced against solution quality. Rather than solely using a lower bound on the solution cost achievable below a search node, an estimate of the distance (in search steps) to the nearest solution below a search node is also utilized. These are combined using the user's stated utility function (represented as a function of time and cost) to evaluate candidate search nodes.

Abstract: A printing system includes a plurality of print media processing modules which transfer print media therebetween during printing and a fault management agent associated with each of the modules for acquiring fault-related data from the respective processing module. A fault management system is in communication with the fault management agents and receives fault-related data from the fault management agents. The fault management system processes the fault related data to identify faults in the system, such as when a first of the processing modules is a cause of fault-related data acquired in a second of the processing modules. When a fault is identified, a reconfiguration agent may reconfigure the printing system to mitigate an impact of at least one of the identified faults.

Abstract: A method and tool is provided to obtain an optimistic estimate or exact optimal value of an operational parameter for a realistic system model under investigation. The realistic system model includes components and paths arranged to process continuous or discrete commodities. The system could be a model of a manufacturing system with different machines (some of which may be identical) processing multiple job types, with different sequences of operations with different processing rates on the different machines at different stages. A network flow model of the realistic system model under investigation is generated. Constraints are applied to the abstracted network flow model, and a plurality of steady state network flows, which take into consideration the applied constraints, are performed. The network flows are combined or cascaded into an aggregate network flow, which captures a transformation of the commodities from a first state to a final output state.

Abstract: A method for obtaining solutions to combinatorial problems by way of a discrete state-based search approach utilizes a node evaluation function based both on solution quality and distance in search steps to a goal. The method considers the problem as finding the shortest path between an initial state and a goal state in a large graph and performs solution evaluation utilizing computation time balanced against solution quality. Rather than solely using a lower bound on the solution cost achievable below a search node, an estimate of the distance (in search steps) to the nearest solution below a search node is also utilized. These are combined using the user's stated utility function (represented as a function of time and cost) to evaluate candidate search nodes.

Abstract: Respective coordinators are spawned or activated to coordinate activities with regard to respective tasks. Where the respective tasks require cooperative efforts of a plurality of controllers, the respective coordinators ensure cooperative efforts by generating and communicating cooperative commands to the plurality of controllers. The coordinators may act as clearinghouses for system data, selectively requesting and relaying system information to appropriate controllers. For example, a document processing system activates respective coordinators for respective sheets of print media. The respective coordinators orchestrate the transportation of the sheets by sequentially orchestrating the activities of sequentially selected pluralities of transportation actuator controllers. Selected sheet position information from sensors and/or from models maintained by the actuator controllers may be relayed by the coordinators to selected actuator controllers as appropriate to the sheet transportation tasks.

Abstract: A method for performing exception handling operates within a computer controlled multi-step production system for producing objects. The system includes a system controller, within which reside a planner/scheduler and module controller(s). The system controller receives a stream of object specifications for objects to be produced including the jobs to which they belong. The planner/scheduler plans and schedules the jobs incrementally, and the system controller sends commands to the module controller(s) directing production of the planned and scheduled objects by production system modules. The method includes receiving notice in the system controller of a problem situation present within the multi-step production system and halting planning for the production of subsequent objects. Plans are canceled plans for all objects that have not begun production, and all objects affected by the problem situation are marked as bad objects.

Abstract: A method for performing exception handling operates within a computer controlled multi-step production system for producing objects. The system includes a system controller, within which reside a planner/scheduler and module controller(s). The system controller receives a stream of object specifications for objects to be produced including the jobs to which they belong. The planner/scheduler plans and schedules the jobs incrementally, and the system controller sends commands to the module controller(s) directing production of the planned and scheduled objects by production system modules. The method includes receiving notice in the system controller of a problem situation present within the multi-step production system and halting planning for the production of subsequent objects. Plans are canceled plans for all objects that have not begun production, and all objects affected by the problem situation are marked as bad objects.

Abstract: A combinatorial search method implemented in a computer control system utilizes on-line state-space planning of operations for multi-step production processes. The planner considers various possible combinations of actions, searching for one that correctly transforms the initial state of the object into the specified desired final state. Each combination of actions the planner considers is called a search node, with each node containing a plan representing a series of actions of various machines on a single object and also containing the predicted state of the object with those actions applied either forward or backward. The method includes determining which of the search nodes to extend further at each search iteration and if the object state in the chosen search node conforms to the desired state of the object, or whether actions should be added to the node's plan.

Abstract: A method implemented in a computer control system utilizes temporal constraints to coordinate multiple planning sessions for multi-step production processes such that scheduling constraints are satisfied and flexibility for individual job planning is retained. The computer control system includes an outer planner loop module, which manages the queue of planned and unplanned jobs and interacts with the computer control system, and an individual job planner. The method includes checking the queue of planned jobs for imminent planned jobs, performing a temporal clamping process for planned jobs scheduled to begin soon, and releasing planned jobs for production. Checking is performed for additional imminent planned jobs and the individual job planner is called to produce a plan for the next job if no imminent planned jobs are identified. A plan is produced for the next job by the individual job planner.

Abstract: Disclosed herein is a method for deriving node localization information within communication networks having a plurality of nodes, which are separated by node paths. The method includes estimating the shortest path between multiple pairs of nodes in the network and constructing a matrix encompassing the estimated shortest paths. Multidimensional scaling is then applied to the matrix and the largest eigenvectors of the transformed matrix are identified. From this is constructed a relative map of the location of the pairs of nodes within the network by utilization of the eigenvectors.

Abstract: An interface is useful in browsing output vectors resulting from applying a transfer function to input data. The interface allows a user to explore effects of different parameter settings which make up the transfer function, particularly in connection with computer-generated and computer-modified images. The interface includes two portions, a central display panel and a surrounding area of a plurality of image displays. Thumbnail sketches of images corresponding to each of the output vectors are located in the central display panel to represent the relationships between the output vectors. The output vectors are processed to determine distances between them, and the distances are then projected to the two-dimensional display of the central display panel. The central display panel can be controlled to pan and zoom the display to review the thumbnail sketches. The user can then select different thumbnail sketches so that full-sized images are displayed in the plurality of image displays.