公开(公告)号：US08775358B2

公开(公告)日：2014-07-08

申请号：US12276956

申请日：2008-11-24

Applicant: Keith Bonawitz ,  Vikash Mansinghka

Inventor： Keith Bonawitz ,  Vikash Mansinghka

IPC: G06F9/44

CPC classification number: G06N7/005

Abstract: A method, apparatus and computer program product for performing probabilistic inference and providing related solution methods is presented. At least one state space (SS) is obtained for variables of interest relating to a problem of interest. None or more densities (D) defining pure functions over locations in the at least one SS are also obtained as is none or more kernels (K) defining a stochastic walk through the at least one SS. A virtual machine executes a stochastic walk through the state space to produce a solution for a problem of interest.

Abstract translation: 提出了一种用于执行概率推理并提供相关解决方案的方法，设备和计算机程序产品。 对于与感兴趣的问题相关的感兴趣的变量，获得至少一个状态空间（SS）。 也可以获得在至少一个SS中的位置定义纯函数的没有或更多的密度（D），因为没有一个或多个限定通过至少一个SS的随机步行的内核（K）。 虚拟机执行通过状态空间的随机步行以产生感兴趣的问题的解决方案。

公开(公告)号：US09424752B1

公开(公告)日：2016-08-23

申请号：US13727071

申请日：2012-12-26

Applicant: Keith Bonawitz

Inventor： Keith Bonawitz

IPC: G01C23/00 ,  G08G5/00

CPC classification number: G01C21/20 ,  B64C2201/022 ,  G05D1/104 ,  G08G1/202 ,  G08G5/0069 ,  G08G5/0091

Abstract: Example methods and systems for performing fleet planning based on coarse estimates of regions is provided. A method may include receiving information indicative of a sequence of coverage requirements for a region over a period of time. For one or more time intervals of the period of time, the method may include dividing the region over which vehicles of the plurality of vehicles may traverse into a plurality of sub-regions such that for each subsequent time interval a size of a given sub-region increases. The method includes at each of the one or more time intervals of the period of time, determining vehicles of the plurality of vehicles that can reach a given landmark in a given sub-region by an end of the one or more time intervals, and based on the sequence of coverage requirements, generating a fleet plan for the time intervals based on the determined vehicles.

Abstract translation: 提供了基于粗略估计区域执行车队规划的示例方法和系统。 方法可以包括在一段时间内接收指示区域的覆盖要求序列的信息。 对于该时间段的一个或多个时间间隔，该方法可以包括将多个车辆中的车辆可以穿过的区域划分成多个子区域，使得对于每个后续时间间隔，给定子区域的大小， 地区增加。 该方法包括在该时间段的一个或多个时间间隔中的每个时间段，确定能够通过一个或多个时间间隔的结束在给定子区域中到达给定地标的多个车辆的车辆，并基于 根据覆盖要求的顺序，根据确定的车辆生成时间间隔的车队计划。

公开(公告)号：US20090144218A1

公开(公告)日：2009-06-04

申请号：US12276956

申请日：2008-11-24

Applicant: Keith Bonawitz ,  Vikash Mansinghka

Inventor： Keith Bonawitz ,  Vikash Mansinghka

IPC: G06N5/04 ,  G06N5/02 ,  G06F9/455

CPC classification number: G06N7/005

Abstract: A method, apparatus and computer program product for performing probabilistic inference and providing related solution methods is presented. At least one state space (SS) is obtained for variables of interest relating to a problem of interest. None or more densities (D) defining pure functions over locations in the at least one SS are also obtained as is none or more kernels (K) defining a stochastic walk through the at least one SS. A virtual machine executes a stochastic walk through the state space to produce a solution for a problem of interest.

Abstract translation: 提出了一种用于执行概率推理并提供相关解决方案的方法，设备和计算机程序产品。 对于与感兴趣的问题相关的感兴趣的变量，获得至少一个状态空间（SS）。 也可以获得在至少一个SS中的位置定义纯函数的没有或更多的密度（D），因为没有一个或多个限定通过至少一个SS的随机步行的内核（K）。 虚拟机执行通过状态空间的随机步行以产生感兴趣的问题的解决方案。