EventsThe 2nd International Online Conference on Mathematics and Applications
Published
This submission belongs to the session S5. Control Theory and Mechanics of the event The 2nd International Online Conference on Mathematics and Applications
Published date
04 Jun, 2026
Academic Editor
author-avatarPaolo Mercorelli
Citation
Mehdi Alimohammadi, Mohammad-R Akbarzadeh-T, A Hybrid Pole-Placement and Deadbeat Controller for Discrete-Time Systems, in Proceedings of The 2nd International Online Conference on Mathematics and Applications, 10 June–12 June 2026, MDPI: Basel, Switzerland
Share
Email
Facebook
Twitter
LinkedIn

A Hybrid Pole-Placement and Deadbeat Controller for Discrete-Time Systems

Mohammad-R Akbarzadeh-T 1
1. Department of Electrical Engineering, Center of Excellence on Soft Computing and Intelligent Information Processing, Ferdowsi University of Mashhad, Mashhad, Iran, Iran
Abstract

Introduction: Deadbeat controllers achieve finite-time convergence in discrete-time linear systems by driving all state variables to the origin within exactly n steps, where n denotes the system order. Despite this theoretical optimality, pure deadbeat control suffers from prohibitively large initial control magnitudes, frequently inducing actuator saturation and rendering the controller impractical for physical implementation. This fundamental trade-off between convergence speed and control feasibility constitutes a critical open challenge in digital control design.

Methods: This paper proposes a two-phase hybrid control architecture that rigorously reconciles finite-time convergence with actuator constraints. During Phase I (1 to m), an Ackermann pole-placement law repositions the closed-loop eigenvalues to prescribed locations within the open unit disk, moderating transient control amplitudes while ensuring asymptotic state reduction. At step m+1, Phase II activates a standard deadbeat formulation that eliminates the residual error in exactly n additional steps. A unified state-space formulation is derived, and Lyapunov-based stability arguments confirm that the switching does not introduce instability. The total convergence time is analytically determined to be T_c = m + n steps.

Results: Comparative simulations on a second-order discrete-time plant (n=2) demonstrate that the hybrid scheme significantly reduces peak control effort. Specifically, the peak effort drops from 9.50 in pure deadbeat to 3.80 and 3.72 for hybrid modes m=2 and m=4, respectively, achieving up to a 61% reduction. Meanwhile, the Mean Square Error (MSE) shifts from 4.13 (pure deadbeat) to 5.58 (m=2) and 5.45 (m=4). This confirms that increasing the switching instant m effectively reduces peak control magnitude at the cost of a proportional increase in settling time and transient error.

Conclusions: The proposed m-step Ackermann / (m+1)-deadbeat hybrid controller provides a formally grounded, tunable framework for discrete-time control design. By parameterizing the switching instant m, practitioners can explicitly trade off convergence speed for reduced control effort, enabling actuator-aware implementation without sacrificing the zero-steady-state-error guarantee of deadbeat control.

Keywords
Discrete-time systems
Deadbeat control
Pole placement
Ackermann's formula
Hybrid switching controllers
Actuator saturation
Control effort minimization.
Poster
Poster.pdf
Optimal Control Strategies for Predator–Prey Systems with Bang–Bang and Quadratic Control Terms.
New Parametric Curves for the Brachistochrone Optimal Control Problem Using the Dynamic Programming Method