Solving the area coverage problem with UAVs: A vehicle routing with time windows variation

In real life, providing security for a set of large areas by covering the areas with Unmanned Aerial Vehicles (UAVs) is a difficult problem that consists of multiple objectives. These difficulties are even greater if the area coverage has to be sustained through a specific time window. We address th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Robotics and autonomous systems Jg. 126; S. 103435
Hauptverfasser:	Semiz, Fatih, Polat, Faruk
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.04.2020
Schlagworte:	Simplex algorithm Transportation problem Unmanned aerial vehicle Vehicle routing problem VRPTW Transportation problem Unmanned aerial vehicle VRPTW Vehicle routing problem Simplex algorithm
ISSN:	0921-8890, 1872-793X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!