System and method for parallel edge partitioning in and/or graph search

    公开(公告)号:US10410144B2

    公开(公告)日:2019-09-10

    申请号:US13273714

    申请日:2011-10-14

    IPC分类号: G06Q10/04

    摘要: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR 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 adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes. The method progresses to the next search layer once all the adjusted operator groups in the current search layer have been used for node expansions.

    System and method for parallel edge partitioning in and/or graph search
    2.
    发明申请
    System and method for parallel edge partitioning in and/or graph search 审中-公开
    和/或图形搜索中的并行边缘划分的系统和方法

    公开(公告)号:US20130097199A1

    公开(公告)日:2013-04-18

    申请号:US13273714

    申请日:2011-10-14

    IPC分类号: G06F17/30

    CPC分类号: G06Q10/04

    摘要: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR 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 adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes. The method progresses to the next search layer once all the adjusted operator groups in the current search layer have been used for node expansions.

    摘要翻译: 用于并行搜索图形的方法和系统,其使用状态空间抽象来构造AND / OR图的抽象表示。 图的抽象表示包括具有重复检测范围的一个或多个抽象节点和具有针对AND节点结果调整的运算符组的一个或多个抽象边缘。 使用边缘分割将抽象节点的重复检测范围划分为较小的重复检测范围,其中抽象边缘用于定义较小的重复检测范围。 当前搜索层中的节点由处理单元使用由节点映射的抽象节点的输出抽象边缘的经调整的运算符组进行扩展,其中并行扩展的节点使用与具有不相交的重复检测范围的抽象边缘相关联的调整的运算符组 。 一旦当前搜索图层中所有已调整的运算符组已被用于节点扩展,该方法将进行到下一个搜索层。

    SYSTEM AND METHOD FOR PARALLEL GRAPH SEARCHING UTILIZING PARALLEL EDGE PARTITIONING
    3.
    发明申请
    SYSTEM AND METHOD FOR PARALLEL GRAPH SEARCHING UTILIZING PARALLEL EDGE PARTITIONING 有权
    用于平行图搜索并行平行边缘分割的系统和方法

    公开(公告)号:US20110313984A1

    公开(公告)日:2011-12-22

    申请号:US12842363

    申请日:2010-07-23

    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.

    摘要翻译: 一种用于执行图形搜索的方法和系统,包括使用状态空间抽象构建图形的抽象表示。 该图的抽象表示包括具有重复检测范围的一个或多个抽象节点和具有操作者组的一个或多个抽象边缘。 使用边缘分割将抽象节点的重复检测范围划分为较小的重复检测范围。 抽象边缘包括较小的重复检测范围。 使用节点映射到的抽象节点的传出抽象边缘的运算符组来扩展当前搜索层中的节点。 与具有不相交重复检测范围的抽象边缘相关联的运算符组用于并行展开节点。 一旦当前搜索层中的所有运算符组已被用于节点扩展,该方法将进行到下一个搜索层。

    System and method for parallel graph searching utilizing parallel edge partitioning

    公开(公告)号:US09984327B2

    公开(公告)日:2018-05-29

    申请号:US12842363

    申请日:2010-07-23

    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.

    METHOD FOR IDENTIFYING THE MAXIMAL PACKING DENSITY OF SHIFTING-TILES AUTOMATED WAREHOUSES
    5.
    发明申请
    METHOD FOR IDENTIFYING THE MAXIMAL PACKING DENSITY OF SHIFTING-TILES AUTOMATED WAREHOUSES 有权
    识别自动化仓库最大包装密度的方法

    公开(公告)号:US20130197869A1

    公开(公告)日:2013-08-01

    申请号:US13363693

    申请日:2012-02-01

    IPC分类号: G06F17/50

    CPC分类号: G06Q10/04 G06Q10/087

    摘要: A warehouse management system including a layout module which determines a layout of the automated warehouse, the layout including at least one occupied cell and at least one blank cell and an analysis module which analyzes the layout of the automated warehouse to determine a minimum number of blank cells required to retrieve an object from all of the occupied cells in the warehouse.

    摘要翻译: 一种仓库管理系统,包括确定自动化仓库布局的布局模块,包括至少一个占用单元和至少一个空白单元的布局,以及分析模块,该分析模块分析自动仓库的布局以确定最小数量的空白 从仓库中的所有占用单元检索对象所需的单元。

    Method for identifying the maximal packing density of shifting-tiles automated warehouses
    6.
    发明授权
    Method for identifying the maximal packing density of shifting-tiles automated warehouses 有权
    识别移动瓦自动化仓库的最大包装密度的方法

    公开(公告)号:US08849634B2

    公开(公告)日:2014-09-30

    申请号:US13363693

    申请日:2012-02-01

    IPC分类号: G06G7/48

    CPC分类号: G06Q10/04 G06Q10/087

    摘要: A warehouse management system including a layout module which determines a layout of the automated warehouse, the layout including at least one occupied cell and at least one blank cell and an analysis module which analyzes the layout of the automated warehouse to determine a minimum number of blank cells required to retrieve an object from all of the occupied cells in the warehouse.

    摘要翻译: 一种仓库管理系统,包括确定自动化仓库布局的布局模块,包括至少一个占用单元和至少一个空白单元的布局,以及分析模块,该分析模块分析自动仓库的布局以确定最小数量的空白 从仓库中的所有占用单元检索对象所需的单元。

    System and method for on-line planning utilizing multiple planning queues

    公开(公告)号:US08463416B2

    公开(公告)日:2013-06-11

    申请号:US12504063

    申请日:2009-07-16

    IPC分类号: G06F19/00

    摘要: 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.

    METHODS AND SYSTEMS FOR TARGET VALUE PATH IDENTIFICATION
    8.
    发明申请
    METHODS AND SYSTEMS FOR TARGET VALUE PATH IDENTIFICATION 有权
    目标值路径识别的方法和系统

    公开(公告)号:US20100010952A1

    公开(公告)日:2010-01-14

    申请号:US12409235

    申请日:2009-03-23

    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.

    摘要翻译: 呈现目标价值搜索方法和系统,用于解决目标值路径问题,以识别其中创建连接图的图形中的路径或路径,并且为连接图中的每个节点确定上限值和下限值, 执行最佳搜索以识别从起始节点到具有最接近目标值的路径值的目标节点的路径或路径。

    System and method for real-time system control using precomputed plans
    10.
    发明申请
    System and method for real-time system control using precomputed plans 有权
    使用预先计算的计划实时系统控制的系统和方法

    公开(公告)号:US20080300706A1

    公开(公告)日:2008-12-04

    申请号:US11807475

    申请日:2007-05-29

    IPC分类号: G06F19/00

    摘要: 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.

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