Search Results (718)

Metaheuristic optimization algorithms have attracted considerable research interest for solving complex optimization problems, yet many existing algorithms suffer from premature convergence and an inadequate balance between exploration and exploitation. The Coati Optimization Algorithm (COA) is a recently proposed nature-inspired metaheuristic that models the hunting and escape behaviors of coatis; however, it exhibits limited search diversity and tends to stagnate in local optima on high-dimensional, multimodal landscapes. This paper proposes an Improved Coati Optimization Algorithm (ICOA) that integrates four complementary enhancement strategies: (1) a Dynamic Adaptive Step-Size strategy that combines Lévy flights with Student’s t-distribution perturbations for heavy-tailed exploration; (2) a Population-Adaptive Dynamic Perturbation strategy that incorporates differential evolution operators with fitness-proportional scaling; (3) an Iterative-Cyclic Differential Perturbation strategy that employs sinusoidal scheduling and population-differential guidance; and (4) a Cosine-Adaptive Gaussian Perturbation strategy for refined exploitation with time-decaying intensity. ICOA is evaluated on 29 CEC2017, 10 CEC2020, and 12 CEC2022 benchmark functions across dimensions ranging from 10 to 100, compared against seven state-of-the-art algorithms in each benchmark suite. A statistical analysis using the Friedman test and the Wilcoxon rank-sum test confirms that ICOA achieves overall rank 1 on all three benchmark suites, with Friedman mean ranks of 1.207 (CEC2017, $D=100$), 1.000 (CEC2020, $D=10$), and 2.208 (CEC2022, $D=10$); the CEC2020 result should be interpreted in the context of its low dimensionality. A scalability analysis across four dimensionalities (10D, 30D, 50D, 100D) demonstrates consistent first-place rankings with mean ranks between 1.000 and 1.207. An ablation study and a sensitivity analysis of the strategy activation probability validate the contribution of each individual strategy and the optimality of the 50% activation setting. Furthermore, ICOA achieves the best results on all six constrained engineering design problems tested, with all improvements confirmed as statistically significant ($p<0.05$). Full article

Real-time motion planning in cluttered and dynamically evolving environments remains challenging due to the need to ensure rapid convergence, collision avoidance, computational efficiency, and robustness against local minima under frequent changes. Although sampling-based planners such as RRTX* and ABIT* provide strong theoretical guarantees, their practical deployment in dense dynamic scenarios is often limited by high sampling overhead and computational latency. This paper proposes a Fast Converging Adaptive Algorithm (FCAA), a deterministic sampling-based framework integrating adaptive sampling density, temperature-controlled exploration, and dynamic step-size regulation within a unified heating and annealing mechanism. The temperature parameter governs both the spatial sampling band and incremental expansion radius, enabling controlled transitions between goal-directed expansion and stochastic exploration when stagnation occurs. The algorithm is evaluated using a two-stage protocol comprising intrinsic validation and benchmarking. Across 36 environments with obstacle densities ranging from 3% to 20% and velocities between −30 and +30 m/s, FCAA achieved a 100% success rate within the defined experimental design while maintaining path quality comparable to or better than RRTX* and ABIT*. Unlike the reference planners, which typically required tens of thousands of samples and seconds of computation, FCAA operated with substantially reduced sampling effort, typically tens of nodes, and planning times from 0.1 to 320 ms depending on scenario complexity. Within the simulation framework, the results indicate that the proposed temperature-regulated strategy enables fast and computationally efficient motion planning under dynamic constraints, making FCAA suitable for time-critical robotic navigation scenarios. Full article

Aiming at the inherent defects of the Horned Lizard Optimization Algorithm (HLOA), such as insufficient global exploration capability, premature convergence to local optima, and inadequate balance between exploration and exploitation, this paper proposes an enhanced Improved Horned Lizard Optimization Algorithm (IHLOA) integrated with multi-strategy improvements. Firstly, the Fuch chaotic mapping is introduced for population initialization, which enhances the ergodicity and diversity of the initial population by leveraging the pseudo-random and aperiodic characteristics of chaotic sequences, laying a high-quality foundation for subsequent optimization searches. Secondly, the golden sine strategy is embedded into the iterative update process to dynamically adjust the search step size and direction. This strategy utilizes the periodic amplitude variation in the sine function and the golden section coefficient to balance the global exploration for potential optimal regions and local exploitation for refined optimization, thereby accelerating convergence speed while avoiding local stagnation. Finally, the orthogonal crossover strategy is incorporated in the late iteration stage to promote effective information interaction between parent and offspring populations. By means of chromosome segment exchange and elitist retention mechanisms, this strategy reduces dimensional search blind spots and further enhances the algorithm’s ability to capture high-quality solutions. Comprehensive experimental evaluations are conducted based on classical benchmark test functions and eight state-of-the-art meta-heuristic algorithms. The results demonstrate that the IHLOA outperforms comparative algorithms in terms of optimization accuracy, convergence speed, and stability across 30-D, 50-D, and 80-D scenarios. For practical path planning applications, the IHLOA achieves remarkable performance improvements: in single-goal path planning, it reduces the path length by 2.54–87.64% compared with benchmark algorithms; in multi-goal path planning, it realizes a 1.24–7.99% reduction in path length and an 11.91% average reduction in the number of turning points relative to the original HLOA. Additionally, the IHLOA exhibits excellent robustness and adaptability in dynamic obstacle environments, effectively shortening the path length and reducing robot stuck times. This research not only enriches the improvement framework of meta-heuristic algorithms but also provides a high-efficiency optimization solution for mobile robot path planning in complex environments. Full article

Background: Short-term facilitation (STF) is a key form of synaptic plasticity driven by activity-dependent increases in presynaptic release probability. However, estimating core synaptic parameters—quantal size ($q$), vesicle pool size ($N$), and release probability ($p_i$)—remains challenging due to nonlinear dynamics and unobservable presynaptic states, limiting the applicability of conventional methods. Methods: We developed a fast analytical framework based on first- and second-order statistical moments of evoked EPSCs, including mean, variance, and cross-stimulus covariance. By constructing composite moment relationships, latent variables were algebraically eliminated, yielding closed-form estimators of synaptic parameters. To improve robustness under strong facilitation, a Tsodyks–Markram (T–M) model-based calibration step was introduced to refine $N$ and $p_i$ using the estimated $q$ as a constraint. Results: Applied to hippocampal CA3–CA1 synapses, the method produced accurate and stable estimates of q across varying noise and sampling conditions. Incorporation of cross-stimulus covariance enabled effective characterization of structured variability that is neglected in classical approaches. While direct estimates of $N$ and $p_i$ showed dispersion, T–M calibration significantly improved stability and physiological consistency. Compared with mean–variance analysis, the proposed method achieved superior performance under facilitating conditions. Conclusions: This hybrid framework enables rapid and reliable estimation of synaptic parameters in STF synapses by exploiting second-order statistical structure. It provides a practical tool for investigating presynaptic mechanisms and may facilitate quantitative studies of synaptic dysfunction in neurological and psychiatric disorders. Full article

The integration of photovoltaic (PV) generation with bidirectional electric vehicle (EV) fast-charging systems offers a promising pathway toward sustainable transportation and grid support. However, the dynamic coupling between maximum power point tracking (MPPT) perturbations and grid-side power quality presents a fundamental challenge in such multi-converter architectures. This paper addresses this challenge through a coordinated design and optimization framework for a grid-connected, PV-assisted bidirectional off-board EV fast charger. The system integrates a 184.695 kW PV array via a DC-DC boost converter, a common DC link, a three-phase bidirectional active front-end rectifier with an LCL filter, and a four-phase interleaved bidirectional DC-DC converter for the EV battery interface. A comparative evaluation of three MPPT algorithms establishes the Fuzzy Logic Variable Step-Size Perturb & Observe (Fuzzy VSS-P&O) as the optimal strategy, achieving 99.7% tracking efficiency with 46 μs settling time. However, initial integration of this high-performance MPPT reveals system-level harmonic distortion, with grid current total harmonic distortion (THD) reaching 4.02% during charging. To resolve this coupling, an Artificial Bee Colony (ABC) metaheuristic algorithm performs coordinated optimization of all critical PI controller gains. The optimized system reduces grid current THD to 1.40% during charging, improves DC-link transient response by 43%, and enhances Phase-Locked Loop (PLL) synchronization accuracy. Comprehensive validation confirms robust bidirectional operation with seamless mode transitions and compliant power quality. The results demonstrate that system-wide intelligent optimization is essential for reconciling advanced energy harvesting with stringent grid requirements in next-generation EV fast-charging infrastructure. Full article

As the boundary between indoor and outdoor spaces, the heat flux of a building envelope is a crucial factor influencing the indoor thermal environment and human thermal comfort, and also an important indicator reflecting the impact of outdoor meteorological factors on the indoor environment. In scenarios involving rapid assessment of existing buildings and engineering projects, the dynamic thermal performance of the building envelope are often affected by factors such as outdoor weather fluctuations, window–wall coupling, wall heat storage, and thermal bridging. To address this issue, this study proposes a dynamic heat flux calculation method that accounts for hysteresis. Simultaneously, the heat conduction equation of the implicit finite difference method (IFDM) and boundary conditions based on wall energy balance are used to optimize the wall surface temperature. An adaptive step size control strategy (Runge–Kutta–Fehlberg) is introduced in the time step setting. Results show that the heat flux R² of the proposed dynamic heat flux calculation method is 0.9207, and the optimized R² is 0.9435, both within an acceptable range for engineering applications. Studies have shown that the simplified framework derived from the heat flux analysis of building envelopes retains the characteristics of wall heat storage and delayed heat release, while effectively solving the window–wall coupling problem and significantly reducing the reliance on computationally expensive numerical methods. This method therefore provides an efficient and scalable technical pathway for thermal performance assessment and energy-retrofit decision support for existing building envelopes. Full article

To address the demand for a micro-power supply for vehicle suspension control, a novel harvester is proposed to recover vortex-induced vibration energy in the wake of a shock absorber. A suspension dynamic model was established to simulate the spring compression process and identify the wind-shielding condition. The spring-shock absorber assembly was then simplified as a stepped cylinder with two cross-sections. Flow-field analysis showed that the size, shape, and rising angle of the wake vortices were affected by the bluff-body geometry, Reynolds number, and boundary conditions. The downwash motion was found to directly influence vortex development, and two new vortex-connection modes were identified. These results provided guidance for harvester optimization. A two-way fluid–structure interaction model was developed to describe the electromechanical conversion behavior of the proposed harvester under flow excitation. Numerical results showed that the output voltage increased with vehicle speed. An average peak voltage of 1.82 V was obtained when the piezoelectric patches were installed two larger-cylinder diameters downstream. The optimal patch length was 120 mm, and further increasing the length did not significantly improve the harvesting performance. Finally, a full-scale prototype was tested, and the measured voltage agreed well with the simulation results. The proposed harvester can therefore serve as a potential micro-power source for low-power suspension electronics. Full article

Scalability of the original test design for the box assembly with removable component (BARC) structure is of interest in the field of experimental structural analysis. As complex structures become increasingly difficult to test experimentally the larger they become, it is a common test practice to use a scaled-down representative model to understand the characteristics of these systems. For complex structures with non-rigid boundary conditions, there exists a gap in understanding the effects of scalability and welding. To gain a better understanding of the outcomes of this phenomenon, the dynamical effects of upscaling the dimensions of the BARC structure are analyzed. Three variations of the BARC are investigated experimentally and computationally, namely, the original BARC system, the BARC system upscaled at 1.5 times the size of the original model, and the BARC system upscaled at two times the size of the original model. The original BARC is tested to investigate the properties of the predetermined boundary conditions. Because the upscaled BARC systems are manufactured using welding, an investigation of the variability of results due to welding imperfections is conducted to evaluate its effects on the vibrational properties of the systems. The dominant resonant frequencies of the three systems are identified through an impact hammer test. The results are then compared to those obtained through finite element analysis, in which both datasets show agreement. In general, as the BARC system is upscaled, the resonant frequencies decrease without inducing mode switching for the selected boundary conditions, indicating that the larger systems are less rigid. To understand the trends of nonlinear softening/hardening and nonlinear damping, forced vibration experiments conducted in the form of true random and controlled stepped-sine excitations are performed. The results show that, in general, as the BARC system is upscaled, changes in the nonlinear properties of the system are induced. With regard to the effects of using welding to manufacture BARC systems, the results prove that variations in welding can lead to non-negligible variations in the vibratory responses of the BARC system. Additionally, several types of harmonic vibrational testing are investigated to understand the physics behind their varied responses. Overall, this work shows that upscaling the BARC system can be beneficial to researchers who require a less rigid system for investigations and that manufacturing of BARC systems by welding can be a cost-effective alternative to subtractive manufacturing. Full article

The design and implementation of a dynamic frequency sweeping algorithm for a 3 kW RF power source are underpinned by theoretical principles aimed at optimizing impedance matching under pulse-mode operation. The algorithm dynamically adjusts the output frequency within a predefined range to align the source impedance Z_source with the conjugate of the load impedance Z*_load, maximizing the power transfer efficiency and minimizing the reflection coefficient Γ. This is achieved by leveraging the maximum power transfer theorem and adapting to dynamic load variations, such as those induced by the plasma state transitions. The algorithm incorporates adaptive step size adjustments based on the rate of change of Γ, predictive frequency initialization using historical data, and real-time impedance monitoring to ensure efficient convergence within the constrained pulse “ON” time (TON). Integration with pulse mode requires synchronization with the pulse signal, fast convergence, and optimized search strategies. Experimental validation on a 13.56 MHz, 3 kW Automatic Sweep Generator testbed operating at 20 kHz pulse modulation with a 50% duty cycle demonstrates a linear and stable sweep, achieving impedance matching and low reflected power within 5.0172 ms. These findings highlight the algorithm’s potential for high-precision applications, such as RF plasma excitation, and underscore the importance of adaptive techniques in dynamic RF systems. Full article

Segmenting non-rigid objects such as smoke in video requires effective utilization of temporal information, which remains challenging due to their irregular deformation and complex appearance variations. Based on our previously proposed DeffNet for industrial fumes video segmentation, this letter presents a novel adaptive frame selection algorithm that employs fuzzy logic control to dynamically optimize the temporal processing step size for the specific task of industrial smoke video segmentation. Our method quantifies inter-frame variation using the Structural Similarity Index (SSIM) and Normalized Cross-Correlation (NCC) as inputs to a fuzzy inference system. Gaussian membership functions, shaped via K-means clustering, and a five-rule fuzzy system are designed to determine the optimal step size, maximizing informative dynamic feature extraction while minimizing redundant computation. As a lightweight front-end module, the algorithm integrates seamlessly into the existing DeffNet segmentation framework without reconstructing new network architecture. Extensive experiments on a dedicated industrial smoke video dataset demonstrate that our approach effectively improves the segmentation performance of DeffNet, achieving 84.27% Intersection over Union (IoU) while maintaining a high inference speed of 39.71 FPS. This work provides an efficient and scene-specific solution for temporal modeling in industrial smoke non-rigid object segmentation and offers a practical improved strategy for DeffNet in real-time industrial smoke monitoring. Full article

Pricing multi-peril agricultural insurance under compound climate hazards demands a framework that captures stochastic dependence among heterogeneous perils, accommodates non-stationary loss dynamics, and supports adaptive policy optimisation. We demonstrate that backward stochastic differential equations, combined with copula dependence, recurrent neural networks, and reinforcement learning, provide a unifying language for this task; the contribution lies in their principled integration. The dynamic premium is the unique adapted solution of a BSDE whose driver encodes compound-risk dependence through a Student-t copula, forward loss dynamics through a jump-diffusion process, and a green-finance adjustment through an optimal control variable. Within this framework we derive three progressive results by adapting standard BSDE theory to the compound-dependence and policy-control setting. First, existence and uniqueness hold under Lipschitz and square-integrability conditions. Second, a comparison theorem guarantees that a larger correlation matrix yields higher premiums; the degrees-of-freedom effect enters separately through the risk-loading magnitude. Third, the Euler discretisation converges at a rate of one half of the time-step size, with copula estimation, LSTM conditional expectation approximation, and Q-learning HJB solution as sequential components. Applied to eleven Zhejiang cities (2014–2023, $N \times T=110$), in this illustrative application the framework reduces premium variance by 43.5 percent (bootstrap 95% CI: $[38.2\%,48.7\%]$) while maintaining actuarial adequacy with a mean loss ratio of 0.678, though the modest sample size warrants caution in generalising these findings. Each component contributes statistically significant improvements confirmed by the Friedman test at the 0.1 percent significance level. Full article

In recent years, video recognition models have witnessed the rapid development of Deep Neural Networks (DNNs). However, these models remain not robust to adversarial examples that are created by adding imperceptible perturbations to clean samples. Recent studies indicate that generating adversarial examples in the hard-label black-box setting is particularly challenging yet highly practical. Compared to image recognition models, there are few hard-label black-box adversarial example generation algorithms for video recognition models. To this end, we propose a hard-label black-box video adversarial example generation algorithm, referred to as Dynamic Black-box Algorithm (DBA). First, DBA uses the binary search algorithm to find the boundary video between two original videos; then, the sampling-based algorithm is used to estimate the gradient on the boundary video; finally, with a dynamic step size adjustment strategy, DBA moves the boundary video towards the direction of the estimated gradient to generate the adversarial video. Additionally, we designed another strategy to skip invalid samples generated during the adversarial example generation process. Experiments demonstrate that DBA attains a superior trade-off between the magnitude of perturbations and query efficiency. Specifically, DBA outperforms state-of-the-art algorithms, achieving an average reduction in Mean Squared Error (MSE) of over 50%. Full article

In complex ground environments, conventional RRT* often suffers from low planning efficiency and poor path quality for robot path planning. This paper proposes BGSE-RRT* (Bi-tree Cooperative, Goal-guided, low-discrepancy Sampling, multi-sector Expansion). First, BGSE-RRT* constructs a nonlinear switching probability via bi-tree cooperative adaptive switching, together with KD-Tree nearest-neighbor acceleration and multi-condition triggering, to adaptively balance global exploration and local convergence. Meanwhile, a goal-guided expansion with dynamic target binding and adaptive step size, under a multi-constraint feasibility check, accelerates the convergence of the two trees. When the goal-guided expansion becomes blocked, BGSE-RRT* generates candidate points in local multi-sector regions using a 2D Halton low-discrepancy sequence and selects the best candidate for expansion; if the multi-sector expansion still fails, a sampling-point-guided expansion is activated to continue advancing and search for a feasible path. Second, B-spline smoothing is applied to improve trajectory continuity. Finally, in five simulation environments and ROS/real-robot joint validation, compared with GB-RRT*, BI-RRT*, BI-APF-RRT*, and BAI-RRT*, BGSE-RRT* reduces planning time by up to 84.71%, shortens path length by 2.94–6.88%, and improves safety distance by 20.68–48.33%. In ROS/real-robot validation, the trajectory-tracking success rate reaches 100%. Full article

In large-scale dam construction, the efficiency of concrete transport operations is fundamentally governed by the coordination between horizontal hauling and vertical hoisting capacities. Traditional experience-based scheduling approaches often fail to capture the stochastic, cyclic, and resource-coupled nature of these transport systems. This study developed a closed queuing network-based stochastic simulation framework to model dam concrete transportation as a finite-population cyclic service system. The process was abstracted into sequential service stages with stochastic service times, and a structured state-space representation combined with time-step simulation was constructed to describe dynamic resource occupation and task transitions under varying truck and cable crane configurations. Application to a real large-scale dam project revealed a characteristic multi-stage performance evolution pattern governed by capacity matching mechanisms. As the truck fleet size increased, system performance transitioned from a transport-limited regime to a capacity-coordination regime and ultimately to a hoisting-saturated regime in which further fleet expansion yielded diminishing returns. Sensitivity analysis demonstrated that hoisting capacity imposed an upper bound on system throughput, while adaptive fleet reconfiguration could restore operational equilibrium under constrained equipment availability. The results indicated that dam concrete transport should be treated as a dynamic capacity regulation problem rather than a static allocation task. The proposed framework provides an interpretable and quantitative decision-support tool for equipment configuration, bottleneck identification, and adaptive scheduling in large-scale hydraulic infrastructure projects. Full article

Predicting the motion of ships and floating structures is essential for ensuring economical and environmentally friendly operations in the ocean. In this study, we propose a hybrid encoder–decoder Convolutional Neural Network–Long Short-Term Memory (CNN–LSTM) architecture to predict motions of a moored Floating Production Storage and Offloading (FPSO) vessel under varying sea conditions. The model integrates a CNN for spatial wave-field feature extraction and an LSTM encoder–decoder to capture temporal dependencies in vessel motion. Synthetic datasets were generated using mid-fidelity dynamics simulations of a coupled FPSO–mooring–riser system subjected to wave excitations. Five sea states ranging from calm to severe were considered to evaluate the model’s robustness. A key preprocessing step involved determining the optimal spatial domain for wave field input, and a wave field size of 600 m × 600 m was identified as the most cost-effective configuration while maintaining accuracy. The model was validated using the Root Mean Square Error (RMSE) or relative RMSE (RRMSE). Despite low RRMSE values in low sea states, predictions were noisier due to high-frequency, low-amplitude responses. In contrast, higher sea states yielded more stable predictions despite higher RRMSE values. The proposed method offers high-resolution motion forecasting capability, which can enhance operational safety and energy efficiency of offshore platforms, particularly when integrated with stereo camera-based wave monitoring systems. Full article