Show simple item record

contributor authorRudnick
contributor authorHerrmann, Jeffrey W.
contributor authorAzarm, Shapour
date accessioned2017-05-09T01:26:50Z
date available2017-05-09T01:26:50Z
date issued2016
identifier issn1530-9827
identifier otherjcise_016_02_021005.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/160616
description abstractOperating unmanned aerial vehicles (UAVs) over inhabited areas requires mitigating the risk to persons on the ground. Because the risk depends upon the flight path, UAV operators need approaches that can find lowrisk flight paths between the mission's start and finish points. Because the flight paths with the lowest risk could be excessively long and indirect, UAV operators are concerned about the tradeoff between risk and flight time. This paper presents a risk assessment technique and biobjective optimization methods to find lowrisk and time (flight path) solutions and computational experiments to evaluate the relative performance of the methods (their computation time and solution quality). The methods were a network optimization approach that constructed a graph for the problem and used that to generate initial solutions that were then improved by a local approach and a greedy approach and a fourth method that did not use the network solutions. The approaches that improved the solutions generated by the network optimization step performed better than the optimization approach that did not use the network solutions.
publisherThe American Society of Mechanical Engineers (ASME)
titleRisk Based Path Planning Optimization Methods for Unmanned Aerial Vehicles Over Inhabited Areas1
typeJournal Paper
journal volume16
journal issue2
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.4033235
journal fristpage21004
journal lastpage21004
identifier eissn1530-9827
treeJournal of Computing and Information Science in Engineering:;2016:;volume( 016 ):;issue: 002
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record