Abstract

We introduce a novel coverage problem which arises in aerial surveying applications. The goal is to compute a shortest path which visits a given set of cones. The apex of each cone is restricted to lie on the ground plane. The common angle \(\alpha \) of the cones represent the field of view of the onboard camera. The cone heights, which can be varying, correspond with the desired observation quality (e.g. resolution). This problem is a novel variant of the Traveling Salesperson Problem with Neighborhoods (TSPN). We name it Cone-TSPN.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call