An Optimal Algorithm for Changing from Latitudinal to Longitudinal Formation of Autonomous Aircraft Squadrons
Paulo Andr\'e Sperandio Giacomin, Elder Moreira Hemerly

TL;DR
This paper introduces an optimal algorithm for autonomous aircraft squadrons to switch formations efficiently and safely using predefined 3D maneuvers, crucial for various operational tasks.
Contribution
It presents a novel, dynamically defined formation change algorithm with proven optimality and collision avoidance capabilities for autonomous aircraft squadrons.
Findings
Collision-free formation change demonstrated in simulations
Algorithm achieves optimal time complexity
Ensures correctness and formation accuracy
Abstract
This work presents an algorithm for changing from latitudinal to longitudinal formation of autonomous aircraft squadrons. The maneuvers are defined dynamically by using a predefined set of 3D basic maneuvers. This formation changing is necessary when the squadron has to perform tasks which demand both formations, such as lift off, georeferencing, obstacle avoidance and landing. Simulations show that the formation changing is made without collision. The time complexity analysis of the transformation algorithm reveals that its efficiency is optimal, and the proof of correction ensures its longitudinal formation features.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Robotic Path Planning Algorithms · Modular Robots and Swarm Intelligence
