This paper extends our earlier work on continuous-time approximation of time-delayed dynamical systems by introducing a lowpass filter-based approach. The proposed method substantially improves the accuracy of predictions in frequency as well as time domain. It is applicable to linear and nonlinear dynamical systems, and can be readily incorporated with real-time controls. In the paper, we first review the mathematics literature on numerical methods for delayed differential equations including the equivalent abstract Cauchy problem. We show that the mathematics work provides a solid foundation for several well-studied numerical methods for time-delayed dynamical systems in the engineering literature. Examples are presented to show the accuracy of the pole prediction for linear systems, and temporal responses for linear and nonlinear systems. Furthermore, we discuss the bandwidth issue of the method, and demonstrate that many extraneous poles introduced by the discrete approximation of the time-delayed system that do not match any exact poles of the system are still very important and contribute to the accuracy of temporal responses.
An iterative compatible cell mapping (CCM) method with the digraph theory is presented in this paper to compute the global invariant manifolds of dynamical systems with high precision and high efficiency. The accurate attractors and saddles can be simultaneously obtained. The simple cell mapping (SCM) method is first used to obtain the periodic solutions. The results obtained by the generalized cell mapping (GCM) method are treated as a database. The SCM and GCM are compatible in the sense that the SCM is a subset of the GCM. The depth-first search algorithm is utilized to find the coarse coverings of global stable and unstable manifolds based on this database. The digraph GCM method is used if the saddle-like periodic solutions cannot be obtained with the SCM method. By taking this coarse covering as a new cell state space, an efficient iterative procedure of the CCM method is proposed by combining sort, search and digraph algorithms. To demonstrate the effectiveness of the proposed method, the classical Hénon map with periodic or chaotic saddles is studied in far more depth than reported in the literature. Not only the global invariant manifolds, but also the attractors and saddles are computed. The computational efficiency can be improved by up to 200 times compared to the traditional GCM method.
In this paper, we present a novel evolutionary algorithm for the computation of approximate solutions for multi-objective optimization problems. These solutions are of particular interest to the decision-maker as backup solutions since they can provide solutions with similar quality but in different regions of the decision space. The novel algorithm uses a subpopulation approach to put pressure towards the Pareto front while exploring promissory areas for approximate solutions. Furthermore, the algorithm uses an external archiver to maintain a suitable representation in both decision and objective space. The novel algorithm is capable of computing an approximation of the set of interest with good quality in terms of the averaged Hausdorff distance. We underline the statements on some academic problems from literature and an application in non-uniform beams.
Abstract An alternating efficient approach for predicting non-stationary response of randomly excited nonlinear systems is proposed by a combination of radial basis function neural network (RBFNN) and stochastic averaging method (SAM). First, the n-degree-of-freedom quasi-non-integrable-Hamiltonian (QNIH) system is reduced to a one-dimensional averaged Itô differential equation within the framework of SAM for QNIH. Subsequently, the associated Fokker–Planck–Kolmogorov (FPK) equation is solved with the RBFNN. Specifically, the solution of the associated FPK equation is expressed in a linear combination of a series of basis functions with time-correlation weights. These time-depended weights are solved by minimizing a loss function, which involves the residual of the differential equations and the constraint conditions. Three typical nonlinear systems are studied to verify the applicability of the developed scheme. Comparisons to the data generated by simulation technique indicate that the approach yields reliable results with high efficiency.
In this paper, we study a multi-objective optimal design of three different frame vibration control configurations and compare their performances in improving the lateral stability of a high-speed train bogie. The existence of the time-delay in the control system and its impact on the bogie hunting stability are also investigated. The continuous time approximation method is used to approximate the time-delay system dynamics and then the root locus curves of the system before and after applying control are depicted. The analysis results show that the three control cases could improve the bogie hunting stability effectively. But the root locus of low- frequency hunting mode of bogie which determinates the system critical speed is different, thus affecting the system stability with the increasing of speed. Based on the stability analysis at different bogie dynamics parameters, the robustness of the control case (1) is the strongest. However, the case (2) is more suitable for the dynamic performance requirements of bogie. For the case (1), the time-delay over 10 ms may lead to instability of the control system which will affect the bogie hunting stability seriously. For the case (2) and (3), the increasing time-delay reduces the hunting stability gradually over the high-speed range. At a certain speed, such as 200 km/h, an appropriate time-delay is favourable to the bogie hunting stability. The mechanism is proposed according to the root locus analysis of time-delay system. At last, the nonlinear bifurcation characteristics of the bogie control system are studied by the numerical integration methods to verify the effects of these active control configurations and the delay on the bogie hunting stability.
The airfoil/wing design is probably the most important part of an aircraft design. A practical aerodynamic design of airfoil requires optimal performance on a wide range of operating conditions. These requirements are often found to be conflicting and demand designer expertise for satisfactory results, not to mention the computational burden of the simulations. Although there exists many studies on direct and inverse design of airfoils, less attention has been paid to simultaneous consideration of multiple objectives. In this paper, a multi-objective optimal airfoil design procedure is presented. PARSEC parametrization method has been utilized to express the airfoil geometry in terms of twelve physical parameters. The aerodynamic performance is obtained by 2D panel method using XFOIL package. Multi-Objective Particle Swarm Optimization (MOPSO) algorithm has been applied for airfoil geometry design because it is efficient and keeps the diversity among the solution set. The objective functions and constraints are chosen to enhance the flight performance at takeoff, cruise, and landing conditions for a long range cargo aircraft. Objectives include maximization of lift to drag ratio (CL/CD), maximization of rate of change of lift to attack angle (dCL/dα) for having increased lift at takeoff/landing condition and minimization of pitching moment CM2. Two applied constraints are CL > CLmin at operating condition and thickness ≤ %25. Each evaluation is consist of finding the optimal operating angle of attack and reporting the corresponding objective values. The quality of the solution at various generations has been studied to guarantee the convergence of the solution. Like any other multi-objective optimization problem (MOP), the solution would be a set of Pareto optimal configurations. Although having multiple solutions gives us a better understanding of the problem, only one configuration should be chosen by the designer. A post processing technique is also used to help the decision maker to choose the most appropriate compromise in the solution set. The method is found to be effective in finding efficient set of airfoils. The simulation is also found to be effective because it can be done on a regular personal computer. It should be noticed that the method can be easily applied to other airfoil design applications by simply modifying the objective functions and the constraints.