Region Extraction From Occupancy Grids
    2.
    发明申请
    Region Extraction From Occupancy Grids 有权
    从占用网格提取区域

    公开(公告)号:US20150254521A1

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

    申请号:US14202576

    申请日:2014-03-10

    Applicant: Google Inc.

    Abstract: Systems and methods for extracting regions from occupancy grids are provided. One example method includes performing a plurality of assignment iterations. Each assignment iteration includes assigning each of a first plurality of cells to one of a plurality of centroids based on a cost formula such that a plurality of regions respectively associated with the plurality of centroids are formed. The region for each centroid comprises all of the cells assigned to such centroid. Each assignment iteration includes reassigning one or more of the first plurality of cells to one or more respective alternate regions. The one or more reassigned cells were included in one or more problem areas of one or more of the plurality of regions. Each assignment iteration includes relocating the plurality of centroids to be the respective means of the plurality of regions. One example system includes computing devices implementing instructions stored on non-transitory computer-readable media.

    Abstract translation: 提供了从占用网格中提取区域的系统和方法。 一个示例性方法包括执行多个分配迭代。 每个分配迭代包括基于成本公式将第一多个单元中的每一个分配给多个质心中的每一个,使得形成分别与多个质心相关联的多个区域。 每个质心的区域包括分配给这种质心的所有单元格。 每个分配迭代包括将第一多个小区中的一个或多个重新分配给一个或多个相应的替代区域。 一个或多个重新分配的小区被包括在多个区域中的一个或多个的一个或多个问题区域中。 每个分配迭代包括将多个质心重定位为多个区域的相应装置。 一个示例性系统包括实现存储在非暂时性计算机可读介质上的指令的计算设备。

    Region extraction from occupancy grids
    5.
    发明授权
    Region extraction from occupancy grids 有权
    从占用网格提取区域

    公开(公告)号:US09195906B2

    公开(公告)日:2015-11-24

    申请号:US14202576

    申请日:2014-03-10

    Applicant: Google Inc.

    Abstract: Systems and methods for extracting regions from occupancy grids are provided. One example method includes performing a plurality of assignment iterations. Each assignment iteration includes assigning each of a first plurality of cells to one of a plurality of centroids based on a cost formula such that a plurality of regions respectively associated with the plurality of centroids are formed. The region for each centroid comprises all of the cells assigned to such centroid. Each assignment iteration includes reassigning one or more of the first plurality of cells to one or more respective alternate regions. The one or more reassigned cells were included in one or more problem areas of one or more of the plurality of regions. Each assignment iteration includes relocating the plurality of centroids to be the respective means of the plurality of regions. One example system includes computing devices implementing instructions stored on non-transitory computer-readable media.

    Abstract translation: 提供了从占用网格中提取区域的系统和方法。 一个示例性方法包括执行多个分配迭代。 每个分配迭代包括基于成本公式将第一多个单元中的每一个分配给多个质心中的每一个,使得形成分别与多个质心相关联的多个区域。 每个质心的区域包括分配给这种质心的所有单元格。 每个分配迭代包括将第一多个小区中的一个或多个重新分配给一个或多个相应的替代区域。 一个或多个重新分配的小区被包括在多个区域中的一个或多个的一个或多个问题区域中。 每个分配迭代包括将多个质心重定位为多个区域的相应装置。 一个示例性系统包括实现存储在非暂时性计算机可读介质上的指令的计算设备。

Patent Agency Ranking