Efficient feasible set characterization through distance field map algorithm and its use in control

Andres F. Obando, Diego A. Muñoz

    Resultado de la investigación: Contribución a una revistaArtículo de la conferenciarevisión exhaustiva

    Resumen

    The feasibility of processes is a well-used notion with several definitions in the literature according to each context. This is understood as the region of operative variables where phenomena of processes occur. In this work, we propose a definition for the feasibility set and explain an algorithm to characterize efficiently its shape and size. Additionally, we define a feasibility index to quantify the belonging grade of a point inside the feasible set, instead of the yes/no usual belonging function. Finally, this paper shows the use of previous concepts for control proposes. In an example, we found the set-point for a process through an optimization problem, guaranteeing the feasibility in the presence of disturbances and improving its productivity.

    Idioma originalInglés
    Páginas (desde-hasta)5536-5541
    Número de páginas6
    PublicaciónIFAC-PapersOnLine
    Volumen53
    N.º2
    DOI
    EstadoPublicada - 2020
    Evento21st IFAC World Congress 2020 - Berlin, Alemania
    Duración: 12 jul. 202017 jul. 2020

    Nota bibliográfica

    Publisher Copyright:
    Copyright © 2020 The Authors. This is an open access article under the CC BY-NC-ND license

    Huella

    Profundice en los temas de investigación de 'Efficient feasible set characterization through distance field map algorithm and its use in control'. En conjunto forman una huella única.

    Citar esto