公开(公告)号：US20240151554A1

公开(公告)日：2024-05-09

申请号：US18500041

申请日：2023-11-01

Applicant: POSTECH Research and Business Development Foundation

Inventor： Hee Kap AHN ,  Tae Hoon AHN ,  Ji Woo PARK ,  Seung Jun LEE

IPC: G01C23/00

CPC classification number: G01C23/00

Abstract: The present disclosure provides a method and an apparatus for quickly and accurately evaluating a trajectory of a projectile such as a satellite launching rocket or a missile by comparing the trajectory with a reference trajectory. The trajectory evaluation method includes: acquiring time series positioning data for a target and predetermined reference trajectory information; and mapping points representing the time series positioning data on a graph into corresponding points on a reference trajectory representing the predetermined reference trajectory information while relocating each mapped point onto a relocatable section taking into account a movable range dependent on a speed of the target, and determining a maximum value of distances moved by the points while the points are mapped and relocated as a similarity between the time series positioning data and the reference trajectory.

公开(公告)号：US20250103653A1

公开(公告)日：2025-03-27

申请号：US18494671

申请日：2023-10-25

Applicant: POSTECH Research and Business Development Foundation

Inventor： Hee Kap AHN ,  Hyo Jeong AN ,  Mook Kwon JUNG ,  Tae Kang EOM ,  Hwi KIM

IPC: G06F16/901

Abstract: Disclosed are embodiments of shortest path search in an obstacle environment. Provided is a shortest path search method including: creating an epsilon graph; and determining k closest points from a query point on the basis of the graph, wherein the creating of the graph includes: creating a node group of nodes on the basis of a point group of arrival points; creating an edge group of edges on the basis of the created nodes; setting, on the basis of an obstacle group of at least one obstacle, whether each of the nodes is a valid node or a non-valid node; setting, on the basis of the obstacle group, whether each of the edges is a valid or non-valid edge; and including, for each of the arrival points, a particular arrival point on an anchor list of a valid node closest from the particular arrival point among the valid nodes.