• DocumentCode
    314429
  • Title

    Computational complexity of terrain mapping perception in autonomous mobility

  • Author

    Kelly, Alonzo ; Stentz, Anthony

  • Author_Institution
    Robotics Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • Volume
    2
  • fYear
    1997
  • fDate
    20-25 Apr 1997
  • Firstpage
    1047
  • Abstract
    For autonomously navigating vehicles, the automatic generation of dense geometric models of the environment is a computationally expensive process. Using first principles, it is possible to quantify the relationship between the raw throughput required of the perception system and the maximum safely achievable speed of the vehicle. We show that terrain mapping perception is of polynomial complexity in the response distance. To the degree that geometric perception consumes time, it also degrades real-time response characteristics. Given this relationship, several strategies of adaptive geometric perception arise which are practical for autonomous vehicles
  • Keywords
    computational complexity; computer vision; mobile robots; path planning; adaptive geometric perception; autonomous mobility; autonomously navigating vehicles; computational complexity; dense geometric models; polynomial complexity; response distance; terrain mapping perception; Computational complexity; Degradation; Mobile robots; Navigation; Polynomials; Remotely operated vehicles; Solid modeling; Terrain mapping; Throughput; Vehicle safety;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Robotics and Automation, 1997. Proceedings., 1997 IEEE International Conference on
  • Conference_Location
    Albuquerque, NM
  • Print_ISBN
    0-7803-3612-7
  • Type

    conf

  • DOI
    10.1109/ROBOT.1997.614273
  • Filename
    614273