公开(公告)号：US20070283319A1

公开(公告)日：2007-12-06

申请号：US11732477

申请日：2007-04-02

申请人： Stephen Coy ,  Gregory Gershanok ,  Ali Boroujerdi ,  Zane Dodson ,  Robert Praus

发明人： Stephen Coy ,  Gregory Gershanok ,  Ali Boroujerdi ,  Zane Dodson ,  Robert Praus

IPC分类号： G06F9/44

CPC分类号： G06F8/34 ,  G06F8/20

摘要： Reliable signaling between outputs and inputs is provided. Inputs and outputs are allowed to be mutable and thus can change. The change of an output affects inputs connected to it. Thus, when write access is requested for an output, a notification is sent to inputs connected to it. The change may be made and then write access may be released signaling that the change is completed. A notification that the change has been completed is then sent from the output to the inputs. This allows a user to know when exactly the change occurred and ended.

摘要翻译： 提供输出和输入之间的可靠信号。 输入和输出允许是可变的，因此可以改变。 输出的变化会影响与之相关的输入。 因此，当为输出请求写访问时，向连接到其的输入发送通知。 可以进行改变，然后写入访问可以被释放，表明更改完成。 更改已完成的通知随后从输出发送到输入。 这允许用户知道何时完成更改发生和结束。

公开(公告)号：US06477515B1

公开(公告)日：2002-11-05

申请号：US09372161

申请日：1999-08-11

申请人： Ali Boroujerdi ,  Jeffrey K. Uhlmann

发明人： Ali Boroujerdi ,  Jeffrey K. Uhlmann

IPC分类号： G06F1518

CPC分类号： G06Q10/04

摘要： A system is disclosed for computing least cost paths under hard constraints such as turn angle constraints. In an explicit embodiment, a transformation is performed on a graph representation of an optimization problem to generate a transformed graph incorporating the hard constraint in the edges of the transformed graph. Unconstrained optimization is then performed on the transformed graph using an implementation of Dijkstra's algorithm. The structure of the transformed graph lends itself to searching for an optimal solution using data structures of the vertices of the original graph. In an implicit embodiment, the searching is performed using the data structures but without explicitly generating the transformed graph. The enhanced performance of the invention is sufficient to allow for dynamic re-routing of vehicles in uncertain or changing environments.

摘要翻译： 公开了一种用于在诸如转角约束的硬约束下计算最小成本路径的系统。 在显式实施例中，对优化问题的图形表示执行变换以生成在变换图的边缘中并入硬约束的变换图。 然后使用Dijkstra算法的实现在变换图上执行无约束优化。 变换图的结构本身就是使用原始图的顶点的数据结构搜索最优解。 在隐式实施例中，使用数据结构执行搜索，但不显式地生成变换图。 本发明的增强的性能足以允许在不确定或变化的环境中的车辆的动态重新路由。