[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
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
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (1,419)

Search Parameters:
Keywords = finite-time control

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
29 pages, 10206 KiB  
Article
Finite-Time Control for Satellite Formation Reconfiguration and Maintenance in LEO: A Nonlinear Lyapunov-Based SDDRE Approach
by Majid Bakhtiari, Amirhossein Panahyazdan and Ehsan Abbasali
Aerospace 2025, 12(3), 201; https://doi.org/10.3390/aerospace12030201 - 28 Feb 2025
Abstract
This paper introduces a nonlinear Lyapunov-based Finite-Time State-Dependent Differential Riccati Equation (FT-SDDRE) control scheme, considering actuator saturation constraints and ensuring that the control system operates within safe operational limits designed for satellite reconfiguration and formation-keeping in low Earth orbit (LEO) missions. This control [...] Read more.
This paper introduces a nonlinear Lyapunov-based Finite-Time State-Dependent Differential Riccati Equation (FT-SDDRE) control scheme, considering actuator saturation constraints and ensuring that the control system operates within safe operational limits designed for satellite reconfiguration and formation-keeping in low Earth orbit (LEO) missions. This control approach addresses the challenges of reaching the relative position and velocity vectors within a defined timeframe amid various orbital perturbations. The proposed approach guarantees precise formation control by utilizing a high-fidelity relative motion model that incorporates all zonal harmonics and atmospheric drag, which are the primary environmental disturbances in LEO. Additionally, the article presents an optimization methodology to determine the most efficient State-Dependent Coefficient (SDC) form regarding fuel consumption. This optimization process minimizes energy usage through a hybrid genetic algorithm and simulated annealing (HGASA), resulting in improved performance. In addition, this paper includes a sensitivity analysis to identify the optimized SDC parameterization for different satellite reconfiguration maneuvers. These maneuvers encompass radial, along-track, and cross-track adjustments, each with varying baseline distances. The analysis provides insights into how different parameterizations affect reconfiguration performance, ensuring precise and efficient control for each type of maneuver. The finite-time controller proposed here is benchmarked against other forms of SDRE controllers, showing reduced error margins. To further assess the control system’s effectiveness, an input saturation constraint is integrated, ensuring that the control system operates within safe operational limits, ultimately leading to the successful execution of the mission. Full article
(This article belongs to the Section Astronautics & Space Science)
Show Figures

Figure 1

Figure 1
<p>Schematic diagram of ECI and LVLH frames used in relative motion analysis.</p>
Full article ">Figure 2
<p>Schematic diagram of the deputy satellite relative to the target satellite.</p>
Full article ">Figure 3
<p>The 3D sketch of deputy satellite trajectory in LVLH frame.</p>
Full article ">Figure 4
<p>The introduced model’s position accuracy compared to the ERM Model.</p>
Full article ">Figure 5
<p>The introduced model’s velocity accuracy compared to the ERM Model.</p>
Full article ">Figure 6
<p>The variation in the optimal values of <math display="inline"><semantics> <mrow> <mi>β</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>γ</mi> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>δ</mi> </mrow> </semantics></math> in the scenarios with radial motion only (<b>a</b>), along-track motion only (<b>b</b>), and cross-track motion only (<b>c</b>).</p>
Full article ">Figure 7
<p>Block diagram of the satellite formation flying control and optimization process.</p>
Full article ">Figure 8
<p>Uncontrolled motion of deputy satellites with respect to the target satellite.</p>
Full article ">Figure 9
<p>The process of cost reduction in optimization through the HGASA.</p>
Full article ">Figure 10
<p>The absolute sum of the magnitudes of the control forces for four deputy satellites using three types of SDC and the optimized form.</p>
Full article ">Figure 11
<p>The 3D sketch of deputy satellites’ formation reconfiguration and maintenance trajectory utilizing the Lyapunov-based FT-SDDRE method (In this figure, The filled circles indicate the deputy satellites’ initial positions, while the hollow circles represent their positions at the end of the mission).</p>
Full article ">Figure 12
<p>The 2D sketch of deputy satellites’ formation reconfiguration and maintenance trajectory utilizing the Lyapunov-based FT-SDDRE method in different perspectives (In this figure, The filled circles indicate the deputy satellites’ initial positions, while the hollow circles represent their positions at the end of the mission).</p>
Full article ">Figure 13
<p>The position tracking of deputy satellites utilizing the Lyapunov-based FT-SDDRE method.</p>
Full article ">Figure 14
<p>The velocity tracking of deputy satellites utilizing the Lyapunov-based SDDRE method.</p>
Full article ">Figure 15
<p>The relative distance among deputy satellites in the projected circular orbit formation after utilizing the Lyapunov-based FT-SDDRE method.</p>
Full article ">Figure 16
<p>The relative distance among deputy satellites in <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>−</mo> <mi>z</mi> </mrow> </semantics></math> plane in the projected circular orbit formation after utilizing the Lyapunov-based FT-SDDRE method.</p>
Full article ">Figure 17
<p>The absolute position tracking error of the Lyapunov-based FT-SDDRE method compared to the classical SDRE and finite-time STM approach by deputy satellites.</p>
Full article ">Figure 18
<p>The absolute velocity tracking error of the Lyapunov-based FT-SDDRE method compared to the classical SDRE and finite-time STM approach by deputy satellites.</p>
Full article ">Figure 19
<p>The control force generated by Lyapunov-based FT-SDDRE controller for deputy satellites.</p>
Full article ">
34 pages, 640 KiB  
Article
Brute Force Computations and Reference Solutions
by Mihail Mihaylov Konstantinov, Petko Hristov Petkov and Ekaterina Borisova Madamlieva
Foundations 2025, 5(1), 7; https://doi.org/10.3390/foundations5010007 - 26 Feb 2025
Viewed by 88
Abstract
In this paper, we consider the application of brute force computational techniques (BFCTs) for solving computational problems in mathematical analysis and matrix algebra in a floating-point computing environment. These techniques include, among others, simple matrix computations and the analysis of graphs of functions. [...] Read more.
In this paper, we consider the application of brute force computational techniques (BFCTs) for solving computational problems in mathematical analysis and matrix algebra in a floating-point computing environment. These techniques include, among others, simple matrix computations and the analysis of graphs of functions. Since BFCTs are based on matrix calculations, the program system MATLAB® is suitable for their computer realization. The computations in this paper are completed in double precision floating-point arithmetic, obeying the 2019 IEEE Standard for binary floating-point calculations. One of the aims of this paper is to analyze cases where popular algorithms and software fail to produce correct answers, failing to alert the user. In real-time control applications, this may have catastrophic consequences with heavy material damage and human casualties. It is known, or suspected, that a number of man-made catastrophes such as the Dharhan accident (1991), Ariane 5 launch failure (1996), Boeing 737 Max tragedies (2018, 2019) and others are due to errors in the computer software and hardware. Another application of BFCTs is finding good initial guesses for known computational algorithms. Sometimes, simple and relatively fast BFCTs are useful tools in solving computational problems correctly and in real time. Among particular problems considered are the genuine addition of machine numbers, numerically stable computations, finding minimums of arrays, the minimization of functions, solving finite equations, integration and differentiation, computing condensed and canonical forms of matrices and clarifying the concepts of the least squares method in the light of the conflict remainders vs. errors. Usually, BFCTs are applied under the user’s supervision, which is not possible in the automatic implementation of computational methods. To implement BFCTs automatically is a challenging problem in the area of artificial intelligence and of mathematical artificial intelligence in particular. BFCTs allow to reveal the underlying arithmetic in the performance of computational algorithms. Last but not least, this paper has tutorial value, as computational algorithms and mathematical software are often taught without considering the properties of computational algorithms and machine arithmetic. Full article
(This article belongs to the Section Mathematical Sciences)
Show Figures

Figure 1

Figure 1
<p>Scaled rounding errors.</p>
Full article ">Figure 2
<p>An oscillating function.</p>
Full article ">Figure 3
<p>Computed first difference of the function <math display="inline"><semantics> <mrow> <mi>f</mi> <mo>(</mo> <mi>x</mi> <mo>)</mo> <mo>=</mo> <mi>x</mi> </mrow> </semantics></math>.</p>
Full article ">
23 pages, 549 KiB  
Article
Dynamic Event-Triggered Sliding Mode Control of Markov Jump Delayed System with Partially Known Transition Probabilities
by Jie Lu, Yang Jia, Xiang Cai, Jinnan Luo and Jiachen Li
Mathematics 2025, 13(5), 750; https://doi.org/10.3390/math13050750 - 25 Feb 2025
Viewed by 161
Abstract
This paper investigates the dynamic event-triggered (ET) sliding mode control (SMC) of Markov jump delayed systems (MJDSs) with partially known transition probabilities. Firstly, a dynamic ET scheme is introduced for the Markov SMC system, and the effect of time delays is considered. In [...] Read more.
This paper investigates the dynamic event-triggered (ET) sliding mode control (SMC) of Markov jump delayed systems (MJDSs) with partially known transition probabilities. Firstly, a dynamic ET scheme is introduced for the Markov SMC system, and the effect of time delays is considered. In addition, the Razumikhin condition is used to deal with the time delay. Moreover, in the case of a Markov jump system with partially known transition probabilities, using the vertex method, weak infinitesimal generator, and Dynkin’s formula, the finite-time boundness (FTB) problem of a class of ET SMC systems with stochastic delay is studied. Finally, a numerical example is given to illustrate the viability of our results. Full article
(This article belongs to the Special Issue Robust Perception and Control in Prognostic Systems)
Show Figures

Figure 1

Figure 1
<p>Control input.</p>
Full article ">Figure 2
<p>Sliding mode variable.</p>
Full article ">Figure 3
<p>Switching signal.</p>
Full article ">Figure 4
<p>Release moments and intervals.</p>
Full article ">Figure 5
<p>Microgrid system composed of three BOOST circuits.</p>
Full article ">Figure 6
<p>Output voltage.</p>
Full article ">Figure 7
<p>Event-triggered signal.</p>
Full article ">
18 pages, 7293 KiB  
Article
Research on BIM-Based Visualization, Simulation, and Early Warning System for Shield Tunnel Construction
by Qian Cheng, Xiangyu Wang, Junbo Sun, Hongyu Zhao and Xianda Liu
Buildings 2025, 15(5), 746; https://doi.org/10.3390/buildings15050746 - 25 Feb 2025
Viewed by 157
Abstract
This study aims to facilitate a comparison between construction monitoring data and simulation results, focusing on the dynamic adjustment of safety monitoring parameters in shield construction. First, a finite element simulation was performed to define a reasonable range for shield parameters based on [...] Read more.
This study aims to facilitate a comparison between construction monitoring data and simulation results, focusing on the dynamic adjustment of safety monitoring parameters in shield construction. First, a finite element simulation was performed to define a reasonable range for shield parameters based on settlement control values, thereby determining the theoretical settlement value. An early warning system was then developed integrating two key factors: theoretical and control settlement values. Finally, Dynamo was used to merge the digital and analog data, enhancing the visual representation of the monitoring information. The findings show that combining simulations with an early warning system effectively addresses the dynamic control challenges of shield construction parameters. Furthermore, integrating digital and analog monitoring significantly improves the efficiency of real-time visualization in monitoring data. This research provides a novel and effective methodology for enhancing shield tunnel construction safety, precision, and efficiency, offering critical insights for large-scale infrastructure projects and contributing to more reliable monitoring systems in complex construction environments. Full article
(This article belongs to the Special Issue Urban Renewal: Protection and Restoration of Existing Buildings)
Show Figures

Figure 1

Figure 1
<p>Revit family parameters.</p>
Full article ">Figure 2
<p>Profile information of three-dimensional geological BIM model.</p>
Full article ">Figure 3
<p>Construction scheme comparison process.</p>
Full article ">Figure 4
<p>Appearance of settlement monitoring points.</p>
Full article ">Figure 5
<p>Relationship between the theoretical settlement values and various warning levels.</p>
Full article ">Figure 6
<p>Loading monitoring information table.</p>
Full article ">Figure 7
<p>Organizing data list.</p>
Full article ">Figure 8
<p>Automatically read the point numbers of settlement monitoring points.</p>
Full article ">Figure 9
<p>Input of monitoring values into Revit.</p>
Full article ">Figure 10
<p>Process of assigning colors to settlement monitoring points in the BIM model.</p>
Full article ">Figure 11
<p>BIM model of settlement monitoring points.</p>
Full article ">Figure 12
<p>Setting parameters for the BIM model family of settlement monitoring points.</p>
Full article ">Figure 13
<p>Finite element model.</p>
Full article ">Figure 14
<p>Surface subsidence curve.</p>
Full article ">Figure 14 Cont.
<p>Surface subsidence curve.</p>
Full article ">Figure 14 Cont.
<p>Surface subsidence curve.</p>
Full article ">Figure 15
<p>Schematic layout of monitoring points.</p>
Full article ">Figure 16
<p>Visualization effect of settlement monitoring.</p>
Full article ">Figure 17
<p>The 3D visual effect of settlement monitoring points.</p>
Full article ">
24 pages, 30044 KiB  
Article
Minimum-Fuel Trajectories and Near-Optimal Explicit Guidance for Pinpoint Landing from Low Lunar Orbit
by Matteo Caruso, Giulio De Angelis, Edoardo Maria Leonardi and Mauro Pontani
Aerospace 2025, 12(3), 183; https://doi.org/10.3390/aerospace12030183 - 25 Feb 2025
Viewed by 141
Abstract
This research addresses minimum-fuel pinpoint lunar landing at the South Pole, focusing on trajectory design and near-optimal guidance aimed at driving a spacecraft from a circular low lunar orbit (LLO) to an instantaneous hovering state above the lunar surface. Orbit dynamics is propagated [...] Read more.
This research addresses minimum-fuel pinpoint lunar landing at the South Pole, focusing on trajectory design and near-optimal guidance aimed at driving a spacecraft from a circular low lunar orbit (LLO) to an instantaneous hovering state above the lunar surface. Orbit dynamics is propagated in a high-fidelity ephemeris-based framework, which employs spherical coordinates as the state variables and includes several harmonics of the selenopotential, as well as third-body gravitational perturbations due to the Earth and Sun. Minimum-fuel two-impulse descent transfers are identified using Lambert problem solutions as initial guesses, followed by refinement in the high-fidelity model, for a range of initial LLO inclinations. Then, a feedback Lambert-based impulsive guidance algorithm is designed and tested through a Monte Carlo campaign to assess the effectiveness under non-nominal conditions related to injection and actuation errors. Because the last braking maneuver is relatively large, a finite-thrust, locally flat, near-optimal guidance is introduced and applied. Simplified dynamics is assumed for the purpose of defining a minimum-time optimal control problem along the last thrust arc. This admits a closed-form solution, which is iteratively used until the desired instantaneous hovering condition is reached. The numerical results in non-nominal flight conditions testify to the effectiveness of the guidance approach at hand in terms of propellant consumption and precision at landing. Full article
(This article belongs to the Special Issue Advances in Lunar Exploration)
Show Figures

Figure 1

Figure 1
<p>Chromatic plot showing the total <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>V</mi> </mrow> </semantics></math> for each combination of initial departure angle and time of flight for a polar LLO. The point of minimum is marked by the red star.</p>
Full article ">Figure 2
<p>Optimal values of <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>V</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <msub> <mi>θ</mi> <msub> <mi>t</mi> <mn>0</mn> </msub> </msub> </semantics></math>, and <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> </mrow> </semantics></math> as functions of LLO inclination.</p>
Full article ">Figure 3
<p>Optimal values of <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>V</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <msub> <mi>θ</mi> <msub> <mi>t</mi> <mn>0</mn> </msub> </msub> </semantics></math>, and <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> </mrow> </semantics></math> as functions of LLO inclination focused on the range <math display="inline"><semantics> <msup> <mn>85</mn> <mo>∘</mo> </msup> </semantics></math> to <math display="inline"><semantics> <msup> <mn>95</mn> <mo>∘</mo> </msup> </semantics></math>.</p>
Full article ">Figure 4
<p>Stream of optimal trajectories from LLO to hovering altitude for various initial inclinations (<math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>0</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> to <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>180</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>), visualized in 3D and projected views.</p>
Full article ">Figure 5
<p>Misaligned <math display="inline"><semantics> <mrow> <mo>Δ</mo> <msubsup> <mover accent="true"> <mi mathvariant="bold-italic">v</mi> <mo stretchy="false">→</mo> </mover> <mi>i</mi> <mo>′</mo> </msubsup> </mrow> </semantics></math> with azimuthal (<math display="inline"><semantics> <mi>β</mi> </semantics></math>) and co-elevation (<math display="inline"><semantics> <mi>γ</mi> </semantics></math>) angles relative to nominal <math display="inline"><semantics> <mrow> <mo>Δ</mo> <msub> <mover accent="true"> <mi mathvariant="bold-italic">v</mi> <mo stretchy="false">→</mo> </mover> <mi>i</mi> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Stream of transfer trajectories (<b>left</b>) and arrival point distribution (<b>right</b>) from Monte Carlo simulations for <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> of the departure LLO.</p>
Full article ">Figure 7
<p>Altitude time histories from Monte Carlo simulations for <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>90</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> of the departure LLO.</p>
Full article ">Figure 8
<p>Stream of transfer trajectories (<b>left</b>) and arrival point distribution (<b>right</b>) from Monte Carlo simulations for <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>80</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> of the departure LLO.</p>
Full article ">Figure 9
<p>Altitude time histories from Monte Carlo simulations for <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>80</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> of the departure LLO.</p>
Full article ">Figure 10
<p>Stream of transfer trajectories (<b>left</b>) and arrival point distribution (<b>right</b>) from Monte Carlo simulations for <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>70</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> of the departure LLO.</p>
Full article ">Figure 11
<p>Altitude time histories from Monte Carlo simulations for <math display="inline"><semantics> <mrow> <mi>i</mi> <mo>=</mo> <msup> <mn>70</mn> <mo>∘</mo> </msup> </mrow> </semantics></math> of the departure LLO.</p>
Full article ">Figure 12
<p>Altitude time histories from Monte Carlo simulations for polar LLO, with LF-NOG.</p>
Full article ">Figure 13
<p>Arrival point distribution from Monte Carlo simulations for polar LLO, with LF-NOG.</p>
Full article ">Figure 14
<p>Radial velocity time histories from Monte Carlo simulations for polar LLO, with LF-NOG.</p>
Full article ">Figure 15
<p>Transverse velocity time histories from Monte Carlo simulations for polar LLO, with LF-NOG.</p>
Full article ">Figure 16
<p>Normal velocity time histories from Monte Carlo simulations for polar LLO, with LF-NOG.</p>
Full article ">
12 pages, 3571 KiB  
Article
Frequency-Based Finite Element Updating Method for Physics-Based Digital Twin
by Youngjae Jeon, Geomji Choi, Kwanghyun Ahn, Kang-Heon Lee and Seongmin Chang
Mathematics 2025, 13(5), 738; https://doi.org/10.3390/math13050738 - 24 Feb 2025
Viewed by 232
Abstract
This study proposes a frequency-based finite element updating method for an effective physics-based digital twin (DT). One approach to constructing a physics-based DT is to develop a mechanics-based mathematical model that accurately simulates the behavior of an actual structure. The proposed method utilizes [...] Read more.
This study proposes a frequency-based finite element updating method for an effective physics-based digital twin (DT). One approach to constructing a physics-based DT is to develop a mechanics-based mathematical model that accurately simulates the behavior of an actual structure. The proposed method utilizes finite element updating, adjusting model parameters to improve model accuracy. Unlike simple modal analysis, which focuses on vibration characteristics, this method recognizes that accurate dynamic transient-based vibration analysis requires considering the damping effect, as well as mass and stiffness, during the updating process. Moreover, a frequency-based analysis is employed instead of the computationally expensive time-based analysis for more efficient dynamic modeling. By transforming data into the frequency domain, the method efficiently represents dynamic behavior within relevant frequency ranges. We further enhance the computational efficiency using the model reduction technique. To validate the method’s accuracy and efficiency, we compare the analysis results and computation time using a numerical example of the control rod drive mechanism. The proposed method shows significantly reduced computation time, by a factor of 8.9 compared to conventional time-based methods, while preserving high accuracy. Therefore, the proposed method can effectively support the development of physics-based DTs. Full article
Show Figures

Figure 1

Figure 1
<p>Comparison of conventional method and proposed method.</p>
Full article ">Figure 2
<p>Effect of damping on the accuracy of the result: (<b>a</b>) magnitude of updating results including and excluding damping; (<b>b</b>) absolute error.</p>
Full article ">Figure 3
<p>Strategy for frequency-based finite element updating method.</p>
Full article ">Figure 4
<p>Numerical model of CRDM.</p>
Full article ">Figure 5
<p>Input acceleration time history applied to x, y, z axes for dynamic analysis.</p>
Full article ">Figure 6
<p>Input acceleration data transformed into frequency domain for dynamic analysis.</p>
Full article ">Figure 7
<p>Verification of accuracy using frequency-based method and time-based method: (<b>a</b>) magnitude of updating results including and excluding damping; (<b>b</b>) absolute error.</p>
Full article ">Figure 8
<p>Comparison of calculation time and number of iterations using frequency-based method and time-based method.</p>
Full article ">
23 pages, 8306 KiB  
Article
Finite Time ESO-Based Line-of-Sight Following Method with Multi-Objective Path Planning Applied on an Autonomous Marine Surface Vehicle
by Bingheng Han and Jinhong Sun
Electronics 2025, 14(5), 896; https://doi.org/10.3390/electronics14050896 - 24 Feb 2025
Viewed by 133
Abstract
The multi-objective path planning and robust continuous path-following method for the autonomous marine surface vehicle (AMSV) is employed. By incorporating the position and direction constraints into the optimization cost function, the spiral path planner obtains a continuous path with smooth path tangency and [...] Read more.
The multi-objective path planning and robust continuous path-following method for the autonomous marine surface vehicle (AMSV) is employed. By incorporating the position and direction constraints into the optimization cost function, the spiral path planner obtains a continuous path with smooth path tangency and curvature and ensures strict adherence to the desired multi-objective points. An improved A* and optimization algorithm are combined with the global path planning to avoid obstacles in real-time. For the path-following controller, the unknown sideslip angle and uncertainties are added to build the system model, based on which observation technique is adopted to estimate all the uncertainties online. Based on the kinematic system, a finite time extended state observer (ESO) is put forward to estimate the sideslip angle accurately. The nonlinear line-of-sight (LOS) guidance scheme is designed for the model, effectively compensating for the observed values and achieving convergence in a finite time. The finite-time ESO is adopted to estimate the uncertainty for the surge and heading controller design, and the terminal sliding mode technique is introduced to achieve the final finite-time convergence. Through extensive experiments, the proposed approach demonstrates its effectiveness, feasibility, and the advantage of fast convergence and accurate control. Full article
Show Figures

Figure 1

Figure 1
<p>The framework of the whole ASMV system, (<b>a</b>) global path planner (<b>b</b>) local path planner (<b>c</b>) LOS guidance geometry (<b>d</b>) finite-time LOS guidance (<b>e</b>) robust controller.</p>
Full article ">Figure 2
<p>Structure of the proposed methodology.</p>
Full article ">Figure 3
<p>The demonstration of the wave interference.</p>
Full article ">Figure 4
<p>The change curve of the reference path (<b>a</b>) Tangent path angle (<b>b</b>) curvature.</p>
Full article ">Figure 5
<p>The external disturbance.</p>
Full article ">Figure 6
<p>The vessel motion estimation.</p>
Full article ">Figure 7
<p>Comparison results of the path-following control.</p>
Full article ">Figure 8
<p>Control performance.</p>
Full article ">Figure 9
<p>The control performance with vessel mass variation.</p>
Full article ">Figure 10
<p>Control results of the obstacle avoidance.</p>
Full article ">Figure 11
<p>Testing ocean maps of common navigation scenarios: (<b>a</b>) coast (<b>b</b>) island (<b>c</b>) reef.</p>
Full article ">
15 pages, 7444 KiB  
Article
Soft Robot Workspace Estimation via Finite Element Analysis and Machine Learning
by Getachew Ambaye, Enkhsaikhan Boldsaikhan and Krishna Krishnan
Actuators 2025, 14(3), 110; https://doi.org/10.3390/act14030110 - 23 Feb 2025
Viewed by 341
Abstract
Soft robots with compliant bodies offer safe human–robot interaction as well as adaptability to unstructured dynamic environments. However, the nonlinear dynamics of a soft robot with infinite motion freedom pose various challenges to operation and control engineering. This research explores the motion of [...] Read more.
Soft robots with compliant bodies offer safe human–robot interaction as well as adaptability to unstructured dynamic environments. However, the nonlinear dynamics of a soft robot with infinite motion freedom pose various challenges to operation and control engineering. This research explores the motion of a pneumatic soft robot under diverse loading conditions by conducting finite element analysis (FEA) and using machine learning. The pneumatic soft robot consists of two parallel hyper-elastic tubular chambers that convert pneumatic pressure inputs into soft robot motion to mimic an elephant trunk and its motion. The body of each pneumatic chamber consists of a series of bellows to effectively facilitate the expansion, contraction, and bending of the body. The first chamber spans the entire length of the soft robot’s body, and the second chamber spans half of it. This unique asymmetric design enables the soft robot to bend and curl in various ways. Machine learning is used to establish a forward kinematic relationship between the pressure inputs and the motion responses of the soft robot using data from FEA. Accordingly, this research employs an artificial neural network that is trained on FEA data to estimate the reachable workspace of the soft robot for given pressure inputs. The trained neural network demonstrates promising estimation accuracy with an R-squared value of 0.99 and a root mean square error of 0.783. The workspaces of asymmetric double-chamber and single-chamber soft robots were compared, revealing that the double-chamber robot offers approximately 185 times more reachable workspace than the single-chamber soft robot. Full article
(This article belongs to the Special Issue Bio-Inspired Soft Robotics)
Show Figures

Figure 1

Figure 1
<p>The soft actuator inspired by the elephant trunk [<a href="#B6-actuators-14-00110" class="html-bibr">6</a>].</p>
Full article ">Figure 2
<p>Overall approach.</p>
Full article ">Figure 3
<p>Soft robot model. The measurement unit is mm.</p>
Full article ">Figure 4
<p>Soft robot base and tip and two pneumatic chambers.</p>
Full article ">Figure 5
<p>Analysis setup: (<b>a</b>) constraints for gravitational load analysis, (<b>b</b>) eccentricity, and (<b>c</b>) surface contacts.</p>
Full article ">Figure 6
<p>The effects of gravity on bending displacement and stress.</p>
Full article ">Figure 7
<p>Neural network architecture.</p>
Full article ">Figure 8
<p>Mean square errors vs. training epochs.</p>
Full article ">Figure 9
<p>Regression plots of neural network accuracy.</p>
Full article ">Figure 10
<p>Residual analysis of displacement responses: without noise (<b>left</b>) and with 0.1% Gaussian noise (<b>right</b>).</p>
Full article ">Figure 11
<p>Soft robot actuation for selected loading cases in <a href="#actuators-14-00110-t002" class="html-table">Table 2</a>.</p>
Full article ">Figure 12
<p>Soft robot tip paths for loading cases in <a href="#actuators-14-00110-t002" class="html-table">Table 2</a>.</p>
Full article ">Figure 13
<p>Soft robot tip paths estimated by trained NN for loading cases in <a href="#actuators-14-00110-t002" class="html-table">Table 2</a>.</p>
Full article ">Figure 14
<p>Estimated workspace of soft robot tip for pressure inputs between 600 kPa and 700 kPa: top (<b>a</b>), front (<b>b</b>), side (<b>c</b>), and isometric (<b>d</b>) views of workspace in reference frame R1.</p>
Full article ">Figure 15
<p>Workspace of the single-chamber soft robot tip for pressure inputs between 0 and 700 kPa: top (<b>a</b>), front (<b>b</b>), side (<b>c</b>), and isometric (<b>d</b>) views.</p>
Full article ">Figure 16
<p>Comparisons between asymmetric and single-chamber pneumatic soft robots.</p>
Full article ">
34 pages, 2854 KiB  
Article
On the Numerical Integration of the Fokker–Planck Equation Driven by a Mechanical Force and the Bismut–Elworthy–Li Formula
by Julia Sanders and Paolo Muratore-Ginanneschi
Entropy 2025, 27(3), 218; https://doi.org/10.3390/e27030218 - 20 Feb 2025
Viewed by 215
Abstract
Optimal control theory aims to find an optimal protocol to steer a system between assigned boundary conditions while minimizing a given cost functional in finite time. Equations arising from these types of problems are often non-linear and difficult to solve numerically. In this [...] Read more.
Optimal control theory aims to find an optimal protocol to steer a system between assigned boundary conditions while minimizing a given cost functional in finite time. Equations arising from these types of problems are often non-linear and difficult to solve numerically. In this article, we describe numerical methods of integration for two partial differential equations that commonly arise in optimal control theory: the Fokker–Planck equation driven by a mechanical potential for which we use the Girsanov theorem; and the Hamilton–Jacobi–Bellman, or dynamic programming, equation for which we find the gradient of its solution using the Bismut–Elworthy–Li formula. The computation of the gradient is necessary to specify the optimal protocol. Finally, we give an example application of the numerical techniques to solving an optimal control problem without spacial discretization using machine learning. Full article
(This article belongs to the Special Issue Control of Driven Stochastic Systems: From Shortcuts to Optimality)
Show Figures

Figure 1

Figure 1
<p>Solution of a Fokker–Planck equation driven by a mechanical potential (<a href="#FD23-entropy-27-00218" class="html-disp-formula">23</a>) computed using Monte Carlo integration via Girsanov formula (dashed blue line). We use <math display="inline"><semantics> <mrow> <msub> <mo>∂</mo> <mi>q</mi> </msub> <mi>U</mi> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mn>2</mn> <mo> </mo> <msup> <mi>q</mi> <mn>3</mn> </msup> </mrow> </semantics></math>. The initial condition is <math display="inline"><semantics> <mrow> <msub> <mi mathvariant="normal">p</mi> <msub> <mi>t</mi> <mi>ι</mi> </msub> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>1</mn> <msqrt> <mrow> <mn>2</mn> <mi>π</mi> </mrow> </msqrt> </mfrac> </mstyle> <mo form="prefix">exp</mo> <mrow> <mo>(</mo> <mo>−</mo> <msup> <mi>q</mi> <mn>2</mn> </msup> <mo>/</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </semantics></math> at <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. The Girsanov method is compared with an implementation of the “proximal gradient descent” method described in [<a href="#B42-entropy-27-00218" class="html-bibr">42</a>], shown in orange. For the proximal gradient descent, we use <math display="inline"><semantics> <msup> <mn>10</mn> <mn>4</mn> </msup> </semantics></math> samples from the initial distribution and <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.05</mn> </mrow> </semantics></math> as the regularization parameter, see [<a href="#B42-entropy-27-00218" class="html-bibr">42</a>]. Both methods simulate trajectories of the auxiliary stochastic process (<a href="#FD11-entropy-27-00218" class="html-disp-formula">11</a>) by the Euler–Maruyama scheme with step size <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>3</mn> </mrow> </msup> </mrow> </semantics></math>. For the Girsanov theorem approach, we evolve <math display="inline"><semantics> <msup> <mn>10</mn> <mn>3</mn> </msup> </semantics></math> trajectories from <math display="inline"><semantics> <msup> <mn>10</mn> <mn>4</mn> </msup> </semantics></math> initial points in the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>6</mn> <mo>,</mo> <mn>6</mn> <mo>]</mo> </mrow> </semantics></math>. Resulting distributions are smoothed by convolution with a box filter. We use <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mi>β</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>. The expected equilibrium state of the distribution is shown by the shaded area in the final panel at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>. In our implementation, the Monte Carlo method of integration is roughly three orders of magnitude faster than the proximal gradient descent. Accompanying code for all figures can be found in the link in the Data Availability statement.</p>
Full article ">Figure 2
<p>Solution of a Fokker–Planck driven by a time-dependent mechanical potential computed using Monte Carlo integration via Girsanov formula (dashed blue line). The optimal protocol <span class="html-italic">U</span> and reference solution (orange line) is computed using an iterative method [<a href="#B41-entropy-27-00218" class="html-bibr">41</a>]. For the Girsanov theorem approach, we evolve <span class="html-italic">M</span> = 10,000 trajectories from 500 initial points in the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>3</mn> <mo>,</mo> <mn>3</mn> <mo>]</mo> </mrow> </semantics></math> with a time step of <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <mn>0.005</mn> </mrow> </semantics></math> by the Euler–Maruyama scheme. The reference solution uses the iteration method of [<a href="#B41-entropy-27-00218" class="html-bibr">41</a>], where integration of the Equations (<a href="#FD21a-entropy-27-00218" class="html-disp-formula">21a</a>) and (<a href="#FD21b-entropy-27-00218" class="html-disp-formula">21b</a>) is also computed as a numerical average of Monte Carlo sampled trajectories, using 5000 initial points from the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>6</mn> <mo>,</mo> <mn>6</mn> <mo>]</mo> </mrow> </semantics></math>. Ten total iterations are performed. Final distributions are normalized and smoothed by a convolution with a box filter. We use <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>f</mi> </msub> <mo>=</mo> <mn>0.2</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mi>β</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>. Assigned boundary conditions (shaded blue area in first and final panels) are given by (<a href="#FD17a-entropy-27-00218" class="html-disp-formula">17a</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>U</mi> <mi>ι</mi> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> </mstyle> <msup> <mrow> <mo>(</mo> <mi>q</mi> <mo>−</mo> <mn>1</mn> <mo>)</mo> </mrow> <mn>4</mn> </msup> </mrow> </semantics></math> and (<a href="#FD17b-entropy-27-00218" class="html-disp-formula">17b</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>U</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> </mstyle> <msup> <mrow> <mo>(</mo> <msup> <mi>q</mi> <mn>2</mn> </msup> <mo>−</mo> <mn>1</mn> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Solution of a Fokker–Planck equation driven by a non-linear mechanical underdamped diffusion computed by Monte Carlo integration. Panels (<b>a</b>–<b>f</b>) show the following: Center: the joint distribution for the momentum and position; Top: the marginal distribution of the momentum; Left: marginal distribution of the position. The optimal protocol <span class="html-italic">U</span> used in the integration and the reference solutions for the marginal densities (orange) are estimated from a perturbative expansion around the overdamped limit [<a href="#B25-entropy-27-00218" class="html-bibr">25</a>]. For the integration, we evolve <span class="html-italic">M</span> = 10,000 trajectories from a set of 2601 equally spaced points from the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>5</mn> <mo>,</mo> <mn>5</mn> <mo>]</mo> <mo>×</mo> <mo>[</mo> <mo>−</mo> <mn>5</mn> <mo>,</mo> <mn>5</mn> <mo>]</mo> </mrow> </semantics></math>. We use a time step size <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <mn>0.025</mn> </mrow> </semantics></math> and integrate over trajectories of (<a href="#FD23-entropy-27-00218" class="html-disp-formula">23</a>) using an Euler–Maruyama discretization. We use <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>f</mi> </msub> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>25</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>. The assigned initial condition is given by (<a href="#FD33a-entropy-27-00218" class="html-disp-formula">33a</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>U</mi> <mi>ι</mi> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> </mstyle> <msup> <mrow> <mo>(</mo> <mi>q</mi> <mo>−</mo> <mn>1</mn> <mo>)</mo> </mrow> <mn>4</mn> </msup> </mrow> </semantics></math> and final condition (<a href="#FD33b-entropy-27-00218" class="html-disp-formula">33b</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>U</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <mstyle scriptlevel="0" displaystyle="true"> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> </mstyle> <msup> <mrow> <mo>(</mo> <msup> <mi>q</mi> <mn>2</mn> </msup> <mo>−</mo> <mn>1</mn> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </semantics></math>, indicated by contour lines in the initial and final panels, respectively.</p>
Full article ">Figure 4
<p>Weighted errors and variances at time <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math> (Panel (f)) for the example in <a href="#entropy-27-00218-f003" class="html-fig">Figure 3</a> as a function of the number of sampled trajectories <span class="html-italic">M</span> of the SDE (<a href="#FD22-entropy-27-00218" class="html-disp-formula">22</a>) with a fixed time step. The errors and variances are computed over 100 sample points <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>=</mo> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>∈</mo> <mrow> <mo>[</mo> <mo>−</mo> <mn>3</mn> <mo>,</mo> <mn>3</mn> <mo>]</mo> </mrow> <mo>×</mo> <mrow> <mo>[</mo> <mo>−</mo> <mn>3</mn> <mo>,</mo> <mn>3</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>. In Panel (<b>a</b>), the output of Algorithm 2 for each point <math display="inline"><semantics> <msub> <mi>x</mi> <mi>i</mi> </msub> </semantics></math> is compared to the assigned final distribution (<a href="#FD33b-entropy-27-00218" class="html-disp-formula">33b</a>). The <math display="inline"><semantics> <msub> <mi>L</mi> <mn>1</mn> </msub> </semantics></math> (blue) is computed as <math display="inline"><semantics> <mrow> <mstyle displaystyle="true"> <munder> <mo>∑</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> </munder> </mstyle> <mo> </mo> <msub> <mi>P</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo> </mo> <mrow> <mo stretchy="false">|</mo> <msubsup> <mover accent="true"> <mi>P</mi> <mo stretchy="false">^</mo> </mover> <mi>f</mi> <mrow> <mo>(</mo> <mi>M</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>−</mo> <msub> <mi>P</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo stretchy="false">|</mo> </mrow> </mrow> </semantics></math>; <math display="inline"><semantics> <msub> <mi>L</mi> <mn>2</mn> </msub> </semantics></math> (orange) is <math display="inline"><semantics> <mrow> <mo stretchy="false">(</mo> <mstyle displaystyle="true"> <munder> <mo>∑</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> </munder> </mstyle> <mo> </mo> <msub> <mi>P</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo> </mo> <msup> <mrow> <mo stretchy="false">|</mo> <msubsup> <mover accent="true"> <mi>P</mi> <mo stretchy="false">^</mo> </mover> <mi>f</mi> <mrow> <mo>(</mo> <mi>M</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>−</mo> <msub> <mi>P</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo stretchy="false">|</mo> </mrow> <mn>2</mn> </msup> <msup> <mo stretchy="false">)</mo> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <msub> <mi mathvariant="italic">L</mi> <mn>∞</mn> </msub> </semantics></math> (green) is <math display="inline"><semantics> <msup> <mrow> <munder> <mi>max</mi> <mrow> <msub> <mi>x</mi> <mn>i</mn> </msub> </mrow> </munder> <mo stretchy="false">|</mo> <msubsup> <mover accent="true"> <mi>P</mi> <mo stretchy="false">^</mo> </mover> <mi>f</mi> <mrow> <mo>(</mo> <mi>M</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>−</mo> <msub> <mi>P</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo stretchy="false">|</mo> </mrow> <mn>2</mn> </msup> </semantics></math> where <math display="inline"><semantics> <mrow> <msubsup> <mover accent="true"> <mi>P</mi> <mo stretchy="false">^</mo> </mover> <mi>f</mi> <mrow> <mo>(</mo> <mi>M</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math> in all cases indicates the value found using <math display="inline"><semantics> <mi>M</mi> </semantics></math> sample trajectories in Algorithm 2. Panel (<b>b</b>) shows the largest (max, blue line) variance across all sample points as a function of the number of sampled trajectories <math display="inline"><semantics> <mi>M</mi> </semantics></math>. All other parameters are as in <a href="#entropy-27-00218-f003" class="html-fig">Figure 3</a>.</p>
Full article ">Figure 5
<p>Gradient of the value function, i.e., the gradient of the solution to the Hamilton–Jacobi–Bellman Equation (<a href="#FD18b-entropy-27-00218" class="html-disp-formula">18b</a>), computed using the Bismut–Elworthy–Li formula (BEL) (dashed blue line) described in Algorithm 3. We sample 10,000 trajectories of the stochastic process (<a href="#FD3-entropy-27-00218" class="html-disp-formula">3</a>) from 500 initial points in the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>3</mn> <mo>,</mo> <mn>3</mn> <mo>]</mo> </mrow> </semantics></math>, discretized by the Euler–Maruyama scheme with time step size <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <mn>0.005</mn> </mrow> </semantics></math>, and compute the BEL weights along the trajectories. The optimal control protocol <span class="html-italic">U</span> and reference solution (orange) used is computed by the iteration as in <a href="#entropy-27-00218-f002" class="html-fig">Figure 2</a>. Numerical parameters and boundary conditions are as in <a href="#entropy-27-00218-f002" class="html-fig">Figure 2</a>. We use <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>f</mi> </msub> <mo>=</mo> <mn>0.2</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mi>β</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>The gradient of the optimal control potential minimizing the Kullback–Leibler divergence (<a href="#FD16-entropy-27-00218" class="html-disp-formula">16</a>) in the underdamped dynamics. We compute the stationarity condition (<a href="#FD31-entropy-27-00218" class="html-disp-formula">31</a>) at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> using the gradient of the solution of the Hamilton–Jacobi–Bellman Equations (<a href="#FD34a-entropy-27-00218" class="html-disp-formula">34a</a>) and (<a href="#FD34b-entropy-27-00218" class="html-disp-formula">34b</a>) using the Bismut–Elworthy–Li formula (Monte Carlo w. BEL) (blue line) in Algorithm 4. The optimal control protocol <span class="html-italic">U</span> and terminal condition <math display="inline"><semantics> <mi>φ</mi> </semantics></math> of (<a href="#FD34a-entropy-27-00218" class="html-disp-formula">34a</a>) and (<a href="#FD34b-entropy-27-00218" class="html-disp-formula">34b</a>) are found using numerical integration of the system of equations described in Section IV of [<a href="#B25-entropy-27-00218" class="html-bibr">25</a>], using a fourth-order co-location method from the DifferentialEquations.jl library [<a href="#B61-entropy-27-00218" class="html-bibr">61</a>]. We use Gaussian boundary conditions: the initial and final position and momentum means are set as zero; the initial and final cross-correlation is zero; the initial variances are set to 1; the final position variance is <math display="inline"><semantics> <mrow> <mn>1.7</mn> </mrow> </semantics></math>; and the final momentum variance is 1. We sample <math display="inline"><semantics> <mrow> <mn>10,000</mn> </mrow> </semantics></math> independent trajectories of the stochastic process (<a href="#FD22-entropy-27-00218" class="html-disp-formula">22</a>) started from 500 sample points in the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>5</mn> <mo>,</mo> <mn>5</mn> <mo>]</mo> <mo>×</mo> <mo>[</mo> <mo>−</mo> <mn>5</mn> <mo>,</mo> <mn>5</mn> <mo>]</mo> </mrow> </semantics></math> using an Euler–Maruyama discretization with time step <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <mn>0.01</mn> </mrow> </semantics></math>. We use <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>f</mi> </msub> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mi>τ</mi> <mo>=</mo> <mi>m</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Solution of the optimal control problem minimizing the Kullback–Leibler divergence from a free diffusion in a fixed time interval in the overdamped dynamics. The gradient of the control protocol is parametrized by a neural network and trained using the process described in Algorithm 5. Panel (<b>a</b>) shows the final boundary condition obtained by integrating the Fokker–Planck Equation (<a href="#FD18a-entropy-27-00218" class="html-disp-formula">18a</a>) using the trained neural network as the drift in Algorithm 1 (blue) against the assigned final boundary condition (orange). Panels (<b>b</b>–<b>g</b>) show the output of the neural network (blue) after training to estimate the gradient of the optimal control protocol against a reference solution [<a href="#B41-entropy-27-00218" class="html-bibr">41</a>] (orange). We use the assigned boundary conditions as in <a href="#entropy-27-00218-f002" class="html-fig">Figure 2</a>, with <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mi>μ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>ι</mi> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>t</mi> <mi>f</mi> </msub> <mo>=</mo> <mn>0.2</mn> </mrow> </semantics></math>. The gradient of the optimal control protocol is parametrized by a fully connected feed-forward neural network with one input layer of four neurons, one hidden layer of ten neurons and one output layer. The swish (<math display="inline"><semantics> <mrow> <mi>x</mi> <mo>⟼</mo> <mi>x</mi> <mi>σ</mi> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> </semantics></math>) activation function is used between the input and hidden, and hidden and output layers. Weights and biases are initialized using Glorot normal initialization, and Glorot uniform initialization for the output layer. The Lagrange multiplier <math display="inline"><semantics> <mi>λ</mi> </semantics></math> function is approximated by fitting a polynomial of degree 6 and is initialized with all coefficients set to 0. At each iteration, 512 points are sampled uniformly from the interval <math display="inline"><semantics> <mrow> <mo>[</mo> <mo>−</mo> <mn>3</mn> <mo>,</mo> <mn>3</mn> <mo>]</mo> </mrow> </semantics></math>. The gradient of the value function is computed using Algorithm 3 with the neural network <math display="inline"><semantics> <mi mathvariant="double-struck">U</mi> </semantics></math> as the drift, with 10 independent simulated trajectories of the associated SDE using an Euler–Maruyama discretization and time step <math display="inline"><semantics> <mrow> <mn>0.005</mn> </mrow> </semantics></math>. The final probability density is computed using Algorithm 1 with <math display="inline"><semantics> <mi mathvariant="double-struck">U</mi> </semantics></math> as the drift, with 100 independent Monte Carlo trajectories from each sample point using an Euler–Maruyama discretization and time step <math display="inline"><semantics> <mrow> <mn>0.005</mn> </mrow> </semantics></math>. The neural network <math display="inline"><semantics> <mi mathvariant="double-struck">U</mi> </semantics></math> is trained in four phases as follows. The first phase is 20 full iterations of Algorithm 5 with 100 updates to the parameters <math display="inline"><semantics> <mi mathvariant="sans-serif">Θ</mi> </semantics></math> per iteration using stochastic gradient descent with learning rate <math display="inline"><semantics> <mrow> <msub> <mi>γ</mi> <mn>2</mn> </msub> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>3</mn> </mrow> </msup> </mrow> </semantics></math>. At each iteration, the Lagrange multiplier <math display="inline"><semantics> <mi>λ</mi> </semantics></math> is recomputed using (<a href="#FD69-entropy-27-00218" class="html-disp-formula">69</a>) with <math display="inline"><semantics> <mrow> <msub> <mi>γ</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. In the second phase, we make 20 full iterations with 100 updates to <math display="inline"><semantics> <mi mathvariant="sans-serif">Θ</mi> </semantics></math> according to (<a href="#FD70-entropy-27-00218" class="html-disp-formula">70</a>) using stochastic gradient descent and learning rate <math display="inline"><semantics> <mrow> <msub> <mi>γ</mi> <mn>2</mn> </msub> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>4</mn> </mrow> </msup> </mrow> </semantics></math> per iteration. The Lagrange multiplier is recomputed once at each iteration using <math display="inline"><semantics> <mrow> <msub> <mi>γ</mi> <mn>1</mn> </msub> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>2</mn> </mrow> </msup> </mrow> </semantics></math>. In the third phase, we make 20 full iterations with 400 updates to <math display="inline"><semantics> <mi mathvariant="sans-serif">Θ</mi> </semantics></math> using stochastic gradient descent with learning rate <math display="inline"><semantics> <mrow> <msub> <mi>γ</mi> <mn>2</mn> </msub> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>5</mn> </mrow> </msup> </mrow> </semantics></math> per iteration. In the fourth phase, we make 20 full iterations with 400 update steps to <math display="inline"><semantics> <mi mathvariant="sans-serif">Θ</mi> </semantics></math> per iteration using the ADAM [<a href="#B65-entropy-27-00218" class="html-bibr">65</a>] optimizer and <math display="inline"><semantics> <mrow> <msub> <mi>γ</mi> <mn>2</mn> </msub> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>4</mn> </mrow> </msup> </mrow> </semantics></math>. The code is written in the Julia programming language, using especially the Flux.jl [<a href="#B66-entropy-27-00218" class="html-bibr">66</a>,<a href="#B67-entropy-27-00218" class="html-bibr">67</a>] and Polynomials.jl libraries.</p>
Full article ">
20 pages, 908 KiB  
Article
Output Feedback Optimal Control for Discrete-Time Singular Systems Driven by Stochastic Disturbances and Markov Chains
by Jing Xie, Bowen Zhang, Tianliang Zhang and Xiangtong Kong
Mathematics 2025, 13(4), 634; https://doi.org/10.3390/math13040634 - 14 Feb 2025
Viewed by 307
Abstract
This paper delves into the exploration of the indefinite linear quadratic optimal control (LQOC) problem for discrete-time stochastic singular systems driven by discrete-time Markov chains. Initially, the conversion of the indefinite LQOC problem mentioned above for stochastic singular systems into an equivalent problem [...] Read more.
This paper delves into the exploration of the indefinite linear quadratic optimal control (LQOC) problem for discrete-time stochastic singular systems driven by discrete-time Markov chains. Initially, the conversion of the indefinite LQOC problem mentioned above for stochastic singular systems into an equivalent problem of normal stochastic systems is executed through a sequence of transformations. Following this, the paper furnishes sufficient and necessary conditions for resolving the transformed LQOC problem with indefinite matrix parameters, alongside optimal control strategies ensuring system regularity and causality, thereby establishing the solvability of the optimal controller. Additionally, conditions are derived to verify the definiteness of the transformed LQOC problem and the uniqueness of solutions for the generalized Markov jumping algebraic Riccati equation (GMJARE). The study attains optimal controls and nonnegative cost values, guaranteeing system admissibility. The results of the finite horizon are extended to the infinite horizon. Furthermore, it introduces the design of an output feedback controller using the LMI method. Finally, a demonstrative example demonstrates the validity of the main findings. Full article
(This article belongs to the Special Issue Stochastic System Analysis and Control)
Show Figures

Figure 1

Figure 1
<p>Ten stochastic disturbance paths.</p>
Full article ">Figure 2
<p>Markovian switching modes.</p>
Full article ">Figure 3
<p>State trajectories <math display="inline"><semantics> <msubsup> <mi>x</mi> <mrow> <mi>k</mi> </mrow> <mn>11</mn> </msubsup> </semantics></math> of the closed-loop model.</p>
Full article ">Figure 4
<p>State trajectories <math display="inline"><semantics> <msubsup> <mi>x</mi> <mrow> <mi>k</mi> </mrow> <mn>12</mn> </msubsup> </semantics></math> of the closed-loop model.</p>
Full article ">Figure 5
<p>State trajectories <math display="inline"><semantics> <msubsup> <mi>x</mi> <mrow> <mi>k</mi> </mrow> <mn>2</mn> </msubsup> </semantics></math> of the closed-loop model.</p>
Full article ">Figure 6
<p>System control signal <math display="inline"><semantics> <msub> <mi>u</mi> <mi>k</mi> </msub> </semantics></math>.</p>
Full article ">
14 pages, 308 KiB  
Article
Finite-Time and Fixed-Time Synchronization of Memristor-Based Cohen–Grossberg Neural Networks via a Unified Control Strategy
by Mei Liu, Binglong Lu, Jinling Wang, Haijun Jiang and Cheng Hu
Mathematics 2025, 13(4), 630; https://doi.org/10.3390/math13040630 - 14 Feb 2025
Viewed by 350
Abstract
This article focuses on the problem of finite-time and fixed-time synchronization for Cohen–Grossberg neural networks (CGNNs) with time-varying delays and memristor connection weights. First, through a nonlinear transformation, an alternative system is derived from the Cohen–Grossberg memristor-based neural networks (MCGNNs) considered. Then, under [...] Read more.
This article focuses on the problem of finite-time and fixed-time synchronization for Cohen–Grossberg neural networks (CGNNs) with time-varying delays and memristor connection weights. First, through a nonlinear transformation, an alternative system is derived from the Cohen–Grossberg memristor-based neural networks (MCGNNs) considered. Then, under the framework of the Filippov solution and by adjusting a key control parameter, some novel and effective criteria are obtained to ensure finite-time or fixed-time synchronization of the alternative networks via the unified control framework and under the same conditions. Furthermore, the two types of synchronization criteria are derived from the considered MCGNNs. Finally, some numerical simulations are presented to test the validity of these theoretical conclusions. Full article
Show Figures

Figure 1

Figure 1
<p>The chaotic attractor of memristive neural networks (<a href="#FD18-mathematics-13-00630" class="html-disp-formula">18</a>).</p>
Full article ">Figure 2
<p>The states of <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>ω</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>The states of <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>ω</mi> <mo>=</mo> <mn>0.2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>The states of <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>e</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>ω</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>The states of <math display="inline"><semantics> <mrow> <msub> <mi>e</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>e</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> when <math display="inline"><semantics> <mrow> <mi>ω</mi> <mo>=</mo> <mn>1.5</mn> </mrow> </semantics></math>.</p>
Full article ">
33 pages, 5254 KiB  
Article
Effective Thermal Diffusivity Measurement Using Through-Transmission Pulsed Thermography: Extending the Current Practice by Incorporating Multi-Parameter Optimisation
by Zain Ali, Sri Addepalli and Yifan Zhao
Sensors 2025, 25(4), 1139; https://doi.org/10.3390/s25041139 - 13 Feb 2025
Viewed by 359
Abstract
Through-transmission pulsed thermography (PT) is an effective non-destructive testing (NDT) technique for assessing material thermal diffusivity. However, the current literature indicates that the technique has lagged behind the reflection mode in terms of technique development despite it offering better defect resolution and the [...] Read more.
Through-transmission pulsed thermography (PT) is an effective non-destructive testing (NDT) technique for assessing material thermal diffusivity. However, the current literature indicates that the technique has lagged behind the reflection mode in terms of technique development despite it offering better defect resolution and the detection of deeper subsurface defects. Existing thermal diffusivity measurement systems require costly setups, including temperature-controlled chambers, multiple calibrations, and strict sample size requirements. This study presents a simple and repeatable methodology for determining thermal diffusivity in a laboratory setting using the through-transmission approach by incorporating both finite element analysis (FEA) and laboratory experiments. A full-factorial design of experiments (DOE) was implemented to determine the optimum flash energy and sample thickness for a reliable estimation of thermal diffusivity. The thermal diffusivity is estimated using the already established Parker’s half-rise equation and the recently developed new least squares fitting (NLSF) algorithm. The latter not only estimates thermal diffusivity but also provides estimates for the input flash energy, reflection coefficient, and the time delay in data capture following the flash event. The results show that the NLSF is less susceptible to noise and offers more repeatable values for thermal diffusivity measurements compared to Parker, thereby establishing it as a more efficient and reliable technique. Full article
(This article belongs to the Section Physical Sensors)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Illustration of the PT transmission mode configuration; (<b>b</b>) nondimensionalised back wall temperature plot displaying the value for ω at half the maximum temperature.</p>
Full article ">Figure 2
<p>Normalised back wall temperature profile at different emissivity values.</p>
Full article ">Figure 3
<p>Geometry for the FEA Model. (<b>a</b>) The yellow region is where the temperature measurements are taken from at the back wall. (<b>b</b>) The meshed geometry is where the region of interest has a finer geometry to save computational time.</p>
Full article ">Figure 4
<p>Thermal diffusivity measurements using the NLSF algorithm and Parker’s method for a 150 × 100 mm S275 steel plate with multiple thicknesses, subjected to different energy levels of pulsed heating simulated in COMSOL. Thermal diffusivity estimates at (<b>a</b>) 2.4kJ (<b>b</b>) 4.8kJ and (<b>c</b>) 9.6kJ.</p>
Full article ">Figure 5
<p>Measurement error for NLSF and Parker’s method across all thicknesses (values have been averaged across the three different energy levels).</p>
Full article ">Figure 6
<p>Error analysis of the NLSF algorithm with varying SNRS for (<b>a</b>) thermal diffusivity measurement and (<b>b</b>) input energy measurement using the temperature plots obtained from the FEA model in COMSOL.</p>
Full article ">Figure 7
<p>Comparison of Parker’s and NLSF method’s performance at estimating thermal diffusivity at different SNRs for energy levels (<b>a</b>) 2.4 kJ, (<b>b</b>) 4.8 kJ, and (<b>c</b>) 9.6 kJ.</p>
Full article ">Figure 7 Cont.
<p>Comparison of Parker’s and NLSF method’s performance at estimating thermal diffusivity at different SNRs for energy levels (<b>a</b>) 2.4 kJ, (<b>b</b>) 4.8 kJ, and (<b>c</b>) 9.6 kJ.</p>
Full article ">Figure 8
<p>Pareto charts for standardised effects for the finite element simulations (<b>a</b>) thermal diffusivity estimated using NLSF and (<b>b</b>) thermal diffusivity estimated using Parker’s method.</p>
Full article ">Figure 9
<p>Residual plots from the finite element simulations for estimating thermal diffusivity using (<b>a</b>) NLSF and (<b>b</b>) Parker’s method.</p>
Full article ">Figure 10
<p>Thermal diffusivity estimations for different thicknesses at (<b>a</b>) 2.4kJ, (<b>b</b>) 4.8kJ, and (<b>c</b>) 9.6kJ using NLSF and Parker’s methods.</p>
Full article ">Figure 10 Cont.
<p>Thermal diffusivity estimations for different thicknesses at (<b>a</b>) 2.4kJ, (<b>b</b>) 4.8kJ, and (<b>c</b>) 9.6kJ using NLSF and Parker’s methods.</p>
Full article ">Figure 11
<p>Thermal diffusivity measurements for varying thicknesses at different energy levels, estimated using (<b>a</b>) NLSF and (<b>b</b>) Parker’s method.</p>
Full article ">Figure 12
<p>Histograms showcasing variations in thermal diffusivity with different thicknesses at different energy levels estimated using NLSF (<b>a</b>,<b>c</b>,<b>e</b>) and Parker’s methods (<b>b</b>,<b>d</b>,<b>f</b>).</p>
Full article ">Figure 13
<p>Pareto charts for standardised effects for the laboratory experiments (<b>a</b>) thermal diffusivity estimated using NLSF and (<b>b</b>) thermal diffusivity estimated using Parker’s method.</p>
Full article ">Figure 14
<p>Comparison of the coefficient of variation (<b>a</b>) comparison between the NLSF and Parker methods, (<b>b</b>) variation at different thicknesses using the NLSF method, and (<b>c</b>) variation at different thicknesses using Parker’s method.</p>
Full article ">Figure 14 Cont.
<p>Comparison of the coefficient of variation (<b>a</b>) comparison between the NLSF and Parker methods, (<b>b</b>) variation at different thicknesses using the NLSF method, and (<b>c</b>) variation at different thicknesses using Parker’s method.</p>
Full article ">Figure 15
<p>Comparison between simulation and laboratory experiments for thermal diffusivity measurement (<b>a</b>) using the NLSF method and (<b>b</b>) using Parker’s method.</p>
Full article ">Figure 16
<p>Residual plots from laboratory experiments for estimating thermal diffusivity using (<b>a</b>) NLSF and (<b>b</b>) Parker.</p>
Full article ">
23 pages, 1254 KiB  
Article
Event-Triggered MFAILC Bipartite Formation Control for Multi-Agent Systems Under DoS Attacks
by Han Li, Lixia Fu and Wenchao Wu
Appl. Sci. 2025, 15(4), 1921; https://doi.org/10.3390/app15041921 - 12 Feb 2025
Viewed by 489
Abstract
For multi-input multi-output (MIMO) nonlinear discrete-time bipartite formation multiagent systems (BFMASs) performing trajectory tracking tasks with unknown dynamics, a dynamic event-triggered model-free adaptive iterative learning control (DET-MFAILC) algorithm is proposed to address periodic denial-of-service (DoS) attacks. First, using the pseudo-partial derivative, a compact [...] Read more.
For multi-input multi-output (MIMO) nonlinear discrete-time bipartite formation multiagent systems (BFMASs) performing trajectory tracking tasks with unknown dynamics, a dynamic event-triggered model-free adaptive iterative learning control (DET-MFAILC) algorithm is proposed to address periodic denial-of-service (DoS) attacks. First, using the pseudo-partial derivative, a compact format dynamic linearization (CFDL) method is employed to construct an equivalent CFDL data model for the MIMO multi-agent system. A DoS attack model and its corresponding compensation algorithm are developed, while a dynamic event-triggered condition is designed considering both the consensus error and the tracking error. Subsequently, the proposed DoS attack compensation algorithm and the dynamic event-triggered mechanism are integrated with the model-free adaptive iterative learning control algorithm to design a controller, which is further extended from fixed-topology systems to time-varying topology systems. The convergence of the control system is rigorously proven. Finally, simulation experiments are conducted on bipartite formation multi-agent systems (BFMASs) under fixed and time-varying communication topologies. The results demonstrate that the proposed algorithm effectively mitigates the impact of DoS attacks, reduces controller updates, conserves network resources, and ensures that both the tracking error and consensus error converge to an ideal range close to zero within a finite number of iterations while maintaining a good formation shape. Full article
(This article belongs to the Topic Agents and Multi-Agent Systems)
Show Figures

Figure 1

Figure 1
<p>Communication topology of the agents.</p>
Full article ">Figure 2
<p>Schematic diagram of DoS attack working cycle.</p>
Full article ">Figure 3
<p>Diagram of periodic DoS attacks.</p>
Full article ">Figure 4
<p>System output of MFAILC under DoS attack (300th iteration).</p>
Full article ">Figure 5
<p>Tracking performance curves of MAFILC under DoS attack (300th iteration).</p>
Full article ">Figure 6
<p>Maximum tracking error of MAFILC under DoS attack.</p>
Full article ">Figure 7
<p>MAFC system output.</p>
Full article ">Figure 8
<p>Tracking performance curves of MFAC.</p>
Full article ">Figure 9
<p>DET-MAFILC system output with compensation mechanism under Dos attack (280th iteration).</p>
Full article ">Figure 10
<p>Tracking performance curves of DET-MAFILC with compensation mechanism under DoS attack (280th iteration).</p>
Full article ">Figure 11
<p>Maximum tracking error of agents under DoS attacks.</p>
Full article ">Figure 12
<p>The MSE of <math display="inline"><semantics> <msub> <mi>ξ</mi> <mrow> <mi>a</mi> <mi>p</mi> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 13
<p>The ET signal of condition [<a href="#B22-applsci-15-01921" class="html-bibr">22</a>].</p>
Full article ">Figure 14
<p>The ET signal of this paper.</p>
Full article ">Figure 15
<p>Time-varying topology of BFMASs.</p>
Full article ">Figure 16
<p>DET-MAFILC system output with compensation mechanism under Dos attack (250th iteration).</p>
Full article ">Figure 17
<p>Tracking performance curves of DET-MAFILC with compensation mechanism under DoS attack (250th iteration).</p>
Full article ">Figure 18
<p>Maximum tracking error of agents under DoS attacks.</p>
Full article ">Figure 19
<p>Formation at different sampling times k (250th iteration).</p>
Full article ">
13 pages, 2708 KiB  
Article
Passivity-Based Twisting Sliding Mode Control for Series Elastic Actuators
by Hui Zhang, Jilong Wang, Lei Zhang, Shijie Zhang, Jing Zhang and Zirong Zhang
Actuators 2025, 14(2), 87; https://doi.org/10.3390/act14020087 - 11 Feb 2025
Viewed by 377
Abstract
This paper presents a passivity-based twisting sliding mode control (PBSMC) approach for series elastic actuators (SEAs). To address the time-varying position trajectory tracking control problem in SEAs, a fourth-order dynamic model is developed to accurately characterize the system. The control framework comprises an [...] Read more.
This paper presents a passivity-based twisting sliding mode control (PBSMC) approach for series elastic actuators (SEAs). To address the time-varying position trajectory tracking control problem in SEAs, a fourth-order dynamic model is developed to accurately characterize the system. The control framework comprises an internal loop and an external loop controller, each designed to ensure precise trajectory tracking. The internal loop controller manages the second derivative of the joint trajectory position error, while the external loop focuses on the error itself. Both controllers are based on the PBSMC methodology to reduce complex nonlinear disturbances and minimize tracking errors. The finite-time convergence of the proposed method is rigorously analyzed. The performance and advantages of the method are evaluated and compared through various simulations. Full article
(This article belongs to the Section Control Systems)
Show Figures

Figure 1

Figure 1
<p>The equivalent schematic diagram of the SEA.</p>
Full article ">Figure 2
<p>Comparison of simulation results between PID, backstepping method, and the proposed method without external interference.</p>
Full article ">Figure 3
<p>Comparison of simulation results between PID, backstepping method, and the proposed method with external interference.</p>
Full article ">Figure 4
<p>Simulation results for SEA (Case 2).</p>
Full article ">
21 pages, 10544 KiB  
Article
Modeling the Energy and Heating Efficiency of 3D Printing for Composite Materials with Dispersed Volumetric Particles
by Teodor Grakov, Valentin Mateev and Iliana Marinova
Electronics 2025, 14(4), 688; https://doi.org/10.3390/electronics14040688 - 10 Feb 2025
Viewed by 329
Abstract
Additive manufacturing, such as the 3D printing of composite materials for electronics is rapidly evolving, enabling the production of advanced electric and magnetic composites with tailored properties. These materials require special printing conditions and advanced control to maintain the desired material properties during [...] Read more.
Additive manufacturing, such as the 3D printing of composite materials for electronics is rapidly evolving, enabling the production of advanced electric and magnetic composites with tailored properties. These materials require special printing conditions and advanced control to maintain the desired material properties during the 3D printing process and in the final product design. Hence, determining the heating and energy consumption and estimating the efficiency of 3D printing is essential. This work modeled the fused filament fabrication 3D printing of composite materials with a polymer carrier matrix. A 3D time-dependent thermal model of a 3D printer extruder was developed and implemented using the finite element method to study and improve the efficiency of 3D printing. As the filler content influences the operational parameters and process energy consumption of the 3D printing process, the transient heating process parameters were estimated using different composite modifier contents. Two types of modifiers were considered: Fe2O3 and CaO, both mixed in a PLA carrier material. The volumetric fill ratio of the two modifiers did not exceed 45%, as the mixing dependency of the material properties is linear in this range. The power fluxes and power efficiency were estimated. The results provide new possibilities for better control methodologies and advanced additive manufacturing for new materials in electronics. Operational control can accelerate the 3D printing process, speeding up the heating of 3D-printed composite materials and reducing the printing time and total energy consumption. Furthermore, this research provides directions for new advanced 3D printing extruder designs with better power and energy heating efficiency. Full article
Show Figures

Figure 1

Figure 1
<p>Advantages and disadvantages of FFF/FDM 3D printing using composite materials. * indicates that this can be an advantage in some cases and a disadvantage in others.</p>
Full article ">Figure 2
<p>The 3D printer extruder design assembled (<b>a</b>) and disassembled showing the main design components (<b>b</b>). Sensors and wires are not shown in the drawings.</p>
Full article ">Figure 3
<p>3D printer extruder—size of all design elements.</p>
Full article ">Figure 4
<p>Finite element mesh of the extruder assembly model, with a central cross-section through the material channel (<b>a</b>), and a close view of the meshed extruder tip (<b>b</b>).</p>
Full article ">Figure 5
<p>Infrared thermography of heated extruder (<b>a</b>); material temperature and temperature of extruder and thermal bridge are visible. Fe-PLA composite microscopy image is shown in (<b>b</b>); particles’ homogenous distribution is visible.</p>
Full article ">Figure 6
<p>Transient heating of 3D printer extruder, measured at the thermal sensor location. (<b>a</b>) represents the Fe<sub>2</sub>O<sub>3</sub> composites and (<b>b</b>) the CaO composites. The temperature variation was compared at 160 s from the beginning of the heating process. This duration was shorter than the process time constant, but it covered the temperature of material plastification in the viscose phase suitable for 3D printing.</p>
Full article ">Figure 7
<p>The temperature distribution in an extruder cross-section (<b>a</b>) and heat flux distributions (<b>b</b>–<b>d</b>). The temperature distribution is in the range between 234.58 °C and 236.98 °C, where the hotspot is located within the heater element, visualized with a circle.</p>
Full article ">Figure 8
<p>Temperature distribution of PLA filament only (<b>a</b>) and its heat flux (<b>b</b>). The viewpoint is from the heater side, indicated by the red hotspot.</p>
Full article ">Figure 9
<p>Transient heat fluxes from the heater element to the 3D printer thermal bridge. (<b>a</b>) corresponds to the Fe<sub>2</sub>O<sub>3</sub> composites and (<b>b</b>) to the CaO composites. The pure PLA filament is given as a reference in the black line.</p>
Full article ">Figure 10
<p>Transient heat fluxes from the thermal bridge to the extruder (E1). (<b>a</b>) corresponds to the Fe<sub>2</sub>O<sub>3</sub> composites and (<b>b</b>) to the CaO composites. The pure PLA filament is given as a reference in the black line.</p>
Full article ">Figure 11
<p>Transient heat fluxes from the polymer filament composite material. (<b>a</b>) corresponds to the Fe<sub>2</sub>O<sub>3</sub> composites and (<b>b</b>) to the CaO composites. The pure PLA filament is given as a reference in the black line.</p>
Full article ">Figure 12
<p>3D printer filament in the extruder for each composite. The temperature variation is due to the composite content. The viewpoint is from the left side of the extruder. The red hotspot faces the extruder heater.</p>
Full article ">Figure 13
<p>Temperature of polymer change depending on composite content at 160 s. (<b>a</b>) Heat flux of polymer change depending on composite content at 160 s (<b>b</b>).</p>
Full article ">Figure 14
<p>The 3D printer extruder’s power in the thermal bridge (<b>a</b>), extruder (<b>b</b>), and filament (<b>c</b>). Filler content in wt.% increased the power in watts.</p>
Full article ">
Back to TopTop