摘要:
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.
摘要:
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.
摘要:
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. Actions that are applicable to the chosen node's object state are selected, transformations are applied to the attributes, and the resulting plan is returned to the system.
摘要:
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. The system controller planned exception handling/recovery or module controller directed exception handling/recovery is applied and normal operation is resumed.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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. Actions that are applicable to the chosen node's object state are selected, transformations are applied to the attributes, and the resulting plan is returned to the system.
摘要:
A data structure is described that comprises a balanced binary tree and a binary heap, which may be utilized for combinatorial searching algorithms. For instance, solutions for performing a task, such as a print job or the like, are associated with nodes that are utilized to generate the data structure. Each node is associated with a quality indicator that describes a most optimal solution that may be reached through the node when traversing the binary tree. The binary heap is generated from a subset of the nodes in the tree, wherein each node in the subset has a quality indicator value that is within a predefined range of a best known solution quality. The binary heap is sorted according to a search effort indicator value for each node, where nodes that are more easily reached in the tree are placed higher in the heap to facilitate rapid identification.