Improved Time of Arrival measurement model for non-convex optimization

被引:2
|
作者
Sidorenko, Juri [1 ,2 ]
Schatz, Volker [1 ]
Doktorski, Leo [1 ]
Scherer-Negenborn, Norbert [1 ]
Arens, Michael [1 ]
Hugentobler, Urs [2 ]
机构
[1] Syst Technol & Image Exploitat IOSB, Fraunhofer Inst Optron, Ettlingen, Germany
[2] Tech Univ Munich, Inst Astron & Phys Geodesy, Munich, Germany
来源
关键词
POSITION SELF-CALIBRATION;
D O I
10.1002/navi.277
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
The quadratic system provided by the Time of Arrival technique can be solved analytically or by nonlinear least squares minimization. An important problem in quadratic optimization is the possible convergence to a local minimum, instead of the global minimum. This problem does not occur for Global Navigation Satellite Systems (GNSS), due to the known satellite positions. In applications with unknown positions of the reference stations, such as indoor localization with self-calibration, local minima are an important issue. This article presents an approach showing how this risk can be significantly reduced. The main idea of our approach is to transform the local minimum to a saddle point by increasing the number of dimensions. In addition to numerical tests, we analytically prove the theorem and the criteria that no other local minima exist for nontrivial constellations.
引用
收藏
页码:117 / 128
页数:12
相关论文
共 50 条
  • [41] Non-Convex Multi-Objective Optimization
    Zhigljavsky, Anatoly
    INTERFACES, 2018, 48 (04) : 396 - 397
  • [42] THEOREM OF EXISTENCE IN NON-CONVEX OPTIMIZATION PROBLEMS
    NIFTIYEV, AA
    IZVESTIYA AKADEMII NAUK AZERBAIDZHANSKOI SSR SERIYA FIZIKO-TEKHNICHESKIKH I MATEMATICHESKIKH NAUK, 1983, 4 (05): : 115 - 119
  • [43] A Non-Convex Optimization Approach to Correlation Clustering
    Thiel, Erik
    Chehreghani, Morteza Haghir
    Dubhashi, Devdatt
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 5159 - 5166
  • [44] Optimization of Non-convex Multiband Cooperative Sensing
    Khwaja, A. S.
    Naeem, M.
    Anpalagan, A.
    Venetsanopoulos, A.
    2014 27TH BIENNIAL SYMPOSIUM ON COMMUNICATIONS (QBSC), 2014, : 61 - 65
  • [45] Lower bounds for non-convex stochastic optimization
    Yossi Arjevani
    Yair Carmon
    John C. Duchi
    Dylan J. Foster
    Nathan Srebro
    Blake Woodworth
    Mathematical Programming, 2023, 199 : 165 - 214
  • [46] Variance Reduction for Faster Non-Convex Optimization
    Allen-Zhu, Zeyuan
    Hazan, Elad
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 48, 2016, 48
  • [47] EXISTENCE OF SOLUTIONS FOR NON-CONVEX OPTIMIZATION PROBLEMS
    BARANGER, J
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1972, 274 (04): : 307 - &
  • [48] Nesting of non-convex figures in non-convex contours
    Vinade, C.
    Dias, A.
    Informacion Tecnologica, 2000, 11 (01): : 149 - 156
  • [49] Lower bounds for non-convex stochastic optimization
    Arjevani, Yossi
    Carmon, Yair
    Duchi, John C.
    Foster, Dylan J.
    Srebro, Nathan
    Woodworth, Blake
    MATHEMATICAL PROGRAMMING, 2023, 199 (1-2) : 165 - 214
  • [50] Evolutionary Gradient Descent for Non-convex Optimization
    Xue, Ke
    Qian, Chao
    Xu, Ling
    Fei, Xudong
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 3221 - 3227