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

Andres F. Obando, Diego A. Muñoz

    Research output: Contribution to journalConference articlepeer-review

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)5536-5541
    Number of pages6
    JournalIFAC-PapersOnLine
    Volume53
    Issue number2
    DOIs
    StatePublished - 2020
    Event21st IFAC World Congress 2020 - Berlin, Germany
    Duration: 12 Jul 202017 Jul 2020

    Bibliographical note

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

    Keywords

    • Distance field map
    • Feasible set
    • Medial axis
    • Optimization

    Fingerprint

    Dive into the research topics of 'Efficient feasible set characterization through distance field map algorithm and its use in control'. Together they form a unique fingerprint.

    Cite this