Search Results (10,095)

Multiple Unmanned Aerial Vehicle (UAV) collaborative coverage path planning is widely applied in fields such as regional surveillance. However, optimizing the trade-off between deployment costs and task execution efficiency remains challenging. To balance resource costs and execution efficiency with an uncertain number of UAVs, this paper analyzes the characteristics of irregular mission areas and formulates a bi-level optimization model for multi-UAV collaborative CPP. The model aims to minimize both the number of UAVs and the total path length. First, in the upper level, an improved Best Fit Decreasing algorithm based on binary search is designed. Straight-line scanning paths are generated by determining the minimum span direction of the irregular regions. Task allocation follows a longest-path-first, minimum-residual-range rule to rapidly determine the minimum number of UAVs required for complete coverage. Considering UAV’s turning radius constraints, Dubins curves are employed to plan transition paths between scanning regions, ensuring path feasibility. Second, the lower level transforms the problem into a Multiple Traveling Salesman Problem that considers path continuity, range constraints, and non-overlapping path allocation. This problem is solved using an Improved Biased Random Key Genetic Algorithm. The algorithm employs a variable-length master–slave chromosome encoding structure to adapt to the task allocation of each UAV. By integrating biased crossover operators with 2-opt interval mutation operators, the algorithm accelerates convergence and improves solution quality. Finally, comparative experiments on mission regions of varying scales demonstrate that, compared with single-level optimization and other intelligent algorithms, the proposed method reduces the required number of UAVs and shortens the total path length, while ensuring complete coverage of irregular regions. This method provides an efficient and practical solution for multi-UAV collaborative CPP in complex environments. Full article

Path planning for multiple four-way shuttles in high-density warehousing is frequently hampered by efficiency-degrading conflicts, particularly head-on deadlocks. To address this challenge, this paper proposes a multi-agent reinforcement learning (MARL) framework based on Proximal Policy Optimization (PPO). The core of our approach is a novel Cooperative Avoidance Reward Mechanism (CARM), which employs a dual-component reward structure. This structure integrates a distance-guided reward to ensure efficient navigation towards targets and a cooperative avoidance reward that uses both immediate and delayed returns to incentivize implicit collaboration. This design effectively resolves conflicts and mitigates the policy instability often caused by traditional collision penalties. Experiments in a 20 × 20 grid simulation environment demonstrated that, compared to a rule-based A* and Conflict-Based Search (CBS) algorithms, the proposed method reduced the average travel distance and total time by 35.8% and 31.5%, respectively, while increasing system throughput by 49.7% and maintaining a task success rate of over 95%. Ablation studies further confirmed the critical role of CARM in achieving stable multi-agent collaboration. This work offers a scalable and efficient data-driven solution for real-time path planning in complex automated warehousing systems. Full article

Industrial gateways serve as critical data aggregation points within the Industrial Internet of Things (IIoT), enabling seamless data interoperability that empowers enterprises to extract value from equipment data more efficiently. However, their role exposes a fundamental trade-off between computational efficiency and prediction accuracy—a contradiction yet to be fully resolved by existing approaches. The rapid proliferation of IoT devices has led to a corresponding surge in network traffic, posing significant challenges for traffic forecasting methods, while deep learning models like Transformers and GNNs demonstrate high accuracy in traffic prediction, their substantial computational and memory demands hinder effective deployment on resource-constrained industrial gateways, while simple linear models offer relative simplicity, they struggle to effectively capture the complex characteristics of IIoT traffic—which often exhibits high nonlinearity, significant burstiness, and a wide distribution of time scales. The inherent time-varying nature of traffic data further complicates achieving high prediction accuracy. To address these interrelated challenges, we propose the lightweight and theoretically grounded DOA-MSDI-CrossLinear framework, redefining traffic forecasting as a hierarchical decomposition–interaction problem. Unlike existing approaches that simply combine components, we recognize that industrial traffic inherently exhibits scale-dependent temporal correlations requiring explicit decomposition prior to interaction modeling. The Multi-Scale Decomposable Mixing (MDM) module implements this concept through adaptive sequence decomposition, while the Dual Dependency Interaction (DDI) module simultaneously captures dependencies across time and channels. Ultimately, decomposed patterns are fed into an enhanced CrossLinear model to predict flow values for specific future time periods. The Dream Optimization Algorithm (DOA) provides bio-inspired hyperparameter tuning that balances exploration and exploitation—particularly suited for the non-convex optimization scenarios typical in industrial forecasting tasks. Extensive experiments on real industrial IoT datasets thoroughly validate the effectiveness of this approach. Full article

The strategic selection of lens geometry—spherical versus plane—decisively shapes the opto-thermal performance boundary of deep ultraviolet light-emitting diodes (DUV-LEDs), thereby governing their efficacy in application-specific photochemical processes. This study demonstrates that spherical lenses, by virtue of their superior light-collecting geometry, significantly enhance optical extraction efficiency and thermal management performance compared to conventional plane lenses. These engineered performance characteristics translate directly into divergent functional outcomes: spherical lenses enable rapid, high-intensity processing, while plane lenses are better suited for controlled, sustained operation. The findings establish a fundamental principle for DUV-LED packaging design: lens geometry can be tailored to optimize efficiency for distinct photochemical tasks, providing a clear pathway from device engineering to application-driven performance. Full article

The Nash equilibrium is a central concept in game theory, widely used across economics, social sciences, computer science, and artificial intelligence. However, computing Nash equilibria, especially in multi-player games, is a complex and computationally challenging task. Among the various types of Nash equilibria, the unique pure-strategy Nash equilibrium payoffs possess particularly desirable properties that make them suitable for deeper analysis and application. In this paper, we propose a first-order logical framework for three-player finite games, inspired by the notion of Pareto optimality, to identify a class of games with unique pure-strategy Nash equilibrium payoffs. By utilizing a SAT solver and the finite verifiability of ternary clauses, we automatically discover several families of three-player games that exhibit unique pure-strategy Nash equilibrium payoffs. This approach provides new insights into the computational aspects of game theory and offers an automated method for discovering novel game-theoretic structures. Full article

We present an advanced statistical framework for estimating the relative intensity of astrophysical event distributions (e.g., Gamma-Ray Bursts, GRBs) on the sky tofacilitate population studies and large-scale structure analysis. In contrast to the traditional approach based on the ratio of Kernel Density Estimation (KDE), which is characterized by numerical instability and bandwidth sensitivity, this work applies a logistic regression embedded in a Bayesian framework to directly model selection effects. It reformulates the problem as a logistic regression task within a Generalized Additive Model (GAM) framework, utilizing isotropic Splines on the Sphere (SOS) to map the conditional probability of redshift measurement. The model complexity and smoothness are objectively optimized using Restricted Maximum Likelihood (REML) and the Akaike Information Criterion (AIC), ensuring a data-driven bias-variance trade-off. We benchmark this approach against an Adaptive Kernel Density Estimator (AKDE) using von Mises–Fisher kernels and Abramson’s square root law. The comparative analysis reveals strong statistical evidence in favor of this Preconditioned (Precon) Estimator, yielding a log-likelihood improvement of $\Delta \mathcal{L}\approx 74.3$ (Bayes factor $>{10}^{30}$) over the adaptive method. We show that this Precon Estimator acts as a spectral bandwidth extender, effectively decoupling the wideband exposure map from the narrowband selection efficiency. This provides a tool for cosmologists to recover high-frequency structural features—such as the sharp cutoffs—that are mathematically irresolvable by direct density estimators due to the bandwidth limitation inherent in sparse samples. The methodology ensures that reconstructions of the cosmic web are stable against Poisson noise and consistent with observational constraints. Full article

Fine segmentation of point clouds in hull structure junction regions is a key technology for achieving high-precision digital inspection. Conventional hard-segmentation methods frequently yield over- or under-segmentation in junction regions such as welds, compromising the reliability of subsequent inspections. This study presents a computational framework that combines the Gaussian-Uniform Mixture Model (GUMM) with the Hidden Markov Random Field (HMRF) and follows a “coarse segmentation–model construction–fine segmentation” pipeline. The framework jointly optimizes the sampling model, the probabilistic model, and the expectation–maximization (EM) inference procedure. By leveraging model simplification and dimensionality reduction, the algorithm simultaneously addresses initial value estimation, spatial distribution characterization, and continuity constraints. Experiments on representative structures, including wall corner, T-joint weld, groove, and flange, show that the proposed framework outperforms the conventional GMM-EM method by approximately 2.5% in precision and 1.5% in both accuracy and F1 score. In local segmentation tasks of complex hull structures, the method achieves a deviation of less than 0.2 mm relative to manual measurements, validating its practical utility in engineering contexts. Full article

In this study, a hybrid deep learning model that combines the VGG16 and ResNet101V2 architectures is proposed for image-based fire detection. In addition, a balanced drone guidance algorithm is developed to efficiently assign tasks to available UAVs. In the fire detection phase, the hybrid model created by combining the VGG16 and ResNet101V2 architectures has been optimized with Global Average Pooling and layer merging techniques to increase classification success. The DeepFire dataset was used throughout the training process, achieving an extremely high accuracy rate of 99.72% and 100% precision. After fire detection, a task assignment algorithm was developed to assign existing drones to fire points at minimum cost and with balanced load distribution. This algorithm performs task assignments using the Hungarian (Kuhn–Munkres) method and cost optimization, and is adapted to direct approximately equal numbers of drones to each fire when the number of fires is less than the number of drones. The developed system was tested in a Python-based simulation environment and evaluated using performance metrics such as total intervention time, energy consumption, and task balance. The results demonstrate that the proposed hybrid model provides highly accurate fire detection and that the task assignment system creates balanced and efficient intervention scenarios. Full article

Deep reinforcement learning (DRL) with self-play has emerged as a promising paradigm for solving combinatorial optimization (CO) problems. The recently proposed Gumbel AlphaZero Plan-to-Play (GAZ PTP) framework adopts a competitive training setup between a learning agent and an opponent to tackle classical CO tasks such as the Traveling Salesman Problem (TSP). However, in complex and multi-constrained environments like the Electric Vehicle Routing Problem (EVRP), standard self-play often suffers from opponent mismatch: when the opponent is either too weak or too strong, the resulting learning signal becomes ineffective. To address this challenge, we introduce Two-Stage Self-Play GAZ PTP (TSS GAZ PTP), a novel DRL method designed to maintain adaptive and effective learning pressure throughout the training process. In the first stage, the learning agent, guided by Gumbel Monte Carlo Tree Search (MCTS), competes against a greedy opponent that follows the best historical policy. As training progresses, the framework transitions to a second stage in which both agents employ Gumbel MCTS, thereby establishing a dynamically balanced competitive environment that encourages continuous strategy refinement. The primary objective of this work is to develop a robust self-play mechanism capable of handling the high-dimensional constraints inherent in real-world routing problems. We first validate our approach on the TSP, a benchmark used in the original GAZ PTP study, and then extend it to the multi-constrained EVRP, which incorporates practical limitations including battery capacity, time windows, vehicle load limits, and charging infrastructure availability. The experimental results show that TSS GAZ PTP consistently outperforms existing DRL methods, with particularly notable improvements on large-scale instances. Full article

Curling presents a challenging continuous-control problem in which shot outcomes depend on long-horizon interactions between complex physical dynamics, strategic intent, and opponent responses. Despite recent progress in applying reinforcement learning (RL) to games and sports, curling lacks a unified environment that jointly supports stable, rule-consistent simulation, structured state abstraction, and scalable agent training. To address this gap, we introduce a comprehensive learning framework for curling AI, consisting of a full-sized simulation environment, a task-aligned Markov decision process (MDP) formulation, and a two-phase training strategy designed for stable long-horizon optimization. First, we propose a novel MDP formulation that incorporates stone configuration, game context, and dynamic scoring factors, enabling an RL agent to reason simultaneously about physical feasibility and strategic desirability. Second, we present a two-phase curriculum learning procedure that significantly improves sample efficiency: Phase 1 trains the agent to master delivery mechanics by rewarding accurate placement around the tee line, while Phase 2 transitions to strategic learning with score-based rewards that encourage offensive and defensive planning. This staged training stabilizes policy learning and reduces the difficulty of direct exploration in the full curling action space. We integrate this MDP and training procedure into a unified Curling RL Framework, built upon a custom simulator designed for stability, reproducibility, and efficient RL training and a self-play mechanism tailored for strategic decision-making. Agent policies are optimized using Soft Actor–Critic (SAC), an entropy-regularized off-policy algorithm designed for continuous control. As a case study, we compare the learned agent’s shot patterns with elite match records from the men’s division of the Le Gruyère AOP European Curling Championships 2023, using 6512 extracted shot images. Experimental results demonstrate that the proposed framework learns diverse, human-like curling shots and outperforms ablated variants across both learning curves and head-to-head evaluations. Beyond curling, our framework provides a principled template for developing RL agents in physics-driven, strategy-intensive sports environments. Full article

Background/Objectives: Parkinsonian gait is characterized by impaired motor adaptability, altered temporal organization, and reduced movement variability. While data augmentation is commonly used to mitigate class imbalance in gait-based machine learning models, conventional strategies often ignore physiological differences between healthy and pathological movements, potentially distorting meaningful motor dynamics. This study explores whether preserving healthy motor variability while selectively augmenting pathological gait signals can improve the robustness and physiological coherence of gait pattern classification models. Methods: Eight patients with Parkinsonian gait patterns and forty-eight healthy participants performed walking tasks on the Motigravity platform under hypogravity conditions. Full-body kinematic data were acquired using wearable inertial sensors. A selective augmentation strategy based on smooth time-warping was applied exclusively to pathological gait segments (×5, σ = 0.2), while healthy gait signals were left unaltered to preserve natural motor variability. Model performance was evaluated using a hybrid convolutional neural network–long short-term memory (CNN–LSTM) architecture across multiple augmentation configurations. Results: Selective augmentation of pathological gait signals achieved the highest classification performance (94.1% accuracy, AUC = 0.97), with balanced sensitivity (93.8%) and specificity (94.3%). Performance decreased when augmentation exceeded an optimal range of variability, suggesting that beneficial augmentation is constrained by physiologically plausible temporal dynamics. Conclusions: These findings demonstrate that physiology-informed, selective data augmentation can improve gait pattern classification under constrained data conditions. Rather than supporting disease-specific diagnosis, this proof-of-concept study highlights the importance of respecting intrinsic differences in motor variability when designing augmentation strategies for clinical gait analysis. Future studies incorporating disease-control cohorts and subject-independent validation are required to assess specificity and clinical generalizability. Full article

In complex wireless communication environments, automatic modulation classification (AMC) faces two critical challenges: the lack of robustness under low-signal-to-noise ratio (SNR) conditions and the inefficiency of integrating multi-scale feature representations. To address these issues, this paper proposes CAIC-Net, a robust modulation classification network that integrates a dynamic cross-attention mechanism with a cross-SNR contrastive learning strategy. CAIC-Net employs a dual-stream feature extractor composed of ConvLSTM2D and Transformer blocks to capture local temporal dependencies and global contextual relationships, respectively. To enhance fusion effectiveness, we design a Dynamic Cross-Attention Unit (CAU) that enables deep bidirectional interaction between the two branches while incorporating an SNR-aware mechanism to adaptively adjust the fusion strategy under varying channel conditions. In addition, a Cross-SNR Contrastive Learning (CSCL) module is introduced as an auxiliary task, where positive and negative sample pairs are constructed across different SNR levels and optimized using InfoNCE loss. This design significantly strengthens the intrinsic noise-invariant properties of the learned representations. Extensive experiments conducted on two standard datasets demonstrate that CAIC-Net achieves competitive classification performance at moderate-to-high SNRs and exhibits clear advantages in extremely low-SNR scenarios, validating the effectiveness and strong generalization capability of the proposed approach. Full article

Cooperative task allocation is one of the critical enablers for multi-Autonomous Underwater Vehicle (AUV) missions, but existing approaches often assume reliable communication that rarely holds in real underwater acoustic environments. We study here the performance and robustness of the Consensus-Based Bundle Algorithm (CBBA) for multi-AUV task allocation under realistically degraded underwater communication conditions with dynamically appearing tasks. An integrated simulation framework that incorporates a Dubins-based kinematic model with minimum turning radius constraints, a configurable underwater acoustic communication model (range, delay, packet loss, and bandwidth), and a full implementation of improved CBBA with new features, complemented by 3D trajectory and network-topology visualization. We define five communication regimes, from ideal fully connected networks to severe conditions with short range and high packet loss. Within these regimes, we assess CBBA based on task allocation quality (total bundle value and task completion rate), convergence behavior (iterations and convergence rate), and communication efficiency (message delivery rate, average delay, and network connectivity), with additional metrics on the number of conflicts during dynamic task reallocation. Our simulation results indicate that CBBA maintains performance close to the optimum when the conditions are good and moderate but degrades significantly when connectivity becomes intermittent. We then introduce a local-communication-based conflict resolution strategy in the face of frequent task conflicts under very poor conditions: neighborhood-limited information exchange, negotiation within task areas, and decentralized local decisions. The proposed conflict resolution strategy significantly reduces the occurrence of conflicts and improves task completion under stringent communication constraints. This provides practical design insights for deploying multi-AUV systems under weak underwater acoustic networks. Full article

Path planning, as a key technology in unmanned aerial vehicle (UAV) systems, affects the overall efficiency of task completion and is often limited by energy consumption, obstacles, and maneuverability in complex application environments. Traditional algorithms have insufficient performance in nonlinear, multimodal, and multiconstraints problems. Based on this, this paper proposes an improved exponential-trigonometric optimization (ETO) to solve a 3D smooth path planning model based on a spherical Bezier curve. Firstly, a fixed arc length resampling strategy is proposed to address the issue of the insufficient adaptability of existing path smoothing methods to dynamic threats. Generate a uniformly distributed set of reference points along the Bezier curve and combine it with spherical projection to improve the safety and efficiency of the flight path. On this basis, establish a total cost function that includes four types of costs. Secondly, a new ETO variant called IETO is proposed by introducing the alpha evolution strategy, noise and physical attack strategy, and opposition-based cross teaching strategy into ETO. Then, the effectiveness of IETO for addressing various optimization problems is showcased through population diversity analysis, ablation analysis, and benchmark experiments. Finally, the results of the simulation experiment indicate that IETO stably provides shorter and smoother safe paths for UAVs in three elevation maps with different terrain features. Full article

Unmanned ground vehicles (UGVs) in agriculture face challenges in navigating complex environments due to the presence of dynamic obstacles. This causes several practical problems including mission delays, higher energy consumption, and potential safety risks. This study addresses the challenge by shifting path planning from reactive local avoidance to proactive global optimization. To that end, it integrates aerial imagery from an unmanned aerial vehicle (UAV) to identify dynamic obstacles using a low-latency YOLOv8 detection pipeline. These are translated into georeferenced exclusion zones for the UGV. The UGV follows the optimized path while relying on a LiDAR-based reactive protocol to autonomously detect and respond to any missed obstacles. A farm management information system is used as the central coordinator. The system was tested in 30 real-field trials in a walnut orchard for two distinct scenarios with varying worker and vehicle loads. The system achieved high mission success, with the UGV completing all tasks safely, with four partial successes caused by worker detection failures under afternoon shadows. UAV energy consumption remained stable, while UGV energy and mission time increased during reactive maneuvers. Communication latency was low and consistent. This enabled timely execution of both proactive and reactive navigation protocols. In conclusion, the present UAV–UGV system ensured efficient and safe navigation, demonstrating practical applicability in real orchard conditions. Full article