1 Search Results for "Trombettoni, Gilles"


Document
An Interval Constraint Programming Approach for Quasi Capture Tube Validation

Authors: Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, and Stéphane Le Menec

Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)


Abstract
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.

Cite as

Abderahmane Bedouhene, Bertrand Neveu, Gilles Trombettoni, Luc Jaulin, and Stéphane Le Menec. An Interval Constraint Programming Approach for Quasi Capture Tube Validation. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Copy BibTex To Clipboard

@InProceedings{bedouhene_et_al:LIPIcs.CP.2021.18,
  author =	{Bedouhene, Abderahmane and Neveu, Bertrand and Trombettoni, Gilles and Jaulin, Luc and Le Menec, St\'{e}phane},
  title =	{{An Interval Constraint Programming Approach for Quasi Capture Tube Validation}},
  booktitle =	{27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
  pages =	{18:1--18:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-211-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{210},
  editor =	{Michel, Laurent D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.18},
  URN =		{urn:nbn:de:0030-drops-153093},
  doi =		{10.4230/LIPIcs.CP.2021.18},
  annote =	{Keywords: Constraint satisfaction problem, Interval analysis, Dynamical systems, Contractor}
}
  • Refine by Author
  • 1 Bedouhene, Abderahmane
  • 1 Jaulin, Luc
  • 1 Le Menec, Stéphane
  • 1 Neveu, Bertrand
  • 1 Trombettoni, Gilles

  • Refine by Classification
  • 1 Applied computing → Operations research
  • 1 Mathematics of computing → Differential algebraic equations
  • 1 Mathematics of computing → Interval arithmetic
  • 1 Mathematics of computing → Ordinary differential equations
  • 1 Theory of computation → Constraint and logic programming

  • Refine by Keyword
  • 1 Constraint satisfaction problem
  • 1 Contractor
  • 1 Dynamical systems
  • 1 Interval analysis

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail