公开(公告)号：US20230400308A1

公开(公告)日：2023-12-14

申请号：US18318663

申请日：2023-05-16

Applicant: POSTECH ACADEMY-INDUSTRY FOUNDATION

Inventor： Hee Kap AHN ,  Tae Kang EOM ,  Hwi KIM ,  Min Cheol KIM

IPC: G01C21/34

CPC classification number: G01C21/3407

Abstract: The present disclosure relates to a method for searching for the shortest path having a minimum link between buildings in a rectilinear polygon obstacle environment, which has been implemented to calculate the shortest path having a minimum link, among the shortest paths based on a Manhattan distance from one building to another building, when buildings are given in a rectilinear polygon obstacle environment. According to the present disclosure, in searching for the shortest path having a minimum link between two buildings, a more efficient data structure can be used in terms of an execution time and memory. A building-building minimum link and shortest path search problem can be solved through only the addition of very small operations by using the segment-point minimum link and shortest path search algorithm which can be easily expanded to the building-building minimum link and shortest path search problem.