arXiv (All)
open access
Adaptive Long-range UAV Flight Planning using Monte Carlo Search Trees
Long-range fixed-wing UAV missions require energy-efficient, dynamically feasible trajectories that can adapt online to evolving wind and airspace constraints. We present a Monte Carlo Tree Search (MCTS)-based framework that addresses this challenge by formulating mission planning as a finite-horizo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- PMosFM: Preconditioned Manifold Matching for One-Step Physics-Constrained Generation#1154548
- PMosFM: Preconditioned Manifold Matching for One-Step Physics-Constrained Generation#1136816
- Robust and Scalable UAV-UGV Planning for Aerial Monitoring under Energy and Precedence Constraints#1296677
- aRieL - Reinforcement Learning for the Ariel Space Telescope Scheduling#1143167
- Universal Observatory Graphs for Distributed Sky Coverage and Artificial Intelligence Based Interplanetary Routing#1036927
Record · ID 1400620
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive