公开(公告)号：US20240362374A1

公开(公告)日：2024-10-31

申请号：US18645266

申请日：2024-04-24

Applicant: HYPERLOOP TECHNOLOGIES, INC.

Inventor： Mohammed Ismaeel BABUR ,  Yury SOKOLOV ,  Dihan YANG

IPC: G06F30/20

CPC classification number: G06F30/20

Abstract: A method for generating a dynamic control point for generating an optimized curve includes determining, at a processor(s), an initial curve. A control point sampling interval and a condition are set by the processor(s). Multiple static control points are determined. The static control points are sampled based on the control point sampling interval. A sampled static control point is selected from the plurality of static control points based on the sampled static control point satisfying the condition. The sampled static control point is stored in a set of filtered control points. The set of filtered control points is sampled. A sampled filtered control point is selected based on the control point sampling interval. A dynamic control point is generated based on the sampled filtered control point.

公开(公告)号：US20240362841A1

公开(公告)日：2024-10-31

申请号：US18645287

申请日：2024-04-24

Applicant: Hyperloop Technologies, Inc.

Inventor： Mohammed Ismaeel BABUR ,  Yury SOKOLOV ,  Dihan YANG

IPC: G06T11/40 ,  G06Q30/0283 ,  G06T11/20

CPC classification number: G06T11/40 ,  G06Q30/0283 ,  G06T11/206 ,  G06T2210/12

Abstract: A method for gap filling of geographic information service (“GIS”) data includes receiving a rasterized cost map including a first alignment curve between two locations. The method also includes determining a pixelization factoring data comprising a pixelization factoring value and pixelization factoring metadata. The method further includes generating a pixelized cost map based on the pixelization factoring data and the rasterized cost map. The method still further includes generating a second alignment curve between the two points in accordance with the pixelized cost map.

公开(公告)号：US20240362836A1

公开(公告)日：2024-10-31

申请号：US18645254

申请日：2024-04-24

Applicant: HYPERLOOP TECHNOLOGIES, INC.

Inventor： Mohammed Ismaeel BABUR ,  Yury SOKOLOV ,  Dihan YANG

IPC: G06T11/20 ,  G06T7/13 ,  G06T11/40

CPC classification number: G06T11/203 ,  G06T7/13 ,  G06T11/40

Abstract: A method for gap filling geographic information service data includes determining a bounding region at or near an initial alignment. The method also includes determining the initial alignment within the bounding region. A corridor buffer is generated at or near the initial alignment, and within the bounding region. Cost layer data is processed. Incompleteness of a number of polygon-bounded areas is determined based on the cost layer data. Partial completeness of the polygon-bounded areas and completeness of the polygon-bounded areas are also determined based on the cost layer data. A synthetic completeness of the number of polygon-bounded areas is generated based on the incompleteness, the partial completeness, synthetic completeness, and completeness of the polygon-based areas. A rasterized cost map including the completeness and the synthetic completeness of the polygon-bounded areas is stored at the processor(s) and in memory (ies).

公开(公告)号：US20240362837A1

公开(公告)日：2024-10-31

申请号：US18645273

申请日：2024-04-24

Applicant: HYPERLOOP TECHNOLOGIES, INC.

Inventor： Mohammed Ismaeel BABUR ,  Yury SOKOLOV ,  Dihan YANG

IPC: G06T11/20 ,  G06T7/13

CPC classification number: G06T11/203 ,  G06T7/13

Abstract: A method for optimizing a search space associated with alignment curves includes determining, at a processor, a bounding region and an initial alignment. The initial alignment is within the bounding region. A corridor buffer that is associated with the initial alignment is generated at the processor. A rasterized cost map is generated at the processor based on the corridor buffer.

公开(公告)号：US20240362375A1

公开(公告)日：2024-10-31

申请号：US18645278

申请日：2024-04-24

Applicant: HYPERLOOP TECHNOLOGIES, INC.

Inventor： Mohammed Ismaeel BABUR ,  Yury SOKOLOV ,  Dihan YANG

IPC: G06F30/20 ,  G06F111/10

CPC classification number: G06F30/20 ,  G06F2111/10

Abstract: A computer-implemented method for optimizing an alignment between two points includes receiving a map of an area. The method also includes selecting a first solver from a group of solvers for optimizing an alignment between the two points in the map, each of the group of solvers is a machine learning solver. The method further includes generating a first optimal alignment between the two points based on the first solver minimizing a cost function associated with the two points.