City University of Hong Kong

Hangzhou Antwork Network Technology Co., Ltd.

Lishuai Li

Lei Zhang

Florent Charruaud

Weizun Zhao

Fang He

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.

Grid based path search method for UAV delivery operations in urban environment

A method of presenting flight data of one or more aircrafts, including the steps of: receiving dataset associated with the aircraft from a data management system; applying an analysis process to compare at least two portions of the received dataset; and presenting the analysed data portions to a user in a visualized manner. A graphical user interface is also included for use with the method.

Growing community of inventors

Hong Kong, China

Lishuai Li