Pith. sign in

REVIEW 1 cited by

Multi-Fidelity Reinforcement Learning for Time-Optimal Quadrotor Re-planning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.08152 v2 pith:QKCIVAN7 submitted 2024-03-13 cs.RO

classification cs.RO
keywords policymethodmodelplanningreal-worldlearningmulti-fidelityreinforcement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

High-speed online trajectory planning for UAVs poses a significant challenge due to the need for precise modeling of complex dynamics while also being constrained by computational limitations. This paper presents a multi-fidelity reinforcement learning method (MFRL) that aims to effectively create a realistic dynamics model and simultaneously train a planning policy that can be readily deployed in real-time applications. The proposed method involves the co-training of a planning policy and a reward estimator; the latter predicts the performance of the policy's output and is trained efficiently through multi-fidelity Bayesian optimization. This optimization approach models the correlation between different fidelity levels, thereby constructing a high-fidelity model based on a low-fidelity foundation, which enables the accurate development of the reward model with limited high-fidelity experiments. The framework is further extended to include real-world flight experiments in reinforcement learning training, allowing the reward model to precisely reflect real-world constraints and broadening the policy's applicability to real-world scenarios. We present rigorous evaluations by training and testing the planning policy in both simulated and real-world environments. The resulting trained policy not only generates faster and more reliable trajectories compared to the baseline snap minimization method, but it also achieves trajectory updates in 2 ms on average, while the baseline method takes several minutes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Smooth SE(3) Trajectories under Left-Invariant Riemannian Metrics

    cs.RO 2026-08 conditional novelty 6.0 of 10

    A metric-conditioned network with analytic boundary completion generates smooth SE(3) trajectories in about a millisecond, approximating variational optima under left-invariant Riemannian metrics.

Pith tools