TL;DR
This paper introduces an efficient algorithm for planning energy-efficient, dynamically feasible trajectories for autonomous ornithopters, combining gliding and flapping maneuvers, with applications in long endurance and perching maneuvers.
Contribution
It presents a novel tree-based, heuristic-guided planning algorithm specifically designed for flapping-wing UAVs, addressing a gap in energy-efficient trajectory planning for ornithopters.
Findings
The proposed method outperforms recent probabilistic planning approaches.
The algorithm effectively plans energy-efficient trajectories for long endurance flights.
Demonstrated online planning for perching maneuvers.
Abstract
This paper presents a novel algorithm to plan energy-efficient trajectories for autonomous ornithopters. In general, trajectory optimization is quite a relevant problem for practical applications with \emph{Unmanned Aerial Vehicles} (UAVs). Even though the problem has been well studied for fixed and rotatory-wing vehicles, there are far fewer works exploring it for flapping-wing UAVs like ornithopters. These are of interest for many applications where long flight endurance, but also hovering capabilities are required. We propose an efficient approach to plan ornithopter trajectories that minimize energy consumption by combining gliding and flapping maneuvers. Our algorithm builds a tree of dynamically feasible trajectories and applies heuristic search for efficient online planning, using reference curves to guide the search and prune states. We present computational experiments to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
