Interval constraint solving for camera control and motion planning

ACM Transactions on Computational Logic

Volumn 5, Issue 4, 2004, Pages 732-767

  Benhamou, Frédéric ^a   Goualard, Frédéric ^a   Languénou, Éric ^a   Christie, Marc ^a  

^a CNRS   (France)

Author keywords

Camera control; Inner approximation; Interval constraint; Universal quantifier

Indexed keywords

CAMERA CONTROL; INNER APPROXIMATION; INTERVAL CONSTRAINTS; UNIVERSAL QUANTIFIERS;

APPROXIMATION THEORY; CAMERAS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONTROL SYSTEMS; DEGREES OF FREEDOM (MECHANICS); MATHEMATICAL MODELS;

CONSTRAINT THEORY;

EID: 8344271961     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1024922.1024927     Document Type: Article

References (62)

1. ABDALLAH, C., DORATO, P., YANG, W., LISKA, R., AND STEINBERG S. 1996. Applications of quantifier eliminatian theory to control theory. In Proceedings of the 4th IEEE Mediterranean Symposium on Control and Automation (Malene, Crete, Greece). 340-345.
2. ABRAMS, S. AND ALLEN, P. K. 1997. Computing camera viewpoints in an active robot work-cell. IBM Res. rep. RC 20987. IBM Research Division, Yorktown Heights, NT.
3. ALEFELD, G. AND HERZBERGER, J. 1983. Introduction to Interval Computations. Academic Press Inc., New York, NY.
4. ARIJON, D. 1976. Grammar of the Film Language. Hastings House Publishers, New York, NY.
5. ARMENGOL, J., TEAVÉ-MASSUYÈS, L., VEHÍ, J., AND SÁINZ, M. A. 1998. Modal interval analysis for error-bounded semiqualitative simulation. In 1r Congrés Català d'Intelligèneia Artificial. 223-231.
6. BENHAMOU, F. 1995. Interval constraint logic programming. In Constraint Programming: Basics and Trends: 1994 Châtillon Spring School, Châtillon-sur-Seine, France, May 16-20, 1994, A. Podelski, Ed. Lecture Notes in Computer Science, vol. 910. Springer-Verlag, Berlin, Germany, 1-21.
7. BENHAMOU, F. 1996. Heterogeneous constraint solving. In Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP'96). Lecture Notes in Computer Science, vol. 1139. Springer-Verlag, Aachen, Germany, 62-76.
8. BENHAMOU, F., GOUALARD, F., GRANVILLIERS, L., AND PUGET, J.-F. 1999. Revising hull and box consistency. In Proceedings of the 16th International Conference on Logic Programming (ICLP'99). MIT Press, Cambridge, MA. 230-244.
9. BENHAMOU, F., MCALLESTER, D., AND VAN HENTENRYCK, P. 1994. CLP(Intervals) revisited. In Proceedings of the International Symposium on Logic Programming (ILPS'94). MIT Press, Cambridge, MA, 124-138.
10. BENHAMOU, F. AND OLDER, W. J. 1997. Applying interval arithmetic to real, integer and Boolean constraints. J. Logic Programm. 32, 1, 1-24.
11. BLINN, J. 1988. Where am I? What am I looking at? IEEE Comput. Graph. Appl. 8, 4 (July), 76-81.
12. CHRISTIE, M., LANGUÉNOU, E., AND GRANVILLIERS, L. 2002. Modeling camera control with constrained hypertubes. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP'2002), P. V. Hentenryck, Ed. Lecture Notes in Computer Science, vol. 2470. Springer-Verlag, Berlin, Germany, 618-632.
13. COLLAVIZZA, H., DELOBEL, F., AND RUEHER, M. 1999. Extending consistent domains of numeric CSP. In Proceedings of the 16th IJCAI. (Stockholm, Sweden). Vol. 1. 406-411.
14. COLLINS, G. E. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol. 33. Springer, Kaiserslauten, Germany, 134-183.
15. DAVENPORT, G., SMITH, T. A., AND PINCEVER, N. 1991. Cinematic primitives for multimedia. IEEE Comput. Graph. Appl. 11, 4 (July), 67-74.
16. DRUCKER, S. M. 1994. Intelligent camera control for graphical environments. Ph.D. dessertation. Program in Media Arts and Sciences, School of Architecture and Planning, MIT, Cambridge, MA.
17. DRUCKER, S. M., GALYSAN, T. A., AND ZELTZER, D. 1992. CINEMA: A system for procedural camera movements. In Proceedings of the 1992 Symposium on Interactive 3D Graphics, M. Levoy and E. E. Catmull, Eds. ACM Press, New York, NY, 67-70.
18. DRUCKER, S. M. AND ZELTZER, D. 1994. Intelligent camera control in a virtual environment. In Proceedings of Graphics Interface '94. Canadian Information Processing Society, Banff, Alta., Canada, 190-199.
19. EBERS, J. J. AND MOLL, J. L. 1954. Large-scale behaviour of junction transistors. IRE Procs. 42, 1761-1772.
20. EMIRIS, I. Z. AND MOURRAIN, B. 1999. Computer algebra methods for studying and computing molecular conformations. Algorithmica 25, 2/3, 372-402.
21. FAROUKI, R. T. AND RAJAN, V. T. 1987. On the numerical condition of polynomials in Bernstein form. Comput. Aided Geom. Des. 4, 191-216.
22. GARDEÑES, E. AND TREPAT, A. 1980. Fundamentals of SIGLA, an interval computing system over the completed set of intervals. Comput. 24, 2-3, 161-179.
23. GARDENES, E. H. AND MIELGO, H. 1986. Modal intervals: Reasons and ground semantics. Inlnterval Mathematics. Lecture Notes in Computer Science, vol. 212. Springer-Verlag, Berlin, Germany.
24. GARLOFF, J. AND GRAF, B. 1999. Solving strict polynomial inequalities by Bernstein expansion. In The Use of Symbolic Methods in Control System Analysis and Design, N. Munro, Ed. The Institution of Electrical Engineers, London, England, 339-352.
25. GLEICHER, M. AND WITKIN, A. 1992. Through-the-lens camera control. In Comput. Graph. (SIGGRAPH '92 Proceedings, E. E. Catmull, Ed.). 26, 2, 331-340.
26. GRANVILLIERS, L. AND BENHAMOU, F. 2001. Progress in the solving of a circuit design problem. J. Global Opt. 20, 2, 155-168.
27. HANSEN, E. R. 1992. Global Optimization Using Interval Analysis. Pure and Applied Mathematics. Marcel Dekker Inc, New York, NY.
28. HAROUD, D. AND FALTINGS, B. 1994. Global consistency for continuous constraints. Lecture Notes in Computer Science, vol. 874. Springer-Verlag, Berlin, Germany, 40-50.
29. HONG, H. AND BUCHBERGER, B. 1991. Speeding-up quantifier elimination by Gröbner bases. Tech. Rep. 91-06. RISC-Linz, Johannes Kepler University, Linz, Austria.
30. IEEE. 1985. IEEE standard for binary floating-point arithmetic. Tech. rep. IEEE Std 754-1985.
31. Institute of Electrical and Electronics Engineers, Piscataway, NJ. Reaffirmed 1990.
32. JARDILLIER, F. AND LANGUÉNOU, É. 1998. Screen-space constraints for camera movements: the virtual cameraman. In Eurographics'98 proceedings, N. Ferreira and M. Göbel, Eds. Vol. 17. Blackwell Publishers, Oxford, UK, 175-186.
33. JAULIN, L. AND WALTER, E. 1993. Set inversion via interval analysis for nonlinear bounded-error estimation. Automatica 29, 4, 1053-1064.
34. JAULIN, L. AND WALTER, E. 1996. Guaranteed tuning with application to robust control and motion planning. Automatica 32. 8, 1217-1221.
35. JIRSTRAND, M. 1995. Cylindrical algebraic decomposition - an introduction. Tech. Rep. 1995-10-18, Department of Electrical Engineering, Linköping University, Linkoping, Sweden.
36. KAUCHEH. E. W. 1980. Interval analysis in the extended interval space IR. Comput. (Supplementum) 2, 33-49.
37. KUTSIA, T. AND SCHICHO, J. 1999. Numerical solving of constraints of multivariate polynomial strict inequalities. Tech. rep. 99-31. RISC Institute, Johannes Kepler University, Linz, Austria.
38. LEFÈVRE, V., MULLER, J.-M., AND TISSERAND, A. 1998. Towards correctly rounded transcendeatals. IEEE Trans. Comput. 47, 11 (Nov.), 1235-1243.
39. MACKWORTH, A. K. 1977. Consistency in networks of relations. Art. Intell. 1, 8, 99-118.
40. MAEKOV, S. 1995. On directed interval arithmetic and its applications. J. Univers. Comput. Sci. 1, 7, 514-526.
41. METNTJES, K. AND MORGAN, A. P. 1990. Chemical equilibrium systems as numerical test problems. ACM Trans. Math. Softw. 16, 2 (June), 143-151.
42. MOORE, R. E. 1966. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ.
43. NEUMAIER, A. 1990. Interval Methods for Systems of Equations. Encyclopedia of Mathematics and its Applications, vol. 37. Cambridge Unversity Press, Cambridge, U.K.
44. OLDER, W. J. AND VELLINO, A. 1990. Extending Prolog with constraint arithmetic on real intervals. In Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering. IEEE Computer Society Press, New York, NY.
45. PAU, P. AND SCHICHO, J. 2000. Quantifier Elimination for trigonometric polynomials by cylindrical trigonometric decomposition. J. Symbol. Computat. 29, 6 (June), 971-983.
46. PUGET, J.-F. 1994. AC++ implementation of CLP. In Proceedings of the Singapore Conference on Intelligent Systems (SPICIS'94, Singapore).
47. PUGET, J.-F. AND VAN HENTENRYCK, P. 1998. A constraint satisfection approach to a circuit design problem. J. Global Opt. 13, 75-93.
48. RADEMACHER, H. A. 1948. On the accumulation of errors in processes of integration on high-speed calculating machines. Annals Comput. Laor. Harvard Univ. 16, 176-185. Cited in Stoer and Bulirsch [1993].
49. SAM, J. 1995. Constraint consistency techniques for continuous domains. Ph.D). dissertation. École polytechnique fédérale de Lausanne, Lausanne, Switzerland.
50. SHARY, S. P. 1995. Algebraic solutions to interval linear equations and their applications. La Numerical Methods and Error Bounds, Proceedings of the IMACS-GAMM International Symposium on Numerical Methods and Error Bounds, G. Alefeld and J. Herzfaerger, Eds. Akademie Verlag, Oldenburg, Germany, 224-233.
51. SHARY, S. P. 1999. Interval Gauss-Seidel method for generalized solution sets to interval linear systems. In MISC'99 - Workshop on Applications of Interval Analysis to Systems and Control (Girona, Spain). 51-65.
52. SHOEMAKE, K. 1985. Animation rotations with quaternion curves. Comput. Graph. Proceedings of SIGGRAPH'83, San Francisco, CA). 19, 3, 245-254.
53. SNYDER, J. M. 1992. Interval analysis for computer graphics. In Computer Graphics (SIGGRAPH '92 Proceedings, E. E. Catmull. Ed.). 28, 2, 121-130.
54. STOER, J. AND BULIRSCH, R. 1993. Introduction to Numerical Analysis, 2nd ed. In Texts in Applied Mathematics, vol. 12. Springer, Heidelberg, Germany.
55. SUNAGA, T. 1958. Theory of an interval algebra and its application to numerical analysis. In Research Association of Applied Geometry Memoirs of the Unifying Study of Basic Problems in Engineering and Physical Sciences by Means of Geometry, K. Kondo, Ed. Vol. 2. Gaknjutsu Bunken Fukyu-Kai, Japan, Chapter Miscellaneous Subjects II, 547-564.
56. TARABANIS, K. 1990. Automated sensor planning and modeling for robotic vision tasks Tech. rap. CUCS-045-90. Columbia University, New York, NY.
57. TURING, A. M. 1948. Rounding-off errors in matrix processes. Quart. J. Mech. 1, 287-308. Cited in Wilkinson [1963].
58. VAN HENTENRYCK, P., MCALLESTER, D., AND KAPUR, D. 1997a. Solving polynomial systems using a branch and prune approach. SIAM J. Numer. Anal. 34, 2 (April), 797-827.
59. VAN HENTENRYCK, P., MICHEL, L., AND DEVILLE, Y. 1997b. Numerica: A Modeling Language for Global Optimization. MIT Press, Cambridge, MA.
60. WALTZ, D. L. 1975. Understanding line drawings of scenes with shadows. In The Psychology of Computer Vision, P. H. Winston, B. Horn, M. Minsky, and Y. Shirai, Eds. McGraw-Hill, New York, NY, Chap. 2, 19-91.
61. WARD, A. C., LOZANO-PÉREZ, T., AND SEERING, W. P. 1989. Extending the constraint propagation of intervals. In Proceedings of IJCAI'89. 1453-1458.
62. WILKINSON, J. H. 1963. Bounding Errors in Algebraic Processes. Prentice-Hall, New Jersey. Reprinted as Dover Publications (1994)