DeepAI AI Chat
Log In Sign Up

Trajectory-based Traveling Salesman Problem for Multirotor UAVs

by   Fabian Meyer, et al.

This paper presents a new method for integrated time-optimal routing and trajectory optimization of multirotor unmanned aerial vehicles (UAVs). Our approach extends the well-known Traveling Salesman Problem by accounting for the limited maneuverability of the UAVs due to their kinematic properties. To this end, we allow each waypoint to be traversed with a discretized velocity as well as a discretized flight direction and compute time-optimal trajectories to determine the travel time costs for each edge. We refer to this novel optimization problem as the Trajectory-based Traveling Salesman Problem (TBTSP). The results show that compared to a state-of-the-art approach for Traveling Salesman Problems with kinematic restrictions of UAVs, we can decrease mission duration by up to 15%.


page 1

page 2

page 3

page 4


Kinematic Orienteering Problem With Time-Optimal Trajectories for Multirotor UAVs

In many unmanned aerial vehicle (UAV) applications for surveillance and ...

Asteroid Flyby Cycler Trajectory Design Using Deep Neural Networks

Asteroid exploration has been attracting more attention in recent years....

Optimal Trajectory Planning for Cinematography with Multiple Unmanned Aerial Vehicles

This paper presents a method for planning optimal trajectories with a te...

Recharging of Flying Base Stations using Airborne RF Energy Sources

This paper presents a new method for recharging flying base stations, ca...

Minimum time trajectory generation for surveying using UAVs

In this paper, we present a motion planning strategy for UAVs that gener...

Energy-Efficient Inference on the Edge Exploiting TinyML Capabilities for UAVs

In recent years, the proliferation of unmanned aerial vehicles (UAVs) ha...

Integrated Optimization of Ascent Trajectory and SRM Design of Multistage Launch Vehicles

This paper presents a methodology for the concurrent first-stage prelimi...