Interval-based projection method for under-constrained numerical systems

This paper presents an interval-based method that follows the branch-and-prune scheme to compute a verified paving of a projection of the solution set of an under-constrained system. Benefits of this algorithm include anytime solving process, homogeneous verification of inner boxes, and applicability to generic problems, allowing any number of (possibly nonlinear) equality and inequality constraints. We present three key improvements of the algorithm dedicated to projection problems: (i) The verification process is enhanced in order to prove faster larger boxes in the projection space. (ii) Computational effort is saved by pruning redundant portions of the solution set that would project identically. (iii) A dedicated branching strategy allows reducing the number of treated boxes. Experimental results indicate that various applications can be modeled as projection problems and can be solved efficiently by the proposed method.

[1]  Stefan Ratschan,et al.  Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving , 2000, J. Univers. Comput. Sci..

[2]  Pascal Van Hentenryck,et al.  Numerica: A Modeling Language for Global Optimization , 1997, IJCAI.

[3]  Hassan K. Khalil,et al.  Nonlinear Systems Third Edition , 2008 .

[4]  Sergey P. Shary,et al.  A New Technique in Systems Analysis Under Interval Uncertainty and Ambiguity , 2002, Reliab. Comput..

[5]  Gilles Trombettoni,et al.  Exploiting Monotonicity in Interval Constraint Propagation , 2010, AAAI.

[6]  K. Baker,et al.  Standardized notation in interval analysis , 2010 .

[7]  Arnold Neumaier,et al.  The enclosure of solutions of parameter-dependent systems of equations , 1988 .

[8]  R. Baker Kearfott,et al.  Algorithm 681: INTBIS, a portable interval Newton/bisection package , 1990, TOMS.

[9]  Pascal Van Hentenryck,et al.  CLP(Intervals) Revisited , 1994, ILPS.

[10]  Vladik Kreinovich,et al.  Algorithms That Still Produce a Solution (Maybe Not Optimal) Even When Interrupted: Shary's Idea Justified , 1998, Reliab. Comput..

[11]  Josep Vehí,et al.  Guaranteed set-point computation with application to the control of a sailboat , 2010 .

[12]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[13]  Luc Jaulin,et al.  Inner Approximation of the Range of Vector-Valued Functions , 2010, Reliab. Comput..

[14]  Alex M. Andrew,et al.  Applied Interval Analysis: With Examples in Parameter and State Estimation, Robust Control and Robotics , 2002 .

[15]  Luc Jaulin,et al.  Inner and Outer Approximations of Existentially Quantified Equality Constraints , 2006, CP.

[16]  Alexandre Goldsztejn.  A branch and prune algorithm for the approximation of non-linear AE-solution sets , 2006, SAC '06.

[17]  Olivier Lhomme,et al.  Consistency Techniques for Numeric CSPs , 1993, IJCAI.

[18]  Josep Vehí,et al.  Quantified Set Inversion Algorithm with Applications to Control , 2005, Reliab. Comput..

[19]  G. E. Collins,et al.  Quantifier Elimination by Cylindrical Algebraic Decomposition — Twenty Years of Progress , 1998 .

[20]  E. Hansen,et al.  Bounding solutions of systems of equations using interval analysis , 1981 .

[21]  P. Olver.  Nonlinear Systems , 2013 .

[22]  A. Neumaier.  Interval methods for systems of equations , 1990 .