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 条
  • [1] A space exploration algorithm for multiparametric programming via Delaunay triangulation
    Baris Burnak
    Justin Katz
    Efstratios N. Pistikopoulos
    Optimization and Engineering, 2021, 22 : 555 - 579
  • [2] A space exploration algorithm for multiparametric programming via Delaunay triangulation
    Burnak, Baris
    Katz, Justin
    Pistikopoulos, Efstratios N.
    OPTIMIZATION AND ENGINEERING, 2021, 22 (01) : 555 - 579
  • [3] Bounding algorithms for design space exploration
    Chaudhuri, S
    Walker, RA
    NINTH GREAT LAKES SYMPOSIUM ON VLSI, PROCEEDINGS, 1999, : 234 - 235
  • [4] Sequential and Parallel Algorithms for the State Space Exploration
    Allal, Lamia
    Belalem, Ghalem
    Dhaussy, Philippe
    Teodorov, Ciprian
    CYBERNETICS AND INFORMATION TECHNOLOGIES, 2016, 16 (01) : 3 - 18
  • [5] On Structured Design Space Exploration for Mapping of Quantum Algorithms
    Bandic, Medina
    Zarein, Hossein
    Alarcon, Eduard
    Almudever, Carmen G.
    2020 XXXV CONFERENCE ON DESIGN OF CIRCUITS AND INTEGRATED SYSTEMS (DCIS), 2020,
  • [6] Comparison of Online Exploration and Coverage Algorithms in Continuous Space
    Andreasen, Malte Z.
    Holler, Philip, I
    Jensen, Magnus K.
    Albano, Michele
    ICAART: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE - VOL 1, 2022, : 527 - 537
  • [7] Design space exploration of HSDPA subsystem algorithms and architectures
    Ge, YQ
    Wellig, A
    Zory, J
    VTC2004-SPRING: 2004 IEEE 59TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, PROCEEDINGS, 2004, : 1246 - 1250
  • [8] Heuristic algorithms for the triangulation of graphs
    Cano, A
    Moral, S
    ADVANCES IN INTELLIGENT COMPUTING - IPMU '94, 1995, 945 : 98 - 107
  • [9] A NEW TRIANGULATION FOR SIMPLICIAL ALGORITHMS
    TODD, MJ
    TUNCEL, L
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (01) : 167 - 180
  • [10] FAST ALGORITHMS FOR GREEDY TRIANGULATION
    LEVCOPOULOS, C
    LINGAS, A
    BIT, 1992, 32 (02): : 280 - 296