Advertisement

Omnidirectional Sensing for Robot Control

  • Kostas Daniilidis
  • Christopher Geyer
  • Volkan Isler
  • Ameesh Makadia
Chapter
Part of the Springer Tracts in Advanced Robotics book series (STAR, volume 4)

Abstract

Most of today’s mobile robots are equipped with some kind of omnidirectional camera. The advantages of such sensors in tasks like navigation, homing, appearance-based localization cannot be overlooked. In this paper, we address the basic questions of how to process omnidirectional signals, how to describe the intrinsic geometry of omnidirectional cameras with a single viewpoint, how to infer 3D motion, and how to place omnidirectional sensors efficiently to guarantee complete coverage.

Keywords

Robot Control Simple Polygon Polar Point Camera Location Absolute Conic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E.H. Adelson and J.R. Bergen. The plenoptic function and the elements of early vision. In M. Landy and J. A. Movshon, editors, Computational Models of Visual Processing. MIT Press, 1991.Google Scholar
  2. 2.
    P.K. Agarwal and S. Sen. Randomized algorithms for geometric optimization problems. Handbook of Randomization (P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, eds.), Kluwer Academic Publishers, to appear.Google Scholar
  3. 3.
    H. Bronnimann and M.T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry, 14(4):463–479, 1995.CrossRefMathSciNetGoogle Scholar
  4. 4.
    G.S. Chirikjian and A.B. Kyatkin. Engineering Applications of Noncommuta-tive Harmonic Analysis: WIth Emphasis on Rotation and Motion Groups. CRC Press, 2000.Google Scholar
  5. 5.
    K. Daniilidis, A. Makadia, and T. Bülow. Image processing in catadioptric planes: Spatiotemporal derivatives and optical flow computation. In Workshop on Omnidirectional Vision, Copenhagen, June 22, pages 3–12, 2002.Google Scholar
  6. 6.
    J.R. Driscoll and D.M. Healy. Computing fourier transforms and convolutions on the 2-sphere. Advances in Applied Mathematics, 15:202–250, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    O. Faugeras, Q.-T. Luong, and T. Papadopoulo. The Geometry of Multiple Images: The Laws That Govern the Formation of Multiple Images of a Scene and Some of Their Applications. MIT Press, 2001.Google Scholar
  8. 8.
    C. Geyer and K. Daniilidis. Catadioptric projective geometry. International Journal of Computer Vision, 43:223–243, 2001.CrossRefGoogle Scholar
  9. 9.
    C. Geyer and K. Daniilidis. Properties of the catadioptric fundamental matrix. In Proc. Seventh European Conference on Computer Vision, pages 140–154, Copenhagen, Denmark, 2002.Google Scholar
  10. 10.
    R. Hartley and A. Zisserman. Multiple View Geometry. Cambridge Univ. Press, 2000.Google Scholar
  11. 11.
    V. Heine. Group Theory in Quantum Mechanics. Pergamon Press, Oxford, 1960.zbMATHGoogle Scholar
  12. 12.
    I.V. Isler, S. Kannan, and K. Daniilidis. VC-dimension of exterior visibility of polyhedra. Technical Report MS-CIS-01-34, Computer and Information Science, University of Pennsylvania, 2001.Google Scholar
  13. 13.
    J. Matousek. Geometric computation and the art of sampling. In IEEE Symposium on Foundations of Computer Science, 1998.Google Scholar
  14. 14.
    L. Matthies. Stereo vision for planetary rovers: Stochastic modeling to near real-time implementation. International Journal of Computer Vision, 8:71–91, 1992.CrossRefGoogle Scholar
  15. 15.
    K. McIsaac and J. Ostrowski. Motion planning for dynamic eel-like robots. In IEEE Conf. on Robotics and Automation, 2000.Google Scholar
  16. 16.
    J. O’Rourke. Art Gallery Theorems And Algorithms. Oxford University Press, 1987.Google Scholar
  17. 17.
    J. Semple and G. Kneebone. Algebraic Projective Geometr. Oxford University Press, 1979.Google Scholar
  18. 18.
    P. Slavik. A tight analysis of the greedy algorithm for set cover. Journal of Algorithms, 25:237–254, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    P. Valtr. Guarding galleries where no point sees a small area. Israel Journal of Mathematics, 104:1–16, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264–280, 1971.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kostas Daniilidis
    • 1
  • Christopher Geyer
    • 1
  • Volkan Isler
    • 1
  • Ameesh Makadia
    • 1
  1. 1.GRASP Laboratory and Department of Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations