An Interval Constraint Programming Approach for Quasi Capture Tube Validation

• Published in: Acta chimica Slovenica Vol. 210; no. 18; pp. 18:1 - 18:17
• Main Authors: Bedouhene, Abderahmane, Neveu, Bertrand, Trombettoni, Gilles, Jaulin, Luc, Le Ménec, Stéphane
• Format: Conference Proceeding
• Language: English
• Published: Slovenian Chemical Society 15.10.2021
• Series: Leibniz International Proceedings in Informatics (LIPIcs)
• Subjects: Computer Science; Dynamical Systems; Mathematics; Operations Research
• ISSN: 1318-0207; 1580-3155
• DOI: 10.4230/LIPIcs.CP.2021.18

Proving that the state of a controlled nonlinear system always stays inside a time moving bubble (or capture tube) amounts to proving the inconsistency of a set of nonlinear inequalities in the time-state space. In practice however, even with a good intuition, it is difficult for a human to find such a capture tube except for simple examples. In 2014, Jaulin et al. established properties that support a new interval approach for validating a quasi capture tube, i.e. a candidate tube (with a simple form) from which the mobile system can escape, but into which it enters again before a given time. A quasi capture tube is easy to find in practice for a controlled system. Merging the trajectories originated from the candidate tube yields the smallest capture tube enclosing it. This paper proposes an interval constraint programming solver dedicated to the quasi capture tube validation. The problem is viewed as a differential CSP where the functional variables correspond to the state variables of the system and the constraints define system trajectories that escape from the candidate tube "for ever". The solver performs a branch and contract procedure for computing the trajectories that escape from the candidate tube. If no solution is found, the quasi capture tube is validated and, as a side effect, a corrected smallest capture tube enclosing the quasi one is computed. The approach is experimentally validated on several examples having 2 to 5 degrees of freedom. 2012 ACM Subject Classification Applied computing → Operations research; Mathematics of computing → Ordinary differential equations; Mathematics of computing → Differential algebraic equations; Mathematics of computing → Interval arithmetic; Theory of computation → Constraint and logic programming