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

1. 发明授权

US09460053B2 Depth-first search for target value problems 有权
标题翻译：深度搜索目标值问题
公开(公告)号：US09460053B2
公开(公告)日：2016-10-04
申请号：US13483184
申请日：2012-05-30
申请人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
发明人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
IPC分类号： G06F17/11
CPC分类号： G06F17/11
摘要： A model-based control system for controlling a production system is disclosed. The production system provides jobs and objectives to the model-based control system. The model-based control system includes, a planner operative to provide the production system with a plan, the planner generating the plan using a depth-first target value search. The depth-first target value search being configured to generate the plan with a failure probability most closely approximating a target value. Also provided is a system model operative to model the behavior of the production system. Another aspect of the model-based control system is a diagnosis engine operative to estimate failure probabilities for plans and provide diagnostic guidance to the planner. The model-based control system including the planner, the system model and diagnosis engine are implemented via a digital processing device.
摘要翻译：公开了一种用于控制生产系统的基于模型的控制系统。生产系统为基于模型的控制系统提供了工作和目标。基于模型的控制系统包括：计划器，用于向生产系统提供计划，计划者使用深度优先目标值搜索生成计划。深度优先目标值搜索被配置为生成具有最接近目标值的故障概率的计划。还提供了用于对生产系统的行为进行建模的系统模型。基于模型的控制系统的另一方面是诊断引擎，用于估计计划的故障概率并向计划者提供诊断指导。包括计划器，系统模型和诊断引擎在内的基于模型的控制系统通过数字处理装置实现。

2. 发明申请

US20120246193A1 DEPTH-FIRST SEARCH FOR TARGET VALUE PROBLEMS 审中-公开
标题翻译：深度搜索目标价值问题
公开(公告)号：US20120246193A1
公开(公告)日：2012-09-27
申请号：US13483184
申请日：2012-05-30
申请人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
发明人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
IPC分类号： G06F17/30 , G06F19/00
CPC分类号： G06F17/11
摘要： A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database.
摘要翻译：一种用于确定基于模型的控制系统的目标路径的方法。基于模型的控制系统包括有向非循环图，其中有向非循环图包括由多个边缘互连的多个顶点。该方法包括以下步骤：针对目标路径执行有向无环图的深度优先搜索。深度优先搜索可操作以返回显式解或隐式解，其中使用启发式确定隐式解。该方法还包括确定深度优先搜索是否返回显式解或隐式解，以及如果深度优先搜索返回隐式解，则从隐式解构成目标路径。该方法还可以包括构造模式数据库。

3. 发明授权

US08266092B2 Methods and systems for target value path identification 有权
标题翻译：目标值路径识别的方法和系统
公开(公告)号：US08266092B2
公开(公告)日：2012-09-11
申请号：US12409235
申请日：2009-03-23
申请人： Lukas D. Kuhn , Tim Schmidt , Robert Price , Johan de Kleer , Rong Zhou , Minh Binh Do
发明人： Lukas D. Kuhn , Tim Schmidt , Robert Price , Johan de Kleer , Rong Zhou , Minh Binh Do
IPC分类号： G06F17/00 , G06N7/00 , G06N7/08
CPC分类号： G06Q10/04
摘要： Target value search methods and systems are presented for solving a target value path problem to identify a path or paths in a graph in which a connection graph is created and upper and lower bound values are determined for each node in the connection graph, and a first best search is performed to identify a path or paths from a starting node to a goal node having a path value closest to the target value.
摘要翻译：呈现目标价值搜索方法和系统，用于解决目标值路径问题，以识别其中创建连接图的图形中的路径或路径，并且为连接图中的每个节点确定上限值和下限值，执行最佳搜索以识别从起始节点到具有最接近目标值的路径值的目标节点的路径或路径。

4. 发明授权

US08364629B2 Depth-first search for target value problems 有权
标题翻译：深度搜索目标值问题
公开(公告)号：US08364629B2
公开(公告)日：2013-01-29
申请号：US12497326
申请日：2009-07-02
申请人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
发明人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
IPC分类号： G06F17/00 , G06N7/00 , G06N7/08
CPC分类号： G06F17/11
摘要： A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database.
摘要翻译：一种用于确定基于模型的控制系统的目标路径的方法。基于模型的控制系统包括有向非循环图，其中有向非循环图包括由多个边缘互连的多个顶点。该方法包括以下步骤：针对目标路径执行有向无环图的深度优先搜索。深度优先搜索可操作以返回显式解或隐式解，其中使用启发式确定隐式解。该方法还包括确定深度优先搜索是否返回显式解或隐式解，以及如果深度优先搜索返回隐式解，则从隐式解构成目标路径。该方法还可以包括构造模式数据库。

5. 发明申请

US20100010952A1 METHODS AND SYSTEMS FOR TARGET VALUE PATH IDENTIFICATION 有权
标题翻译：目标值路径识别的方法和系统
公开(公告)号：US20100010952A1
公开(公告)日：2010-01-14
申请号：US12409235
申请日：2009-03-23
申请人： Lukas D. Kuhn , Tim Schmidt , Robert Price , Johan de Kleer , Rong Zhou , Minh Binh Do
发明人： Lukas D. Kuhn , Tim Schmidt , Robert Price , Johan de Kleer , Rong Zhou , Minh Binh Do
IPC分类号： G06N5/02
CPC分类号： G06Q10/04
摘要： Target value search methods and systems are presented for solving a target value path problem to identify a path or paths in a graph in which a connection graph is created and upper and lower bound values are determined for each node in the connection graph, and a first best search is performed to identify a path or paths from a starting node to a goal node having a path value closest to the target value.
摘要翻译：呈现目标价值搜索方法和系统，用于解决目标值路径问题，以识别其中创建连接图的图形中的路径或路径，并且为连接图中的每个节点确定上限值和下限值，执行最佳搜索以识别从起始节点到具有最接近目标值的路径值的目标节点的路径或路径。

6. 发明授权

US08392455B2 Multi-interval heuristics for accelerating target-value search 有权
标题翻译：用于加速目标值搜索的多间隔启发式
公开(公告)号：US08392455B2
公开(公告)日：2013-03-05
申请号：US12497353
申请日：2009-07-02
申请人： Tim Schmidt , Lukas D. Kuhn , Rong Zhou , Johan de Kleer , Robert Price
发明人： Tim Schmidt , Lukas D. Kuhn , Rong Zhou , Johan de Kleer , Robert Price
IPC分类号： G06F7/00
CPC分类号： G06F17/11 , G06Q10/04
摘要： Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include one or more intervals. Thereafter, a best search is performed to identify a path, or paths, from a starting vertex to a goal vertex having a path value closest to a target value.
摘要翻译：提出了使用多间隔启发式求解目标值搜索问题的方法和系统。方法和系统标识图中的路径或路径，从而生成连接图，并为连接图中的每个顶点生成范围集。范围集包括一个或多个间隔。此后，执行最佳搜索以识别从起始顶点到具有最接近目标值的路径值的目标顶点的路径或路径。

7. 发明申请

US20110004625A1 Multi-Interval Heuristics For Accelerating Target-Value Search 有权
标题翻译：用于加速目标值搜索的多间隔启发式
公开(公告)号：US20110004625A1
公开(公告)日：2011-01-06
申请号：US12497353
申请日：2009-07-02
申请人： Tim Schmidt , Lukas D. Kuhn , Rong Zhou , Johan de Kleer , Robert Price
发明人： Tim Schmidt , Lukas D. Kuhn , Rong Zhou , Johan de Kleer , Robert Price
IPC分类号： G06F17/30
CPC分类号： G06F17/11 , G06Q10/04
摘要： Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include one or more intervals. Thereafter, a best search is performed to identify a path, or paths, from a starting vertex to a goal vertex having a path value closest to a target value.
摘要翻译：提出了使用多间隔启发式求解目标值搜索问题的方法和系统。方法和系统标识图中的路径或路径，从而生成连接图，并为连接图中的每个顶点生成范围集。范围集包括一个或多个间隔。此后，执行最佳搜索以识别从起始顶点到具有最接近目标值的路径值的目标顶点的路径或路径。

8. 发明申请

US20110004581A1 Depth-First Search For Target Value Problems 有权
标题翻译：深度优先搜索目标值问题
公开(公告)号：US20110004581A1
公开(公告)日：2011-01-06
申请号：US12497326
申请日：2009-07-02
申请人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
发明人： Tim Schmidt , Rong Zhou , Lukas D. Kuhn , Robert Price , Johan de Kleer
IPC分类号： G06N7/04 , G06F17/30 , G06N7/02
CPC分类号： G06F17/11
摘要： A method for determining a target path for a model-based control system. The model-based control system includes a directed acyclic graph, where the directed acyclic graph includes a plurality of vertices interconnected by a plurality of edges. The method includes the steps of performing a depth-first search of the directed acyclic graph for the target path. The depth-first search is operative to return an explicit solution or an implicit solution, wherein the implicit solution is determined using a heuristic. The method further includes determining if the depth-first search returned an explicit solution or an implicit solution, and if the depth-first search returned an implicit solution, constructing the target path from the implicit solution. The method may further include constructing a pattern database.
摘要翻译：一种用于确定基于模型的控制系统的目标路径的方法。基于模型的控制系统包括有向非循环图，其中有向非循环图包括由多个边缘互连的多个顶点。该方法包括以下步骤：针对目标路径执行有向无环图的深度优先搜索。深度优先搜索可操作以返回显式解或隐式解，其中使用启发式确定隐式解。该方法还包括确定深度优先搜索是否返回显式解或隐式解，以及如果深度优先搜索返回隐式解，则从隐式解构成目标路径。该方法还可以包括构造模式数据库。

9. 发明申请

US20110313984A1 SYSTEM AND METHOD FOR PARALLEL GRAPH SEARCHING UTILIZING PARALLEL EDGE PARTITIONING 有权
标题翻译：用于平行图搜索并行平行边缘分割的系统和方法
公开(公告)号：US20110313984A1
公开(公告)日：2011-12-22
申请号：US12842363
申请日：2010-07-23
申请人： Rong Zhou , Tim Schmidt , Minh Binh Do , Serdar Uckun
发明人： Rong Zhou , Tim Schmidt , Minh Binh Do , Serdar Uckun
IPC分类号： G06F17/30
CPC分类号： G06N5/003 , G06N5/02
摘要： A method and system for performing a graph search, includes constructing an abstract representation of the graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning. The abstract edges include the smaller duplicate detection scopes. Nodes in the current search layer are expanded using the operator groups of outgoing abstract edges of the abstract nodes the nodes map to. The operator groups associated with abstract edges having disjoint duplicate detection scopes are used to expand the nodes in parallel. Once all the operator groups in the current search layer have been used for node expansion the method progresses to the next search layer.
摘要翻译：一种用于执行图形搜索的方法和系统，包括使用状态空间抽象构建图形的抽象表示。该图的抽象表示包括具有重复检测范围的一个或多个抽象节点和具有操作者组的一个或多个抽象边缘。使用边缘分割将抽象节点的重复检测范围划分为较小的重复检测范围。抽象边缘包括较小的重复检测范围。使用节点映射到的抽象节点的传出抽象边缘的运算符组来扩展当前搜索层中的节点。与具有不相交重复检测范围的抽象边缘相关联的运算符组用于并行展开节点。一旦当前搜索层中的所有运算符组已被用于节点扩展，该方法将进行到下一个搜索层。

10. 发明授权

US09984327B2 System and method for parallel graph searching utilizing parallel edge partitioning 有权
公开(公告)号：US09984327B2
公开(公告)日：2018-05-29
申请号：US12842363
申请日：2010-07-23
申请人： Rong Zhou , Tim Schmidt , Minh Binh Do , Serdar Uckun
发明人： Rong Zhou , Tim Schmidt , Minh Binh Do , Serdar Uckun
IPC分类号： G06F17/30 , G06N5/00 , G06N5/02
CPC分类号： G06N5/003 , G06N5/02
摘要： A method and system for performing a graph search, includes constructing an abstract representation of the graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning. The abstract edges include the smaller duplicate detection scopes. Nodes in the current search layer are expanded using the operator groups of outgoing abstract edges of the abstract nodes the nodes map to. The operator groups associated with abstract edges having disjoint duplicate detection scopes are used to expand the nodes in parallel. Once all the operator groups in the current search layer have been used for node expansion the method progresses to the next search layer.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式