Abstract:Compared to stand-alone taxiing, modeling and simulation of multi-aircraft taxiing on the flight deck needs toconsider the avoidance and computational cost. The mathematical model of the path planning of multi-aircraft taxiing wasestablished, including a simplified model of the aircraft and its towing system, an objective function, etc. A path-optimizedsearch algorithm based on A* and a simple method to ensure fast and successful path search, that is, letting the aircraft’s nose be aligned with the catapult runway, were proposed. A heuristic function was given with the demand that aircraftshould reach the corresponding catapult as shortly as possible. Constrains of its entry into the target point were taken intoaccount. Collision detection not only considered the constraints in single-path planning, but also detected the alternatepaths multiple times at each step of the node expansion. Using an example to illustrate the effectiveness of the proposedmethod, it can ensure the entire aircraft team has a reasonable taxiing path before launch.