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

2. 发明申请

US20110060750A1 MAX-VALUE-FIRST SEARCH FOR TARGET VALUE PROBLEMS 审中-公开
标题翻译：针对目标价值问题的最大价值第一搜索
公开(公告)号：US20110060750A1
公开(公告)日：2011-03-10
申请号：US12636089
申请日：2009-12-11
申请人： Lukas Daniel Kuhn , Johan deKleer , Tim Schmidt , Rong Zhou
发明人： Lukas Daniel Kuhn , Johan deKleer , Tim Schmidt , Rong Zhou
IPC分类号： G06F17/30
CPC分类号： G06F16/9027
摘要： The present application relates to systems and methods for determining at least one target path from a start vertex to a goal vertex within a directed acyclic graph. The systems and methods use a target value search (MFTVS) of a directed acyclic graph. The MFTVS includes beginning with a start vertex as a current prefix and progressing through selected prefixes. The MFTVS further includes determining a selected prefix from successor prefixes of the current prefix according to a selection rule. The selection rule is one of selecting the successor prefix having a highest path value and selecting the successor prefix having a lowest path value. The MFTVS further includes setting the current prefix to the selected prefix until a frontier of a blind spot is encountered. The frontier of the blind spot is defined by an evaluation function.
摘要翻译：本申请涉及用于确定从有向无环图中的起始顶点到目标顶点的至少一个目标路径的系统和方法。系统和方法使用有向无环图的目标值搜索（MFTVS）。 MFTVS包括从起始顶点开始为当前前缀，并通过选定的前缀进行。 MFTVS还包括根据选择规则从当前前缀的后继前缀确定所选择的前缀。选择规则是选择具有最高路径值的后继前缀并选择具有最低路径值的后继前缀之一。 MFTVS还包括将当前前缀设置为所选前缀，直到遇到盲点的边界。盲点的边界由评估函数定义。

IPRDB

热门服务

关于我们

友情链接

联系方式