Route Planning for Angle Constrained Terrain Mapping Using an Unmanned Aerial Vehicle

Authors:
P. B. Sujit;B. P. Hudzietz;S. Saripalli
Affiliations:
Department of Electrical and Computer Engineering, University of Porto, Porto, Portugal 4200-393;School of Earth and Space Exploration, Arizona State University, Tempe, USA 85287;School of Earth and Space Exploration, Arizona State University, Tempe, USA 85287
Venue:
Journal of Intelligent and Robotic Systems
Year:
2013

Citing 2
Cited 0

Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)
Approximation algorithms for TSP with neighborhoods in the plane

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unmanned Aerial Vehicles (UAVs) equipped with downward-facing, low-cost cameras can be used for terrain mapping. Using a photogrammetric technique, structure from motion, one can create accurate models for less cost than current methods. During mapping, images at certain locations (points of interest (POIs) need to be taken from specified directions due to environmental conditions. As the area that needs to be mapped increases the number of POIs increase. Therefore, we need a route planning algorithm that can determine efficient paths taking kinematic constraints of the vehicle and the angle of arrival at the POIs into account. To determine an efficient solution, we cast the routing problem as a Traveling Salesman Problem (TSP) with angular constraints, and develop two new solutions based on multi-lookahead and multi-neighbor strategies. Simulations are carried out to evaluate the performance of the algorithms.