Show simple item record

contributor authorJianfei Chen
contributor authorZhiQiang Chen
date accessioned2022-01-30T19:24:53Z
date available2022-01-30T19:24:53Z
date issued2020
identifier other%28ASCE%29CP.1943-5487.0000887.pdf
identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4265255
description abstractSmall unmanned aerial vehicles (UAVs) are emerging as transformative platforms for different geospatial applications. In these scenarios, multidestination path planning becomes critical due to their energy limitation. However, how to tactically operate a UAV with its limited energy source considering per-destination tasking in a network is not fully answered. An optimization framework is developed in this paper by casting the formulation as a classical traveling salesman problem with neighborhoods (TSPN). The authors introduce a packet-loss function and propose optimizing the total cost with the hovering-induced cost as a regularization term. The framework yields two upper-bound schemes and one regularized solution by considering the hovering-induced energy, the dynamically minimized path-energy (DM-PE) solution. The simulation results, based on both small and large-scale networks, verify that the DM-PE scheme warrants the most minimal path-energy cost among the three solutions.
publisherASCE
titleSpatial Path–Energy Optimization for UAV Operation in Arial–Ground Networking
typeJournal Paper
journal volume34
journal issue3
journal titleJournal of Computing in Civil Engineering
identifier doi10.1061/(ASCE)CP.1943-5487.0000887
page04020008
treeJournal of Computing in Civil Engineering:;2020:;Volume ( 034 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record