Minimum-Time Sequential Traversal by a Team of Small Unmanned Aerial Vehicles in an Unknown Environment with Winds (2501.09944v1)

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