This thesis presents a predictive energy management controller for long-haul hybrid trucks. In a receding horizon control framework, the vehicle speed reference, battery energy reference, and engine on/off decision are optimized over a prediction horizon. A mixed-integer quadratic program (MIQP) is formulated by performing modelling approximations and by including the binary engine on/off decision in the optimal control problem. The branch-and-bound algorithm is applied to solve this problem. Simulation results show fuel consumption reductions between 10-15%, depending on driving cycle, compared to a conventional truck. The hybrid truck without the predictive control saves significantly less. Fuel consumption is reduced by 3-8% in this case. A sensitivity analysis studies the effects on branch-and-bound iterations and fuel consumption when varying parameters related to the binary engine on/off decision. In addition, it is shown that the control strategy can maintain a safe time gap to a leading vehicle. Also, the introduction of the battery temperature state makes it possible to approximately model the dynamic battery power limitations over the prediction horizon. The main contributions of the thesis are the MIQP control problem formulation, the strategy to solve this with the branch-and-bound method, and the sensitivity analysis.

This thesis describes the theory of model predictive control and application of the theory to synchronous drives. It shows explicit and on-line solutions and compares the results with classical vector control structure.

Confidentiel / Confidential

Un groupe de robots collaboratifs peut gérer des tâches qui sont difficiles, voire impossibles, à accomplir par un seul. On appelle un ensemble de robots coopérant un système multi-agents (SMA). L'interaction entre agents est un facteur clé dans la commande coopérative qui pose d'importants défis théoriques et pratiques. L'une des tâches du contrôle coopératif est le consensus dont l'objectif est de concevoir des protocoles de commande afin de parvenir à un accord entre leurs états respectifs. Cette thèse améliore la navigation pour les SMA, tout en tenant compte de certaines contraintes pratiques (modèle du robot et contraintes temporelles) dans la conception de contrôleurs coopératifs pour chaque agent, de manière décentralisée. Dans cette thèse, deux directions sont étudiées. D'une part, le taux de convergence est une spécification de performance importante pour la conception du contrôleur pour un système dynamique. La convergence rapide est toujours recherchée pour améliorer les performances et la robustesse. La plupart des algorithmes de consensus existants se concentrent sur la convergence asymptotique, où le temps d'établissement est infini. Cependant, de nombreuses applications nécessitent une convergence rapide généralement caractérisée par une stratégie de commande à temps fini. De plus, la commande à temps fini autorise certaines propriétés intéressantes, mais le temps de stabilisation dépend des conditions initiales des agents. L'objectif ici est de concevoir un protocole de consensus leader-follower à temps fixe pour les SMA décrits en temps continu. Ce problème est étudié en utilisant la théorie de la stabilisation à temps fixe, qui garantit que le temps de stabilisation est borné quelles que soient les conditions initiales. Les contrôleurs et les observateurs à modes glissants sont conçus pour que chaque agent résolve le problème du consensus à temps fixe lorsque le leader est dynamique. D'autre part, par rapport aux systèmes à temps continu, le problème du consensus dans un cadre à temps discret convient mieux aux applications pratiques en raison de la limitation des ressources de calcul pour chaque agent. Le modèle de commande prédictive (MPC) permet de gérer les contraintes de commande et d'état des systèmes. Dans cette thèse, cette méthode est appliquée pour traiter le problème du consensus en temps discret en laissant chaque agent résoudre, à chaque étape, un problème de commande optimale contraint impliquant uniquement l'état des agents voisins. Les performances de suivi sont également améliorées dans cette thèse en ajoutant de nouveaux termes à partir du MPC classique. Les contrôleurs proposés sont simulés et implémentés sur un groupe composé de plusieurs robots réels en utilisant ROS (Robotic Operating System). Dans cette thèse, quelques solutions correspondant au problème de la connexion entre plusieurs robots mobiles de manière décentralisée, du réglage des périodes d'échantillonnage et des paramètres de contrôle sont également abordées. / Nowadays, robots have become increasingly important to investigate hazardous and dangerous environments. A group of collaborating robots can often deal with tasks that are difficult, or even impossible, to be accomplished by a single robot. Multiple robots working in a cooperative manner is called as a Multi-Agent System (MAS). The interaction between agents to achieve a global task is a key in cooperative control. Cooperative control of MASs poses significant theoretical and practical challenges. One of the fundamental topics in cooperative control is the consensus where the objective is to design control protocols between agents to achieve a state agreement. This thesis improves the navigation scheme for MASs, while taking into account some practical constraints (robot model and temporal constraints) in the design of cooperative controllers for each agent, in a fully decentralized way. In this thesis, two directions are investigated. On one hand, the convergence rate is an important performance specification to design the controller for a dynamical system. As an important performance measure for the coordination control of MASs, fast convergence is always pursued to achieve better performance and robustness. Most of the existing consensus algorithms focus on asymptotic convergence, where the settling time is infinite. However, many applications require a high speed convergence generally characterized by a finite-time control strategy. Moreover, finite-time control allows some advantageous properties but the settling time depend on the initial states of agents. The objective here is to design a fixed-time leader-follower consensus protocol for MASs described in continuous-time. This problem is studied using the powerful theory of fixed-time stabilization, which guarantee that the settling time is upper bounded regardless to the initial conditions. Sliding mode controllers and sliding mode observers are designed for each agent to solve the fixed-time consensus tracking problem when the leader is dynamic. On the other hand, compared with continuous-time systems, consensus problem in a discrete-time framework is more suitable for practical applications due to the limitation of computational resources for each agent. Model Predictive Control (MPC) has the ability to handle control and state constraints for discrete-time systems. In this thesis, this method is applied to deal with the consensus problem in discrete-time by letting each agent to solve, at each step, a constrained optimal control problem involving only the state of neighboring agents. The tracking performances are also improved in this thesis by adding new terms in the classical MPC technique. The proposed controllers will be simulated and implemented on a team of multiple Mini-Lab Enova Robots using ROS (Robotic Operating System) which is an operating system for mobile robots. ROS provides not only standard operating system services but also high-level functionalities. In this thesis, some solutions corresponding to problem of connection between multiple mobile robots in a decentralized way for a wireless robotic network, of tuning of the sampling periods and control parameters are also discussed.

Over the past decades, attention has been brought to the importance of indoor air quality and the serious threat of bio-aerosol contamination towards human health. A novel idea to transport hazardous particles away from sensitive areas is to automatically control bio-aerosol concentrations, by utilising airflows from ventilation systems. Regarding this, computational fluid dynamics (CFD) may be employed to investigate the dynamical behaviour of airborne particles, and data-driven methods may be used to estimate and control the complex flow simulations. This thesis presents a methodology for machine-learning based control of particle concentrations in turbulent gas-solid flow. The aim is to reduce concentration levels at a 90 degree corner, through systematic manipulation of underlying two-phase flow dynamics, where an energy constrained inlet airflow rate is used as control variable. A CFD experiment of turbulent gas-solid flow in a two-dimensional corner geometry is simulated using the SST k-omega turbulence model for the gas phase, and drag force based discrete random walk for the solid phase. Validation of the two-phase methodology is performed against a backwards facing step experiment, with a 12.2% error correspondence in maximum negative particle velocity downstream the step. Based on simulation data from the CFD experiment, a linear auto-regressive with exogenous inputs (ARX) model and a non-linear ARX based neural network (NN) is used to identify the temporal relationship between inlet flow rate and corner particle concentration. The results suggest that NN is the preferred approach for output predictions of the two-phase system, with roughly four times higher simulation accuracy compared to ARX. The identified NN model is used in a model predictive control (MPC) framework with linearisation in each time step. It is found that the output concentration can be minimised together with the input energy consumption, by means of tracking specified target trajectories. Control signals from NN-MPC also show good performance in controlling the full CFD model, with improved particle removal capabilities, compared to randomly generated signals. In terms of maximal reduction of particle concentration, the NN-MPC scheme is however outperformed by a manually constructed sine signal. In conclusion, CFD based NN-MPC is a feasible methodology for efficient reduction of particle concentrations in a corner area; particularly, a novel application for removal of indoor bio-aerosols is presented. More generally, the results show that NN-MPC may be a promising approach to turbulent multi-phase flow control.

In underwater tracking and surveillance, the active towed array sonar presents a way of discovering and tracking adversarial submerged targets that try to stay hidden. The configuration consist of listening and emitting hydrophones towed behind a ship. Moreover, it has inherent limitations, and the characteristics of sound in the ocean are complex. By varying the pulse form emitted and the trajectory of the ship the measurement accuracy may be improved. This type of optimization constitutes a sensor management problem. In this thesis, a model of the tracking scenario has been constructed derived from Cramér-Rao bound analyses. A model predictive control approach together with information measures have been used to optimize a filter's estimated state of the target. For the simulations, the MATLAB environment has been used. Different combinations of decision horizons, information measures and variations of the Kalman filter have been studied. It has been found that the accuracy of the Extended Kalman filter is too low to give consistent results given the studied information measures. However, the Unscented Kalman filter is sufficient for this purpose.

Die Dissertation liefert einen Beitrag zur Modellierung und optimalen Ansteuerung von vernetzten hybriden Energiesystemen. Die Arbeit beschreibt die Entwicklung einer modellprädiktiven Regelung (MPC) für konkrete Energiesysteme. Dafür wird eine Betrachtung zu berücksichtigender wirtschaftlicher und technischer Rahmenbedingungen vorgenommen, die zur Formulierung notwendiger Nebenbedingungen für die MPC genutzt wird. Für den Umgang mit dem ansteigenden Rechenbedarf der MPC bei steigender Systemzahl wird ein alternativer Ansatz auf Basis eines auktionsbasierten Algorithmus vorgestellt. Die Modellierung der Energiesysteme wird ausgehend von einer bestehenden Laboranlage vorgenommen. Die Erprobung der vorgestellten Ansätze erfolgt in einer Simulationsumgebung, die die Untersuchung verschiedener Szenarien erlaubt. Im Rahmen der Simulationsszenarien mit unterschiedlicher Systemzahl und Zusammensetzung der Energie-systeme wird eine Sensibilitätsanalyse der vorgestellten MPC vorgenommen. Die Interpretation der Ergebnisse erfolgt auf Basis numerischer und empirischer Bewertungskriterien.

No description available.

No description available.

This thesis proposes, validates, and compares low-complexity algorithms for the fast-and-safe charge and balance of Li-ion batteries both for the single cell case and for the case of a serially-connected string of battery cells. The proposed algorithms are based on a reduced-order electrochemical model (Equivalent Hydraulic Model, EHM), and make use of constrained-control strategies to limit the main electrochemical degradation phenomena that may accelerate aging, namely: Lithium plating in the anode and solvent oxidation inthe cathode. To avoid the computational intensiveness of solving an online optimization as in the Model Predictive Control (MPC) framework, this thesis proposes the use of Reference Governor schemes. Variants of both the Scalar Reference Governors (SRG) and the Explicit Reference Governors (ERG) are developed to deal with the non-convex admissible region for the charge of a battery cell, while keeping a low computational burden. To evaluate the performance of the proposed techniques for the single cell case, they are experimentallyvalidated on commercial Turnigy LCO cells of 160 mAh at four different constant temperatures (10, 20, 30 and 40 °C). In the second part of this thesis, the proposed charging strategies are extended to take into account the balance of a serially-connected string of cells. To equalize possible mismatches, a centralized policy based on a shunting grid (active balance) connects or disconnects the cells during the charge. After a preliminary analysis, a simple mixed-integer algorithm was proposed. Since this method is computationally inefficient due to the high number of scenarios to be evaluated, this thesis proposes a ratio-based algorithm based on a Pulse-Width Modulation (PWM) approach. This approach can be used within both MPC and RG schemes. The numerical validations of the proposed algorithms for the case of a string of four battery cells are carried out using a simulator based on a full-order electrochemical model. Numerical validations show that the PWM-like approach charges in parallel all the cells within the pack, whereas the mixed-integer approach charges the battery cells sequentially from the battery cell with the lowest state of charge to the ones with the highest states of charge. On the basis of the simulations, an algorithm based on a mixed logic that allows to charge in a “sequential parallel” approach is proposed. Some conclusions and future directions of research are proposed at the end of the thesis. / Doctorat en Sciences de l'ingénieur et technologie / info:eu-repo/semantics/nonPublished