Wirelessly charging unmanned aerial vehicles (WCUAVs) can complete charging tasks without human intervention and may help us efficiently collect various types of geographically dispersed data in unmanned data collection systems (UDCSs). However, the limited number of wireless charging stations and longer wireless charging times also pose challenges to minimizing the Age of Information (AoI). Here, we provide a heuristic method to minimize AoI for WCUAVs. Firstly, the problem of minimizing AoI is modeled as a trajectory optimization problem with nonlinear constraints involving n sensor nodes, a data center, and a limited number of wireless charging stations. Secondly, to solve this NP-hard problem, an improved artificial plant community (APC) approach is proposed, including a single-WCUAV architecture and a multi-WCUAV architecture. Thirdly, a benchmark test set is designed, and benchmark experiments are conducted. When the number of WCUAVs increased from 1 to 2, the total flight distance increased by 12.011% and the average AoI decreased by 45.674%. When the number of WCUAVs increased from 1 to 10, the total flight distance increased by 87.667% and the average AoI decreased by 78.641%. The experimental results show that the proposed APC algorithm can effectively solve AoI minimization challenges of WCUAVs and is superior to other baseline algorithms with a maximum improvement of 9.791% in average AoI. Due to its simple calculation and efficient solution, it is promising to deploy the APC algorithm on the edge computing platform of WCUAVs.
Robot swarm manufacturing is a promising direction in smart manufacturing that aggre-gates multiple robots to collaboratively complete production jobs; however, achieving conflict-free scheduling remains a significant challenge. Traditional methods struggle to address this issue since robot swarms are inherently prone to conflicts. This article puts forward a non-sorted metaheuristic method to solve it. First, the conflict-free robot swarm manufacturing problem—integrating a multi-objective optimization problem (MOP), a flexible job-shop scheduling problem (FJSP) for job processing, and a flow-shop schedul-ing problem (FSP) for robot travel—is formulated as a multi-objective job-flow-shop scheduling problem (MJFSP). The robot swarm must accomplish all manufacturing jobs while achieving high manufacturing performance, energy efficiency, and conflict-free op-erations. Second, a non-sorted metaheuristic algorithm based on an artificial plant com-munity (APC) is proposed. It employs a sequential-pairwise single-elimination tourna-ment system (SSTS) to select elites with a time complexity of 𝑂(𝑛), which scales linearly with the population size (𝑛). This surpasses the sorting-based elite selection with poly-nomial time complexity employed in most metaheuristic methods, such as the 𝑂(𝑛2) of the non-dominated sorting genetic algorithm-III (NSGA-III). Third, an MJFSP benchmark dataset is built, and the experimental results uncover the complex dependencies between the FJSP for job processing and the FSP for robot traveling. The proposed method im-proves the makespan by up to 13.10% and reduces non-loaded energy consumption by up to 13.49%, achieving zero collision time and an average solution time 11.18% faster than NSGA-III.