共查询到20条相似文献，搜索用时 46 毫秒
1.
This paper provides the closed form analytical solution to the problem of minimizing the material volume required to support a given set of bending loads with a given number of discrete structural members, subject to material yield constraints. The solution is expressed in terms of two variables, the aspect ratio, ρ-1, and complexity of the structure, q (the total number of members of the structure is equal to q(q+1)). The minimal material volume (normalized) is also given in closed form by a simple function of ρ and q, namely, V=q(ρ-1/q-ρ1/q). The forces for this nonlinear problem are shown to satisfy a linear recursive equation, from node-to-node of the structure. All member lengths are specified by a linear recursive equation, dependent only on the initial conditions involving a user specified length of the structure. The final optimal design is a class 2 tensegrity structure. Our results generate the 1904 results of Michell in the special case when the selected complexity q approaches infinity. Providing the optimum in terms of a given complexity has the obvious advantage of relating complexity q to other criteria, such as costs, fabrication issues, and control. If the structure is manufactured with perfect joints (no glue, welding material, etc.), the minimal mass complexity is infinite. But in the presence of any joint mass, the optimal structural complexity is finite, and indeed quite small. Hence, only simple structures (low complexity q) are needed for practical design. 相似文献
2.
In this work a procedure for obtaining polytopic λ-contractive sets for Takagi–Sugeno fuzzy systems is presented, adapting well-known algorithms from literature on discrete-time linear difference inclusions (LDI) to multi-dimensional summations. As a complexity parameter increases, these sets tend to the maximal invariant set of the system when no information on the shape of the membership functions is available. λ-contractive sets are naturally associated to level sets of polyhedral Lyapunov functions proving a decay-rate of λ. The paper proves that the proposed algorithm obtains better results than a class of Lyapunov methods for the same complexity degree: if such a Lyapunov function exists, the proposed algorithm converges in a finite number of steps and proves a larger λ-contractive set. 相似文献
3.
采用Gröbner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Gröbner基.本文引入一个有效提升算法来计算这组Gröbner基.当用straight line program模型对整个计算过程进行复杂度分析时,可以把计算开销控制在多项式时间内. 相似文献
4.
提出了一种基于迭代自适应机制的改进算法,有效地缩减了分层置信传播算法(HBP)的计算时间.传统HBP计算时间随指定的迭代上限增加而线性增长.为此引入消息收敛的条件判断,在迭代上限相同情况下,减少算法的迭代次数,缩减整体迭代时间.实验表明,与传统HBP相比,该方法计算时间缩减了38％以上,计算时间对整体迭代上限不敏感.该方法可以应用于使用HBP算法的其他方法. 相似文献
5.
This study presents a model for predicting the low-cycle fatigue life of steel reinforcing bars using Artificial Neural Network (ANN). A Radial Basis Function (RBF) artificial neural network topology with two additional hidden layers and four neurons (processing elements) in each of these layers is used. The input parameters for the network are the maximum tensile strain (εs,max) and the strain ratio (R) and the output of the ANN is the number of cycles to fatigue failure (Nf). Low-cycle fatigue tests were conducted by the authors in a previous study for different types of steel reinforcing bars subjected to different strain amplitudes and at different strain ratios. The data resulted from these tests were used to train and test the ANN. It is observed that the ANN prediction of low-cycle fatigue life of steel reinforcing bars is within ±2 cycles of the experimental results for the majority of the test data. A parametric study had been carried out to investigate the effect of maximum strain and strain ratio on the fatigue life of steel reinforcing bars. It is concluded that both the strain ratio and the maximum strain have significant effect on the low-cycle fatigue life of such bars, especially at low values of maximum strain and their effect should be considered in both analysis and design. Other observations and conclusions were also drawn. 相似文献
6.
采用Gr(o)bner基方法,可以把一个在有限群作用下不变的多项式写成不变环的生成元的多项式.核心问题是如何有效地计算这个正维不变理想的Gr(o)bner基.本文引入一个有效提升算法来计算这组Gr(o)bner基.当用straight line program模型对整个计算过程进行复杂度分析时,可以把计算开销控制在多项式时间内. 相似文献
7.
K.B. Datta 《Journal of The Franklin Institute》1980,309(2):103-123
8.
《Journal of The Franklin Institute》2022,359(2):1713-1731
Optimized extreme learning machine (OELM) has been shown to achieve high performance on classification problems due to its simple dual form. This paper presents a predictor-corrector affine scaling interior point method to exploit the dual problem of OELM. This method aims to combine a predictor step with a corrector step for determining the descent Newton direction. At each iteration, the predictor step focuses on the complementarity gap reduction and computes an affine scaling direction to estimate the extent of the reduction of complementarity gap, while the corrector step traces the central path towards the optimal solution by high order approximation, and computes the corresponding center direction. Then, the Newton direction is combined by using both two directions, and the iteration sequence of interior feasible points converges to the optimal solution. Extensive experimental evaluations on various benchmark datasets show that the proposed algorithms outperform other interior point-based or active set-based algorithms. Moreover, they are able to converge in fewer iterations, which are independent of kernel type, dataset size and dimensionality. 相似文献
9.
《Journal of The Franklin Institute》2023,360(2):1226-1251
For a kind of linear discrete-time-invariant multi-input-multi-output systems with a higher-order relative degree that repetitively operates within a finite time length, the paper exploits a Markov parameters identification method by making use of the multi-operation inputs and outputs obeying a criterion. Simultaneously, an adaptive iterative learning control scheme is architected by formulating the compensator with the sequentially identified Markov parameters and the tracking error in minimizing a performance index consisting of the quadratic tracking error of the next iteration and the compensation cost. Algebraic manipulations including the singular value decomposition of a matrix and the eigenvalues estimation conduct that the identification error of the Markov parameters is monotonically declining as the iteration goes on and a smaller identification ratio in the criterion delivers a faster decline rate. Meanwhile, a rigorous derivation achieves that under the assumption that the initial identification error is within an appropriate range the tracking error is monotonously convergent for the case when the relative degree is unit whilst the tracking error is asymptotically bounded for a positive level for the case where the relative degree is higher. Numerical simulations illustrate the validity and efficiency. 相似文献
10.
A number of numerical codes have been written for the problem of finding the circle of smallest radius in the Euclidean plane that encloses a finite set P of points, but these do not give much insight into the geometry of this circle. We investigate geometric properties of the minimal circle that may be useful in the theoretical analysis of applications. We show that a circle C enclosing P is minimal if and only if it is rigid in the sense that it cannot be translated while still enclosing P. We show that the center of the minimal circle is in the convex hull of P. We use this rigidity result and an analysis of the case of three points to find sharp estimates on the diameter of the minimal circle in terms of the diameter of P. 相似文献
11.
In a typical inverted-file full-text document retrieval system, the user submits queries consisting of strings of characters combined by various operators. The strings are looked up in a text-dictionary which lists, for each string, all the places in the database at which it occurs. It is desirable to allow the user to include in his query truncated terms such as X1, 1X, 1X1, or X1Y, where X and X are specified strings and 1 is a variable-length-don't-care character, that is, 1 represents an arbitrary, possibly empty, string. Processing these terms involves finding the set of all words in the dictionary that match these patterns. How to do this efficiently is a long-standing open problem in this domain.In this paper we present a uniform and efficient approach for processing all such query terms. The approach, based on a “permuted dictionary” and a corresponding set of access routines, requires essentially one disk access to obtain from the dictionary all the strings represented by a truncated term, with negligible computing time. It is thus well suited for on-line applications. Implementation is simple, and storage overhead is low: it can be made almost negligible by using some specially adapted compression techniques described in the paper.The basic approach is easily adaptable for slight variants, such as fixed (or bounded) length don't-care characters, or more complex pattern matching templates. 相似文献
12.
We classify gapped topological superconducting (TSC) phases of one-dimensional quantum wires with local magnetic symmetries, in which the time-reversal symmetry is broken, but its combinations with certain crystalline symmetries, such as , , and , are preserved. Our results demonstrate that an equivalent BDI class TSC can be realized in the or superconducting wire, which is characterized by a chiral Zc invariant. More interestingly, we also find two types of totally new TSC phases in the and superinducting wires, which are beyond the known AZ class, and are characterized by a helical Zh invariant and Zh⊕Zc invariants, respectively. In the Zh TSC phase, Z pairs of Majorana zero modes (MZMs) are protected at each end. In the case, the MZMs can be either chiral or helical, and even helical-chiral coexisting. The minimal models preserving or symmetry are presented to illustrate their novel TSC properties and MZMs. 相似文献
13.
The problem of finite-time consensus of linear multi-agent systems subject to input saturation is investigated and two control protocols are presented for leaderless and leader-following cases, respectively. The leaderless multi-agent systems with proposed non-smooth protocol can achieve consensus in finite time. The consensus protocol designed for leader-following case with directed topology can solve the finite-time consensus problem, where a priori constraint is adopted to deal with input saturation. Furthermore, the settling time is explicitly derived using finite-time Lyapunov theory. Finally, the effectiveness of the theoretical results is illustrated with several numerical simulations. 相似文献
14.
《Journal of The Franklin Institute》2022,359(12):5960-5990
This paper proposes a fuzzy non-fragile finite frequency H∞ control algorithm for the active suspension system (ASS) of the electric vehicles driven by in-wheel motors with an advanced dynamic vibration absorber (DVA). Firstly, an interval type-2 Takagi-Sugeno (T-S) fuzzy model is established to formulate the nonlinear time-delay ASS with the uncertainties of sprung mass, unsprung mass, suspension stiffness, and tire stiffness. Secondly, a differential evolution (DE) algorithm is adopted to optimize the parameters of vehicle suspension and DVA. Thirdly, a non-fragile finite frequency H∞ control controller is developed under the consideration of controller perturbation and input delay to improve the comprehensive performance of the chassis under the finite frequency external disturbances. Finally, simulation tests are carried out to verify the effectiveness of the proposed controller. 相似文献
15.
《Journal of The Franklin Institute》2022,359(11):5798-5826
In this paper, we propose a continuous finite-time convergence finite impulse response (FIR) fixed-lag smoother using multiple, or more than two, computationally efficient IIR filters. We describe the optimal design to improve and further optimize an existing scheme based on two IIR filters. Multiple IIR filters are utilized to minimize the estimation error variance of the proposed smoother under the condition that its estimate converges to a real state in a finite time. As the number of adopted IIR filters increases, the proposed smoother improves and its performance approaches that of the heavy computational fixed-lag minimum variance FIR smoother. By choosing the appropriate number of IIR filters, we can balance the trade-off between improved accuracy and increased implementation costs. To realize the optimal design of IIR filters with the limited number of IIR filters, their gains are determined using a particle swarm optimization scheme. Numerical examples are used to show that with an increasing number of IIR filters, the estimation error variance decreases monotonically while guaranteeing finite-time convergence. 相似文献
16.
《Journal of The Franklin Institute》2019,356(13):6946-6967
This paper investigates a Q-learning scheme for the optimal consensus control of discrete-time multiagent systems. The Q-learning algorithm is conducted by reinforcement learning (RL) using system data instead of system dynamics information. In the multiagent systems, the agents are interacted with each other and at least one agent can communicate with the leader directly, which is described by an algebraic graph structure. The objective is to make all the agents achieve synchronization with leader and make the performance indices reach Nash equilibrium. On one hand, the solutions of the optimal consensus control for multiagent systems are acquired by solving the coupled Hamilton–Jacobi–Bellman (HJB) equation. However, it is difficult to get analytical solutions directly of the discrete-time HJB equation. On the other hand, accurate mathematical models of most systems in real world are hard to be obtained. To overcome these difficulties, Q-learning algorithm is developed using system data rather than the accurate system model. We formulate performance index and corresponding Bellman equation of each agent i. Then, the Q-function Bellman equation is acquired on the basis of Q-function. Policy iteration is adopted to calculate the optimal control iteratively, and least square (LS) method is employed to motivate the implementation process. Stability analysis of proposed Q-learning algorithm for multiagent systems by policy iteration is given. Two simulation examples are experimented to verify the effectiveness of the proposed scheme. 相似文献
17.
18.
19.
I.S. Sadek 《Journal of The Franklin Institute》2011,348(7):1656-1667
The present paper deals with an optimal boundary control problem in which the process of systems under consideration is governed by a linear parabolic partial differential equation over an infinite time interval. The objective of the paper is to determine the optimal boundary control that minimize a given energy-based performance measure. The performance measure is specified as a quadratic functional of displacement and a suitable penalty term involving the boundary controls. In order to determine the optimal boundary controls, the problem with boundary controls are converted into a problem with distributed controls. The modal space technique is then used to reduce the system into the optimal control of time invariant lumped parameter system. The associated system of uncoupled first order initial value problems is solved in terms of controllers. Next step deals with the computation of the control and trajectory of the linear time-invariant lumped parameter. For this we approximate the controllers by a finite number of orthogonal exponential zero-interpolants over the interval [0,∞). The resultant performance index after using the optimality condition leads to a system of linear algebraic equations. The suggested technique is easy to implement on digital computer. We provide a numerical example to demonstrate the applicability and efficiency of the proposed approach. 相似文献
20.
The paper deals with the optimal control of a distributed host structure consisting of two elastically connected complex continuous double-string system and subjected to certain excitation load. Investigation of the behavior of such system is of great theoretical and practical importance. A technique is proposed to actively damp out the undesired vibrations in the structures by a combination of applied actuators and displacement feedback gains. Two performance measures, involving energies at the terminal time as well as applied and feedback control efforts, are introduced. The optimality conditions of the applied actuators are derived by using the method of eigenfunction expansion and calculus of variations. The feedback parameters are numerically determined from the solution of a minimization problem. The proposed approach is illustrated by a numerical example involving a system which consists of two strings subjected to a continuous load. 相似文献