Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (112)

Search Parameters:
Keywords = Nelder–Mead method

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
36 pages, 3275 KB  
Article
A Symmetry-Driven Inverse Design Framework for Multi-Agent Cooperative Deployment Under Line-of-Sight Constraints
by Fenghua Chen, Mindong Liu, Fuchao Dai and Weipeng Zhou
Symmetry 2026, 18(6), 980; https://doi.org/10.3390/sym18060980 - 5 Jun 2026
Viewed by 109
Abstract
Cooperative deployment of mobile agents under geometric and line-of-sight constraints gives rise to high-dimensional constrained optimization problems whose underlying physical configuration often exhibits exploitable structure. This paper develops a symmetry-driven inverse design framework that leverages two structural features of the engagement geometry—the [...] Read more.
Cooperative deployment of mobile agents under geometric and line-of-sight constraints gives rise to high-dimensional constrained optimization problems whose underlying physical configuration often exhibits exploitable structure. This paper develops a symmetry-driven inverse design framework that leverages two structural features of the engagement geometry—the Z2×Z2 mirror symmetries of the extended target silhouette and a closed-form forward–inverse correspondence between line-of-sight-aligned burst locations and physical agent parameters—to construct low-dimensional seeds for subsequent physical parameter optimization. The framework is developed and validated on a representative naval defense instance in which a fleet of unmanned aerial vehicles (UAVs) releases spherical obscuration payloads to interrupt the line of sight between incoming mobile threats and a cylindrical extended target. Instead of searching only over the four-dimensional UAV parameter space (heading angle, speed, drop time, fuse delay), the method first specifies a desired burst location in a two-dimensional inverse space and analytically back-calculates feasible agent parameters, which are then refined by multi-start Nelder–Mead optimization in the physical parameter space. A conservative three-dimensional cylindrical line-of-sight obscuration model is developed by constructing four extreme tangent sightlines from the missile to the cylindrical target and verifying whether the spherical smoke cloud simultaneously blocks all of them. A hierarchical multi-agent task allocation framework combines a performance matrix, assignment enumeration, and joint multi-start refinement. Numerical experiments on five progressively complex sub-problems demonstrate obscuration durations of 1.362 s (single fixed shot), 4.580 s (optimized shot), 7.324 s (three-shot relay), 11.140 s (three-UAV cooperation), and 20.652 s (full five-UAV three-missile assignment). Additional high-dimensional benchmarks, sensitivity tests, and error analyses clarify the reproducibility and limitations of the approach. Full article
(This article belongs to the Section Engineering and Materials)
Show Figures

Figure 1

21 pages, 5218 KB  
Article
Forward Scatter Radar Moving Target Detection via Linearly Weighted Time–Frequency Entropy
by Yuqing Zheng, Xiaofeng Ai, Zhiming Xu and Shunping Xiao
Remote Sens. 2026, 18(11), 1780; https://doi.org/10.3390/rs18111780 - 1 Jun 2026
Viewed by 253
Abstract
Forward scatter radar (FSR) can enhance target echo signal power by exploiting the sharp increase in radar cross-section (RCS), and has been widely studied in passive radar target detection. Traditional FSR detectors operate based on the shadowing effect that occurs when a target [...] Read more.
Forward scatter radar (FSR) can enhance target echo signal power by exploiting the sharp increase in radar cross-section (RCS), and has been widely studied in passive radar target detection. Traditional FSR detectors operate based on the shadowing effect that occurs when a target crosses the baseline. However, when satellite transmitters are used, the probability that a target’s trajectory intersects with the baseline in three-dimensional space approaches zero. Therefore, shadowing is difficult to occur. A moving-target detection method using weighted time-frequency (TF) entropy fusion is proposed in this paper for scenarios where targets move near the baseline. First, an echo signal model is established to show that the frequency change can be approximated as linear within a short time. Then, four TF entropy features are extracted from the received signal and linearly weighted to form the test statistic. The weights are optimized using the Nelder–Mead algorithm, with the objective of maximizing the average detection probability. Finally, the effectiveness of the proposed algorithm is verified through simulations and anechoic chamber measurements. The weighted fused TF entropy achieves a higher detection probability than any single TF entropy. Compared with the energy detector, the required signal-to-noise ratio (SNR) is reduced by about 3 dB to achieve the same detection probability at a false alarm probability of 10−3. Full article
Show Figures

Figure 1

22 pages, 5586 KB  
Article
Design of Functionally Graded Alloys for Locks Highly Resistant to Ultrasonic Detector Attacks
by Luka Matić, Antonio Petošić, Viktor Šunde and Željko Ban
Materials 2026, 19(11), 2268; https://doi.org/10.3390/ma19112268 - 27 May 2026
Viewed by 151
Abstract
Mechanical locks have not been fully replaced by electrical locks and are still being researched and improved, along with advanced electronic methods of attack. Moreover, reading pin lengths by detecting their natural frequencies (lock decoding) to forge copies of a legitimate key can [...] Read more.
Mechanical locks have not been fully replaced by electrical locks and are still being researched and improved, along with advanced electronic methods of attack. Moreover, reading pin lengths by detecting their natural frequencies (lock decoding) to forge copies of a legitimate key can be done quickly using active or passive ultrasonic detectors. One possible method of defence against them is manufacturing lock pins using functionally graded materials (FGMs). A pin’s natural frequency (in the range 100 kHz–1 MHz) and hence its ultrasonic pulse transit/reflection time can be correlated to its length if it is made of a homogeneous material. The idea is to design pins made of functionally graded alloys to achieve equal natural frequencies, but also desired positions of standing wave nodes regardless of pin length. To calculate the composition of the FGM alloy, we must first develop mathematical models of a pin’s vibrations. Two simple and fast mathematical models are first derived from the finite-element model (FEM) of a pin. These models are used in an optimization procedure based on the Nelder–Mead simplex method to calculate optimal profiles of Young’s modulus and density along a pin’s longitudinal axis. A successful optimization procedure for 10 key pin lengths is performed to make a pin-tumbler lock resistant to ultrasonic attacks. Full article
(This article belongs to the Section Materials Simulation and Design)
Show Figures

Graphical abstract

24 pages, 2836 KB  
Article
Approximate MSEV State-Space Based Optimal Control of Nonlinear and Nonstationary Dynamic Systems
by Nemanja Deura, Zoran Banjac, Miloš Pavlović, Boško Božilović, Željko Đurović and Branko Kovačević
Mathematics 2026, 14(11), 1802; https://doi.org/10.3390/math14111802 - 22 May 2026
Viewed by 241
Abstract
A new class of modified minimum state error variance (MSEV) state-space based optimal linear quadratic Gaussian (LQG) regulators for closed-loop structures with estimated feedback has been proposed in this article. The negative feedback path is designed as the cascade of the digital LQG [...] Read more.
A new class of modified minimum state error variance (MSEV) state-space based optimal linear quadratic Gaussian (LQG) regulators for closed-loop structures with estimated feedback has been proposed in this article. The negative feedback path is designed as the cascade of the digital LQG regulator and discrete Kalman state observer. The proposed design enables tracking of a time-varying reference input using the predictive control approach. Moreover, the proposed tracking method utilizes a multivariable continuous-time Cauchy state-space model of nonlinear, nonstationary dynamic systems. The resulting control strategy is approximately optimal, as the optimality of the LQG design holds locally for each linearized model around the respective operating point and does not extend to the global nonlinear system. In this sense, starting from the prespecified nominal state trajectory to be tracked, a numerical optimization procedure minimizing the squared tracking error at each step by using the Nelder–Mead direct search simplex algorithm under the required constraints on the input signal has been developed. The LQG regulator and Kalman state observer are designed by utilizing the linear discrete-time state variable models that properly approximate the nonlinear system dynamics across the nominal state trajectory. The performance of the proposed design is validated by simulating a six-degree-of-freedom nonlinear aircraft model across typical flight regimes. Full article
(This article belongs to the Special Issue Mathematical Modelling of Nonlinear Dynamical Systems, 2nd Edition)
Show Figures

Figure 1

22 pages, 12453 KB  
Article
Strategic Data Re-Uploads: A Pathway to Improved Quantum Classification Data Re-Uploading Strategies for Improved Quantum Classifier Performance
by Sara Aminpour, Yaser M. Banad and Sarah S. Sharif
Entropy 2026, 28(5), 550; https://doi.org/10.3390/e28050550 - 13 May 2026
Viewed by 403
Abstract
Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an [...] Read more.
Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an advanced approach leveraging data re-uploading, a strategy that cyclically encodes classical data into quantum states to improve classifier performance. We examine two cost functions, fidelity and trace distance, across various quantum classifier configurations, including single-qubit, two-qubit, and entangled two-qubit systems. Additionally, we evaluate four optimization techniques (L-BFGS-B, COBYLA, Nelder–Mead, and SLSQP) to determine their effectiveness in optimizing quantum circuits for both linear and non-linear classification tasks. Our results show that the choice of optimization method significantly impacts classifier performance, with L-BFGS-B and COBYLA often yielding superior accuracy. The two-qubit entangled classifier shows improved accuracy over its non-entangled counterpart, albeit with increased computational cost. Also, the two-qubit entangled classifier is the best option for real-world random datasets in terms of accuracy and computational cost. Linear classification tasks generally exhibit more stable performance across optimization techniques compared to non-linear tasks. Our findings highlight the potential of data re-uploading in quantum machine learning, outperforming existing quantum classifier models in terms of accuracy and robustness. This work contributes to the growing field of quantum machine learning by providing a comprehensive comparison of classification strategies and optimization techniques in quantum computing environments, offering a foundation for developing more efficient and accurate quantum classifiers. Full article
(This article belongs to the Special Issue Quantum Algorithms and Quantum Machine Learning)
Show Figures

Figure 1

14 pages, 2674 KB  
Proceeding Paper
Parameter Determination of Quantum Approximate Optimization Algorithm Using Layerwise Grid Search Method
by Su-Ling Lee and Chien-Cheng Tseng
Eng. Proc. 2026, 134(1), 69; https://doi.org/10.3390/engproc2026134069 - 22 Apr 2026
Viewed by 529
Abstract
The quantum approximate optimization algorithm (QAOA) is an efficient method for solving combinatorial optimization problems in quantum computing. These problems involve finding the best solution from a finite set of possibilities. At its core, the QAOA uses an Ansatz circuit composed of alternating [...] Read more.
The quantum approximate optimization algorithm (QAOA) is an efficient method for solving combinatorial optimization problems in quantum computing. These problems involve finding the best solution from a finite set of possibilities. At its core, the QAOA uses an Ansatz circuit composed of alternating unitary operators, the mixing and problem Hamiltonians, that are controlled by a set of parameters. Its goal is to find the optimal parameters so that the final quantum state of the circuit encodes the problem’s solution. While this parameter optimization is often handled by classical optimizers, including constrained optimization by linear approximations (COBYLA) and Nelder–Mead, these methods frequently present local extrema. Therefore, we developed a layerwise grid search (LGS) method as an alternative. Since a full grid search is too time-consuming, the LGS method significantly reduces the search time while still finding a good solution. To demonstrate its effectiveness, we present experimental results for the max-cut problem, comparing the performance of our LGS method against conventional classical optimizers. Full article
Show Figures

Figure 1

23 pages, 1694 KB  
Article
A Biomimetic Gazelle Optimization Approach for Enhanced Temperature Regulation in Electric Furnaces
by Davut Izci, Adil Ozcayci, Serdar Ekinci, Irfan Okten, Erdal Akin, Gokhan Yuksek, Ali Akdagli, Ali Yildiz and Filiz Karaomerlioglu
Biomimetics 2026, 11(4), 255; https://doi.org/10.3390/biomimetics11040255 - 7 Apr 2026
Viewed by 792
Abstract
Accurate temperature regulation is essential for ensuring product quality, operational safety, and energy efficiency in industrial electric furnace systems. However, the inherent thermal inertia, time-delay effects, and nonlinear dynamics of furnace processes often make precise temperature control a challenging task. Motivated by these [...] Read more.
Accurate temperature regulation is essential for ensuring product quality, operational safety, and energy efficiency in industrial electric furnace systems. However, the inherent thermal inertia, time-delay effects, and nonlinear dynamics of furnace processes often make precise temperature control a challenging task. Motivated by these challenges, this study proposes an optimization-based control framework aimed at improving the temperature regulation performance of electric furnace systems. The proposed approach integrates a proportional–integral–derivative (PID) controller with the recently developed gazelle optimization algorithm (GOA) for automatic tuning of the controller parameters. First, a mathematical model of the electric furnace is established to describe the dynamic relationship between the control input and the furnace temperature output. Based on this model, a PID controller is implemented to regulate the furnace temperature. The parameters of the PID controller are then optimized using GOA, a nature-inspired metaheuristic algorithm that mimics the adaptive predator–prey survival strategies observed in gazelle herds. In order to achieve a balanced improvement in both steady-state and transient performance, a composite objective function is introduced. The proposed performance index combines the integral of absolute error with additional transient performance indicators related to maximum overshoot and settling time. The effectiveness of the proposed GOA-based tuning framework is evaluated through extensive simulation studies and statistical analyses conducted over multiple independent optimization runs. The results demonstrate stable convergence behavior, with the optimization process achieving a minimum objective value of 2.4251, a maximum value of 2.5347, and an average value of 2.4674 across 25 runs. The optimized control system exhibits improved dynamic characteristics, including a rise time of 1.8509 s, a settling time of 3.6834 s, and a low overshoot of 1.5104%. To further assess its effectiveness, the proposed GOA–PID control strategy is compared with several widely used controller tuning methods reported in the literature, including genetic algorithm, Ziegler–Nichols, Cohen–Coon, Nelder–Mead, and direct synthesis approaches. Comparative results indicate that the proposed method achieves a superior balance between response speed, stability, and temperature tracking accuracy. Full article
(This article belongs to the Section Biological Optimisation and Management)
Show Figures

Figure 1

28 pages, 3487 KB  
Article
Control Research on Tractor Steer-by-Wire Hydraulic System Based on Improved Sparrow Search Algorithm-PID
by Tianpeng He, Siwei Pan, Zhixiong Lu, Zheng Wang and Tao Tian
Agriculture 2026, 16(7), 795; https://doi.org/10.3390/agriculture16070795 - 3 Apr 2026
Viewed by 531
Abstract
To address the inherent nonlinearity and time-varying dynamics of tractor steer-by-wire (SbW) hydraulic systems, as well as the inadequacies of empirical PID tuning in achieving rapid dynamic response and high tracking accuracy during headland maneuvers, continuous steering, and stochastic field operations, this study [...] Read more.
To address the inherent nonlinearity and time-varying dynamics of tractor steer-by-wire (SbW) hydraulic systems, as well as the inadequacies of empirical PID tuning in achieving rapid dynamic response and high tracking accuracy during headland maneuvers, continuous steering, and stochastic field operations, this study proposes an Improved Sparrow Search Algorithm (ISSA)-PID control strategy. Initially, an SbW hydraulic test bench was established, and an asymmetric dynamic transfer function model of the steering system was identified utilizing the Nelder–Mead simplex method. To overcome the susceptibility of the conventional Sparrow Search Algorithm (SSA) to local optima entrapment and its insufficient population diversity, the Circle chaotic map was employed to enhance the initial population distribution. Furthermore, an adaptive t-distribution mutation strategy was incorporated to coordinate global exploration and local exploitation, facilitating the optimization of the PID parameters. Hardware-in-the-loop (HIL) bench tests were conducted to evaluate the performance of the different control algorithms. With the proposed ISSA-PID controller, under step response conditions, accounting for the inherent dynamics of the asymmetric steering cylinder, the response times for left and right turns were reduced to 0.77 s and 0.98 s, respectively. During random signal tracking tests that emulate stochastic field operations, the average tracking error was minimized to 0.75°, with a maximum deviation restricted to 1.27°. These results demonstrate that the proposed ISSA-PID strategy addresses parameter tuning challenges, improving control precision and dynamic response. Consequently, it offers a practical control strategy for tractor SbW hydraulic systems. Full article
(This article belongs to the Section Agricultural Technology)
Show Figures

Figure 1

17 pages, 953 KB  
Article
Socioeconomic Interventions for WHO’s End TB Strategy Targets: Insights from SIR Modelling in Kazakhstan
by Temirlan Ukubayev, Berik Koichubekov, Marina Sorokina and Donatas Austys
Int. J. Environ. Res. Public Health 2026, 23(3), 351; https://doi.org/10.3390/ijerph23030351 - 11 Mar 2026
Viewed by 771
Abstract
Background: Tuberculosis remains a major global public health challenge. Mathematical models are essential for strategic planning and evaluation of tuberculosis control programs, while addressing socioeconomic risk factors has proven key to accelerating incidence declines. Therefore, this study quantitatively assesses the impact of socioeconomic [...] Read more.
Background: Tuberculosis remains a major global public health challenge. Mathematical models are essential for strategic planning and evaluation of tuberculosis control programs, while addressing socioeconomic risk factors has proven key to accelerating incidence declines. Therefore, this study quantitatively assesses the impact of socioeconomic interventions on tuberculosis incidence in Kazakhstan. Methods: A modified SIR compartmental model was developed in Python 3.12 to simulate tuberculosis transmission dynamics. Parameters were calibrated using the Nelder–Mead simplex algorithm, and predictive performance was evaluated via hold-out validation. Scenario-based projections were generated to explore the impact of socioeconomic improvements on future tuberculosis incidence. Results: The calibrated SIR model demonstrated strong predictive accuracy, achieving a mean absolute percentage error of 2.3%. The sensitivity analysis revealed that the model is robust to moderate socioeconomic perturbations, with healthcare funding and unemployment rate as the primary uncertainty drivers. Scenario simulations showed that enhanced financial assistance for tuberculosis patients produced the largest effect beyond baseline. Optimization results indicate that 7.4% rise in GDP per capita, 10.2% increase in healthcare funding, 23.1% and 19.1% reductions in poverty and unemployment rates, and 40.2% growth in tuberculosis patient financial support relative to 2024 are sufficient to achieve the WHO’s End TB Strategy 2030 target. Conclusions: The model offers a valuable tool for tuberculosis forecasting and intervention evaluation, highlighting the synergistic role of socioeconomic measures in achieving global elimination goals. Full article
Show Figures

Figure 1

26 pages, 10181 KB  
Article
Symmetry-Inspired Dung Beetle Optimizer for 3D UAV Path Planning with Structural-Invariance-Aware Grouping
by Gang Wu, Jiajie Li, Shuang Guo and Kaiyuan Li
Symmetry 2026, 18(3), 423; https://doi.org/10.3390/sym18030423 - 28 Feb 2026
Viewed by 387
Abstract
Metaheuristic methods for three-dimensional (3D) unmanned aerial vehicle (UAV) path planning often suffer from premature convergence and reduced accuracy in complex high-dimensional spaces, in which waypoint-based decision variables exhibit structured dependencies and segment-level regularities. In a symmetry-inspired operational sense, these regularities can be [...] Read more.
Metaheuristic methods for three-dimensional (3D) unmanned aerial vehicle (UAV) path planning often suffer from premature convergence and reduced accuracy in complex high-dimensional spaces, in which waypoint-based decision variables exhibit structured dependencies and segment-level regularities. In a symmetry-inspired operational sense, these regularities can be interpreted as exploitable dependency patterns across path segments and permutation invariance among homogeneous UAVs, which are often overlooked by standard algorithms. The paper proposes an enhanced dung beetle optimizer (LEDBO) that integrates interaction-aware variable handling, adaptive role regulation, and a fitness-state-driven hybrid search mechanism. Correlation-based variable grouping clusters dependent waypoints into segments to exploit statistical dependency patterns among waypoint-coordinate variables and enhance local refinement. A three-level adaptive role-regulation scheme adjusts search behaviors according to convergence status and population diversity, thereby mitigating stagnation. Meanwhile, a fitness-state-driven hybrid engine combines Nelder–Mead local refinement with Lévy-flight global exploration to balance exploitation and exploration across stages. Experiments on the CEC2017 benchmark suite and complex 3D UAV path-planning simulations demonstrate that LEDBO achieves better solution quality, convergence behavior, and robustness than representative metaheuristics, producing smoother, shorter, and safer trajectories. The results suggest that incorporating interaction-aware variable grouping and adaptive search regulation can improve UAV path planning and related high-dimensional continuous optimization tasks. Full article
(This article belongs to the Section Computer)
Show Figures

Figure 1

36 pages, 3003 KB  
Article
A Modified Artificial Protozoa Optimizer for Robust Parameter Identification in Nonlinear Dynamic Systems
by Davut Izci, Serdar Ekinci, Gökhan Yüksek, Mostafa Rashdan, Burcu Bektaş Güneş, Muhammet İsmail Güngör and Mohammad Salman
Biomimetics 2026, 11(1), 65; https://doi.org/10.3390/biomimetics11010065 - 12 Jan 2026
Viewed by 732
Abstract
Accurate parameter identification in nonlinear and chaotic dynamic systems requires optimization algorithms that can reliably balance global exploration and local refinement in complex, multimodal search landscapes. To address this challenge, a modified artificial protozoa optimizer (mAPO) is developed in this study by embedding [...] Read more.
Accurate parameter identification in nonlinear and chaotic dynamic systems requires optimization algorithms that can reliably balance global exploration and local refinement in complex, multimodal search landscapes. To address this challenge, a modified artificial protozoa optimizer (mAPO) is developed in this study by embedding two complementary mechanisms into the original artificial protozoa optimizer: a probabilistic random learning strategy to enhance population diversity and global search capability, and a Nelder–Mead simplex-based local refinement stage to improve exploitation and fine-scale solution adjustment. The general optimization performance and scalability of the proposed framework are first evaluated using the CEC2017 benchmark suite. Statistical analyses conducted over shifted and rotated, hybrid, and composition functions demonstrate that mAPO achieves improved mean performance and reduced variability compared with the original APO, indicating enhanced robustness in high-dimensional and complex optimization problems. The effectiveness of mAPO is then examined in nonlinear system identification applications involving chaotic dynamics. Offline and online parameter identification experiments are performed on the Rössler chaotic system and a permanent magnet synchronous motor, including scenarios with abrupt parameter variations. Comparative simulations against APO and several state-of-the-art optimizers show that mAPO consistently yields smaller objective function values, more accurate parameter estimates, and superior statistical stability. In the PMSM case, exact parameter reconstruction with zero error is achieved across all independent runs, while rapid and smooth convergence is observed under both static and time-varying conditions. Full article
(This article belongs to the Section Biological Optimisation and Management)
Show Figures

Figure 1

25 pages, 3778 KB  
Article
Research on Path Planning for Mobile Robot Using the Enhanced Artificial Lemming Algorithm
by Pengju Qu, Xiaohui Song and Zhijin Zhou
Mathematics 2025, 13(21), 3533; https://doi.org/10.3390/math13213533 - 4 Nov 2025
Cited by 6 | Viewed by 1368
Abstract
To address the key challenges in shortest path planning for known static obstacle maps—such as the tendency to converge to local optima in U-shaped/narrow obstacle regions, unbalanced computational efficiency, and suboptimal path quality—this paper presents an enhanced Artificial Lemming Algorithm (DMSALAs). The algorithm [...] Read more.
To address the key challenges in shortest path planning for known static obstacle maps—such as the tendency to converge to local optima in U-shaped/narrow obstacle regions, unbalanced computational efficiency, and suboptimal path quality—this paper presents an enhanced Artificial Lemming Algorithm (DMSALAs). The algorithm integrates a dynamic adaptive mechanism, a hybrid Nelder–Mead method, and a localized perturbation strategy to improve the search performance of ALAs. To validate DMSALAs efficacy, we conducted ablation studies and performance comparisons on the IEEE CEC 2017 and CEC 2022 benchmark suites. Furthermore, we evaluated the algorithm in mobile robot path planning scenarios, including simulated grid maps (10 × 10, 20 × 20, 30 × 30, 40 × 40) and a real-world experimental environment built by our team. These experiments confirm that DMSALAs effectively balance optimization accuracy and practical applicability in path planning problems. Full article
Show Figures

Figure 1

16 pages, 2114 KB  
Article
The Design Optimization of a Harmonic-Excited Synchronous Machine Operating in the Field-Weakening Region
by Vladimir Prakht, Vladimir Dmitrievskii, Vadim Kazakbaev, Eduard Valeev and Victor Goman
World Electr. Veh. J. 2025, 16(11), 599; https://doi.org/10.3390/wevj16110599 - 29 Oct 2025
Viewed by 907
Abstract
In this paper, the optimization of a harmonic-excited synchronous machine (HESM) is carried out. A two-phase harmonic exciter winding of the HESM provides brushless excitation and sufficient starting torque at any rotor position. The HESM under consideration is intended to be used for [...] Read more.
In this paper, the optimization of a harmonic-excited synchronous machine (HESM) is carried out. A two-phase harmonic exciter winding of the HESM provides brushless excitation and sufficient starting torque at any rotor position. The HESM under consideration is intended to be used for applications requiring speed control, especially in the field-weakening region. The novelty of the proposed approach is that a two-level optimization based on a two-stage model is used to reduce the computational burden. It includes a finite-element model that takes into account only the fundamental current harmonic (basic model). Using the output of the basic model, a reduced-order model (ROM) is parametrized. The ROM considers pulse-width-modulated components of the inverter output current, zero-sequence current injected into the stator winding, and harmonic excitation winding currents. A two-level optimization technique is developed based on the Nelder–Mead method, taking into account the significantly different computational complexity of the basic and reduced-order models. Optimization is performed considering two operating points: base and maximum speed. The results show that an optimized design provides significantly higher efficiency and reduced inverter power requirements. This allows the use of more compact and cheaper power switches. Therefore, the advantage of the presented approach lies in the computationally effective optimization of HESMs (optimization time is reduced by approximately three orders of magnitude compared to calculations using FEA alone), which enhances HESMs’ performance in various applications. Full article
Show Figures

Figure 1

11 pages, 9295 KB  
Article
Berlage Oscillator as a Mathematical Model of High-Frequency Geoacoustic Emission with One Dislocation Source
by Darya Sergienko and Roman Parovik
Acoustics 2025, 7(4), 65; https://doi.org/10.3390/acoustics7040065 - 14 Oct 2025
Viewed by 860
Abstract
A mathematical model of high-frequency geoacoustic emission for a single dislocation radiation source is suggested in the papper. The mathematical model is a linear Berlage oscillator with non-constant coefficients whose solution is the Berlage function momentum. Further, the values of the parameters of [...] Read more.
A mathematical model of high-frequency geoacoustic emission for a single dislocation radiation source is suggested in the papper. The mathematical model is a linear Berlage oscillator with non-constant coefficients whose solution is the Berlage function momentum. Further, the values of the parameters of the Berlage pulse are specified using experimental data. For this purpose, the problem of multidimensional optimization is solved, which consists of two stages: global optimization using the differential evolution method and local optimization according to the Nelder-Mead method. Statistics are given to confirm the correctness of the obtained results: standard error and coefficient of determination. It is shown that two-stage multivariate optimization makes it possible to refine the parameters of the Berlage pulse with a sufficiently high accuracy to describe high-frequency geoacoustic emission. Full article
Show Figures

Figure 1

32 pages, 12099 KB  
Article
Hardware–Software System for Biomass Slow Pyrolysis: Characterization of Solid Yield via Optimization Algorithms
by Ismael Urbina-Salas, David Granados-Lieberman, Juan Pablo Amezquita-Sanchez, Martin Valtierra-Rodriguez and David Aaron Rodriguez-Alejandro
Computers 2025, 14(10), 426; https://doi.org/10.3390/computers14100426 - 5 Oct 2025
Viewed by 1158
Abstract
Biofuels represent a sustainable alternative that supports global energy development without compromising environmental balance. This work introduces a novel hardware–software platform for the experimental characterization of biomass solid yield during the slow pyrolysis process, integrating physical experimentation with advanced computational modeling. The hardware [...] Read more.
Biofuels represent a sustainable alternative that supports global energy development without compromising environmental balance. This work introduces a novel hardware–software platform for the experimental characterization of biomass solid yield during the slow pyrolysis process, integrating physical experimentation with advanced computational modeling. The hardware consists of a custom-designed pyrolizer equipped with temperature and weight sensors, a dedicated control unit, and a user-friendly interface. On the software side, a two-step kinetic model was implemented and coupled with three optimization algorithms, i.e., Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Nelder–Mead (N-M), to estimate the Arrhenius kinetic parameters governing biomass degradation. Slow pyrolysis experiments were performed on wheat straw (WS), pruning waste (PW), and biosolids (BS) at a heating rate of 20 °C/min within 250–500 °C, with a 120 min residence time favoring biochar production. The comparative analysis shows that the N-M method achieved the highest accuracy (100% fit in estimating solid yield), with a convergence time of 4.282 min, while GA converged faster (1.675 min), with a fit of 99.972%, and PSO had the slowest convergence time at 6.409 min and a fit of 99.943%. These results highlight both the versatility of the system and the potential of optimization techniques to provide accurate predictive models of biomass decomposition as a function of time and temperature. Overall, the main contributions of this work are the development of a low-cost, custom MATLAB-based experimental platform and the tailored implementation of optimization algorithms for kinetic parameter estimation across different biomasses, together providing a robust framework for biomass pyrolysis characterization. Full article
Show Figures

Figure 1

Back to TopTop