A smoothing Newton method for minimizing a sum of Euclidean norms

2000-2001 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

Validation of nominations in gas networks and properties of technical capacities

[no abstract

Fuel Optimal Control Algorithms for Connected and Automated Plug-In Hybrid Vehicles

Improving the fuel economy of light-duty vehicles (LDV) is a compelling solution to stabilizing Greenhouse Gas (GHG) emissions and decreasing the reliance on fossil fuels. Over the years, there has been a considerable shift in the market of LDVs toward powertrain electrification, and plug-in hybrid electric vehicles (PHEVs) are the most cost-effective in avoiding GHG emissions. Meanwhile, connected and automated vehicle (CAV) technologies permit energy-efficient driving with access to accurate trip information that integrates traffic and charging infrastructure. This thesis aims at developing optimization-based algorithms for controlling powertrain and vehicle longitudinal dynamics to fully exploit the potential for reducing fuel consumption of individual PHEVs by utilizing CAV technologies. A predictive equivalent minimization strategy (P-ECMS) is proposed for a human-driven PHEV to adjust the co-state based on the difference between the future battery state-of-charge (SOC) obtained from short-horizon prediction and a future reference SOC from SOC node planning. The SOC node planning, which generates battery SOC reference waypoints, is performed using a simplified speed profile constructed from segmented traffic information, typically available from mobile mapping applications. The PHEV powertrain, consisting of engine and electric motors, is mathematically modeled as a hybrid system as the state is defined by the values of the continuous variable, SOC, and discrete modes, hybrid vehicle (HV), and electric vehicle (EV) modes with the engine on/off. As a hybrid system, the optimal control of PHEVs necessitates a numerical approach to solving a mixed-integer optimization problem. It is of interest to have a unified numerical algorithm for solving such mixed-integer optimal control problems with many states and control inputs. Based on a discrete maximum principle (DMP), a discrete mixed-integer shooting (DMIS) algorithm is proposed. The DMIS is demonstrated in successfully addressing the cranking fuel optimization in the energy management of a PHEV. It also serves as the foundation of the co-optimization problem considered in the remaining part of the thesis. This thesis further investigates different control designs with an increased vehicle automation level combining vehicle dynamics and powertrain of PHEVs in within-a-lane traffic flow. This thesis starts with a sequential (or decentralized) optimization and then advances to direct fuel minimization by simultaneously optimizing the two subsystems in a centralized manner. When shifting toward online implementation, the unique challenge lies in the conflict between the long control horizon required for global optimality and the computational power limit. A receding horizon strategy is proposed to resolve the conflict between the horizon length and the computation complexity, with co-states approximating the future cost. In particular, the co-state is updated using a nominal trajectory and the temporal-difference (TD) error based on the co-state dynamics. The remaining work aims to develop a unified model predictive control (MPC) framework from the powertrain (PT) control of a human-driven to the combined vehicle dynamics (VD) and PT control of an automated PHEV. In the unified framework, the cost-to-go (the fuel consumption as the economic cost) is represented by the co-state associated with the battery SOC dynamics. In its application to automated PHEVs, a control barrier function (CBF) is augmented as an add-on block to modify the vehicle-level control input for guaranteed safety. This unified MPC framework allows for systematically evaluating the fuel economy and drivability performance of different levels and structures of optimization strategies.PHDMechanical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/169876/1/dichencd_1.pd

A generic interior-point framework for nonsmooth and complementarity constrained nonlinear optimization

[no abstract

Application of general semi-infinite Programming to Lapidary Cutting Problems

We consider a volume maximization problem arising in gemstone cutting industry. The problem is formulated as a general semi-infinite program (GSIP) and solved using an interiorpoint method developed by Stein. It is shown, that the convexity assumption needed for the convergence of the algorithm can be satisfied by appropriate modelling. Clustering techniques are used to reduce the number of container constraints, which is necessary to make the subproblems practically tractable. An iterative process consisting of GSIP optimization and adaptive refinement steps is then employed to obtain an optimal solution which is also feasible for the original problem. Some numerical results based on realworld data are also presented

Relaxations and Approximations for Mixed-Integer Optimal Control

This thesis treats different aspects of the class of Mixed-Integer Optimal Control Problems (MIOCPs). These are optimization problems that combine the difficulties of underlying dynamic processes with combinatorial decisions. Typically, these combinatorial decisions are realized as switching decisions between the system’s different operations modes. During the last decades, direct methods emerged as the state-of-the-art solvers for MIOCPs. The formulation of a valid, tight and dependable integral relaxation, i.e., the formulation of a model for fractional values, plays an important role for these direct solution methods. We give detailed insight into several relaxation approaches for MIOCPs and compare them with regard to their respective structures. In particular, these are the typical solution’s structures and properties as convexity, problem size and numerical behavior. From these structural properties, we deduce some required specifications of a solver. Additionally, the modeling and subsequent limitation of the switching process directly tackle the class-specific typical issue of chattering solutions. One of the relaxation methods for MIOCPs is the outer convexification, where the binary variables only enter affinely. For the approximation of this relaxation’s solution, we took up on the control approximation problem in integral sense derived by Sager as part of a decomposition approach for MIOCPs with affine binary controls. This problem describes the optimal approximation of fractional controls with binary controls such that the corresponding dynamic process is changed as little as possible. For the multi-dimensional problem, we developed a new heuristic, which for the first time gives a bound that only depends on the control grid and not anymore on the number of the system’s controls. For the generalization of the control approximation problem with additional constraints, we derived a tailored branch-and-bound algorithm, which is based on the properties of the Lagrangian relaxation of the one-dimensional problem. This algorithm beats state-of-the-art commercial solvers for Mixed-Integer Linear Programs (MILPs) for this special approximation problem by several orders of magnitude. Overall, we present several, partially new modeling approaches for MIOCPs together with the accompanying structural properties. On this basis, we develop new theories for the approximation of certain relaxed solutions. We discuss the efficient implementation of the resulting structure exploiting algorithms. This leads to a deeper and better understanding of MIOCPs. We show the practicability of the theoretical observations with the help of four prototypical problems. The presented methods and algorithms allow on their basis the direct development of decision support and analysis tools in practice

Proceedings of the ECCOMAS Thematic Conference on Multibody Dynamics 2015

This volume contains the full papers accepted for presentation at the ECCOMAS Thematic Conference on Multibody Dynamics 2015 held in the Barcelona School of Industrial Engineering, Universitat Politècnica de Catalunya, on June 29 - July 2, 2015. The ECCOMAS Thematic Conference on Multibody Dynamics is an international meeting held once every two years in a European country. Continuing the very successful series of past conferences that have been organized in Lisbon (2003), Madrid (2005), Milan (2007), Warsaw (2009), Brussels (2011) and Zagreb (2013); this edition will once again serve as a meeting point for the international researchers, scientists and experts from academia, research laboratories and industry working in the area of multibody dynamics. Applications are related to many fields of contemporary engineering, such as vehicle and railway systems, aeronautical and space vehicles, robotic manipulators, mechatronic and autonomous systems, smart structures, biomechanical systems and nanotechnologies. The topics of the conference include, but are not restricted to: ● Formulations and Numerical Methods ● Efficient Methods and Real-Time Applications ● Flexible Multibody Dynamics ● Contact Dynamics and Constraints ● Multiphysics and Coupled Problems ● Control and Optimization ● Software Development and Computer Technology ● Aerospace and Maritime Applications ● Biomechanics ● Railroad Vehicle Dynamics ● Road Vehicle Dynamics ● Robotics ● Benchmark ProblemsPostprint (published version