Abstract
For non-stationary tethered multirotor UAVs in real-world conditions, simulating the forces imposed on the drone by the aerodynamic drag of the tether becomes crucial, with online use cases placing a hard bound on the maximum solve time. In previous work, a quasi-analytical catenary tether model reached a mean solve time of 0.51 ms using a general-purpose root finder, but without any worst-case guarantees or proven convergence. In this work, we reformulate the inner solver by reducing the catenary boundary-value problem to a single transcendental equation in one well-conditioned unknown. We derive a closed-form bracket and prove monotonicity and convexity as well as existence and uniqueness of the root, which together guarantee convergence of the solver. We further propose a two-regime initial guess which approximates the true root within 3.4% and reduces the mean iteration count by 68.0% to 2.36 compared to the textbook initialization. Building on the hybrid root-finding method rtsafe (Newton-Raphson with bisection fallback giving bounded iteration counts), we implement a specialized variant that exploits the problem structure to omit unnecessary checks while retaining correctness, which gives up to 1.3 times speedup. With the proposed solver the full tether model achieves a nearly constant solve time of 6.9 us on average and 7.7 us at worst, a 40 times speedup over an optimized re-implementation of the previous method, while agreeing with it to a relative deviation of 8.7e-9. Because the reformulation leaves the underlying physical model untouched, the experimental validation of the previous work carries over unchanged. We further demonstrate its suitability for embedded, resource-constrained platforms with a Lua implementation running directly in ArduPilot on a drone's flight controller, where it stays well inside the scheduling budget with a mean solve time of 0.74 ms.
Explore similar work
Aug 10, 2026cs.RO
Recent developments in planetary exploration have shown the potential of Unmanned Aerial Vehicles (UAVs), such as the Ingenuity helicopter that provided valuable mapping data. However, limited payload capabilities constrain the flight times and compute available for localization, which restrict their applicability. By providing a tethered connection, issues such as battery and computational constraints are offloaded to the base rover. At the same time, the cable can be exploited for non-drifting localization. This work presents a novel Tether-Inertial Localization approach that uses tether length and angle measurements to estimate the UAV position relative to its base. The method combines a computationally efficient analytical catenary model with a Gaussian Process (GP) residual error compensation. This accounts for systematic sensor inaccuracies and model limitations. Experimental validation across circular, triangular, and figure-eight trajectories with tether lengths up to 4.5 m and a total flight time of 37 minutes demonstrates the effectiveness of the proposed approach. Using only tether-based position estimates for feedback, the analytical catenary model achieves an average RMSE of 7.4 cm, which is further reduced to 5.2 cm through GP-based residual compensation, one order of magnitude better than the state-of-the-art. These results establish Tether-Inertial Localization as a practical alternative to vision- and GNSS-based localization for Tethered Unmanned Aerial Vehicles (TUAVs).
Dielof van Loon, Anton Bredenbeck, Lennart Puck +2
Jul 15, 2026cs.RO
This paper introduces the Dynamical Vehicle Orienteering Problem (DVOP), a generalization of the Orienteering Problem (OP). The OP maximizes the reward collected from spatial targets under a limited travel budget; the DVOP extends it by accounting for both external and vehicle-actuated forces. We study the DVOP in the context of multi-rotor Unmanned Aerial Vehicle (UAV) flight planning, using a three-dimensional Point-Mass Model (PMM) constrained by maximum velocity and acceleration magnitudes and subject to gravitational acceleration, with the travel budget expressed as a maximum flight time. Because the DVOP couples reward maximization with time-optimal trajectory planning, it cannot be formulated as a simple graph problem and solved exactly without relaxing or under-actuating the vehicle dynamics. We therefore propose two solution approaches: a Branch-and-Bound (BnB) procedure that combines Non-Linear Programming (NLP) and Mixed-Integer Linear Programming (MILP) to provide high-quality solutions, and a Large Neighborhood Search (LNS) metaheuristic that supplies an initial reward bound and scales to instances intractable for the BnB. The BnB relies on a novel MILP formulation of travel costs based on minimum-time trajectory primitives through target triplets, yielding a tight reward upper bound, while the LNS uses limited thrust decomposition to compute fast, high-quality PMM trajectories. Experiments on benchmark instances show improvements of up to 37 % over state-of-the-art solutions for the Kinematic Orienteering Problem, and a real-world deployment on a multi-rotor UAV verifies the proposed PMM solution trajectories.
František Nekovář, Matej Novosad, Martin Saska +1
Jul 24, 2026cs.CE
Multirotor Unmanned Aerial Vehicle (UAV) design is governed by a tightly coupled system of non-linear equations spanning structural mechanics, electrochemistry, aerodynamics, and kinematics. Solved sequentially, a miscalibrated sub-model coefficient triggers a mass-compounding cascade failure--the Mass Snowball effect. This paper presents AeroEval, a physics-based, Multidisciplinary Design Optimization (MDO) engine that simultaneously resolves all subsystem couplings and maps continuous sizing optima to physically purchasable, commercial off-the-shelf (COTS) components. The MDO engine is validated under a strict calibrate/test protocol that eliminates circularity: three structural/packaging coefficients are fitted on a held-out cohort of 20 do-it-yourself (DIY) and legacy platforms, then frozen and evaluated blind on 19 modern commercial drone platforms spanning 377 g to 76 kg. On the commercial test cohort the engine predicts Maximum Takeoff Weight (MTOW) within 7.2% Mean Absolute Percentage Error (MAPE), with a mean complexity factor
k≈1.05±0.08 and
RMSEMTOW=1.59 kg; the DIY calibration cohort, characterized by high build variability, yields 26.1% MAPE. Battery mass is predicted within 7.9% on single-pack platforms, with a disclosed systematic underprediction on redundant multi-battery enterprise platforms. A 14-parameter sensitivity suite of >300 simulations quantifies partial derivatives of takeoff mass and flight time; forward velocity diverges beyond 25.5 m/s due to cubic parasite power growth. The path-dependent mass-shedding model for agricultural and delivery roles reduces structural frame mass by up to 40.6% and energy capacity by 33.7% relative to static baselines. Typical solver convergence requires 25-50 iterations, completing in under 50 ms on a standard desktop CPU.
Akshay Gupta Burela, P. B. Sujit