On Weak Topology for Optimal Control of Switched Nonlinear Systems

Optimal control of switched systems is challenging due to the discrete nature of the switching control input. The embedding-based approach addresses this challenge by solving a corresponding relaxed optimal control problem with only continuous inputs, and then projecting the relaxed solution back to obtain the optimal switching solution of the original problem. This paper presents a novel idea that views the embedding-based approach as a change of topology over the optimization space, resulting in a general procedure to construct a switched optimal control algorithm with guaranteed convergence to a local optimizer. Our result provides a unified topology based framework for the analysis and design of various embedding-based algorithms in solving the switched optimal control problem and includes many existing methods as special cases

Optimal control of controllable switched systems

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (p. 83-85).Many of the existing techniques for controlling switched systems either require the solution to a complex optimization problem or significant sacrifices to either stability or performance to offer practical controllers. In [13], it is shown that stabilizing, practical controllers with meaningful performance guarantees can be constructed for a specific class of hybrid systems by parameterizing the controller actions by a finite set. We extend this approach to the control of controllable switched systems by constraining the switching portion of the control input and fixing the feedback controller for each subsystem. We show that, under reasonable assumptions, the resulting system is guaranteed to converge to the target while providing meaningful performance. We apply our approach to the direct-injection stratified charge (DISC) engine and compare the results to that of a model predictive controller designed for the same application.by Michael David Rinehart.S.M

Rotorcraft flight-propulsion control integration: An eclectic design concept

The NASA Ames and Lewis Research Centers, in conjunction with the Army Research and Technology Laboratories, have initiated and partially completed a joint research program focused on improving the performance, maneuverability, and operating characteristics of rotorcraft by integrating the flight and propulsion controls. The background of the program, its supporting programs, its goals and objectives, and an approach to accomplish them are discussed. Results of the modern control governor design of the General Electric T700 engine and the Rotorcraft Integrated Flight-Propulsion Control Study, which were key elements of the program, are also presented

Optimal Tracking in Switched Systems With Free Final Time and Fixed Mode Sequence Using Approximate Dynamic Programming

Optimal tracking in switched systems with fixed mode sequence and free final time is studied in this article. In the optimal control problem formulation, the switching times and the final time are treated as parameters. For solving the optimal control problem, approximate dynamic programming (ADP) is used. The ADP solution uses an inner loop to converge to the optimal policy at each time step. In order to decrease the computational burden of the solution, a new method is introduced, which uses evolving suboptimal policies (not the optimal policies), to learn the optimal solution. The effectiveness of the proposed solutions is evaluated through numerical simulations

Development and demonstration of an on-board mission planner for helicopters

Mission management tasks can be distributed within a planning hierarchy, where each level of the hierarchy addresses a scope of action, and associated time scale or planning horizon, and requirements for plan generation response time. The current work is focused on the far-field planning subproblem, with a scope and planning horizon encompassing the entire mission and with a response time required to be about two minutes. The far-feld planning problem is posed as a constrained optimization problem and algorithms and structural organizations are proposed for the solution. Algorithms are implemented in a developmental environment, and performance is assessed with respect to optimality and feasibility for the intended application and in comparison with alternative algorithms. This is done for the three major components of far-field planning: goal planning, waypoint path planning, and timeline management. It appears feasible to meet performance requirements on a 10 Mips flyable processor (dedicated to far-field planning) using a heuristically-guided simulated annealing technique for the goal planner, a modified A* search for the waypoint path planner, and a speed scheduling technique developed for this project

Optimal slip control for tractors with feedback of drive torque

Traction efficiency of tractors barely reaches 50 % in field operations. On the other hand, modern trends in agriculture show growth of the global tractor markets and at the same time increased demands for greenhouse gas emission reduction as well as energy efficiency due to increasing fuel costs. Engine power of farm tractors is growing at 1.8 kW per year reaching today about 500 kW for the highest traction class machines. The problem of effective use of energy has become crucial. Existing slip control approaches for tractors do not fulfil this requirement due to fixed reference set-point. The present work suggests an optimal control scheme based on set-point optimization and on assessment of soil conditions, namely, wheel-ground parameter identification using fuzzy-logic-assisted adaptive unscented Kalman filter.:List of figures VIII List of tables IX Keywords XI List of abbreviations XII List of mathematical symbols XIII Indices XV 1 Introduction 1 1.1 Problem description and challenges 1 1.1.1 Development of agricultural industry 1 1.1.2 Power flows and energy efficiency of a farm tractor 2 1.2 Motivation 9 1.3 Purpose and approach 12 1.3.1 Purpose and goals 12 1.3.2 Brief description of methodology 14 1.3.2.1 Drive torque feedback 14 1.3.2.2 Measurement signals 15 1.3.2.3 Identification of traction parameters 15 1.3.2.4 Definition of optimal slip 15 1.4 Outline 16 2 State of the art in traction management and parameter estimation 17 2.1 Slip control for farm tractors 17 2.2 Acquisition of drive torque feedback 23 2.3 Tire-ground parameter estimation 25 2.3.1 Kalman filter 25 2.3.2 Extended Kalman filter 27 2.3.3 Unscented Kalman filter 27 2.3.4 Adaptation algorithms for Kalman filter 29 3 Modelling vehicle dynamics for traction control 31 3.1 Tire-soil interaction 31 3.1.1 Forces in wheel-ground contact 32 3.1.1.1 Vertical force 32 3.1.1.2 Tire-ground surface geometry 34 3.1.2 Longitudinal force 36 3.1.3 Zero-slip condition 37 3.1.3.1 Soil shear stress 38 3.1.3.2 Rolling resistance 39 3.2 Vehicle body and wheels 40 3.2.1 Short description of Multi-Body-Simulation 40 3.2.2 Vehicle body and wheel models 42 3.2.3 Wheel structure 43 3.3 Stochastic input signals 45 3.3.1 Influence of trend and low-frequency components 47 3.3.2 Modelling stochastic signals 49 3.4 Further components and general view of tractor model 53 3.4.1 Generator, intermediate circuit, electrical motors and braking resistor 53 3.4.2 Diesel engine 55 4 Identification of traction parameters 56 4.1 Description of identification approaches 56 4.2 Vehicle model 58 4.2.1 Vehicle longitudinal dynamics 58 4.2.2 Wheel rotational dynamics 59 4.2.3 Tire dynamic rolling radius and inner rolling resistance coefficient 60 4.2.4 Whole model 61 4.3 Static methods of parameter identification 63 4.4 Adaptation mechanism of the unscented Kalman filter 63 4.5 Fuzzy supervisor for the adaptive unscented Kalman filter 66 4.5.1 Structure of the fuzzy supervisor 67 4.5.2 Stability analysis of the adaptive unscented Kalman filter with the fuzzy supervisor 69 5 Optimal slip control 73 5.1 Approaches for slip control by means of traction control system 73 5.1.1 Feedback compensation law 73 5.1.2 Sliding mode control 74 5.1.3 Funnel control 77 5.1.4 Lyapunov-Candidate-Function-based control, other approaches and choice of algorithm 78 5.2 General description of optimal slip control algorithm 79 5.3 Estimation of traction force characteristic curves 82 5.4 Optimal slip set-point computation 85 6 Verification of identification and optimal slip control systems 91 6.1 Simulation results 91 6.1.1 Identification of traction parameters 91 6.1.1.1 Comparison of extended Kalman filter and unscented Kalman filter 92 6.1.1.2 Comparison of ordinary and adaptive unscented Kalman filters 96 6.1.1.3 Comparison of the adaptive unscented Kalman filter with the fuzzy supervisor and static methods 99 6.1.1.4 Description of soil conditions 100 6.1.1.5 Identification of traction parameters under changing soil conditions 101 6.1.2 Approximation of characteristic curves 102 6.1.3 Slip control with reference of 10% 103 6.1.4 Comparison of operating with fixed and optimal slip reference 104 6.2 Experimental verification 108 6.2.1 Setup and description of the experiments 108 6.2.2 Virtual slip control without load machine 109 6.2.3 Virtual slip control with load machine 113 7 Summary, conclusions and future challenges 122 7.1 Summary of results and discussion 122 7.2 Contributions of the dissertation 123 7.3 Future challenges 123 Bibliography 125 A Measurement systems 137 A.1 Measurement of vehicle velocity 137 A.2 Measurement of wheel speed 138 A.3 Measurement or estimation of wheel vertical load 139 A.4 Measurement of draft force 140 A.5 Further possible measurement systems 141 B Basic probability theoretical notions 142 B.1 Brief description of the theory of stochastic processes 142 B.2 Properties of stochastic signals 144 B.3 Bayesian filtering 145 C Modelling stochastic draft force and field microprofile 147 D Approximation of kappa-curves 152 E Simulation parameters 15

Towards Optimal Real-Time Automotive Emission Control

The legal bounds on both toxic and carbon dioxide emissions from automotive vehicles are continuously being lowered, forcing manufacturers to rely on increasingly advanced methods to reduce emissions and improve fuel efficiency. Though great strides have been made to date, there is still a large potential for continued improvement. Today, many subsystems in vehicles are optimized for static operation, where subsystems in the vehicle perform well at constant operating points. Extending optimal operation to the dynamic case through the use of optimal control is one method for further improvements.This thesis focuses on two subtopics that are crucial for implementing optimal control; dynamic modeling of vehicle subsystems, and methods for generating and evaluating computationally efficient optimal controllers. Though today\u27s vehicles are outfitted with increasingly powerful computers, their computational performance is low compared to a conventional PC. Any controller must therefore be very computationally efficient in order to feasibly be implemented. Furthermore, a sufficiently accurate dynamic model of the subsystem is needed in order to determine the optimal control value. Though many dynamic models of the vehicle\u27s subsystems exist, most do not fulfill the specific requirements set by optimal controllers.This thesis comprises five papers that, together, probe some methods of implementing dynamic optimal control in real-time. Two papers develop optimal control methods, one introduces and studies a cold-start model of the three-way catalyst, one paper extends the three-way catalyst model and studies optimal cold-start control, and one considers fuel-optimally controlling the speed of the engine in a series-hybrid. By combining the method and model papers we open for the potential to reduce toxic emissions by better managing cold-starts in hybrid vehicles, as well as reducing carbon dioxide emissions by operating the engine in a more efficient manner during transients

Approximate dynamic programming based solutions for fixed-final-time optimal control and optimal switching

Optimal solutions with neural networks (NN) based on an approximate dynamic programming (ADP) framework for new classes of engineering and non-engineering problems and associated difficulties and challenges are investigated in this dissertation. In the enclosed eight papers, the ADP framework is utilized for solving fixed-final-time problems (also called terminal control problems) and problems with switching nature. An ADP based algorithm is proposed in Paper 1 for solving fixed-final-time problems with soft terminal constraint, in which, a single neural network with a single set of weights is utilized. Paper 2 investigates fixed-final-time problems with hard terminal constraints. The optimality analysis of the ADP based algorithm for fixed-final-time problems is the subject of Paper 3, in which, it is shown that the proposed algorithm leads to the global optimal solution providing certain conditions hold. Afterwards, the developments in Papers 1 to 3 are used to tackle a more challenging class of problems, namely, optimal control of switching systems. This class of problems is divided into problems with fixed mode sequence (Papers 4 and 5) and problems with free mode sequence (Papers 6 and 7). Each of these two classes is further divided into problems with autonomous subsystems (Papers 4 and 6) and problems with controlled subsystems (Papers 5 and 7). Different ADP-based algorithms are developed and proofs of convergence of the proposed iterative algorithms are presented. Moreover, an extension to the developments is provided for online learning of the optimal switching solution for problems with modeling uncertainty in Paper 8. Each of the theoretical developments is numerically analyzed using different real-world or benchmark problems --Abstract, page v

A Non-Blocking Priority Queue for the Pending Event Set

The large diffusion of shared-memory multi-core machines has impacted the way Parallel Discrete Event Simulation (PDES) engines are built. While they were originally conceived as data-partitioned platforms, where each thread is in charge of managing a subset of simulation objects, nowadays the trend is to shift towards share-everything settings. In this scenario, any thread can (in principle) take care of CPU-dispatching pending events bound to whichever simulation object, which helps to fully share the load across the available CPU-cores. Hence, a fundamental aspect to be tackled is to provide an efficient globally-shared pending events’ set from which multiple worker threads can concurrently extract events to be processed, and into which they can concurrently insert new produced events to be processed in the future. To cope with this aspect, we present the design and implementation of a concurrent non-blocking pending events’ set data structure, which can be seen as a variant of a classical calendar queue. Early experimental data collected with a synthetic stress test are reported, showing excellent scalability of our proposal on a machine equipped with 32 CPU-cores