公开(公告)号：US20220108621A1

公开(公告)日：2022-04-07

申请号：US17468615

申请日：2021-09-07

Applicant: City University of Hong Kong ,  Hangzhou Antwork Network Technology Co., Ltd.

Inventor： Lishuai LI ,  Fang HE ,  Lei ZHANG

IPC: G08G5/00 ,  G05D1/04 ,  B64C39/02

Abstract: The present invention provides a method for planning a shortest possible three-dimensional path for autonomous flying robots to traverse from one location to the other in a geographical region, including translating a three-dimensional (3D) environment, discretizing the 3D environment into a graph of many grid cells or nodes, employing a modified any-angle path planning algorithm to calculate non-uniform traversal cost of each grid cell and by averaging the total traversal costs along the path to shorten the corresponding computation time, whilst incorporating operational costs other than the traversal cost specific to the autonomous flying robots to be traversed. The shortest possible path found by the present method does not only consider the path length, but also takes different costs of traversing and operating the flying robots into account, which increases its feasibility and flexibility to be applied in a wide variety of situations and technological areas.

公开(公告)号：US11915599B2

公开(公告)日：2024-02-27

申请号：US17468615

申请日：2021-09-07

Applicant: City University of Hong Kong ,  Hangzhou Antwork Network Technology Co., Ltd.

Inventor： Lishuai Li ,  Fang He ,  Lei Zhang

IPC: G08G5/00 ,  G05D1/04 ,  B64C39/02 ,  G05D1/00 ,  B64U101/00

CPC classification number: G08G5/0039 ,  B64C39/024 ,  G05D1/042 ,  G08G5/0034 ,  B64U2101/00

Abstract: The present invention provides a method for planning a shortest possible three-dimensional path for autonomous flying robots to traverse from one location to the other in a geographical region, including translating a three-dimensional (3D) environment, discretizing the 3D environment into a graph of many grid cells or nodes, employing a modified any-angle path planning algorithm to calculate non-uniform traversal cost of each grid cell and by averaging the total traversal costs along the path to shorten the corresponding computation time, whilst incorporating operational costs other than the traversal cost specific to the autonomous flying robots to be traversed. The shortest possible path found by the present method does not only consider the path length, but also takes different costs of traversing and operating the flying robots into account, which increases its feasibility and flexibility to be applied in a wide variety of situations and technological areas.

公开(公告)号：US20220075393A1

公开(公告)日：2022-03-10

申请号：US17468628

申请日：2021-09-07

Applicant: City University of Hong Kong ,  Hangzhou Antwork Network Technology Co., Ltd.

Inventor： Lishuai LI ,  Fang HE ,  Lei ZHANG ,  Xinyu HE

IPC: G05D1/10 ,  B64C39/02

Abstract: The UAV system has one or more UAVs and an operating device. The operating device is connected to the UAVs through wireless communication. The management method includes: generating a plurality of position cells; prioritizing a plurality of OD pairs and generates a delivery sequence; output one or more route information according to the position cells and the delivery sequence; and transmitting the route information to one or more UAV. Each of the position cells has a cell type and a cell cost.