Back to Search
Start Over
Solving non-linear constraint satisfation problems involving time-dependant functions
- Source :
- Mathematics in Computer Science, Mathematics in Computer Science, Springer, 2014, 8 (3-4), pp.503-524. ⟨10.1007/s11786-014-0209-6⟩
- Publication Year :
- 2014
- Publisher :
- HAL CCSD, 2014.
-
Abstract
- International audience; In this paper, we consider the resolution of non-linear constraint satisfaction problems where the variables of the systems are trajectories (functions from R to Rn). We introduce the notion of tubes as intervals of functions, for which the lower and upper bounds are trajectories with respect to the inclusion. We then define basic operators and prove propositions verified by tubes. We show the possibility to build contractors on tubes and propagate constraints to solve problems involving time-dependant functions as the unknown variables.We show that the approach is particularly powerful when inter-temporal equations (e.g. delays) are involved. Finally, in order to illustrate the principle and efficiency of the approach, several test cases are provided.
- Subjects :
- 0209 industrial biotechnology
Mathematical optimization
Applied Mathematics
02 engineering and technology
Resolution (logic)
[SPI.AUTO]Engineering Sciences [physics]/Automatic
Computational Mathematics
Nonlinear system
020901 industrial engineering & automation
Test case
Computational Theory and Mathematics
0202 electrical engineering, electronic engineering, information engineering
Interval analysis Constraint satisfaction problem Tubes Time dependant functions Primary 65G40 Secondary 65G30
Order (group theory)
020201 artificial intelligence & image processing
Dependant
Constraint satisfaction problem
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 16618270 and 16618289
- Database :
- OpenAIRE
- Journal :
- Mathematics in Computer Science, Mathematics in Computer Science, Springer, 2014, 8 (3-4), pp.503-524. ⟨10.1007/s11786-014-0209-6⟩
- Accession number :
- edsair.doi.dedup.....0eb03f255c6599b91732420e6806840f
- Full Text :
- https://doi.org/10.1007/s11786-014-0209-6⟩