Absolute Triangulation Algorithms for Space Exploration

被引:12
|
作者
Henry, Sebastien [1 ]
Christian, John A. [1 ]
机构
[1] Georgia Inst Technol, Guggenheim Sch Aerosp Engn, Atlanta, GA 30332 USA
关键词
OBSERVABILITY CRITERIA; ATTITUDE DETERMINATION; OPTICAL OBSERVATIONS; POSE ESTIMATION; STAR TRACKERS; NAVIGATION; POSITION; PERFORMANCE; HISTORY;
D O I
10.2514/1.G006989
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Images are an important source of information for spacecraft navigation and for three-dimensional (3-D) reconstruction of observed space objects. Both of these applications take the form of a triangulation problem when the camera has a known attitude and the measurements extracted from the image are line-of-sight (LOS) directions. This work provides a comprehensive review of the history and theoretical foundations of triangulation. A variety of classical triangulation algorithms are reviewed, including a number of suboptimal linear methods (many LOS measurements) and the optimal method of Hartley and Sturm (only two LOS measurements). It is shown that the optimal many-measurement case may be solved without iteration as a linear system using the new linear optimal sine triangulation (LOST) method. Both LOST and the polynomial method of Hartley and Sturm provide the same result in the case of only two measurements. The various triangulation algorithms are assessed with a few numerical examples, including planetary terrain relative navigation, angles-only optical navigation at Uranus, 3-D reconstruction of Notre-Dame de Paris, and angles-only relative navigation.
引用
收藏
页码:21 / 46
页数:26
相关论文
共 50 条
  • [31] Multi-objective design space exploration using genetic algorithms
    Palesi, M
    Givargis, T
    CODES 2002: PROCEEDINGS OF THE TENTH INTERNATIONAL SYMPOSIUM ON HARDWARE/SOFTWARE CODESIGN, 2002, : 67 - 72
  • [32] Design-space exploration of the most widely used cryptography algorithms
    Papaefstathiou, I
    Papaefstathiou, V
    Sotifiou, C
    MICROPROCESSORS AND MICROSYSTEMS, 2004, 28 (10) : 561 - 571
  • [33] Triangulation Algorithms for Generating As-Is Floor Plans
    Filipe Jorge da Silva Brandão
    Alexandra Paio
    Adriano Lopes
    Nexus Network Journal, 2020, 22 : 683 - 700
  • [34] Approximated algorithms for the minimum dilation triangulation problem
    Gisela Dorzan, Maria
    Guillermo Leguizamon, Mario
    Mezura-Montes, Efren
    Hernandez-Penalver, Gregorio
    JOURNAL OF HEURISTICS, 2014, 20 (02) : 189 - 209
  • [35] Delaunay triangulation algorithms useful for multibeam echosounding
    Brouns, G
    De Wulf, A
    Constales, D
    JOURNAL OF SURVEYING ENGINEERING, 2003, 129 (02) : 79 - 84
  • [36] Triangulation Algorithms for Generating As-Is Floor Plans
    da Silva Brandao, Filipe Jorge
    Paio, Alexandra
    Lopes, Adriano
    NEXUS NETWORK JOURNAL, 2020, 22 (03) : 683 - 700
  • [37] Approximated algorithms for the minimum dilation triangulation problem
    Maria Gisela Dorzán
    Mario Guillermo Leguizamón
    Efrén Mezura-Montes
    Gregorio Hernández-Peñalver
    Journal of Heuristics, 2014, 20 : 189 - 209
  • [38] Minimal Triangulation Algorithms for Perfect Phylogeny Problems
    Gysel, Rob
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 421 - 432
  • [39] Sensor placement algorithms for triangulation based localization
    Tekdas, Onur
    Isler, Volkan
    PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-10, 2007, : 4448 - +
  • [40] ALGORITHMS FOR INVESTIGATING OPTIMALITY OF CONE TRIANGULATION FOR A POLYHEDRON
    Stojanovic, Milica
    Vuckovic, Milica
    KRAGUJEVAC JOURNAL OF MATHEMATICS, 2007, 30 : 327 - 342