Improving inter-block backtracking with interval Newton
- 70 Downloads
Inter-block backtracking (IBB) computes all the solutions of sparse systems of nonlinear equations over the reals. This algorithm, introduced by Bliek et al. (1998) handles a system of equations previously decomposed into a set of (small) k ×k sub-systems, called blocks. Partial solutions are computed in the different blocks in a certain order and combined together to obtain the set of global solutions. When solutions inside blocks are computed with interval-based techniques, IBB can be viewed as a new interval-based algorithm for solving decomposed systems of nonlinear equations. Previous implementations used Ilog Solver and its IlcInterval library as a black box, which implied several strong limitations. New versions come from the integration of IBB with the interval-based library Ibex. IBB is now reliable (no solution is lost) while still gaining at least one order of magnitude w.r.t. solving the entire system. On a sample of benchmarks, we have compared several variants of IBB that differ in the way the contraction/filtering is performed inside blocks and is shared between blocks. We have observed that the use of interval Newton inside blocks has the most positive impact on the robustness and performance of IBB. This modifies the influence of other features, such as intelligent backtracking. Also, an incremental variant of inter-block filtering makes this feature more often fruitful.
KeywordsIntervals Decomposition Solving sparse systems
Unable to display preview. Download preview PDF.
- 1.Benhamou, F., Goualard, F., Granvilliers, L., & Puget, J.-F. (1999). Revising hull and box consistency. In ICLP (pp. 230–244).Google Scholar
- 2.Bliek, C., Neveu, B., & Trombettoni, G. (1998). Using graph decomposition for solving continuous CSPs. In Proc. CP’98, LNCS (Vol. 1520, pp. 102–116).Google Scholar
- 4.Chabert, G. (2009). Ibex—An Interval based EXplorer. www.ibex-lib.org.
- 5.Chabert, G., & Jaulin, L. (2009). Contractor programming. Artificial Intelligence. Accessed 18 March 2009.Google Scholar
- 6.Debruyne, R., & Bessière, C. (1997). Some practicable filtering techniques for the constraint satisfaction problem. In Proc. of IJCAI (pp. 412–417).Google Scholar
- 8.Granvilliers, L. (2003). RealPaver user’s manual, version 0.3. University of Nantes. www.sciences.-univ-nantes.fr/info/perso/permanents/granvil/realpaver.
- 10.Hoffmann, C., Lomonossov, A., & Sitharam, M. (1997). Finding solvable subsets of constraint graphs. In Proc. constraint programming CP’97 (pp. 463–477).Google Scholar
- 11.ILOG, Av. Galliéni, Gentilly (2000). Ilog solver V. 5, users’ reference manual.Google Scholar
- 13.Jermann, C., Neveu, B., & Trombettoni, G. (2003). Algorithms for identifying rigid subsystems in geometric constraint systems. In Proc. IJCAI (pp. 233–38).Google Scholar
- 14.Jermann, C., Neveu, B., & Trombettoni, G. (2003). Inter-Block backtracking: Exploiting the structure in continuous CSPs. In Proc. of 2nd int. workshop on global constrained optimization and constraint satisfaction (COCOS’03).Google Scholar
- 17.Lebbah, Y. (1999). Contribution à la résolution de contraintes par consistance forte. Ph.D. thesis, Université de Nantes.Google Scholar
- 19.Lhomme, O. (1993). Consistency techniques for numeric CSPs. In IJCAI (pp. 232–238).Google Scholar
- 20.McAllester, D. A. (1993). Partial order backtracking. Research note, artificial intelligence laboratory, MIT. ftp://ftp.ai.mit.edu/people/dam/dynamic.ps.
- 21.Merlet, J.-P. (2002). Optimal design for the micro parallel robot MIPS. In Proc. of IEEE international conference on robotics and automation, ICRA ’02, Washington DC, USA (Vol. 2, pp.1149–1154).Google Scholar
- 23.Neveu, B., Jermann, C., & Trombettoni, G. (2005). Inter-Block backtracking: Exploiting the structure in continuous CSPs. In Selected papers in the 2nd int. worksh. on global constrained optimization and constraints, COCOS, LNCS (Vol. 3478, pp. 15–30).Google Scholar
- 24.Trombettoni, G., & Chabert, G., (2007). Constructive interval disjunction. In Proc. of CP (pp. 635–650).Google Scholar
- 25.Van Hentenryck, P., Michel, L., & Deville Y. (1997). Numerica: A modeling language for global optimization. Cambridge: MIT.Google Scholar
- 26.Wilczkowiak, M., Trombettoni, G., Jermann, C., Sturm, P., & Boyer, E. (2003). Scene modeling based on constraint system decomposition techniques. In Proc. ICCV.Google Scholar