arXiv subjects

Armin Nurkanović

Publications and source records attributed to Armin Nurkanović.

25 records · Page 2Linked to original sources

arXiv2023

FESD-J: Finite Elements with Switch Detection for Numerical Optimal Control of Rigid Bodies with Impacts and Coulomb Friction

The Finite Elements with Switch Detection (FESD) is a high-accuracy method for the numerical simulation and solution of optimal control problems subject to discontinuous ODEs. In this article, we extend the FESD method [Nurkanović et al., 2022] to the dynamic equations of multiple rigid bodies that exhibit state jumps due to impacts and Coulomb friction. This new method is referred to as FESD with Jumps (FESD-J). Starting from the standard Runge-Kutta equations, we let the integration step sizes be degrees of freedom. Additional constraints are introduced to ensure exact switch detection and to remove spurious degrees of freedom if no switches occur. Moreover, at the boundaries of each finite element, we impose the impact equations in their complementarity form, at both the position and velocity level. They compute the normal and tangential impulses in case of contact making. Otherwise, they are reduced to the continuity conditions for the velocities. FESD-J treats multiple contacts, where each contact can have a different coefficient of restitution and friction. All methods introduced in this paper are implemented in the open-source software package NOSNOC. We illustrate the use of FESD-J in both simulation and optimal control examples.

math.OC↗

arXiv2023

Direct Collocation for Numerical Optimal Control of Second-Order ODE

Mechanical systems are usually modeled by second-order Ordinary Differential Equations (ODE) which take the form $\ddot{q} = f(t, q, \dot{q})$. While simulation methods tailored to these equations have been studied, using them in direct optimal control methods is rare. Indeed, the standard approach is to perform a state augmentation, adding the velocities to the state. The main drawback of this approach is that the number of decision variables is doubled, which could harm the performance of the resulting optimization problem. In this paper, we present an approach tailored to second-order ODE. We compare it with the standard one, both on theoretical aspects and in a numerical example. Notably, we show that the tailored formulation is likely to improve the performance of a direct collocation method, for solving optimal control problems with second-order ODE of the more restrictive form $\ddot{q} = f(t, q)$.

math.OC↗

arXiv2022

Frenet-Cartesian Model Representations for Automotive Obstacle Avoidance within Nonlinear MPC

In recent years, nonlinear model predictive control (NMPC) has been extensively used for solving automotive motion control and planning tasks. In order to formulate the NMPC problem, different coordinate systems can be used with different advantages. We propose and compare formulations for the NMPC related optimization problem, involving a Cartesian and a Frenet coordinate frame (CCF/ FCF) in a single nonlinear program (NLP). We specify costs and collision avoidance constraints in the more advantageous coordinate frame, derive appropriate formulations and compare different obstacle constraints. With this approach, we exploit the simpler formulation of opponent vehicle constraints in the CCF, as well as road aligned costs and constraints related to the FCF. Comparisons to other approaches in a simulation framework highlight the advantages of the proposed approaches.

eess.SY↗

arXiv2022

A Feasible Sequential Linear Programming Algorithm with Application to Time-Optimal Path Planning Problems

In this paper, we propose a Feasible Sequential Linear Programming (FSLP) algorithm applied to time-optimal control problems (TOCP) obtained through direct multiple shooting discretization. This method is motivated by TOCP with nonlinear constraints which arise in motion planning of mechatronic systems. The algorithm applies a trust-region globalization strategy ensuring global convergence. For fully determined problems our algorithm provides locally quadratic convergence. Moreover, the algorithm keeps all iterates feasible enabling early termination at suboptimal, feasible solutions. This additional feasibility is achieved by an efficient iterative strategy using evaluations of constraints, i.e., zero-order information. Convergence of the feasibility iterations can be enforced by reduction of the trust-region radius. These feasibility iterations maintain feasibility for general Nonlinear Programs (NLP). Therefore, the algorithm is applicable to general NLPs. We demonstrate our algorithm's efficiency and the feasibility update strategy on a TOCP of an overhead crane motion planning simulation case.

math.OC↗

arXiv2022

NOSNOC: A Software Package for Numerical Optimal Control of Nonsmooth Systems

This letter introduces the NOnSmooth Numerical Optimal Control (NOSNOC) open-source software package. It is a modular MATLAB tool based on CasADi and IPOPT for numerically solving Optimal Control Problems (OCP) with piecewise smooth systems (PSS). The tool supports: 1) automatic reformulation of systems with state jumps into PSS (via the time-freezing reformulation [Nurkanović et al., 2021]) and of PSS into computationally more convenient forms, 2) automatic discretization of the OCP via, e.g., the recently introduced Finite Elements with Switch Detection [Nurkanović et al., 2022] which enables high accuracy optimal control and simulation of PSS, 3) solution methods for the resulting discrete-time OCP. The nonsmooth discrete-time OCP are solved with techniques of continuous optimization in a homotopy procedure, without the use of integer variables. This enables the treatment of a broad class of nonsmooth systems in a unified way. Two tutorial examples are given. A benchmark shows that NOSNOC provides both faster and more accurate solutions than conventional approaches, including mixed-integer formulations.

math.OC↗

arXiv2022

Continuous Optimization for Control of Hybrid Systems with Hysteresis via Time-Freezing

This article regards numerical optimal control of a class of hybrid systems with hysteresis using solely techniques from nonlinear optimization, without any integer variables. Hysteresis is a rate independent memory effect which often results in severe nonsmoothness in the dynamics. These systems are not simply Piecewise Smooth Systems (PSS); they are a more complicated form of hybrid systems. We introduce a time-freezing reformulation which transforms these systems into a PSS. From the theoretical side, this reformulation opens the door to study systems with hysteresis via the rich tools developed for Filippov systems. From the practical side, it enables the use of the recently developed Finite Elements with Switch Detection [Nurkanovic et al., 2022], which makes high accuracy numerical optimal control of hybrid systems with hysteresis possible. We provide a time optimal control problem example and compare our approach to mixed-integer formulations from the literature.

math.OC↗

arXiv2020

A Time-Freezing Approach for Numerical Optimal Control of Nonsmooth Differential Equations with State Jumps

We present a novel reformulation of nonsmooth differential equations with state jumps which enables their easier simulation and use in optimal control problems without the need of using integer variables. The main idea is to introduce an auxiliary differential equation to mimic the state jump map. Thereby, also a clock state is introduced which does not evolve during the runtime of the auxiliary system. The pieces of the trajectory that correspond to the parts when the clock state was evolving recover the solution of the original system with jumps. Our reformulation results in nonsmooth ordinary differential equations where the discontinuity is in the first time derivative of the trajectory, rather than in the trajectory itself. This class of systems is easier to handle both theoretically and numerically. We provide numerical examples demonstrating the ease of use of this reformulation in both simulation and optimal control. In the optimal control example a single call of a nonlinear programming (NLP) solver yields the same solution as a multi-stage formulation, without the need for exploring the optimal number of stages by enumeration or heuristics.

math.OC↗