Search arXivSearch

arXiv · 2605.19202

Aerial Inspection Behaviors via RL-based Quadrotor Control for Under-canopy Forest Environments

Abstract

This paper addresses the problem of using a deep Reinforcement Learning (RL)-based low-level Quadrotor controller within an autonomous Quadrotor navigation stack for aerial inspection missions in under-canopy forest environments. Specifically, the article presents an end-to-end (mapping states to RPMs) Quadrotor control policy that achieves inspection view-pose tracking (simultaneous position and yaw reference tracking), which is crucial for various target inspection behaviors and point-to-point navigation in forests. To ensure safe and reliable deployment of the end-to-end RL controller in long-range missions, this article utilizes a higher navigation guidance layer comprising of a Traveling Salesman Problem planner (TSP) and a Rapidly-exploring Random Tree Star (RRT*) planner. Over a known map of a forest and a set of user-specified inspection regions, the TSP planner finds the optimal visitation sequence. Between two target regions, collision-free paths that respect the tracking limitations of the lower end-to-end RL policy are generated by an RRT* planner. Through five target inspection scenarios, this article demonstrates that an RL-based motor-level stabilizing controller, supported by a navigation guidance layer, can be used effectively as the low-level inspection execution module for under-canopy forest inspection missions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fausto Mauricio Lagos Suarez, Akshit Saradagi, Vidya Sumathy, Viswa Narayanan Sankaranarayanan, George Nikolakopoulos. 2026-05-19. Aerial Inspection Behaviors via RL-based Quadrotor Control for Under-canopy Forest Environments. https://arxiv.org/abs/2605.19202

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

HybridFlow: A 2-NFE Generative Policy for Real-Time Robotic Manipulation

Generative policies for robotic manipulation must balance action accuracy with inference latency. We present HybridFlow, a three-stage policy inference procedure requiring two network function evaluations (2-NFE). A Global Jump uses the MeanFlow average velocity to generate a coarse action trajectory; a parameter-free ReNoise interpolation constructs a state at a nonzero refinement time; and a Local Refine queries the instantaneous-velocity limit of the same network at that time. This construction reuses a unified model without distillation. Our analysis characterizes interval-composition errors and the attenuation of endpoint error under ReNoise interpolation. Controlled RoboMimic ablations support the MeanFlow proposal and intermediate-state construction, achieving 95% average success with reused noise and 95.5% with fresh noise, versus 78% for one-step MeanFlow. Across five real-robot settings with all policies running on the same Jetson AGX Thor, HybridFlow improves normalized task performance over 16-step Diffusion Policy by 13-68 points with approximately eightfold lower action-generation latency. Additional experiments demonstrate its compatibility as an action expert in a vision-language-action framework. Project page: https://hybridflow-anonymous.pages.dev/

cs.RO

SCRAMPPI: Contingency-Constrained Planning using Hamilton-Jacobi Reachability

Autonomous robots commonly aim to achieve a nominal objective while minimizing a cost. Without contingency preparation, this can leave them vulnerable to mission failure. This is formalized as a trajectory optimization problem over the nominal cost with a contingency constraint: from each checked state along the nominal plan, an admissible contingency maneuver must exist that reaches a designated recovery target within a prescribed contingency horizon. Existing methods either optimize contingency trajectories alongside the nominal plan or evaluate this constraint through computationally expensive nested sampling-based searches. Instead, we introduce SCRAMPPI, which represents this requirement as a reach-avoid problem and leverages Hamilton--Jacobi (HJ) reachability analysis to evaluate contingency feasibility. By either computing a reach-avoid value function offline or updating it only as the environment is revealed, and integrating it with model predictive path integral (MPPI) control via resampling-based rollouts, SCRAMPPI provides contingency-feasibility evaluations while still planning in 15-20 hz. Finally, we present simulated and hardware experiments demonstrating real-time nominal planning and execution of contingency maneuvers in mobile-robot navigation, alongside a five-dimensional friction-limited recovery simulation.

cs.RO

Scenario MPC with STL Specifications and Pareto-Based Feasibility Repair

Temporal logic is a formal language for reasoning about system behaviors over time. Signal temporal logic (STL), in particular, has been used to encode spatio-temporal requirements for control synthesis in multi-agent systems, often under the assumption that agents are cooperative and their dynamics are known. However, real-world multi-agent applications, such as autonomous driving, typically involve stochastic and uncontrollable agents. Recent work explored robust control with worst-case or probabilistic formulations, but remains limited in that it either (1) certifies strict satisfaction of STL constraints without addressing feasibility recovery, or (2) relaxes infeasible constraints with ego-centric objectives. In this paper, we propose a model predictive control (MPC) framework that treats feasibility repair as a Pareto optimization problem to explicitly characterize tradeoffs among agent objectives. We further provide a probabilistic certificate on STL violation rate to formally quantify uncertainty under stochastic and uncontrollable agents. The proposed framework is evaluated on two autonomous driving scenarios. Results show that the framework recovers feasible control with demonstrated safe behaviors.

cs.RO