Salvato in:
Dettagli Bibliografici
Autori principali: DesRoches, Jeffrey A., Cowlagi, Raghvendra V.
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:https://arxiv.org/abs/2501.09944
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917894824132608
author DesRoches, Jeffrey A.
Cowlagi, Raghvendra V.
author_facet DesRoches, Jeffrey A.
Cowlagi, Raghvendra V.
contents We consider the problem of transporting multiple packages from an initial location to a destination location in a windy urban environment using a team of SUAVs. Each SUAV carries one package. We assume that the wind field is unknown, but wind speed can be measured by SUAVs during flight. The SUAVs fly sequentially one after the other, measure wind speeds along their trajectories, and report the measurements to a central computer. The overall objective is to minimize the total travel time of all SUAVs, which is in turn related to the number of SUAV traversals through the environment. For a discretized environment modeled by a graph, we describe a method to estimate wind speeds and the time of traversal for each SUAV path. Each SUAV traverses a minimum-time path planned based on the current wind field estimate. We study cases of static and time-varying wind fields with and without measurement noise. For each case, we demonstrate via numerical simulation that the proposed method finds the optimal path after a minimal number of traversals.
format Preprint
id arxiv_https___arxiv_org_abs_2501_09944
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Minimum-Time Sequential Traversal by a Team of Small Unmanned Aerial Vehicles in an Unknown Environment with Winds
DesRoches, Jeffrey A.
Cowlagi, Raghvendra V.
Systems and Control
We consider the problem of transporting multiple packages from an initial location to a destination location in a windy urban environment using a team of SUAVs. Each SUAV carries one package. We assume that the wind field is unknown, but wind speed can be measured by SUAVs during flight. The SUAVs fly sequentially one after the other, measure wind speeds along their trajectories, and report the measurements to a central computer. The overall objective is to minimize the total travel time of all SUAVs, which is in turn related to the number of SUAV traversals through the environment. For a discretized environment modeled by a graph, we describe a method to estimate wind speeds and the time of traversal for each SUAV path. Each SUAV traverses a minimum-time path planned based on the current wind field estimate. We study cases of static and time-varying wind fields with and without measurement noise. For each case, we demonstrate via numerical simulation that the proposed method finds the optimal path after a minimal number of traversals.
title Minimum-Time Sequential Traversal by a Team of Small Unmanned Aerial Vehicles in an Unknown Environment with Winds
topic Systems and Control
url https://arxiv.org/abs/2501.09944