Abstract: Apparatus and methods that approximately solve an actuation allocation problem by breaking the solution into modules, which may or may not be overlapping. The solution to the actuation allocation problem is expressed in terms of solutions for each of the modules. The solutions for the modules serve as constraints for a solution of the optimization problem on each module. The optimization problem for each module is decomposed into further modules until the modules consist of a small enough number of individual implementation units so that the solution for the module can be solved using conventional optimization techniques.

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 developing and using real time applications for a dynamic system having a sensing subsystem, actuation subsystem, a control subsystem, and an application subsystem utilizes stochastic compute time algorithms. After optimization functions, desired state and constraints are received and detector data has been provided from a sensor subsystem, a statistical optimization error description is generated. From this statistical optimization error description a strategy is developed, including the optimization errors, within the control subsystem. An execution module within the control subsystem then sends an execution strategy to various actuators within the actuation subsystem.

Abstract: A method for developing and using real time applications for a dynamic system having a sensing subsystem, actuation subsystem, a control subsystem, and an application subsystem utilizes stochastic compute time algorithms. After optimization functions, desired state and constraints are received and detector data has been provided from a sensor subsystem, a statistical optimization error description is generated. From this statistical optimization error description a strategy is developed, including the optimization errors, within the control subsystem. An execution module within the control subsystem then sends an execution strategy to various actuators within the actuation subsystem.

Abstract: In a problem partitioning method for problem solving in a computer system, a definition of a system to be controlled, a hierarchical control structure definition, problem definitions for a plurality of control nodes in the hierarchical control structure, and a structure evaluation function are used in partitioning the system problem. The partitioning method defines an instantiation of the hierarchical control structure by decomposing the system into a plurality of hierarchical control structure instances, with each control structure instance having a plurality of control levels. The performance of each of the hierarchical control structure instances is evaluated with the structure evaluation function and an optimal hierarchical control structure instance is selected.

Abstract: A method for problem solving in a computer system includes an applications module for sending a problem statement to a complexity module, which configures a solving module with configuration parameters and also determines expected problem solver behavior. The solving module selects a set of parameter configuration vectors, determines a set of search space points, performs a partial search based on the parameter configuration vectors, and determines actual problem solver behavior. The solving module then determines whether a problem solution has been found, whether to perform a solver iteration step or request a complexity module to perform an adaptation step.

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: For an automated manufacturing system having a number of modules with numerous alternative capabilities, a computer-controlled system provides for configuration-specific reprioritization of jobs. The computer-controlled system includes at least one system controller for planning and scheduling utilization of selected module capabilities in the production of jobs having not less than one work unit. Module capabilities include the relative costs of the module capabilities.

Abstract: A method for problem solving in a computer system includes an applications module for sending a problem statement to a complexity module. The complexity module configures a solving module with configuration parameters and also determines expected solver behavior. A solving module determines actual solver behavior, determines whether a problem solution has been found, and determines whether to perform a solver iteration step or to request a complexity module to perform an adaptation step.

Abstract: For an automated manufacturing system having a number of modules with numerous alternative capabilities, a computer-controlled system provides for monitoring and reporting incremental job status. The computer-controlled system includes at least one system controller for planning and scheduling a variety of jobs submitted to the manufacturing system for processing. The system controller includes at least one planning function, which plans utilization of selected module capabilities in the production of jobs having more than one work unit. A scheduling function schedules utilization of selected module capabilities. A logging and integration function logs execution reports from the various modules in the manufacturing system.

Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.

Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.

Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.

Abstract: A method is presented for a time-aware strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: For an automated manufacturing system having a number of modules with numerous alternative capabilities, a computer-controlled system provides for configuration-specific reprioritization of jobs. The computer-controlled system includes at least one system controller for planning and scheduling utilization of selected module capabilities in the production of jobs having not less than one work unit. Module capabilities include the relative costs of the module capabilities.

Abstract: For an automated manufacturing system having a number of modules with numerous alternative capabilities, a computer-controlled system provides for monitoring and reporting incremental job status. The computer-controlled system includes at least one system controller for planning and scheduling a variety of jobs submitted to the manufacturing system for processing. The system controller includes at least one planning function, which plans utilization of selected module capabilities in the production of jobs having more than one work unit. A scheduling function schedules utilization of selected module capabilities. A logging and integration function logs execution reports from the various modules in the manufacturing system.

Abstract: A computer controlled system provides for configuration-specific recovery of operation in a reconfigurable production system having a plurality of modules with a plurality of alternative capabilities for processing work units. The system includes a system controller having planning, scheduling, and performance failure identification functions. The planning function plans utilization of selected module capabilities in the production of jobs having not less than one work unit and the scheduling function schedules utilization of selected module capabilities in the production of jobs. The failure identification function identifies the failure of module capabilities to perform the work units for a scheduled job.

Abstract: A media transport array for forming sequential media streams feeding a media processing system in which serial flows, parallel flows, or both are desired are structured from standard, batch fabricatable media path modules. Each media path module includes a frame unit, intermodule latching means, media control electronics, and media state sensing electronics. Within each media path module, at least one media transport nip receives media and passes it to an independently actuated media director. Media guides support media as it moves into and out of the media director.

Abstract: A frameless media path module is provided for a media processing system feeding media streams through a media path structured for serial or parallel flows. The frameless media path module includes a plurality of media guides and not less than two media transport nips operated by at least one actuator. Means is included for attaching the frameless media path module to a supporting structure. Media state sensing electronics detect media edge or relative motion and intermodule electrical communication capability is provided.