Search

This paper describes a design for a least mean square error estimator in discrete time systems where the components of the state vector, in measurement equation, are corrupted by different multiplicative noises in addition to observation noise. We show how known results can be considered a particular case of the algorithm stated in this paper. [ABSTRACT FROM AUTHOR]

The problem of stochastic stability is investigated for a class of neural networks with both Markovian jump parameters and continuously distributed delays. The jumping parameters are modeled as a continuous-time, finite-state Markov chain. By constructing appropriate Lyapunov-Krasovskii functionals, some novel stability conditions are obtained in terms of linear matrix inequalities (LMIs). The proposed LMI-based criteria are computationally efficient as they can be easily checked by using recently developed algorithms in solving LMIs. A numerical example is provided to show the effectiveness of the theoretical results and demonstrate the LMI criteria existed in the earlier literature fail. The results obtained in this paper improve and generalize those given in the previous literature. [ABSTRACT FROM AUTHOR]

In mathematical modeling of economic problems, it is common to assume that economic laws influence the process and analyze the type of solution obtained. Sometimes these laws have unknown parameters and they worth studying if these parameters can be determined. In this paper, a structured system is considered and the identifiability is analyzed. In case the parameters can be uniquely identified, an algorithm for obtaining the model parameters is presented and, finally, the existence of a balanced growth solution is studied. [ABSTRACT FROM AUTHOR]

This paper proposes an efficient method to solve the optimal power flow problem in power systems using Particle Swarm Optimization (PSO). The objective of the proposed method is to find the steady-state operating point which minimizes the fuel cost, while maintaining an acceptable system performance in terms of limits on generator power, line flow, and voltage. Three different inertia weights, a constant inertia weight (CIW), a time-varying inertia weight (TVIW), and global-local best inertia weight (GLbestIW), are considered with the particle swarm optimization algorithm to analyze the impact of inertia weight on the performance of PSO algorithm. The PSO algorithm is simulated for each of the method individually. It is observed that the PSO algorithm with the proposed inertia weight yields better results, both in terms of optimal solution and faster convergence. The proposed method has been tested on the standard IEEE 30 bus test system to prove its efficacy. The algorithm is computationally faster, in terms of the number of load flows executed, and provides better results than other heuristic techniques. [ABSTRACT FROM AUTHOR]

This paper presents a novel optimization model called hierarchical swarm optimization (HSO), which simulates the natural hierarchical complex system from where more complex intelligence can emerge for complex problems solving. This proposed model is intended to suggest ways that the performance of HSO-based algorithms on complex optimization problems can be significantly improved. This performance improvement is obtained by constructing the HSO hierarchies, which means that an agent in a higher level swarm can be composed of swarms of other agents from lower level and different swarms of different levels evolve on different spatiotemporal scale. A novel optimization algorithm (named PS²O), based on the HSO model, is instantiated and tested to illustrate the ideas of HSO model clearly. Experiments were conducted on a set of 17 benchmark optimization problems including both continuous and discrete cases. The results demonstrate remarkable performance of the PS²O algorithm on all chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a strategy for designing a robust discrete-time adaptive controller for stabilizing linear time-invariant (LTI) continuous-time dynamic systems. Such systems may be unstable and noninversely stable in the worst case. A reduced-order model is considered to design the adaptive controller. The control design is based on the discretization of the system with the use of a multirate sampling device with fast-sampled control signal. A suitable on-line adaptation of the multirate gains guarantees the stability of the inverse of the discretized estimated model, which is used to parameterize the adaptive controller. A dead zone is included in the parameters estimation algorithm for robustness purposes under the presence of unmodeled dynamics in the controlled dynamic system. The adaptive controller guarantees the boundedness of the system measured signal for all time. Some examples illustrate the efficacy of this control strategy. [ABSTRACT FROM AUTHOR]

A filled function approach is proposed for solving a non-smooth unconstrained global optimization problem. First, the definition of filled function in Zhang2009 for smooth global optimization is extended to non-smooth case and a new one is put forwarded. Then, a novel filled function is proposed for non-smooth the global optimization and a corresponding non-smooth algorithm based on the filled function is designed. At last, a numerical test is made. The computational results demonstrate that the proposed approach is efficient and reliable. [ABSTRACT FROM AUTHOR]