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

1. 发明授权

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.

2. 发明申请

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.
摘要翻译：本文描述的特征涉及优化用于选择用于执行制造作业的计划的作业计划过程。计划员可以接收要执行作业的系统的模型，并且可以选择足以执行作业的预先计算的计划。在计划期间的第一部分期间识别预先计算的计划，并且可以利用计划周期的其余部分来搜索和识别用于执行作业的更好的计划。如果在规划期结束时无法确定更好的计划，则可以执行所选的预计算方案。

3. 发明申请

US20090268247A1 SYSTEM AND METHOD FOR ON-LINE PLANNING UTILIZING MULTIPLE PLANNING QUEUES 有权
标题翻译：使用多个规划队列进行在线规划的系统和方法
公开(公告)号：US20090268247A1
公开(公告)日：2009-10-29
申请号：US12504063
申请日：2009-07-16
申请人： Wheeler Ruml , Minh Binh Do , Rong Zhou
发明人： Wheeler Ruml , Minh Binh Do , Rong Zhou
IPC分类号： G06F3/12
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.
摘要翻译：本文描述的特征涉及使用多个作业计划队列同时处理对一个或多个机器和/或其组件的多个作业请求批次。每批作业请求被分配给规划队列，并且每个规划队列包括存储非计划作业的未计划子队列，存储等待执行的计划作业的未发送子队列和存储已经被输出到的计划作业的发送子队列执行机器。作业计划器和相关组件确定在给定时间点哪个未发送的子队列具有最少的计划作业，并从与所标识的未发送子队列相同的计划队列中的计划外子队列中选择一个计划外作业。然后，计划人员将为所选作业生成计划，并将计划的作业插入到未发送的子队列中，以最终输出到机器执行。以这种方式，用于每个规划队列的未发送子队列被保持具有基本上相等数量的准备执行的计划作业，这通过确保所有机器和/或相关组件保持繁忙而提高了吞吐量。

4. 发明授权

US07590464B2 System and method for on-line planning utilizing multiple planning queues 失效
标题翻译：使用多个规划队列进行在线规划的系统和方法
公开(公告)号：US07590464B2
公开(公告)日：2009-09-15
申请号：US11807472
申请日：2007-05-29
申请人： 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.
摘要翻译：本文描述的特征涉及使用多个作业计划队列同时处理对一个或多个机器和/或其组件的多个作业请求批次。每批作业请求被分配给规划队列，并且每个规划队列包括存储非计划作业的未计划子队列，存储等待执行的计划作业的未发送子队列和存储已经被输出到的计划作业的发送子队列执行机器。作业计划器和相关组件确定在给定时间点哪个未发送的子队列具有最少的计划作业，并从与所标识的未发送子队列相同的计划队列中的计划外子队列中选择一个计划外作业。然后，计划人员将为所选作业生成计划，并将计划的作业插入到未发送的子队列中，以最终输出到机器执行。以这种方式，用于每个规划队列的未发送子队列被保持具有基本上相等数量的准备执行的计划作业，这通过确保所有机器和/或相关组件保持繁忙而提高了吞吐量。

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. 发明授权

US07925366B2 System and method for real-time system control using precomputed plans 有权
标题翻译：使用预先计算的计划实时系统控制的系统和方法
公开(公告)号：US07925366B2
公开(公告)日：2011-04-12
申请号：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 , G06F17/30
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.
摘要翻译：本文描述的特征涉及优化用于选择用于执行制造作业的计划的作业计划过程。计划员可以接收要执行作业的系统的模型，并且可以选择足以执行作业的预先计算的计划。在计划期间的第一部分期间识别预先计算的计划，并且可以利用计划周期的其余部分来搜索和识别用于执行作业的更好的计划。如果在规划期结束时无法确定更好的计划，则可以执行所选的预计算方案。

7. 发明申请

US20080300707A1 System and method for on-line planning utilizing multiple planning queues 失效
标题翻译：使用多个规划队列进行在线规划的系统和方法
公开(公告)号：US20080300707A1
公开(公告)日：2008-12-04
申请号：US11807472
申请日：2007-05-29
申请人： 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.
摘要翻译：本文描述的特征涉及使用多个作业计划队列同时处理对一个或多个机器和/或其组件的多个作业请求批次。每批作业请求被分配给规划队列，并且每个规划队列包括存储非计划作业的未计划子队列，存储等待执行的计划作业的未发送子队列和存储已经被输出到的计划作业的发送子队列执行机器。作业计划器和相关组件确定在给定时间点哪个未发送的子队列具有最少的计划作业，并从与所识别的未发送子队列相同的计划队列中的计划外子队列中选择一个计划外作业。然后，计划人员将为所选作业生成计划，并将计划的作业插入到未发送的子队列中，以最终输出到机器执行。以这种方式，用于每个规划队列的未发送子队列被保持具有基本上相等数量的准备执行的计划作业，这通过确保所有机器和/或相关组件保持繁忙而提高了吞吐量。

8. 发明申请

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

9. 发明申请

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计划员生成的未来成果解决方案结合到未来成果解决方案的集合集中，分析未来成果解决方案的集合集，至少部分地选择最佳行动对未来成果解决方案的集合进行分析，并将选定的最佳动作输出到计算机内存。

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

热门服务

关于我们

友情链接

联系方式