专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08607102B2 Fault management for a printing system 有权
标题翻译：打印系统的故障管理
公开(公告)号：US08607102B2
公开(公告)日：2013-12-10
申请号：US11522171
申请日：2006-09-15
申请人： Meera Sampath , Markus P. J. Fromherz , Dusan G. Lysy , Rajinderjeet Singh Minhas , Naveen Sharma , William Joseph Hannaway , Wheeler Ruml
发明人： Meera Sampath , Markus P. J. Fromherz , Dusan G. Lysy , Rajinderjeet Singh Minhas , Naveen Sharma , William Joseph Hannaway , Wheeler Ruml
IPC分类号： G06F11/00
CPC分类号： H04N1/00204 , G03G15/0194 , G03G15/5079 , G03G15/55 , G03G2215/00021 , G06F11/0733 , G06F11/0748 , G06F11/0793 , G06F17/243 , H04N1/00244 , H04N1/00413 , H04N1/00474 , H04N1/00477 , H04N1/00493 , H04N2201/0094
摘要： 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.
摘要翻译：打印系统包括在打印期间在其间转印打印介质的多个打印介质处理模块和与每个模块相关联的故障管理代理，用于从相应的处理模块获取故障相关数据。故障管理系统与故障管理代理进行通信，从故障管理代理接收故障相关数据。故障管理系统处理故障相关数据以识别系统中的故障，例如当第一处理模块是在第二处理模块中获取的故障相关数据的原因时。当识别出故障时，重新配置代理可以重新配置打印系统以减轻所识别的故障中的至少一个的影响。

2. 发明授权

US08463416B2 System and method for on-line planning utilizing multiple planning queues 有权
公开(公告)号：US08463416B2
公开(公告)日：2013-06-11
申请号：US12504063
申请日：2009-07-16
申请人： Wheeler Ruml , Minh Binh Do , Rong Zhou
发明人： Wheeler Ruml , Minh Binh Do , Rong Zhou
IPC分类号： G06F19/00
CPC分类号： G06F3/1214 , G03G15/5083 , G03G2215/00113 , G03G2215/00126 , G06F3/1215 , G06F3/124 , G06F3/126 , G06F3/1263 , G06F3/1285 , G06Q10/06
摘要： 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.

3. 发明申请

US20080300706A1 System and method for real-time system control using precomputed plans 有权
标题翻译：使用预先计算的计划实时系统控制的系统和方法
公开(公告)号：US20080300706A1
公开(公告)日：2008-12-04
申请号：US11807475
申请日：2007-05-29
申请人： Wheeler Ruml , Minh Binh Do , Rong Zhou , Haitham Ali Hindi
发明人： Wheeler Ruml , Minh Binh Do , Rong Zhou , Haitham Ali Hindi
IPC分类号： G06F19/00
CPC分类号： G06Q10/06 , G06Q10/04 , G06Q50/04 , Y02P90/30
摘要： 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.
摘要翻译：本文描述的特征涉及优化用于选择用于执行制造作业的计划的作业计划过程。计划员可以接收要执行作业的系统的模型，并且可以选择足以执行作业的预先计算的计划。在计划期间的第一部分期间识别预先计算的计划，并且可以利用计划周期的其余部分来搜索和识别用于执行作业的更好的计划。如果在规划期结束时无法确定更好的计划，则可以执行所选的预计算方案。

4. 发明申请

US20050278303A1 System and method for production planning utilizing on-line state-space planning 有权
标题翻译：使用在线状态空间规划的生产计划的系统和方法
公开(公告)号：US20050278303A1
公开(公告)日：2005-12-15
申请号：US10855936
申请日：2004-05-27
申请人： Wheeler Ruml , Markus Fromherz
发明人： Wheeler Ruml , Markus Fromherz
IPC分类号： G06F7/00
CPC分类号： G06Q10/06 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： 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.
摘要翻译：在计算机控制系统中实现的组合搜索方法利用多步骤生产过程的在线状态空间规划操作。计划员考虑各种可能的动作组合，搜索正确地将对象的初始状态转换为指定的期望最终状态的组合。计划者认为的每个动作组合称为搜索节点，每个节点包含一个计划，该计划表示单个对象上各种机器的一系列动作，并且还包含具有向前或向后应用的动作的预测状态。该方法包括确定哪些搜索节点在每个搜索迭代中进一步扩展，以及如果所选择的搜索节点中的对象状态符合对象的期望状态，或者是否应该将动作添加到节点的计划中。选择适用于所选节点的对象状态的动作，将变换应用于属性，并将生成的计划返回给系统。

5. 发明授权

US09250967B2 Model-based planning with multi-capacity resources 有权
标题翻译：以多容量资源为基础的模型规划
公开(公告)号：US09250967B2
公开(公告)日：2016-02-02
申请号：US11807473
申请日：2007-05-29
申请人： Minh Binh Do , Wheeler Ruml , Rong Zhou
发明人： Minh Binh Do , Wheeler Ruml , Rong Zhou
IPC分类号： G06F9/50 , G03G15/06 , G06Q10/06
CPC分类号： G06F9/5016 , G03G15/06 , G06F9/5011 , G06Q10/06
摘要： 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.
摘要翻译：描述了便于执行基于模型的规划技术以用于在机器中分配多容量资源的系统和方法。该机器可以是例如印刷平台，例如静电印刷机。根据各种特征，多容量资源可以是片材缓冲器，并且可以利用时间约束来确定片材缓冲器的新分配的插入点是否可行。可以评估多个插入点（例如，串行或并行），以便确定用于打印作业等的最佳解决方案。

6. 发明授权

US08407077B2 System and method for manufacturing system design and shop scheduling using network flow modeling 有权
标题翻译：使用网络流建模制造系统设计和车间调度的系统和方法
公开(公告)号：US08407077B2
公开(公告)日：2013-03-26
申请号：US11364685
申请日：2006-02-28
申请人： Haitham Ali Hindi , Wheeler Ruml
发明人： Haitham Ali Hindi , Wheeler Ruml
IPC分类号： G06Q10/00
CPC分类号： G05B19/41885 , G06Q10/04 , G06Q50/04 , Y02P90/30
摘要： 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 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 processing multiple job types, with different sequences of operations at different stages. Constraints are applied to the abstracted network flow model, and a plurality of steady state network flows are performed. and combined to captures the transformation of the commodities from a first state to a final output state. The optimistic estimate of the realistic system model under investigation is then returned through use of a general purpose or custom solver. The method can be used to perform tradeoff studies between machine allocations, job mixes, operating costs, reliability and throughput, or to speed up scheduling and machine control.
摘要翻译：提供了一种方法和工具，以获得正在调查的现实系统模型的操作参数的乐观估计或精确最优值。该模型包括用于处理连续或离散商品的组件和路径。该系统可以是具有处理多种作业类型的不同机器的制造系统的模型，在不同阶段具有不同的操作序列。约束应用于抽象网络流模型，并执行多个稳态网络流。并结合起来，将商品从第一个国家转变为最终产出状态。然后通过使用通用或定制求解器返回对现实系统模型的乐观估计。该方法可用于在机器分配，作业混合，运行成本，可靠性和吞吐量之间进行权衡研究，或加快调度和机器控制。

7. 发明申请

US20110238614A1 AI PLANNING BASED QUASI-MONTECARLO SIMULATION METHOD FOR PROBABILISTIC PLANNING 有权
标题翻译：用于概率规划的基于AI规划的QUASI-MONTECARLO模拟方法
公开(公告)号：US20110238614A1
公开(公告)日：2011-09-29
申请号：US12748686
申请日：2010-03-29
申请人： Sungwook Yoon , Wheeler Ruml , Minh Binh Do
发明人： Sungwook Yoon , Wheeler Ruml , Minh Binh Do
IPC分类号： G06N5/02
CPC分类号： G06N99/005
摘要： 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.
摘要翻译：提供了一种基于计算机的方法和系统，用于基于AI规划的准蒙特卡罗模拟进行概率规划。该方法包括为初始状态生成一组可能的动作，生成一组样本未来结果，使用AI计划器为每个样本未来结果生成解决方案，生成一组低概率和高的未来结果解决方案将每个样本未来成果产生的解决方案与AI计划员生成的未来成果解决方案结合到未来成果解决方案的集合集中，分析未来成果解决方案的集合集，至少部分地选择最佳行动对未来成果解决方案的集合进行分析，并将选定的最佳动作输出到计算机内存。

8. 发明授权

US07873962B2 Distributed control systems and methods that selectively activate respective coordinators for respective tasks 有权
标题翻译：分布式控制系统和方法，其选择性地激活相应任务的各个协调器
公开(公告)号：US07873962B2
公开(公告)日：2011-01-18
申请号：US11102910
申请日：2005-04-08
申请人： Lara S. Crawford , Haitham A. Hindi , Markus P. J. Fromherz , Craig Eldershaw , Wheeler Ruml , Kimon D. Roufas
发明人： Lara S. Crawford , Haitham A. Hindi , Markus P. J. Fromherz , Craig Eldershaw , Wheeler Ruml , Kimon D. Roufas
IPC分类号： G06F9/46 , G06F15/16 , G06F3/12 , G06F7/66 , G06K15/00
CPC分类号： G05B19/41865 , G05B2219/32297 , G05B2219/33273 , G05B2219/45187 , G06F3/1296 , Y02P90/20
摘要： 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.
摘要翻译：产生或激活相应的协调员，以协调相关任务的活动。在各个任务需要多个控制器的协同努力的情况下，各个协调器通过生成并向多个控制器传送协作命令来确保合作努力。协调员可以充当系统数据的清算所，选择性地请求和将系统信息中继到适当的控制器。例如，文档处理系统激活相应的打印介质的协调器。相应的协调员通过顺序地编排顺序选择的多个运输执行器控制器的活动来协调运输。来自传感器和/或由致动器控制器维护的模型的选择的纸张位置信息可以由协调器被中继到选择的执行器控制器，以适合于纸张传送任务。

9. 发明申请

US20090144310A1 BOUNDED SUB-OPTIMAL PROBLEM SOLVING 有权
标题翻译：边界子优化问题解决
公开(公告)号：US20090144310A1
公开(公告)日：2009-06-04
申请号：US11948265
申请日：2007-11-30
申请人： Wheeler Ruml
发明人： Wheeler Ruml
IPC分类号： G06F17/30
CPC分类号： G06F17/30961
摘要： 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.
摘要翻译：描述了包括平衡二叉树和二进制堆的数据结构，其可以用于组合搜索算法。例如，用于执行诸如打印作业等的任务的解决方案与用于生成数据结构的节点相关联。每个节点都与一个质量指标相关联，该指标描述了遍历二叉树时通过节点可以达到的最佳解决方案。该二进制堆是从树中的一个节点的子集生成的，其中该子集中的每个节点具有在最佳已知解决方案质量的预定范围内的质量指标值。根据每个节点的搜索工作指标值对二进制堆进行排序，其中在树中更容易到达的节点放置在堆中较高的位置以便于快速识别。

10. 发明申请

US20080300708A1 Model-based planning using query-based component executable instructions 失效
标题翻译：基于模型的规划使用基于查询的组件可执行指令
公开(公告)号：US20080300708A1
公开(公告)日：2008-12-04
申请号：US11807478
申请日：2007-05-29
申请人： Wheeler Ruml , Robert M. Lothus , Minh Binh Do
发明人： Wheeler Ruml , Robert M. Lothus , Minh Binh Do
IPC分类号： G06F19/00
CPC分类号： G06Q10/06 , G06F8/30 , Y02P90/20
摘要： 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.
摘要翻译：用于规划系统的机器控制的方法包括确定用于由系统执行处理作业的计划的每个组件的一个或多个能力和一个或多个能力约束。该计划是基于组件，一个或多个功能以及一个或多个约束来逐步构建的。通过计划的增量部分来查询一组或多组可执行指令，其中每组可执行指令与组件中的不同组件相关联，并表示其对应组件执行的动作，每个增量部分包括由其对应的组件执行，并且每组可执行指令执行其接收的增量部分。在从每个查询的可执行指令集中接收到指示每个组件能够执行增量部分中的动作的确认时，生成用于处理作业的最终计划。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式