Search Results (266)

The rapid advancement of intelligent unmanned systems has brought new opportunities to mobile crowd sensing (MCS). Compared with traditional homogeneous frameworks, heterogeneous air-ground collaborative multi-agent frameworks consisting of unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) exhibit superior flexibility and efficiency in complex sensing tasks. Task allocation among agents is crucial for improving overall MCS quality. To achieve efficient task allocation for heterogeneous collaborative agents, this study investigated two typical complex multi-agent task allocation scenarios with dual optimization objectives: (1) For the Air-Ground Few-Agents-More-Tasks (AG-FAMT) scenario, the objectives are to maximize task completion and minimize total travel distance; (2) For the Air-Ground More-Agents-Few-Tasks (AG-MAFT) scenario (task allocation based on agent locations), the objectives are to minimize total travel distance and travel time cost. Overall, in this paper, we proposed two algorithms: a multi-task minimum cost maximum flow optimization algorithm called Multi-Task Minimum-Cost Maximum-Flow (MT-MCMF) tailored for AG-FAMT, and a multi-objective optimization algorithm called Weighted Integer Linear Programming (W-ILP) for AG-MAFT (with a focus on optimizing UAV charging path planning). Experiments on a large-scale real-world dataset demonstrated that both proposed algorithms outperform baseline methods under varying experimental settings (task quantity, difficulty, and distribution), providing a novel approach to enhance the overall quality of air-ground MCS tasks. Full article

To address the complex challenge of simultaneously optimizing the operation time, motion impact, and energy consumption in industrial robotic arm trajectory planning, this study proposes a novel multi-objective optimization framework based on an improved multi-objective golden jackal optimization (IMGJO) algorithm. Firstly, the original single-objective Golden Jackal Optimization is extended into a multi-objective formulation by integrating an external Pareto archive and a crowding distance sorting mechanism. This extension effectively generates a well-distributed and highly convergent Pareto-optimal solution set. Secondly, to enhance global exploration capabilities and improve convergence stability, the escape energy model is refined. This is achieved through the synergistic integration of three key strategies: tent chaotic mapping for enhancing the initial population diversity, opposition-based learning to accelerate the early-stage search process, and an elitism preservation strategy to prevent premature convergence and mitigate the risk of entrapment in local optima. Thirdly, the IMGJO algorithm is integrated with a 3-5-3 polynomial interpolation scheme to establish a kinematically constrained trajectory planning model, ensuring a generation of smooth, continuous, and dynamically feasible joint space trajectories. Finally, comprehensive comparative experiments against several state-of-the-art benchmark algorithms demonstrate that the proposed IMGJO framework significantly outperforms its counterparts in terms of both convergence speed and the quality of the Pareto solution set. Furthermore, experimental validation on the Yaskawa HP-20D robotic arm platform demonstrates that the proposed method can effectively achieve a comprehensive optimization of execution time, impact, and energy consumption. Compared with the pre-optimization trajectory, the total operation time is reduced by 2.42%; the impacts of Joint 1 and Joint 2 are reduced by 74.65% and 75.82%, respectively; and the energy consumption of Joint 1 and Joint 2 are reduced by 27.11% and 26.83%, respectively. Moreover, the generated trajectory is smooth and continuous, thereby significantly improving the operational efficiency and stability of the robotic arm. Full article

Bidirectional power converters generate significant heat losses during high-frequency operation, posing a severe challenge to the performance of heat dissipation systems. Traditional thermal design methods often struggle to balance multiple objectives, such as cooling efficiency, cost, weight, and size, thereby limiting the reliability and safety of the system. To address these challenges, this paper proposes a novel Multi-Objective Exponential Distribution Optimizer algorithm based on the Exponential Distribution Optimizer. Subsequently, key design variables of the heat dissipation system are selected. Next, the Optimal Latin Hypercube Sampling method is employed to generate sample points, and a second-order response surface surrogate model for the heat pipe radiator’s volume and temperature is developed. Lastly, by integrating elite non-dominated sorting, crowding distance mechanisms, and an information feedback mechanism, the multi-objective challenge is decomposed into subproblems, thereby enhancing optimization efficiency. Through comparative simulation experiments on benchmark functions, the Wilcoxon signed-rank test results for the MOEDO algorithm on the majority of the three metrics are denoted as ‘+’, indicating statistically significant advantages over the compared algorithms, thereby demonstrating its superior performance in addressing multi-objective optimization problems. The study further conducts simulation verification of the heat pipe heat dissipation system before and after optimization using ANSYS Icepak. The simulation results demonstrate that, compared with the conventional design, the maximum Insulated Gate Bipolar Transistor (IGBT) temperature is reduced by 17.12% and the heat sink volume is reduced by 14.61%. Full article

In air jet looms, relay nozzles are critical components in governing airflow velocity and air consumption during the weft insertion process. Although computational fluid dynamics (CFD) offers high-fidelity simulation for aerodynamic analysis, its computational burden hinders its practicality in iterative aerodynamic design of relay nozzles. To address the challenge, this study proposes a data-driven framework integrating a Chebyshev polynomial Kolmogorov–Arnold Network (Chebyshev KAN) surrogate model with an Improved Multi-objective Red-billed Blue Magpie Optimizer (IMORBMO). The accuracy of the Chebyshev KAN model was benchmarked against conventional multilayer perceptrons (MLP), convolutional neural networks (CNN), and the standard Kolmogorov–Arnold Network (KAN). Experimental results demonstrate that the Chebyshev KAN model achieves the lowest mean absolute error (MAE) of 0.103 for airflow velocity and 0.115 for air consumption. Building upon the non-dominated sorting and crowding distance strategies, IMORBMO was developed, incorporating an adaptive mutation mechanism by information entropy for improvement of convergence, diversity, and uniformity of the Pareto-optimal solutions. Comprehensive evaluations on the ZDT and WFG benchmark suites confirm that the IMORBMO consistently attains the best and highly competitive performance, yielding the lowest generation distance (GD), inverted generational distance (IGD) values and the highest hypervolume (HV). Applied to the aerodynamic optimization of a relay nozzle, the proposed framework delivers an optimal aerodynamic design that increases airflow velocity by 10.5% while reducing air consumption by 15.4%, as verified by CFD simulation. The steady-state flow field was simulated by solving the Reynolds-Average NavierStokes equations with the k–ω turbulent model, utilizing Fluent 2025.R2. No-slip wall, inlet pressure and outlet pressures are boundary conditions to the relay nozzle surfaces. This work establishes a computationally efficient and accurate optimization paradigm that holds significant promise for aerodynamic design and other complex real-world engineering applications. Full article

Community detection is a key task in the analysis of complex networks, particularly in social network analysis, where uncovering cohesive and well-separated groups is essential for understanding structural organization and interaction patterns. Many existing centroid-based community detection methods rely primarily on node degree for centroid selection, which often leads to centroid crowding and insufficient spatial separation among communities. To address these limitations, this paper proposes Degree–Distance Centroid–Community Detection with Influential Nodes (DDC-CDIN), a distance-driven and influence-aware community detection framework. In the proposed approach, nodes are first ranked according to an Enhanced Degree Centrality measure that incorporates degree information, neighbourhood structure, and local clustering characteristics to identify structurally influential nodes. Centroids are then selected iteratively from the top-ranked influential nodes by maximizing shortest-path distances, ensuring that the chosen centroids are both representative and well dispersed within the network. Once the centroids are determined, the remaining nodes are assigned to communities based on the minimum geodesic distance, yielding compact, clearly separated clusters. Extensive experiments across multiple real-world networks show that DDC-CDIN achieves competitive performance compared to traditional centroid-based and modularity-driven methods in terms of modularity, community cohesion, and boundary clarity. The results indicate that jointly incorporating influence-aware node ranking with distance-based centroid dispersion effectively mitigates centroid crowding and enhances overall community detection quality. These findings demonstrate the effectiveness and robustness of DDC-CDIN for detecting well-structured and topologically coherent communities in complex networks. Full article

Detection, tracking, and re-identification (ReID) of children wearing similar uniforms in a kindergarten environment is a very complex challenge for computer vision. Traditional surveillance systems or simple convolutional neural network (CNN) models often fail to distinguish children in crowds and occlusions. To address this challenge, this study proposes a novel hybrid framework combining YOLOv8 and Vision Transformer (ViT). Using YOLOv8 for detection and ViT for global feature extraction, we trained the model on a custom dataset of 31,521 images, achieving an overall accuracy of 93.75%, and the public benchmark MOT20 dataset of 28,630 images, achieving an overall accuracy of 96.02%. Our system showed remarkable success in tracking performance, where it achieved 86.7% MOTA and 99.7% IDF1 scores. This high IDF1 score proves that the model is highly effective in preventing identity switch. The main novelty of this study is the behavioral analysis of children beyond the boundaries of surveillance, where we measure walking distance and trajectory, and screen time. Finally, through cross-dataset comparison with the MOT20 public benchmark, we demonstrated that our proposed customized model is much more effective than current state-of-the-art methods in overcoming the domain gap in specific environments such as kindergarten. Full article

Time difference of arrival (TDOA) localization enables high-accuracy positioning by analyzing arrival-time differences of target signals at distributed radar nodes, whose performance strongly depends on radar node topology. However, existing studies tend to focus more on improving localization accuracy, while overlooking the impact of radar geometric layout and surveillance coverage on localization performance. To this end, this paper proposes a topology optimization method for a distributed radar system based on an improved non-dominated sorting multi-objective particle swarm optimization (NS-MOPSO) algorithm. A geometric localization model is developed for a distributed TDOA radar system. Based on this model, three optimization objectives are formulated, including minimizing geometric dilution of precision (GDOP), maximizing target coverage, and improving the geometric balance of node placement. These three objective functions are incorporated into the NS-MOPSO framework to achieve a more reasonable radar geometric distribution. To enhance the optimization performance, a series of strategies are adopted, such as non-dominated sorting for Pareto-based solution selection, an improved crowding-distance scheme to encourage balanced multi-objective optimization, and Gaussian mutation to increase solution diversity and reduce the risk of premature convergence. To validate the proposed method, both simulation studies and real-world experiments were conducted under different node deployment scenarios. The results show that the optimized topology achieves a 6.4% reduction in RMSPE and a 4.3% increase in the proportion of high-quality localization regions compared with the best-performing comparative method, while also demonstrating faster convergence and improved stability. These findings confirm the effectiveness and robustness of the proposed approach in enhancing localization accuracy, expanding effective coverage, and improving overall system performance. Full article

As intelligent construction technology advances, new projects have become more technology-intensive, collaborative, and multi-objective. Traditional team formation methods based on people’s experience can no longer meet their complex management needs. This study reframes team formation as a multi-objective optimization problem to maximize person–job fit and team collaboration. By introducing a hierarchical penalty mechanism for structured resumes and performing semantic feature extraction on unstructured text via the BERT-base-Chinese model, we develop a job competency model, quantify person–job fit with cosine similarity, and assess team collaboration through MBTI theory and a project-specific scoring framework. An improved algorithm, CSCD-NSGA-II, is proposed, which combines K-means clustering and a modified crowding distance, to maintain solution diversity under constraints. It improves HV by 1.55% and reduces SP by 10.81% compared to the standard NSGA-II. Validation using real projects, simulated data, and algorithm comparisons demonstrates that CSCD-NSGA-II generates teams more efficiently than manual methods. Survey results indicate improved role diversity and the feasibility of collaboration, along with similar task adaptability. The algorithm also outperforms NSGA-II, MOPSO, and SPEA2, supporting intelligent team formation in modern construction. Full article

This paper addresses the question of how many autonomous aerial vehicles (UAVs or drones) can safely operate within a bounded three-dimensional airspace. First, we derive the absolute mathematical limits on drone density using geometric arguments from sphere packing and covering theory. Then, we verify these limits empirically by simulating a swarm controlled via model predictive control. We incrementally increase the number of drones until motion becomes impossible. Each drone is modeled as a double-integrator system with a bounded speed and acceleration and is surrounded by a radius spherical safety zone $r>0$. The drones are controlled via model predictive control with hard separation constraints. We formalize complete blockage as the loss of any feasible non-trivial trajectory set, either due to geometric crowding or dynamic limitations. Using tools from discrete geometry, we establish absolute upper bounds on a safe population via sphere-packing results and sufficient conditions for total immobilization via sphere-covering arguments. We extend these static bounds by incorporating dynamics through stopping-distance analysis, leading to an inflated exclusion radius that captures the effect of finite control authority. In addition, we prove min-cut style flow-capacity bounds that limit feasible throughput across bottlenecks and derive horizon-dependent conflict-graph conditions that capture MPC infeasibility at high densities. These results provide a rigorous theoretical framework for determining the transition from feasible multi-drone operation to inevitable gridlock, offering explicit quantitative thresholds that can inform airspace design, drone density regulation, and the tuning of predictive controllers. We evaluate our theoretical findings with a simulation environment. Full article

Path planning for large-scale agricultural fields faces challenges such as irregular field shapes, uncertain boundaries, and the need to balance path efficiency, energy consumption, and coverage quality. To address these problems, this research introduces a strategy-aware hierarchical hybrid optimization framework (HANS) for autonomous agricultural operations. This framework introduces a global principal axis extraction method based on Principal Component Analysis (PCA), utilizing the statistical distribution of field boundaries to guide path direction, thereby improving robustness against boundary noise and irregular geometries. The framework integrates Adaptive Large Neighborhood Search (ALNS) for global exploration and Tabu Search (TS) for local optimization, forming a tightly coordinated hybrid structure. The framework further employs a Pareto-set-based decision support selection strategy to solve a multi-objective optimization model encompassing machine kinematics, turning patterns, and energy-aware cost evaluation. This strategy provides three methods: weighted preference-based compromise solution selection, crowding distance-based diversified solution selection, and single-objective extreme value-based dedicated optimization solution selection. To balance the impact of path length, energy consumption, and coverage rate, we assigned equal or nearly equal weights to them (i.e., (0.33, 0.33, 0.34)). Furthermore, the framework incorporates operators and feedback learning mechanisms specific to agricultural coverage path problems to enable adaptive operator selection and reduce reliance on manual parameter tuning. Simulation results under three representative field scenarios show that compared to fixed-direction planning, HANS improves the average coverage rate by 0.51 percentage points and reduces fuel consumption by 4.34%. Compared to Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Tabu Search (TS), and Simulated Annealing (SA), the proposed method shortens the working path length by 0.37–0.83%, improves coverage rate by 0.34–1.11%, and reduces energy consumption by 0.61–1.03%, while maintaining competitive computational costs. These results demonstrate the effectiveness and practicality of HANS in large-scale autonomous farming operations. Full article

In this paper, a Multiple-Objective Memetic Algorithm (MOMA) is proposed to address the Energy-Efficient Distributed Assembly Permutation Flow-Shop Scheduling Problem (EEDAPFSP) by explicitly exploiting the structural and objective symmetries inherent in the scheduling process, with the dual objectives of minimizing the maximum completion time (makespan) and total energy consumption (TEC). The EEDAPFSP is a complex NP-hard optimization problem in modern sustainable manufacturing that balances production efficiency and environmental sustainability. During the global search phase, a symmetry-preserving dual-search framework is constructed, in which diverse and potential regions in the solution space are explored by symmetrically generating time-dominant product sub-sequences (TDPSs) and energy-dominant product sub-sequences (EDPSs) in the individuals of each iteration, enabling complementary exploration from time- and energy-oriented perspectives. This is accomplished through the incorporation of a variable-weight metric technique and a first product fixed strategy into an estimation distributed algorithm-based hyper-heuristic (EDAHH), so as to maintain a balanced and symmetric probabilistic modeling of decision patterns with respect to the makespan and energy consumption. In the local search phase, two problem-specific designed neighborhood structures are proposed to refine the job sequences corresponding to the TDPS and EDPS in the superior sub-population, effectively reducing both the makespan and TEC. A box-level $\epsilon$ dominance technique based on the crowding distance is proposed for Pareto archive updating. Additionally, an energy-saving strategy is embedded throughout the algorithm, incorporating three mechanisms—job processing delay, machine shutdown and restart control, and speed regulation—to further optimize TEC during both the global and local search phases. Finally, extensive computational experiments are carried out, and the results demonstrate that the MOMA achieves significantly better performance in terms of the inverted generational distance ($IGD$) and the quality metric $\rho$ compared with state-of-the-art algorithms. The resulting Pareto front of non-dominated solutions provides a comprehensive set of trade-offs between energy consumption and the makespan, offering decision makers flexible and efficient scheduling options. Full article

Due to the significant potential of crowd flow prediction in the domains of commercial activities and public management, numerous researchers have commenced investing in pertinent investigations. The majority of existing studies employ recurrent neural networks, long short-term memory, and similar models to achieve their objectives. Despite the advancements in predictive modeling, the objective of many existing studies remains in the minimization of distance errors. This focus, however, introduces three notable limitations in prediction outcomes: (1) the predicted location may represent an average of multiple points rather than a distinct target, (2) the results may fail to reflect actual user behavior patterns, and (3) the predictions may lack geographic plausibility. To address these challenges, we developed a Transformer-based model integrated with adversarial network architecture. The Transformer component has shown considerable effectiveness in forecasting individual movement trajectories, while the discriminator within the adversarial framework guides the generator in refining outputs to better reflect user habits and spatial rationality. Full article

Multimodal multiobjective optimization problems (MMOPs) are widely encountered in real-world applications. While numerous evolutionary algorithms have been developed to locate equivalent Pareto-optimal solutions, existing Multimodal Multiobjective Evolutionary Algorithms (MMOEAs) often struggle to handle large-scale decision variables and sparse Pareto sets due to the curse of dimensionality and unknown sparsity. To address these challenges, this paper proposes a novel approach named MASR-MMEA, which stands for Large-scale Sparse Multimodal Multiobjective Optimization via Multi-stage Search and Reinforcement Learning (RL)-assisted Environmental Selection. Specifically, to enhance search efficiency, a multi-stage framework is established incorporating three key innovations. First, a dual-strategy genetic operator based on improved hybrid encoding is designed, employing sparse-sensing dynamic redistribution for binary vectors and a sparse fuzzy decision framework for real vectors. Second, an affinity-based elite strategy utilizing Mahalanobis distance is introduced to pair real vectors with compatible binary vectors, increasing the probability of generating superior offspring. Finally, an adaptive sparse environmental selection strategy assisted by Multilayer Perceptron (MLP) reinforcement learning is developed. By utilizing the MLP-generated Guiding Vector (GDV) to direct the evolutionary search toward efficient regions and employing an iteration-based adaptive mechanism to regulate genetic operators, this strategy accelerates convergence. Furthermore, it dynamically quantifies population-level sparsity and adjusts selection pressure through a modified crowding distance mechanism to filter structural redundancy, thereby effectively balancing convergence and multimodal diversity. Comparative studies against six state-of-the-art methods demonstrate that MASR-MMEA significantly outperforms existing approaches in terms of both solution quality and convergence speed on large-scale sparse MMOPs. Full article

The interface between synthetic materials and biological systems is a critical determinant of performance in medical devices and biosensors. This review examines the evolution of biointerface science through the lens of self-assembled monolayers (SAMs) of thiols on gold, a model system that offers atomic-level control over surface chemistry. We trace the field from the foundational structural characterization to the establishment of empirical design rules for bio-inertness. While early theoretical models attributed protein resistance to steric repulsion forces in polymer brushes, contemporary understanding has shifted toward the “water barrier” hypothesis, which posits that tightly bound interfacial water prevents direct biomolecular contact. We highlight recent studies that extend these concepts into “realistic” crowded biological environments. Their work reveals that fouling surfaces in crowded media generate a “viscous interphase layer” (VIL) that extends tens of nanometers into solution, whereas zwitterionic surfaces maintain a robust hydration shell that prevents this accumulation. Furthermore, this hydration barrier is shown to fundamentally alter bacterial mechanics, forcing microorganisms into a reversible, tethered “hovering” state at a significant biological interaction distance (>100 nm) from the surface, effectively precluding biofilm nucleation. These insights underscore that the future of antifouling material design lies in the precise engineering of interfacial hydration structures. Full article

In modern financial markets, decision-makers increasingly rely on quantitative methods to navigate complex trade-offs among multiple, often conflicting objectives. This paper addresses constrained multi-objective optimization (MOO) with an application to portfolio optimization for minimizing risk and maximizing return. To this end, and to address existing gaps, we propose a novel reinforcement learning (RL)-guided non-dominated sorting genetic algorithm II (NSGA-II) enhanced with gray relational coefficients (GRC), termed RL-NSGA-II-GRC, which combines an RL agent controller and GRC-based selection to improve the convergence and diversity of the Pareto-optimal fronts. The agent adapts key evolutionary parameters online using population-level metrics of hypervolume, feasibility, and diversity, while the GRC-enhanced tournament operator ranks parents via a unified score simultaneously considering dominance rank, crowding distance, and geometric proximity to ideal reference. We evaluate the framework on the Kursawe and CONSTR benchmark problems and on a NASDAQ portfolio optimization application. On the benchmarks, RL-NSGA-II-GRC achieves convergence metric improvements of about 5.8% and 4.4% over the original NSGA-II, while preserving a well-distributed set of non-dominated solutions. In the portfolio application, the method produces a smooth and densely populated efficient frontier that supports the identification of the maximum Sharpe ratio portfolio (with annualized Sharpe ratio = 1.92), as well as utility-optimal portfolios for different risk-aversion levels. The main contributions of this work are three-fold: (1) we propose an RL-NSGA-II-GRC method that integrates an RL agent into the evolutionary framework to adaptively control key parameters using generational feedback; (2) we design a GRC-enhanced binary tournament selection operator that provides a comprehensive performance indicator to efficiently guide the search toward the Pareto-optimal front; (3) we demonstrate, on benchmark MOO problems and a NASDAQ portfolio case study, that the proposed method delivers improved convergence and well-populated efficient frontiers that support actionable investment insights. Full article