Search arXiv⌕ Search

arXiv · 2610.03924

Barrier-Shaped Recurrent Reinforcement Learning for Autonomous Landing on a Heaving Ship Deck

Abstract

This paper addresses autonomous landing of unmanned aerial vehicle (UAV) rotorcrafts on a heaving ship deck using a recurrent policy trained via asymmetric actor-critic reinforcement learning: the critic sees 6 s of future deck height during training, while the actor sees only what the onboard sensors provide in flight, a 17-dimensional state made of the vehicle's position, velocity and attitude relative to the deck and outputs world-frame velocity and yaw-rate commands. Training is performed across 4096 parallel simulated environments, followed by fine-tuning in 16 environments with an onboard vision pipeline in the loop. A control-barrier-function (CBF) stopping margin on the deck-relative vertical state is incorporated at two stages: as a reward term during training, where it halves the median simulated contact speed relative to a policy trained without it, and as a runtime safety filter at deployment, evaluated at every control step to abort and retry the descent when the margin is violated. Because the autopilot's disarm logic cannot detect the vehicle resting on a moving deck, proximity-based thrust cutoff at touchdown is commanded directly in the landing pipeline. The proposed approach is validated using a parallel-manipulator-platform-based deck emulator that reproduces the heaving motion of the ship deck (scaled to 0.70 m peak-to-peak, 7.5 s mean period) and a quadcopter UAV with an onboard camera. Across 31 motion-capture and 20 vision-based trials, the UAV landed every time, with median times to contact of 6.5 and 7.3 s; 77% and 50% landed on the first attempt, with mean deck-relative speeds of 0.29 and 0.27 m/s, respectively, at the instant of thrust cutoff, which is the last speed under the policy's control. Supplementary video: https://youtu.be/S5hDkrSZJt4

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ritwik Shankar, Chiranjeev Prachand, Abhishek, Soumya Ranjan Sahoo. 2026-10-02. Barrier-Shaped Recurrent Reinforcement Learning for Autonomous Landing on a Heaving Ship Deck. https://arxiv.org/abs/2610.03924

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

KEEP EXPLORING

Related papers

Opinion Dynamics in Social Multiplex Networks with Mono and Bi-directional Interactions in the Presence of Leaders

We delve into the dynamics of opinions within a multiplex network using coordination games, where agents communicate either through one-way or two-way interactions, and where a designated leader may be present. By employing graph theory and Markov chains, we illustrate that despite zero diagonal elements in transition probability matrices or decomposable layers, opinions converge under specific conditions on the layers, leading to a consensus, and we show by a counterexample that a spanning tree in the union of the layers does not suffice. We further scrutinize the convergence rates of opinion dynamics in networks with one-way versus two-way interactions. We find that in networks with a designated leader, opinions converge towards the initial opinion of the leader, whereas in networks without a designated leader, opinions converge to a convex combination of the opinions of agents. Moreover, we emphasize the crucial role of designated leaders in steering opinion convergence within the network. Paired experiments on 1,200 random multiplex networks show that a leader slows down convergence, and that two-way interactions slow it down in the presence of a leader but speed it up in its absence.

eess.SY↗

Network-Aware Progressive Replacement Sequence Planning for Laser-Enhanced BeiDou Navigation Constellations

The early satellites of the third-generation BeiDou Navigation Satellite System (BDS-3) are approaching the end of their design lifetime, making progressive constellation replacement an inevitable engineering task. Meanwhile, laser inter-satellite links (LISLs) offer high-precision time transfer, ranging, and high-rate data forwarding, providing a promising upgrade path for future BeiDou satellites. This paper investigates the replacement-sequence planning problem for progressively replacing legacy microwave satellites with laser-enabled satellites from a networking perspective. Since practical replacement decisions remain constrained by legacy satellite lifetime, on-orbit condition, laser satellite manufacturing readiness, and launch scheduling, networking information is used as an auxiliary criterion in the actual engineering replacement process. An integer linear programming model is developed to evaluate the network value of intermediate laser--microwave hybrid states. Based on this common state evaluator, two complementary planning methods are developed. A priority-aware exact method supports round-wise network-assisted launch decisions, while a visibility-guided adaptive large-neighborhood search is used for full-sequence planning and provides a full-horizon network-oriented near-optimal reference. Simulations using the actual BDS-3 constellation show that stronger network participation leads to earlier and larger ground-connected laser subnetworks, fewer microwave-dependent satellites, better coordination between laser-backbone growth and high-rate ground access, and improved residual microwave-layer performance. These results provide a quantitative basis for incorporating network performance as an auxiliary criterion in future BeiDou replacement planning.

eess.SY↗

Physically Constrained Agentic AI for Energy Scheduling

Agentic AI extends energy management beyond fixed-form interaction by translating natural-language requests into coordinated scheduling actions. We present a hierarchical ReAct Energy Management System (EMS) in which one orchestrator coordinates specialist agent types for shiftable appliances, EV charging, and thermal control. Physical authorization is separated from language generation: a deterministic critic reconstructs each integrated day-ahead candidate and checks its schema, appliance cycles, device power, thermal comfort, and, when active, the whole power feeder limit. Across Qwen 3.5 checkpoints, single-appliance mixed-integer schedules were feasible in 83.3 percent of runs. Localized feedback produced no accepted coupled schedule, whereas a multi-step policy authorized 6/6 current coupled runs: 3/3 for 27B and 3/3 for 35B-A3B. The standard occupied-window policy permits pre-conditioning, enforces comfort from 09:00-18:00. Every accepted schedule passed an independent final replay. Feasible costs were 2522.499 JPY for 27B and 1592.697 JPY for 35B-A3B, which are slightly higher than the mathematical optimization optimum of 1343.380 JPY. These results establish a fail-closed workflow for agentic MIP and MILP energy scheduling under the declared physical model.

eess.SY↗