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...

Celý popis

Podrobná bibliografie

Vydáno v:	Robotics and autonomous systems Ročník 126; s. 103435
Hlavní autoři:	Semiz, Fatih, Polat, Faruk
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.04.2020
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!