arXiv subjects

Johannes Diwold

Publications and source records attributed to Johannes Diwold.

9 recordsLinked to original sources

arXiv2022

On the Exact Linearization and Control of Flat Discrete-time Systems

The paper addresses the exact linearization of flat nonlinear discrete-time systems by generalized static or dynamic feedbacks which may also depend on forward-shifts of the new input. We first investigate the question which forward-shifts of a given flat output can be chosen in principle as a new input, and subsequently how to actually introduce the new input by a suitable feedback. With respect to the choice of a feasible input, easily verifiable conditions are derived. Introducing such a new input requires a feedback which may in general depend not only on this new input itself but also on its forward-shifts. This is similar to the continuous-time case, where feedbacks which depend on time derivatives of the closed-loop input - and in particular quasi-static ones - have already been used successfully for the exact linearization of flat systems since the nineties of the last century. For systems with a flat output that does not depend on forward-shifts of the input, it is shown how to systematically construct a new input such that the total number of the corresponding forward-shifts of the flat output is minimal. Furthermore, it is shown that in this case the calculation of a linearizing feedback is particularly simple, and the subsequent design of a discrete-time flatness-based tracking control is discussed. The presented theory is illustrated by the discretized models of a wheeled mobile robot and a 3DOF helicopter.

math.OC↗

arXiv2022

Necessary and Sufficient Conditions for Difference Flatness

We show that the flatness of a nonlinear discrete-time system can be checked by computing a unique sequence of involutive distributions. The well-known test for static feedback linearizability is included as a special case. Since the computation of the sequence of distributions requires only the solution of algebraic equations, it allows an efficient implementation in a computer algebra program. In case of a positive result, a flat output can be obtained by straightening out the involutive distributions with the Frobenius theorem.

math.OC↗

arXiv2022

Discrete-time Flatness and Linearization along Trajectories

The paper studies the relation between a nonlinear time-varying flat discrete-time system and the corresponding linear time-varying systems which are obtained by a linearization along trajectories. It is motivated by the continuous-time case, where it is well-known that the linearization of flat systems along trajectories results in linear time-varying systems which are again flat. Since flatness implies controllability, this constitutes an important verifiable necessary condition for flatness. In the present contribution, it is shown that this is also true in the discrete-time case: We prove that the linearized system is again flat, and that a possible flat output is given by the linearization of a flat output of the nonlinear system. Analogously, the map that describes the parameterization of the system variables of the linear system by this flat output coincides with the linearization of the corresponding map of the nonlinear system. The results are illustrated by two examples.

math.OC↗

arXiv2022

Discrete-time Flatness-based Controller Design using an Implicit Euler-discretization

In this contribution, we present a constructive method to derive flat sampled-data models for continuous-time flat systems through an implicit Euler-discretization. We show how the sampled-data model can be used subsequently for a flatness-based controller design, and illustrate our results with the well-known planar VTOL aircraft example.

math.DS↗

arXiv2022

Flatness Analysis for the Sampled-data Model of a Single Mast Stacker Crane

We show that the Euler-discretization of the nonlinear continuous-time model of a single mast stacker crane is flat. The construction of the flat output is based on a transformation of a subsystem into the linear time-variant discrete-time controller canonical form. Based on the derived flat output, which is also a function of backward-shifts of the system variables, we discuss the planning of trajectories to achieve a transition between two rest positions and compute the corresponding discrete-time feedforward control.

math.DS↗

arXiv2021

Discrete-time Flatness-based Control of a Gantry Crane

This article addresses the design of a discrete-time flatness-based tracking control for a gantry crane and demonstrates the practical applicability of the approach by measurement results. The required sampled-data model is derived by an Euler-discretization with a prior state transformation in such a way that the flatness of the continuous-time system is preserved. Like in the continuous-time case, the flatness-based controller design is performed in two steps. First, the sampled-data system is exactly linearized by a discrete-time quasi-static state feedback. Subsequently, a further feedback enforces a stable linear tracking error dynamics. To underline its practical relevance, the performance of the novel discrete-time tracking control is compared to the classical continuous-time approach by measurement results from a laboratory setup. In particular, it turns out that the discrete-time controller is significantly more robust with respect to large sampling times. Moreover, it is shown how the discrete-time approach facilitates the design of optimal reference trajectories, and further measurement results are presented.

eess.SY↗

arXiv2021

Differential-Geometric Decomposition of Flat Nonlinear Discrete-Time Systems

We prove that every flat nonlinear discrete-time system can be decomposed by coordinate transformations into a smaller-dimensional subsystem and an endogenous dynamic feedback. For flat continuous-time systems, no comparable result is available. The advantage of such a decomposition is that the complete system is flat if and only if the subsystem is flat. Thus, by repeating the decomposition at most $n-1$ times, where $n$ is the dimension of the state space, the flatness of a discrete-time system can be checked in an algorithmic way. If the system is flat, then the algorithm yields a flat output which only depends on the state variables. Hence, every flat discrete-time system has a flat output which does not depend on the inputs and their forward-shifts. Again, no comparable result for flat continuous-time systems is available. The algorithm requires in each decomposition step the construction of state- and input transformations, which are obtained by straightening out certain vector fields or distributions with the flow-box theorem or the Frobenius theorem. Thus, from a computational point of view, only the calculation of flows and the solution of algebraic equations is needed. We illustrate our results by two examples.

math.OC↗

arXiv2021

A Trajectory-Based Approach to Discrete-Time Flatness

For discrete-time systems, flatness is usually defined by replacing the time-derivatives of the well-known continuous-time definition by forward-shifts. With this definition, the class of flat systems corresponds exactly to the class of systems which can be linearized by a discrete-time endogenous dynamic feedback as it is proposed in the literature. Recently, verifiable necessary and sufficient differential-geometric conditions for this property have been derived. In the present contribution, we make an attempt to take into account also backward-shifts. This extended approach is motivated by the one-to-one correspondence of solutions of flat systems to solutions of a trivial system as it is known from the continuous-time case. If we transfer this idea to the discrete-time case, this leads to an approach which also allows backward-shifts. To distinguish the classical definition with forward-shifts and the approach of the present paper, we refer to the former as forward-flatness. We show that flat systems (in the extended sense with backward-shifts) still share many beneficial properties of forward-flat systems. In particular, they still are reachable/controllable, allow a straightforward planning of trajectories and can be linearized by a certain subclass of dynamic feedbacks.

math.DG↗

arXiv2020

A Normal Form for Two-Input Flat Nonlinear Discrete-Time Systems

We show that every flat nonlinear discrete-time system with two inputs can be transformed into a structurally flat normal form by state- and input transformations. This normal form has a triangular structure and allows to read off the flat output, as well as a systematic construction of the parameterization of all system variables by the flat output and its forward-shifts. For flat continuous-time systems no comparable normal form exist.

math.DS↗