Including Ordinary Differential Equations Based Constraints in the Standard CP Framework

Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the numerical constraint satisfaction problem framework in a natural and efficient way. Slightly adapted standard filtering algorithms proposed in the numerical constraint satisfaction problem framework are applied to these constraints leading to a branch and prune algorithm that handles ordinary differential equations based constraints. Preliminary experiments are presented.

• Type: Journal
• Year: 2010
• Where: CP
• Authors: Alexandre Goldsztejn, Olivier Mullier, Damien Eveillard, Hiroshi Hosobe
• Keywords: Artificial Intelligence, Constraint Satisfaction Problem, CP 2010, Numerical Constraint Satisfaction, Standard Filtering Algorithms