Achieving high performance optimization algorithms for embedded applications can be very challenging, particularly when several requirements such as high accuracy computations, short elapsed time, area cost, low power...
详细信息
Achieving high performance optimization algorithms for embedded applications can be very challenging, particularly when several requirements such as high accuracy computations, short elapsed time, area cost, low power consumption and portability must be accomplished. This paper proposes a hardware implementation of the Particle Swarm Optimization algorithm with passive congregation (HPPSOpc), which was developed using several floating-point arithmetic libraries. The passive congregation is a biological behavior which allows the swarm to preserve its integrity, balancing between global and local search. The HPPSOpc architecture was implemented on a Virtex5 FPGA device and validated using two multimodal benchmark problems. Synthesis, simulation and execution time results demonstrates that the passive congregation approach is a low cost solution for solving embedded optimization problems with a high performance.
Nowadays, there are a great number of universities and organizations working in e-learning solutions. One of most well-known is the learning management system or LMS that allow displaying theoretical content in an org...
详细信息
Nowadays, there are a great number of universities and organizations working in e-learning solutions. One of most well-known is the learning management system or LMS that allow displaying theoretical content in an organized and controlled way. In some jobs and studies it is necessary that the student get a practical knowledge as well as a theoretical knowledge. To obtain this practical knowledge, the universities and organizations are developing virtual labs and Web labs. At these moments the LMS and Web labs are working independently. We are designing and developing a new architecture allowing the integration of the LMS with different Web labs from different universities. This architecture must allow the student, teachers and administrators to use the LMS's services and virtual labs as if he was working with the same software..
Abstract This work investigates the topic of solving Bilinear Matrix Inequalities (BMIs) problems in the optimal control design field, using successive resolutions of properly defined Linear Matrix Inequalities (LMIs)...
详细信息
Abstract This work investigates the topic of solving Bilinear Matrix Inequalities (BMIs) problems in the optimal control design field, using successive resolutions of properly defined Linear Matrix Inequalities (LMIs). This technique can be described as an ‘LMI-based coordinate descent method'. Indeed the original (BMI) problem is solved independently for each coordinate at each step using a LMI optimization, while the other coordinate is fixed. No method based on this idea has been formally proved to converge to the global optimum of the BMI problem, or a local optimum in general. This will be discussed using relevant results both from the mathematical programming and control design points of view. This discussion supports the algorithm proposed here which, thanks to a particular change of variables, leads to sequences of improving solutions. Also emphasized is a second improvement important to avoid in practice early convergence to suboptimal solutions instead of local optima. The control framework used is that of optimal output feedback design for linear time invariant (LTI) systems. An example using a random plant is drawn to illustrate the typical effectiveness of the algorithm.
In this paper a comparative study on the use of extended and unscented Kalman filters for state estimation in nonlinear systems is presented. This is done to reveal the differences, and congruencies, in filters' s...
详细信息
Abstract We propose an algorithm for optimal input design in nonlinear stochastic dynamic systems. The approach relies on minimizing a function of the covariance of the parameter estimates of the system with respect t...
Abstract We propose an algorithm for optimal input design in nonlinear stochastic dynamic systems. The approach relies on minimizing a function of the covariance of the parameter estimates of the system with respect to the input. The covariance matrix is approximated using a joint likelihood function of hidden states and measurements, and a combination of state filters and smoothers. The input is parametrized using an autoregressive model. The proposed approach is illustrated through a simulation example.
In this paper, we consider identifying Auto Regressive with eXternal input (ARX) models for both Linear Time-Invariant (LTI) and Linear Time-Variant (LTV) systems. We aim at doing the identification from the smallest ...
详细信息
ISBN:
(纸本)9781612848006
In this paper, we consider identifying Auto Regressive with eXternal input (ARX) models for both Linear Time-Invariant (LTI) and Linear Time-Variant (LTV) systems. We aim at doing the identification from the smallest possible number of observations. This is inspired by the field of Compressive Sensing (CS), and for this reason, we call this problem Compressive System Identification (CSI). In the case of LTI ARX systems, a system with a large number of inputs and unknown input delays on each channel can require a model structure with a large number of parameters, unless input delay estimation is performed. Since the complexity of input delay estimation increases exponentially in the number of inputs, this can be difficult for high dimensional systems. We show that in cases where the LTI system has possibly many inputs with different unknown delays, simultaneous ARX identification and input delay estimation is possible from few observations, even though this leaves an apparently ill-conditioned identification problem. We discuss identification guarantees and support our proposed method with simulations. We also consider identifying LTV ARX models. In particular, we consider systems with parameters that change only at a few time instants in a piecewise-constant manner where neither the change moments nor the number of changes is known a priori. The main technical novelty of our approach is in casting the identification problem as recovery of a block-sparse signal from an underdetermined set of linear equations. We suggest a random sampling approach for LTV identification, address the issue of identifiability and again support our approach with illustrative simulations.
This paper presents a new method to estimate the relative motion of a vehicle from images of a single camera. The biggest problem in visual motion estimation is data association; matched points contain many outliers t...
详细信息
This paper presents a new method to estimate the relative motion of a vehicle from images of a single camera. The biggest problem in visual motion estimation is data association; matched points contain many outliers that must be detected and removed so that the motion can be estimated accurately. A very established method for robust motion estimation in the presence of outliers is the five-point RANSAC algorithm. Five-point RANSAC operates by generating motion hypotheses from randomly-sampled minimal sets of five-point correspondences. These hypotheses are then tested against all data points and the motion hypothesis that after a given number of iterations returns the largest number of inliers is taken as the solution to the problem. A typical drawback of RANSAC is that the number of iterations required to find a suitable solution grows exponentially with the number of outliers, often requiring thousands of iterations for typical data from urban environments. Another problem is that - due to its random nature - sometimes the found solution is not the “best” solution to the motion estimation problem. In this paper, we describe an algorithm for relative motion estimation in the presence of outliers, which does not rely on RANSAC. Contrary to RANSAC, motion hypotheses are not generated from randomly-sampled point correspondences, but from a “proposal distribution” that is built by exploiting the vehicle non-holonomic constraints. We show that not only is the proposed algorithm significantly faster than RANSAC, but that the returned solution may also be better in that it favors the underlying motion model of the vehicle, thus overcoming the typical limitations of RANSAC. Additionally, the proposed algorithm provides the likelihood of the motion estimate, which can be very useful in all those applications where a probability distribution of the position of the vehicle is required (e.g., SLAM). Finally, the performance of the proposed method is compared to that of the sta
Technical characteristics of an innovative prototype e-learning platform using satellite communications for control theory courses are exposed. A detailed account of all necessary tools and mechanisms is presented ena...
详细信息
Technical characteristics of an innovative prototype e-learning platform using satellite communications for control theory courses are exposed. A detailed account of all necessary tools and mechanisms is presented enabling real time text, and audio/video based communication between tutors and learners. The provided end-user driven services include: a virtual classroom, offline operation, sharing of applications, private/public chatting, audio/video streaming. In addition a concise description of the pilot network architecture depending on the DVB-RCS standard is presented justifying further the choice of the communications platform. Simulation results concerning the teaching of fundamental issues in Networked control Theory within the proposed architecture are provided. Connections with hybrid configurations such as wireless terrestrial broadband technologies (DVB-RCS/ WiMAX, DVB-RCS/Wi-Fi) are further analyzed and justified. Finally some conclusive anticipated directions related to the future of modern control courses education in connection with state of art technological advances are explored.
Synthesis of musical instruments or human voice is a time consuming process which requires theoretical and experimental knowledge about the synthesis engine. Commonly, performers need to deal with synthesizer interfac...
详细信息
Synthesis of musical instruments or human voice is a time consuming process which requires theoretical and experimental knowledge about the synthesis engine. Commonly, performers need to deal with synthesizer interfaces and a process of trial and error for creating musical sounds similar to a target sound. This drawback can be overcome by adjusting automatically the synthesizer parameters using optimization algorithms. In this paper a hybrid particle swarm optimization (PSO) algorithm is proposed to solve the frequency modulation (FM) matching synthesis problem. The proposed algorithm takes advantage of a shuffle process for exchanging information between particles and applies the selective passive congregation and the opposition-based learning approaches to preserve swarm diversity. Both approaches for injecting diversity are based on simple operators, preserving the easy implementation philosophy of the particle swarm optimization. The proposed hybrid particle swarm optimization algorithm was validated for a three-nested FM synthesizer, which represents a 6-dimensional multimodal optimization problem with strong epistasis. Simulation results revealed that the proposed algorithm presented promising results in terms of quality of solutions.
暂无评论