Towards a Generic Interval Solver for Differential-Algebraic CSP - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Towards a Generic Interval Solver for Differential-Algebraic CSP


In this paper, we propose an interval constraint programming approach that can handle the differential-algebraic CSP (DACSP), where an instance is composed of real and functional variables (also called dynamic variables or trajectories) together, and differential and/or “static” numerical constraints among those variables. Differential-Algebraic CSP systems can model numerous real-life problems occurring in physics, biology or robotics. We introduce a solver, built upon the Tubex and Ibex interval libraries, that can rigorously approximate the set of solutions of a DACSP system. The solver achieves temporal slicing and a tree search by splitting trajectories domains. Our approach provides a significant step towards a generic interval CP solver for DACSP that has the potential to handle a large variety of constraints. First experiments highlight that this solver can tackle interval Initial Value Problems (IVP), Boundary Value Problems (BVP) and integro-differential equations.
Fichier principal
Vignette du fichier
dacsp_paper.pdf (458.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02956402 , version 1 (03-10-2020)



Simon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, et al.. Towards a Generic Interval Solver for Differential-Algebraic CSP. CP 2020 - 26th International Conference on Principles and Practice of Constraint Programming, Simonis, Helmut, Sep 2020, Louvain-la-Neuve, Belgium. pp.548-565, ⟨10.1007/978-3-030-58475-7_32⟩. ⟨hal-02956402⟩
222 View
269 Download



Gmail Facebook Twitter LinkedIn More