Inter-block backtracking: Exploiting the structure in continuous CSPs

Lecture Notes in Computer Science

Volumn 3478, Issue , 2005, Pages 15-30

  Neveu, Bertrand ^a   Jermann, Christophe ^b   Trombettoni, Gilles ^a  

^a INRIA   (France)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

Backtracking; Decomposition; Intervals; Solving sparse systems

Indexed keywords

GRAPH THEORY; NONLINEAR EQUATIONS; SIGNAL FILTERING AND PREDICTION;

BACKTRACKING; INTER-BLOCK BACKTRACKING (IBB); INTERVALS; SOLVING SPARSE SYSTEMS;

TRACKING (POSITION);

EID: 24944548440     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11425076_2     Document Type: Conference Paper

References (19)

1. S. Ait-Aoudia, R. Jegou, and D. Michelucci. Reduction of constraint systems. In Compugraphic, 1993.
2. Christian Bliek, Bertrand Neveu, and Gilles Trombettoni. Using graph decomposition for solving continuous csps. In Principles and Practice of Constraint Programming, CP'98, volume 1520 of LNCS, pages 102-116. Springer, 1998.
3. W. Bouma, I. Pudos, C.M. Hoffmann, J. Cai, and R. Paige. Geometric constraint solver. Computer Aided Design, 27(6):487-501, 1995.
4. B. Buchberger. An algebraic method in ideal theory. In Multidimensional System Theory, pages 184-232. Reidel Publishing Co., 1985.
5. B. Mourrain D. Bondyfalat and T. Papadopoulo. An application of automatic theorem proving in computer vision. In 2nd International Workshop on Automated Deduction in Geometry, Springer-Verlag, 1999.
6. Rina Dechter. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41(3):273-312, January 1990.
7. C. Durand. Symbolic and Numerical Techniques For Constraint Solving. PhD thesis, Purdue University, 1998.
8. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica : A Modeling Language for Global Optimization. MIT Press, 1997.
9. Christoph Hoffmann, Andrew Lomonossov, and Meera Sitharam. Finding solvable subsets of constraint graphs. In Proc. Constraint Programming CP'97, pages 463-477, 1997.
10. L. Jaulin, M. Kieffer, O. Didrit, and E. Walter. Applied Interval Analysis. Springer-Verlag, 2001.
11. Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, and Michel Rueher. A constraint programming approach for solving rigid geometric systems. In Principles and Practice of Constraint Programming, CP 2000, volume 1894 of LNCS, pages 233-248, 2000.
12. E. Lahaye. Une méthode de résolution d'une catégorie d'équations transcendantes. Compte-rendu des Séances de L'Académie des Sciences, 198:1840-1842, 1934.
13. R.S. Latham and A.E. Middleditch. Connectivity analysis: A tool for processing geometric constraints. Computer Aided Design, 28(11):917-928, 1996.
14. O. Lhomme. Consistency techniques for numeric csps. In IJCAI, pages 232-238, 1993.
15. D.A. McAllester. Partial order backtracking. Research Note, Artificial Intelligence Laboratory, MIT, 1993. ftp://ftp.ai.mit.edu/people/dam/dynamic.ps.
16. Jean-Pierre Merlet. Optimal design for the micro robot. In in IEEE Int. Conf. on Robotics and Automation, 2002.
17. Gilles Trombettoni and Marta Wilczkowiak. Scene Reconstruction based on Constraints: Details on the Equation System Decomposition. In Proc. International Conference on Constraint Programming, CP'03, volume LNCS 2833, pages 956-961, 2003.
18. Marta Wilczkowiak, Gilles Trombettoni, Christophe Jermann, Peter Sturm, and Edmond Boyer. Scene Modeling Based on Constraint System Decomposition Techniques. In Proc. International Conference on Computer Vision, ICCV'03, 2003.
19. W. Wu. Basic principles of mechanical theorem proving in elementary geometries. J. Automated Reasoning, 2:221-254, 1986.