Set-Membership Computation of Admissible Controls for Trajectory Tracking - Archive ouverte HAL Access content directly
Journal Articles Reliable Computing Year : 2017

Set-Membership Computation of Admissible Controls for Trajectory Tracking

Olivier Mullier
Estelle Courtial

Abstract

In a context of predictive control strategy, this paper addresses the computation of admissible control set for a trajectory tracking over a prediction horizon. The proposed method combines numerical methods based on set-membership computation and control methods based on a flatness concept. It makes possible i) to provide a guaranteed computation of admissible controls, ii) to deal with uncertain reference trajectory, iii) to reduce the time complexity of the algorithm compared to the existing approach. Simulations illustrate the efficiency of the developed methods in two different cases. For Single Input-Single Output (SISO) systems, generalized affine forms are computed otherwise a Branch & Prune algorithm with an inner inclusion test is used for Multi Inputs-Multi Outputs (MIMO) systems. The computational time is reduced significantly compared to the one required by the existing approach.
Fichier principal
Vignette du fichier
reliable-computing-24-pp-011-026.pdf (741.86 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01657736 , version 1 (24-01-2019)

Identifiers

  • HAL Id : hal-01657736 , version 1

Cite

Olivier Mullier, Estelle Courtial. Set-Membership Computation of Admissible Controls for Trajectory Tracking. Reliable Computing, 2017. ⟨hal-01657736⟩
36 View
32 Download

Share

Gmail Facebook Twitter LinkedIn More