International Review of Aerospace Engineering (IREASE)
Quantum Approximate Optimization Algorithm for Trajectory Planning in Aerospace Missions Using Cirq Simulator
Jakub Kołota
Abstract
Trajectory optimization is a fundamental problem in aerospace mission planning, involving the selection of optimal paths to minimize fuel consumption, travel time, or other mission costs. This study explores the use of the Quantum Approximate Optimization Algorithm (QAOA) implemented in the Cirq simulator to solve discrete trajectory planning problems modeled as directed graphs. A level-based graph is constructed to represent multiple candidate waypoints between a starting location and a goal, ensuring that feasible paths respect continuity and waypoint constraints. QAOA is applied to select edges that minimize a cost function representing trajectory efficiency while enforcing path consistency through penalty terms. The simulations demonstrate that the algorithm successfully identifies feasible and cost-effective paths, highlighting the potential of quantum-inspired optimization methods for aerospace applications. The results provide a foundation for future research on integrating quantum computing techniques into autonomous mission planning and trajectory optimization tasks.