Estimation and control of non-linear and hybrid systems with applications to air-to-air guidance

Issued as Progress report, and Final report, Project no. E-21-67

A computer algebra user interface manifesto

Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result even by amateurs. This wizard integrates ideas including: * flexible subexpression selection; * complete control over the ordering of variables and commutative operands, with well-chosen defaults; * interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level; * quick applicability tests to reduce the listing of inapplicable transformations; * using an organizing principle to order the alternatives in a helpful manner; * labeling quickly-computed alternatives in dialog boxes with a preview of their results, * using ellipsis elisions if necessary or helpful; * allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives or to return quickly to branches already visited; * allowing the user to accumulate more than one of the alternative forms; * integrating direct manipulation into the wizard; and * supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.Comment: 38 pages, 12 figures, to be published in Communications in Computer Algebr

Intelligent Computational Transportation

Transportation is commonplace around our world. Numerous researchers dedicate great efforts to vast transportation research topics. The purpose of this dissertation is to investigate and address a couple of transportation problems with respect to geographic discretization, pavement surface automatic examination, and traffic ow simulation, using advanced computational technologies. Many applications require a discretized 2D geographic map such that local information can be accessed efficiently. For example, map matching, which aligns a sequence of observed positions to a real-world road network, needs to find all the nearby road segments to the individual positions. To this end, the map is discretized by cells and each cell retains a list of road segments coincident with this cell. An efficient method is proposed to form such lists for the cells without costly overlapping tests. Furthermore, the method can be easily extended to 3D scenarios for fast triangle mesh voxelization. Pavement surface distress conditions are critical inputs for quantifying roadway infrastructure serviceability. Existing computer-aided automatic examination techniques are mainly based on 2D image analysis or 3D georeferenced data set. The disadvantage of information losses or extremely high costs impedes their effectiveness iv and applicability. In this study, a cost-effective Kinect-based approach is proposed for 3D pavement surface reconstruction and cracking recognition. Various cracking measurements such as alligator cracking, traverse cracking, longitudinal cracking, etc., are identified and recognized for their severity examinations based on associated geometrical features. Smart transportation is one of the core components in modern urbanization processes. Under this context, the Connected Autonomous Vehicle (CAV) system presents a promising solution towards the enhanced traffic safety and mobility through state-of-the-art wireless communications and autonomous driving techniques. Due to the different nature between the CAVs and the conventional Human- Driven-Vehicles (HDVs), it is believed that CAV-enabled transportation systems will revolutionize the existing understanding of network-wide traffic operations and re-establish traffic ow theory. This study presents a new continuum dynamics model for the future CAV-enabled traffic system, realized by encapsulating mutually-coupled vehicle interactions using virtual internal and external forces. A Smoothed Particle Hydrodynamics (SPH)-based numerical simulation and an interactive traffic visualization framework are also developed

Applications of neural networks to control systems

Tese de dout., Engenharia Electrónica, School of Electronic Engineering Science, Univ. of Wales, Bangor, 1992This work investigates the applicability of artificial neural networks to control systems. The following properties of neural networks are identified as of major interest to this field: their ability to implement nonlinear mappings, their massively parallel structure and their capacity to adapt. Exploiting the first feature, a new method is proposed for PID autotuning. Based on integral measures of the open or closed loop step response, multilayer perceptrons (MLPs) are used to supply PID parameter values to a standard PID controller. Before being used on-line, the MLPs are trained offline, to provide PID parameter values based on integral performance criteria. Off-line simulations, where a plant with time-varying parameters and time varying transfer function is considered, show that well damped responses are obtained. The neural PID autotuner is subsequently implemented in real-time. Extensive experimentation confirms the good results obtained in the off-line simulations. To reduce the training time incurred when using the error back-propagation algorithm, three possibilities are investigated. A comparative study of higherorder methods of optimization identifies the Levenberg-Marquardt (LM)algorithm as the best method. When used for function approximation purposes, the neurons in the output layer of the MLPs have a linear activation function. Exploiting this linearity, the standard training criterion can be replaced by a new, yet equivalent, criterion. Using the LM algorithm to minimize this new criterion, together with an alternative form of Jacobian matrix, a new learning algorithm is obtained. This algorithm is subsequently parallelized. Its main blocks of computation are identified, separately parallelized, and finally connected together. The training time of MLPs is reduced by a factor greater than 70 executing the new learning algorithm on 7 Inmos transputers

Topics in Automotive Rollover Prevention: Robust and Adaptive Switching Strategies for Estimation and Control

The main focus in this thesis is the analysis of alternative approaches for estimation and control of automotive vehicles based on sound theoretical principles. Of particular importance is the problem rollover prevention, which is an important problem plaguing vehicles with a high center of gravity (CG). Vehicle rollover is, statistically, the most dangerous accident type, and it is difficult to prevent it due to the time varying nature of the problem. Therefore, a major objective of the thesis is to develop the necessary theoretical and practical tools for the estimation and control of rollover based on robust and adaptive techniques that are stable with respect to parameter variations. Given this background, we first consider an implementation of the multiple model switching and tuning (MMST) algorithm for estimating the unknown parameters of automotive vehicles relevant to the roll and the lateral dynamics including the position of CG. This results in high performance estimation of the CG as well as other time varying parameters, which can be used in tuning of the active safety controllers in real time. We then look into automotive rollover prevention control based on a robust stable control design methodology. As part of this we introduce a dynamic version of the load transfer ratio (LTR) as a rollover detection criterion and then design robust controllers that take into account uncertainty in the CG position. As the next step we refine the controllers by integrating them with the multiple model switched CG position estimation algorithm. This results in adaptive controllers with higher performance than the robust counterparts. In the second half of the thesis we analyze extensions of certain theoretical results with important implications for switched systems. First we obtain a non-Lyapunov stability result for a certain class of linear discrete time switched systems. Based on this result, we suggest switched controller synthesis procedures for two roll dynamics enhancement control applications. One control design approach is related to modifying the dynamical response characteristics of the automotive vehicle while guaranteeing the switching stability under parametric variations. The other control synthesis method aims to obtain transient free reference tracking of vehicle roll dynamics subject to parametric switching. In a later discussion, we consider a particular decentralized control design procedure based on vector Lyapunov functions for simultaneous, and structurally robust model reference tracking of both the lateral and the roll dynamics of automotive vehicles. We show that this controller design approach guarantees the closed loop stability subject to certain types of structural uncertainty. Finally, assuming a purely theoretical pitch, and motivated by the problems considered during the course of the thesis, we give new stability results on common Lyapunov solution (CLS) existence for two classes of switching linear systems; one is concerned with switching pair of systems in companion form and with interval uncertainty, and the other is concerned with switching pair of companion matrices with general inertia. For both problems we give easily verifiable spectral conditions that are sufficient for the CLS existence. For proving the second result we also obtain a certain generalization of the classical Kalman-Yacubovic-Popov lemma for matrices with general inertia

Solution methods for dynamic and non-linear finite element analysis

The computer analysis of structures and solids using finite element methods has now taken on very significant proportions. In many cases the safety of a structure may be significantly increased and its cost reduced if an appropriate finite element analysis can be and is performed. In the development and use of finite element methods, we recognize that, considering static linear analysis, already towards the end of the nineteen sixties the methods were highly developed - thus it had taken only about one decade from the inception to the extensive practical use of finite element methods. Although difficulties were still encountered in the linear static analysis of some structures, e.g. complex shells, most of the structures could already be analysed in a routine manner. This situation in engineering analysis was, however, quite different when dynamic or nonlinear conditions had to be considered. Whereas the finite element methods could be developed relatively quickly for linear static analysis, methods for practical dynamic and nonlinear analyses are much more difficult to establish. Although much emphasis has been placed on research in nonlinear analysis, the progress in the development of valuable techniques has been quite slow. The practical objectives in the development of finite element methods for dynamic and nonlinear analysis are, in essence, that we want to be able to analyze increasingly more complex structures which are subjected to loads that vary rapidly - causing dynamic response - and loads of high intensity - causing the structure to respond beyond its linear range. In nonlinear conditions, geometric and/or material nonlinearities may have to be taken into consideration. These analysis conditions are encountered already in many industries (e.g. design of nuclear power plants) and, with the current needs towards usage of new materials and more efficient structures, nonlinear analysis will undoubtedly be required to an increasing extent. Considering research in finite element analysis procedures, emphasis must be placed on the development of reliable, general and cost-effective techniques. The reliability of the analysis techniques is of utmost concern in order that the analyst can employ the methods with confidence. The results of an analysis can only be interpreted with confidence if reliable methods have been employed. The generality and cost-effectiveness of the methods are important in order to produce analysis tools that, in a design office, are applicable to a relatively large number of problems. With the above aims in mind, the development of finite element procedures for dynamic and nonlinear analysis becomes a very formidable task. Not only is it necessary to propose -guided by knowledge and intuition - improved analysis techniques and then to implement and test these methods, but it is of major importance and difficulty to "fully" verify and qualify these theories and their computer program implementations. Whereas the verification and qualification of a finite element method is usually quite straight-forward in linear static analysis, this process may represent the major task in the development of a method for nonlinear analysis. During the last decade I have endeavored to advance the state-of-the-art of general and reliable finite element analysis procedures for dynamic and nonlinear response calculations

Geometric data understanding : deriving case specific features

There exists a tradition using precise geometric modeling, where uncertainties in data can be considered noise. Another tradition relies on statistical nature of vast quantity of data, where geometric regularity is intrinsic to data and statistical models usually grasp this level only indirectly. This work focuses on point cloud data of natural resources and the silhouette recognition from video input as two real world examples of problems having geometric content which is intangible at the raw data presentation. This content could be discovered and modeled to some degree by such machine learning (ML) approaches like deep learning, but either a direct coverage of geometry in samples or addition of special geometry invariant layer is necessary. Geometric content is central when there is a need for direct observations of spatial variables, or one needs to gain a mapping to a geometrically consistent data representation, where e.g. outliers or noise can be easily discerned. In this thesis we consider transformation of original input data to a geometric feature space in two example problems. The first example is curvature of surfaces, which has met renewed interest since the introduction of ubiquitous point cloud data and the maturation of the discrete differential geometry. Curvature spectra can characterize a spatial sample rather well, and provide useful features for ML purposes. The second example involves projective methods used to video stereo-signal analysis in swimming analytics. The aim is to find meaningful local geometric representations for feature generation, which also facilitate additional analysis based on geometric understanding of the model. The features are associated directly to some geometric quantity, and this makes it easier to express the geometric constraints in a natural way, as shown in the thesis. Also, the visualization and further feature generation is much easier. Third, the approach provides sound baseline methods to more traditional ML approaches, e.g. neural network methods. Fourth, most of the ML methods can utilize the geometric features presented in this work as additional features.Geometriassa käytetään perinteisesti tarkkoja malleja, jolloin datassa esiintyvät epätarkkuudet edustavat melua. Toisessa perinteessä nojataan suuren datamäärän tilastolliseen luonteeseen, jolloin geometrinen säännönmukaisuus on datan sisäsyntyinen ominaisuus, joka hahmotetaan tilastollisilla malleilla ainoastaan epäsuorasti. Tämä työ keskittyy kahteen esimerkkiin: luonnonvaroja kuvaaviin pistepilviin ja videohahmontunnistukseen. Nämä ovat todellisia ongelmia, joissa geometrinen sisältö on tavoittamattomissa raakadatan tasolla. Tämä sisältö voitaisiin jossain määrin löytää ja mallintaa koneoppimisen keinoin, esim. syväoppimisen avulla, mutta joko geometria pitää kattaa suoraan näytteistämällä tai tarvitaan neuronien lisäkerros geometrisia invariansseja varten. Geometrinen sisältö on keskeinen, kun tarvitaan suoraa avaruudellisten suureiden havainnointia, tai kun tarvitaan kuvaus geometrisesti yhtenäiseen dataesitykseen, jossa poikkeavat näytteet tai melu voidaan helposti erottaa. Tässä työssä tarkastellaan datan muuntamista geometriseen piirreavaruuteen kahden esimerkkiohjelman suhteen. Ensimmäinen esimerkki on pintakaarevuus, joka on uudelleen virinneen kiinnostuksen kohde kaikkialle saatavissa olevan datan ja diskreetin geometrian kypsymisen takia. Kaarevuusspektrit voivat luonnehtia avaruudellista kohdetta melko hyvin ja tarjota koneoppimisessa hyödyllisiä piirteitä. Toinen esimerkki koskee projektiivisia menetelmiä käytettäessä stereovideosignaalia uinnin analytiikkaan. Tavoite on löytää merkityksellisiä paikallisen geometrian esityksiä, jotka samalla mahdollistavat muun geometrian ymmärrykseen perustuvan analyysin. Piirteet liittyvät suoraan johonkin geometriseen suureeseen, ja tämä helpottaa luonnollisella tavalla geometristen rajoitteiden käsittelyä, kuten väitöstyössä osoitetaan. Myös visualisointi ja lisäpiirteiden luonti muuttuu helpommaksi. Kolmanneksi, lähestymistapa suo selkeän vertailumenetelmän perinteisemmille koneoppimisen lähestymistavoille, esim. hermoverkkomenetelmille. Neljänneksi, useimmat koneoppimismenetelmät voivat hyödyntää tässä työssä esitettyjä geometrisia piirteitä lisäämällä ne muiden piirteiden joukkoon