Search

This paper investigates an L1 adaptive fault-tolerant control scheme for nonlinear systems with input constraint, external disturbances, and multiple faults, which include actuator faults and sensor faults. Faults and input constraint are important factors that affect the stability and performance of a control system. Actuators and sensors are the most vulnerable components, with the former receiving more attention in comparison. In this paper, sensor faults are first transformed into pseudo-actuator faults through the augmented matrix approach, which facilitates their handling together with actuator faults. Saturation constraints on the control signal are not conducive to the design of the controller. The conversion of an input-saturated function to a time-varying linear system is completed based on function approximation and Lagrange's mean value theorem. Moreover, a nonlinear system with unknown input gain and uncertainties is constructed using these methods. Next, an L1 adaptive fault-tolerant controller is designed to cope with uncertainties, including system uncertainties, external disturbances, faults, and approximation errors. In the L1 adaptive controller, the online estimation of the time-varying parameters allows for updating of the system state, while the combination of the two is transmitted to the control law such that it can compensate for the effects of the uncertainties. The stability and performance boundaries are further derived using the Lyapunov theory and the L1 reference system. Finally, simulations are carried out to demonstrate the effectiveness of the proposed controller. [ABSTRACT FROM AUTHOR]

To address the problem of low accuracy and efficiency in trajectory planning algorithms for interceptors facing multiple constraints during the midcourse guidance phase, an improved trajectory convex programming method based on the lateral distance domain is proposed. This algorithm can achieve fast trajectory planning, reduce the approximation error of the planned trajectory, and improve the accuracy of trajectory guidance. First, the concept of lateral distance domain is proposed, and the motion model of the midcourse guidance segment in the interceptor is converted from the time domain to the lateral distance domain. Second, the motion model and multiple constraints are convexly and discretely transformed, and the discrete trajectory convex model is established in the lateral distance domain. Third, the deep reinforcement learning algorithm is used to learn and train the initial solution of trajectory convex programming, and a high-quality initial solution trajectory is obtained. Finally, a dynamic adjustment method based on the distribution of approximate solution errors is designed to achieve efficient dynamic adjustment of grid points in iterative solving. The simulation experiments show that the improved trajectory convex programming algorithm proposed in this paper not only improves the accuracy and efficiency of the algorithm but also has good optimization performance. [ABSTRACT FROM AUTHOR]

The purpose of the present paper is to study a sequence of linear and positive operators which was introduced by A. Lupas. First, we obtain estimate of moments of the operators and then prove a basic convergence theorem for simultaneous approximation. Further, we find error in approximation in terms of modulus of continuity of function. Finally, we establish a Voronovskaja asymptotic formula for linear combination of the above operators. [ABSTRACT FROM AUTHOR]

This paper studies an adaptive fault tolerant control (AFTC) scheme for a continuum robot subjected to unknown actuator faults, dynamics uncertainties, unknown disturbances, and prescribed performance. Specifically, to deal with uncertainties, a function approximation technique (FAT) is employed to evaluate the unknown actuator faults and uncertain dynamics of the continuum robot. Then, a nonlinear disturbance observer (DO) is developed to estimate the unknown compounded disturbance, which contains the unknown disturbances and approximation errors of the FAT. Furthermore, the prescribed error bound is treated as a time-varying constraint, and the controller design method is based on an asymmetric barrier Lyapunov function (BLF), which is operated to strictly ensure the steady-state and transient performance of the continuum robot. Afterwards, the simulation results validate the effectiveness of the proposed AFTC in dealing with the unknown actuator faults, uncertainties, unknown disturbances, and prescribed performance. Finally, the effectiveness of the proposed AFTC scheme is verified through experiments. [ABSTRACT FROM AUTHOR]

This paper proposes a dead-reckoning (DR) method for vehicles using Lie theory. This approach treats the pose (position and attitude) and velocity of the vehicle as elements of the Lie group SE 2 (3) and follows the computations based on Lie theory. Previously employed DR methods, which have been widely used, suffer from cumulative errors over time due to inaccuracies in the calculated changes from velocity during the motion of the vehicle or small errors in modeling assumptions. Consequently, this results in significant discrepancies between the estimated and actual positions over time. However, by treating the pose and velocity of the vehicle as elements of the Lie group, the proposed method allows for accurate solutions without the errors introduced by linearization. The incremental updates for pose and velocity in the DR computation are represented in the Lie algebra. Experimental results confirm that the proposed method improves the accuracy of DR. In particular, as the motion prediction time interval of the vehicle increases, the proposed method demonstrates a more pronounced improvement in positional accuracy. [ABSTRACT FROM AUTHOR]

In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited resources, the runtime of the approximate function is as crucial as its accuracy. The proposed algorithm searches for the optimal piecewise polynomial (OPP) with the minimum computational cost while ensuring that the error is below a specified threshold. This was accomplished by using smooth piecewise polynomials with optimal order and numbers of intervals. The computational cost only depended on polynomial complexity, i.e., the order and the number of intervals at runtime function call. In previous studies, the user had to decide one or all of the orders and the number of intervals. In contrast, the OPP approximation algorithm determines both of them. For the optimal approximation, computational costs for all the possible combinations of piecewise polynomials were calculated and tabulated in ascending order for the specific target CPU off-line. Each combination was optimized through constrained least squares and the random selection method for the given sample points. Afterward, whether the approximation error was below the predetermined value was examined. When the error was permissible, the combination was selected as the optimal approximation, or the next combination was examined. To verify the performance, several representative functions were examined and analyzed. [ABSTRACT FROM AUTHOR]

This paper presents general theoretical studies on asymptotic convergence rate (ACR) for finite dimensional optimization. Given the continuous problem function and discrete time stochastic optimization process, the ACR is the optimal constant for control of the asymptotic behaviour of the expected approximation errors. Under general assumptions, condition ACR < 1 implies the linear behaviour of the expected time of hitting the ε - optimal sublevel set with ε → 0 + and determines the upper bound for the convergence rate of the trajectories of the process. This paper provides general characterization of ACR and, in particular, shows that some algorithms cannot converge linearly fast for any nontrivial continuous optimization problem. The relation between asymptotic convergence rate in the objective space and asymptotic convergence rate in the search space is provided. Examples and numerical simulations with use of a (1+1) self-adaptive evolution strategy and other algorithms are presented. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive bearing rigid formation control strategy for a class of nonlinear system with unknown dead-zone inputs and external disturbance is proposed. Firstly, the I-Type fuzzy system is used to approximate the unknown nonlinear dynamics of the formation model, and the approximation errors and unknown external disturbance are eliminated by the parameter adaptive estimation. Furthermore, the adaptive dynamic estimation algorithm is utilized to estimate and compensate the unknown dead-zone parameters, effectively suppressing the impact of dead-zone on formation system performance. Finally, the stability of the formation system is proved based on LaSalle's invariance principle, and the effectiveness of the algorithm is verified by simulation results. [ABSTRACT FROM AUTHOR]

Large-scale symmetric and asymmetric matrices have emerged in predicting the relationship between genes and diseases. The emergence of large-scale matrices increases the computational complexity of the problem. Therefore, using low-rank matrices instead of original symmetric and asymmetric matrices can greatly reduce computational complexity. In this paper, we propose an approximation conjugate gradient method for solving the low-rank matrix recovery problem, i.e., the low-rank matrix is obtained to replace the original symmetric and asymmetric matrices such that the approximation error is the smallest. The conjugate gradient search direction is given through matrix addition and matrix multiplication. The new conjugate gradient update parameter is given by the F-norm of matrix and the trace inner product of matrices. The conjugate gradient generated by the algorithm avoids SVD decomposition. The backtracking linear search is used so that the approximation conjugate gradient direction is computed only once, which ensures that the objective function decreases monotonically. The global convergence and local superlinear convergence of the algorithm are given. The numerical results are reported and show the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we develop a method for the estimation of airgap spatial variation from the harmonics that appear in the stator's current under static eccentricity conditions. We move beyond the detection of the eccentricity fault and endeavour to quantify the severity of this fault. To achieve this, we formulate the problem as a mathematical inverse problem and attempt to solve it in the Bayesian framework using the so-called Bayesian approximation error approach. The solution takes the form of an algorithm capable of estimating the parameter(s) that characterize the spatial variation of the airgap length from noisy and limited data. Furthermore, it can quantify the uncertainty associated with the results as a byproduct of the Bayesian analysis approach employed in this paper. The results demonstrate that with each iteration of the algorithm, estimation accuracy improves, and the uncertainty of the estimated results reduces. • Bayesian approximation error analysis shows promise in monitoring electrical machines with eccentric rotors. • The paper applies Bayesian inversion for online estimation of airgap length in induction machines with eccentric rotors. • The study estimates static eccentricity ratio from limited data on harmonics of the machine line currents. • This paper gives an analytical method for calculating all inductances of induction machines under static eccentricity. [ABSTRACT FROM AUTHOR]

This paper presents application and tuning of the equilibrated residual method (ERM) of a posteriori error estimation for coupled electromechanical problems of direct, inverse and general piezoelectricity. In these three cases, either electric potential is induced by strains or strains appear due to the applied electric potential or both phenomena occur simultaneously. The mentioned ERM is assigned for the assessment of modeling and approximation errors of the numerical finite element solution. Such error values usually serve as indication for adaptive hierarchical modeling and adaptive mesh changes within thin and/or solid piezoelectric members so as to obtain the solution of assumed accuracy. [ABSTRACT FROM AUTHOR]

Uncompensated motion errors can seriously affect the imaging quality of synthetic aperture sonars (SASs). In the existing line-by-line motion compensation (MOCO) algorithms for wide-beam multiple-receiver SAS systems, the approximate form of the range history error usually introduces a significant approximation error, and the residual two-dimensional (2D) range cell migration (RCM) caused by aperture-dependent motion errors is not corrected, resulting in the severe defocus of the image. In this paper, in the presence of translational and rotational errors in a multiple-receiver SAS system, the exact range history error concerning the five-degree-of-freedom (DOF) motion errors of the sway, heave, yaw, pitch, and roll under the non-stop-hop-stop case is derived. Based on this, a two-stage subaperture MOCO algorithm for wide-beam multiple-receiver SAS systems is proposed. We decompose the range history error into the beam-center term (BCT) and the residual spatial-variant term (RSVT) to compensate successively. In the first stage, the time delay and phase error caused by the BCT are compensated receiver-by-receiver through interpolation and phase multiplication in the azimuth-time domain. In the second stage, the data of a single pulse are regarded as a subaperture, and the RSVT is compensated in the subaperture range-Doppler (RD) domain. We divide the range into several blocks to correct RCM caused by the RSVT in the subaperture RD domain, and the phase error caused by the RSVT is compensated by phase multiplication. After compensation, the wide-beam RD algorithm is used for imaging. Simulated and real-data experiments verify the superiority and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The paper presents a posteriori error approximation concept based on residuals in the two-dimensional discontinuous Galerkin (DG) method. The approach is relatively simple and effective in application, and it takes advantage of some unique properties of the DG method. The error function is constructed in an enriched approximation space, utilizing the hierarchical nature of the basis functions. Among many versions of the DG method, the most popular one is based on the interior penalty approach. However, in this paper a DG method with finite difference (DGFD) is utilized, where the continuity of the approximate solution is enforced by finite difference conditions applied on the mesh skeleton. In the DG methods arbitrarily shaped finite elements can be used, so in this paper the meshes with polygonal finite elements are considered, including quadrilateral and triangular elements. Some benchmark examples are presented, in which Poisson's and linear elasticity problems are considered. The examples use various mesh densities and approximation orders to evaluate the errors. The error estimation maps, generated for the discussed tests, indicate a good correlation with the exact errors. In the last example, the error approximation concept is applied for an adaptive hp mesh refinement. [ABSTRACT FROM AUTHOR]

In this paper, the composite control of position and orientation of the quadrotor for tracking purposes are investigated. The quadrotor is an underactuated nonlinear system. So, based on the introduced virtual inputs the quadrotor is transformed into an actuated system. External disturbances and different sources of uncertainty such as input saturation are considered in the dynamic model of the quadrotor. Also, after transform implementation, some complicated terms appear which are considered as other sources of uncertainty. To guarantee the stabilization and tracking goals of the quadrotor in the perturbed model, the composite adaptive fuzzy PID-Like controller is proposed. This controller consists of three parts where the innovation of the paper appears in all terms. The main term is an adaptive fuzzy PID-like controller which able to approximate the coefficients of PID based on the decentralized fuzzy logic. Then, a H∞ compensator based on a modified Riccati-like equation is presented; which can attenuate the fuzzy approximation errors. Also, as the last term of the composite controller, the modified disturbance observer is designed that estimates the uncertainty and disturbance. The experimental result shows that the proposed method leads to resilient stabilization and tracking in comparison with conventional methods. [ABSTRACT FROM AUTHOR]

The paper refers to interdisciplinary research in the areas of hierarchical cluster analysis of big data and ordering of primary data to detect objects in a color or in a grayscale image. To perform this on a limited domain of multidimensional data, an NP-hard problem of calculation of close to optimal piecewise constant data approximations with the smallest possible standard deviations or total squared errors (approximation errors) is solved. The solution is achieved by revisiting, modernizing, and combining classical Ward's clustering, split/merge, and K-means methods. The concepts of objects, images, and their elements (superpixels) are formalized as structures that are distinguishable from each other. The results of structuring and ordering the image data are presented to the user in two ways, as tabulated approximations of the image showing the available object hierarchies. For not only theoretical reasoning, but also for practical implementation, reversible calculations with pixel sets are performed easily, as with individual pixels in terms of Sleator–Tarjan Dynamic trees and cyclic graphs forming an Algebraic Multi-Layer Network (AMN). The detailing of the latter significantly distinguishes this paper from our prior works. The establishment of the invariance of detected objects with respect to changing the context of the image and its transformation into grayscale is also new. [ABSTRACT FROM AUTHOR]

In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new component of this paper is that we bound the error of approximation by the product of two norms—the norm of f and the A 1 -norm of f. Typically, only the A 1 -norm of f is used. In particular, we establish that some greedy algorithms (Pure Greedy Algorithm (PGA) and its modifications) are as good as the Orthogonal Greedy Algorithm (OGA) in this new sense of the rate of convergence, while it is known that the PGA is much worse than the OGA in the standard sense. Our new results provide better bounds for the accuracy than known results in the case of small ∥ f ∥ . [ABSTRACT FROM AUTHOR]

Bayesian optimization algorithms are widely used for solving problems with a high computational complexity in terms of objective function evaluation. The efficiency of Bayesian optimization is strongly dependent on the quality of the surrogate models of an objective function, which are built and refined at each iteration. The quality of surrogate models, and hence the performance of an optimization algorithm, can be greatly improved by selecting the appropriate hyperparameter values of the approximation algorithm. The common approach to finding good hyperparameter values for each iteration of Bayesian optimization is to build surrogate models with different hyperparameter values and choose the best one based on some estimation of the approximation error, for example, a cross-validation score. Building multiple surrogate models for each iteration of Bayesian optimization is computationally demanding and significantly increases the time required to solve an optimization problem. This paper suggests a new approach, called exploratory landscape validation, to find good hyperparameter values with less computational effort. Exploratory landscape validation metrics can be used to predict the best hyperparameter values, which can improve both the quality of the solutions found by Bayesian optimization and the time needed to solve problems. [ABSTRACT FROM AUTHOR]

The paper provides a precise error estimate for an asymptotic expansion of a certain stochastic control problem related to relative entropy minimization. In particular, it is shown that the expansion error depends on the regularity of functionals on path space. An efficient numerical scheme based on a weak approximation with Monte Carlo simulation is employed to implement the asymptotic expansion in multidimensional settings. Throughout numerical experiments, it is confirmed that the approximation error of the proposed scheme is consistent with the theoretical rate of convergence. [ABSTRACT FROM AUTHOR]

When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the circuit is probabilistically sampled, is able to reduce the approximation error compared to conventional deterministic synthesis. In this paper, we demonstrate that the optimal probabilistic synthesis quadratically reduces the approximation error. Moreover, we show that a deterministic synthesis algorithm can be efficiently converted into a probabilistic one that achieves this quadratic error reduction. We also numerically demonstrate how this conversion reduces the T-count and analytically prove that this conversion halves an information-theoretic lower bound on the circuit size. In order to derive these results, we prove general theorems about the optimal convex approximation of a quantum state. Furthermore, we demonstrate that this theorem can be used to analyze an entanglement measure. [ABSTRACT FROM AUTHOR]

This paper provides a convergence and stability analysis of the incremental value iteration algorithm under the influence of various errors. Incremental control is firstly used to linearize the continuous-time nonlinear system, recursive least squares (RLS) identification is then introduced to identify the incremental model online. Based on the incremental model, the value iteration algorithm is used to design an optimal adaptive controller, with an analytical optimal control law. Moreover, the convergence of the developed incremental value iteration algorithm is proved. The stability of the controller is analyzed using Lyapunov stability theory. Finally, a flight control simulation verifies the robustness of the controller to various initial conditions, as well as adaptation to actuator faults. [ABSTRACT FROM AUTHOR]

In this paper, the scope of discrete asymptotic homogenization employing voxel (cartesian) mesh discretization is expanded to estimate high fidelity effective properties of any periodic heterogeneous media with arbitrary Bravais's lattice symmetry, including those with non-orthogonal periodic bases. A framework was developed in Python with a proposed fast–nearest neighbour algorithm to accurately estimate the periodic boundary conditions of the discretized representative volume element of the lattice unit cell. Convergence studies are performed, and numerical errors caused by both voxel meshing and periodic boundary condition approximation processes are discussed in detail. It is found that the numerical error in periodicity approximation is cyclically dependent on the number of divisions performed during the meshing process and, thus, is minimized with a refined voxel mesh. Validation studies are performed by comparing the elastic properties of 2D hexagon lattices with orthogonal and non-orthogonal bases. The developed methodology was also applied to derive the effective properties of several lattice topologies, and variation of their anisotropic macroscopic properties with relative densities is presented as material selection charts. [ABSTRACT FROM AUTHOR]

Ship operators typically depend on the visual method for draft reading, which may lead to errors or approximations, and it further introduces draft survey calculation errors and cannot provide continuous updates. Ensuring accurate real-time ship draft measurement becomes crucial for enhancing navigational safety, optimizing vessel performance, and achieving precise cargo and consumable measurements. With the current approach towards automation and remote operation of ships, the need to rely on the accuracy of the measurements provided by the sensors has increased. Although different sensor types are gradually being adopted for draft measurement, they encounter challenges in the demanding marine environment which may result in noisy and inaccurate readings. This paper aims to estimate the true draft of a ship in different conditions from noisy sensor measurements using the Kalman filter algorithm. The purpose of the algorithm is to reduce uncertainty in draft measurement that is generated from inaccuracies in the sensor or from the dynamic marine environment. The paper involves designing the Kalman Filter algorithm for draft measurement to work within the different conditions the ship may experience. Simulating different situations and analyzing the result, the application of the filter shows the advantage in real-time draft measurement in both static and dynamic conditions. [ABSTRACT FROM AUTHOR]

Linear tool path with the inherent shortcoming of tangential and curvature discontinuities leads to poor machining efficiency and surface finish. A lot of local corner smoothing methods which inset a tiny spline curve at the corners have been proposed in literature. However, there exists potential overlap of the two adjacent spline curves while smoothing, and still no optimal solution to fully use the segment length of each corner while eliminating the overlaps. To optimally eliminate the overlaps and smooth the transition curve curvature in real time, a symmetrical non-uniform rational B-spline (NURBS) curve transition based on look ahead optimal method is proposed in this paper, by scanning a set of unconstrained pre-cornering transition curve information, analysing the overlap type and backward determining the optimal transition length with curvature extreme smoothness in consideration, thus fully use the linear segment length of each corner and fully increasing the feedrate at the corners. G 2 continuity, analytical expression of the curvature extreme, approximation error constraint, and real-time performance are considered simultaneously in this paper. Simulation and real machining experiments are made to compare with the existing symmetrical rounding algorithms, the results show that the proposed method has a significant curvature decrease of 17.64% and 4.44% improvement of efficiency, and the curvature distribution of the adjacent curves are balanced, thus improved the machining velocity smoothness. In addition, the real machining experiment results validate the proposed method can work well in 125 μs real-time control period CNC system. [ABSTRACT FROM AUTHOR]

The main aim of this paper is to propose new mathematical models for simulation of biosensors and to construct and investigate discrete methods for the efficient solution of the obtained systems of nonlinear PDEs. The classical linear diffusion operators are substituted with nonlocal fractional powers of elliptic operators. The splitting type finite volume scheme is used as a basic template for the introduction of new mathematical models. Therefore the accuracy of the splitting scheme is investigated and compared with the symmetric Crank-Nicolson scheme. The dependence of the approximation error on the regularity of the solution is investigated. Results of computational experiments for different values of fractional parameters are presented and analysed. [ABSTRACT FROM AUTHOR]

B-spline curve approximation is widely used for fitting linear toolpaths to improve machining quality and efficiency in CNC machining. For a high-quality smoothing method, the control of both approximation error and curve curvature needs to be taken into account. To reduce the maximum curve curvature while meeting the precision requirements, a B-spline approximation scheme with tool tip position adjustment is proposed in this paper. Toolpaths are first divided into several subdivisions according to the discrete curvature of each tool tip point. For subdivisions that need adjustment, tool tip positions are adjusted to minimize the maximum discrete curvature. An existing approximation method named energy-term-incorporated progressive and iterative approximation for least square fitting (ELSPIA) is selected and improved to fit the adjusted toolpaths and lower the chord errors. For improving the numerical stability of the ELSPIA method, the way of searching appropriate foot point parameters is discussed in this paper. Deviation expansion factors of tooltip points are also defined to make the ELSPIA method suitable for fitting the adjusted toolpaths. Both simulations and experimental studies are conducted to prove that the proposed method can significantly decrease the maximum curvature of fitted B-spline curves and improve the machining efficiency without exceeding the tolerance. For example, experimental results show that for the tested butterfly and rabbit toolpaths, the proposed method can improve the machining efficiency by 2.61% and 2.37%, compared with the ELSPIA method without tool tip position adjustment. [ABSTRACT FROM AUTHOR]

Ground-based multiple-input multiple-output synthetic aperture radar (MIMO-SAR) is a new type of deformation monitoring sensor that has the advantages of no mechanical motion and fast echo acquisition. Ground-based MIMO-SAR can significantly improve the data rate of deformation monitoring. In this paper, a fast imaging algorithm tailored for ground-based MIMO-SAR data is proposed, which can be applied in both far-field and near-field scenarios. First, the phase center approximation error of the non-collinear array in the near field is analyzed. Then, a fast imaging algorithm based on geometric transformation for the coherent synthesis of subimages is put forward. The algorithm uses the geometric transformation to convert the subaperture imaging results into the full aperture coordinate system, which avoids the point-by-point interpolation calculation and further reduces the computational cost of the subimage coherent synthesis algorithm. Simulations and experiments show that the algorithm can achieve high-precision focusing imaging, and its operation efficiency is significantly improved compared with the algorithm based on interpolation. [ABSTRACT FROM AUTHOR]

An interesting problem in descriptive geometry is the unfolding of the non-developable surfaces of revolution. In this paper we start from the two classic methods of approximate development of a sphere: the gore method and the zone method. For each of the two methods, we study the errors of approximation. It is considered an approximate development of sphere using gore method, in 3 variants, using successively: 4 meridian (vertical) planes (resulting 8 gores), 5 meridian planes (10 gores) and 6 meridian planes (12 gores). Also for the same sphere, the approximate development is obtained using successively: 7 level planes (resulting 8 zones), 9 level planes (10 zones) and 11 level planes (12 zones). For every variant of development, the error is calculated by comparing the area of approximate development and the theoretical area of the sphere. A computerized method based on Maple procedures is used. In the paper there is also a comparison between the errors of the two methods (gore method and zone method). [ABSTRACT FROM AUTHOR]

The main issue we are studying in this paper is that of aggregation maps, which refers to the process of combining various input values into a single output. We apply aggregated special maps on Mittag-Leffler-type functions in one parameter to get diverse approximation errors for fractionalorder systems in Hilfer sense using an optimal method. Indeed, making use of various well-known special functions that are initially chosen, we establish a new class of matrix-valued fuzzy controllers to evaluate maximal stability and minimal error. An example is given to illustrate the numerical results by charts and tables. [ABSTRACT FROM AUTHOR]

As we know, feedforward neural networks (FNNs) with sigmoidal activation function are universal approximators. Theoretically, for any continuous function defined on a compact set, there exists an FNN such that the FNN can approximate the function with arbitrary accuracy, which constitutes a theoretical guarantee that FNN can be used as an efficient learning machine. This paper addresses the construction and approximation for FNNs. We construct an FNN with sigmoidal activation function and estimate its approximation error. In particular, an inverse theorem of the approximation is established, which implies the equivalence characterization theorem of the approximation and reveals the relationship between the topological structure of the FNN and its approximation ability. As keys in this study, the concepts of modulus of continuity of function, K-functional, and their relationship are utilized, and two Bernstein-type inequalities are established. [ABSTRACT FROM AUTHOR]

Folklore suggests that policy gradient can be more robust to misspecification than its relative, approximate policy iteration. This paper studies the case of state-aggregated representations, in which the state space is partitioned and either the policy or value function approximation is held constant over partitions. This paper shows a policy gradient method converges to a policy whose regret per period is bounded by ϵ, the largest difference between two elements of the state-action value function belonging to a common partition. With the same representation, both approximate policy iteration and approximate value iteration can produce policies whose per-period regret scales as ϵ / (1 − γ) , where γ is a discount factor. Faced with inherent approximation error, methods that locally optimize the true decision objective can be far more robust. This paper was accepted by Hamid Nazerzadeh, data science. Supplemental Material: Data are available at https://doi.org/10.1287/mnsc.2023.4788. [ABSTRACT FROM AUTHOR]

In this paper it is shown, that if a possibly inhomogeneous Markov chain with continuous time and finite state space is weakly ergodic and all the entries of its intensity matrix are locally integrable, then, using available results from the perturbation theory, its time-dependent probability characteristics can be approximately obtained from another Markov chain, having piecewise constant intensities and the same state space. The approximation error (the taxicab distance between the state probability distributions) is provided. It is shown how the Cauchy operator and the state probability distribution for an arbitrary initial condition can be calculated. The findings are illustrated with the numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, a Szasz-Favard-Mirakyan operator is exploited for chaos synchronization of a master-slave system. The universal approximation feature asset lets in Szasz-Favard-Mirakyan operators for approximating uncertainties, including un-modeled dynamics and disturbances. The above subject is considered in detail in this investigation. It is confirmed that the synchronization/approximation errors are uniformly bounded and stable if the Szasz-Favard-Mirakyan operators are applied as the regressors. Additionally, it has been presumed that the synchronization's error rate is not available, and an observer will be designed for its estimation. The Duffing–Holmes oscillator is examined as the computer-generated chaotic framework with the target of examining the functioning of the recommended synchronization observer-based controller. The outcomes are compared with an effective approximation-based control strategy. Unlike Chebyshev Neural Network approximators in which the system's inputs states are needed to define the regressor vector and approximate uncertainties, the suggested Szasz-Favard-Mirakyan operators–based strategy is independent of the system states for constructing the regressor vector. [ABSTRACT FROM AUTHOR]

Off-policy learning, where the goal is to learn about a policy of interest while following a different behavior policy, constitutes an important class of reinforcement learning problems. It is well-known that emphatic temporal-difference (TD) learning is a pioneering off-policy reinforcement learning method involving the use of the followon trace. Although the gradient emphasis learning (GEM) algorithm has recently been proposed to fix the problems of unbounded variance and large emphasis approximation error introduced by the followon trace from the perspective of stochastic approximation. This approach, however, is limited to a single gradient-TD2-style update instead of considering the update rules of other GTD algorithms. Overall, it remains an open question on how to better learn the emphasis for off-policy learning. In this paper, we rethink GEM and investigate introducing a novel two-time-scale algorithm called TD emphasis learning with gradient correction (TDEC) to learn the true emphasis. Further, we regularize the update to the secondary learning process of TDEC and obtain our final TD emphasis learning with regularized correction (TDERC) algorithm. We then apply the emphasis estimated by the proposed emphasis learning algorithms to the value estimation gradient and the policy gradient, respectively, yielding the corresponding emphatic TD variants for off-policy evaluation and actor-critic algorithms for off-policy control. Finally, we empirically demonstrate the advantage of the proposed algorithms on a small domain as well as challenging Mujoco robot simulation tasks. Taken together, we hope that our work can provide new insights into the development of a better alternative in the family of off-policy emphatic algorithms. [ABSTRACT FROM AUTHOR]

The paper presents a model of structured objects in a grayscale or color image, described by means of optimal piecewise constant image approximations, which are characterized by the minimum possible approximation errors for a given number of pixel clusters, where the approximation error means the total squared error. An ambiguous image is described as a non-hierarchical structure but is represented as an ordered superposition of object hierarchies, each containing at least one optimal approximation in g0 = 1, 2,..., etc., colors. For the selected hierarchy of pixel clusters, the objects-of-interest are detected as the pixel clusters of optimal approximations, or as their parts, or unions. The paper develops the known idea in cluster analysis of the joint application of Ward's and K-means methods. At the same time, it is proposed to modernize each of these methods and supplement them with a third method of splitting/merging pixel clusters. This is useful for cluster analysis of big data described by a convex dependence of the optimal approximation error on the cluster number and also for adjustable object detection in digital image processing, using the optimal hierarchical pixel clustering, which is treated as an alternative to the modern informally defined "semantic" segmentation. [ABSTRACT FROM AUTHOR]

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution. [ABSTRACT FROM AUTHOR]