UAV Flight Path Generating Method and Device
First Claim
1. A UAV flight path generating method, comprising:
- generating at least one ordered key-view subset based on the key-views of the landmark in the scene;
generating local flight paths according to the ordered key-view subset, and defining the local cost function of the local flight paths;
constructing a generalized traveling salesman problem (STSP) based on the local flight paths, getting at least one global flight path to visit at least one landmark by solving the STSP problem, and defining the global cost function of the global flight path;
generating the final cost function based on both the local cost function and the global cost function, and generating the flight path of the UAV by selecting a local flight path and a global flight path according to the result of the solution.
1 Assignment
0 Petitions
Accused Products
Abstract
This invention proposes a new method and software to generate a path with good quality for aerial video shooting in large scale scenes. Using a coarse 2.5D model of a scene, this path generation method consists of several steps: first the user is expected to specify a set of landmarks and designate a superset of key-views for each landmark; our system then automatically generates and evaluates a variety of local camera moves for observing each landmark, which are smooth and collision-free; then automatically determines the optimal order in which the landmarks should be visited, chaining the local camera moves into a single continuous trajectory. Thus, users are able to focus on specifying the visual content that should be captured by the aerial video, rather than on the difficult lower level aspects of designing and specifying the precise drone and camera motions.
-
Citations
21 Claims
-
1. A UAV flight path generating method, comprising:
-
generating at least one ordered key-view subset based on the key-views of the landmark in the scene; generating local flight paths according to the ordered key-view subset, and defining the local cost function of the local flight paths; constructing a generalized traveling salesman problem (STSP) based on the local flight paths, getting at least one global flight path to visit at least one landmark by solving the STSP problem, and defining the global cost function of the global flight path; generating the final cost function based on both the local cost function and the global cost function, and generating the flight path of the UAV by selecting a local flight path and a global flight path according to the result of the solution. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer readable storage medium comprising computer readable instructions, wherein the computer readable instructions enable, when being executed, a processor to at least perform the operations of:
-
generating at least one ordered key-view subset based on the key-views of the landmark in the scene; generating local flight paths according to the ordered key-view subset, and defining the local cost function of the local flight paths; constructing a generalized traveling salesman problem (STSP) based on the local flight paths, getting at least one global flight path to visit at least one landmark by solving the STSP problem, and defining the global cost function of the global flight path; generating the final cost function based on both the local cost function and the global cost function, and generating the flight path of the UAV by selecting a local flight path and a global flight path according to the result of the solution. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. An computer device, comprising:
-
a memory comprising computer readable instructions; and a processor configured to, when the computer readable instructions are executed, perform the operations of; generating at least one ordered key-view subset based on the key-views of the landmark in the scene; generating local flight paths according to the ordered key-view subset, and defining the local cost function of the local flight paths; constructing a generalized traveling salesman problem (STSP) based on the local flight paths, getting at least one global flight path to visit at least one landmark by solving the STSP problem, and defining the global cost function of the global flight path; generating the final cost function based on both the local cost function and the global cost function, and generating the flight path of the UAV by selecting a local flight path and a global flight path according to the result of the solution. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
Specification