To address the issue of safe, orderly, and efficient operation for unmanned vehicles within the apron area in the future, a hardware framework of aircraft–vehicle–airfield collaboration and a trajectory planning method for unmanned vehicles on the apron were proposed. As for the vehicle–airfield perspective, a collaboration mechanism between flight support tasks and unmanned vehicle departure movement was constructed. As for the latter, a control mechanism was established for the right-of-way control of the apron. With the goal of reducing waiting time downstream of the pre-selected path, a multi-agent reinforcement learning model with a collaborative graph was created to accomplish path selection among various origin–destination pairs. Then, we took Apron NO.2 in Ezhou Huahu Airport as an example for simulation verification. The results show that, compared with traditional methods, the proposed method improves the average vehicle speed and reduces average vehicle queue time by 11.60% and 32.34%, respectively. The right-of-way signal-switching actions are associated with the path selection behavior of the corresponding agent, fitting the created aircraft–vehicle collaboration. After 10 episodes of training, the Q-values can steadily converge, with the deviation rate decreasing from 40% to below 0.22%, making the balance between sociality and competitiveness. A single trajectory can be planned in just 0.78 s, and for each second of training, 7.54 s of future movement of vehicles can be planned in the simulation world. Future research could focus on online rolling trajectory planning for UGSVs in the apron area, and realistic verification under multi-sensor networks can further advance the application of unmanned vehicles in apron operations.
Electric-powered unmanned guidance vehicles provide surface taxiing guidance for arriving and departing aircraft within the airport movement area, enabling sustained safety under complex operational conditions and improving overall operational efficiency, particularly under low-visibility scenarios. In this context, how to design scientifically rigorous operational trajectories for the three phases of unmanned guidance vehicle operations—dispatch, guidance, and recovery—remains an open and important research problem. This study proposes a three-stage trajectory-planning method for unmanned guidance vehicles, including initial trajectory planning, conflict prediction, and conflict resolution. First, the Guidance Unit—composed of the unmanned guidance vehicle and the guided aircraft—is defined, and a standard speed-profile design model is established for this unit. Then, considering airport operational-safety constraints, a conflict prediction algorithm for the guidance process is developed, which identifies potential conflicts in guidance trajectory planning based on time-window overlap analysis. Subsequently, under operational safety constraints, an optimization model aiming to minimize the maximum guidance time is formulated, and a trajectory planning algorithm for unmanned guidance vehicles based on the improved A* algorithm is designed to generate conflict-free operational trajectories. Finally, a simulation study is conducted using a major airport in Southwest China as a case study. The results show that (1) the speed-profile design and airport operational-rule constraints affect the operational trajectories of unmanned guidance vehicles; (2) the proposed algorithm enables coordinated planning of both speed control and path selection, thereby improving overall operational efficiency by 43.65% compared with conventional operations, while ensuring conflict-free airport surface taxiing, due to the adoption of an improved A* trajectory-planning algorithm for unmanned guidance vehicles; (3) under the electric-powered guidance-vehicle scheme proposed in this study, the method achieves a 34.52% reduction in total energy consumption during the guidance phase compared with traditional Follow-Me guidance, enabling the simultaneous optimization of operational efficiency and energy consumption.