ARTICLE | doi:10.20944/preprints202304.0163.v1
Subject: Engineering, Marine Engineering Keywords: Inertial navigation system; Initial alignment; Backtracking Scheme; Polar region
Online: 10 April 2023 (10:00:18 CEST)
In the polar region, the gravity vector and Earth's rotation vector tend to be in the same direction, leading to slower convergence speed and longer alignment time of the moving base alignment. When the alignment time is short, the alignment cannot converge, resulting in low azimuth accuracy. To address this issue, we propose a polar moving base alignment method based on backtracking scheme. Notably, this work first derives a polar coarse alignment method with the inertial frame based on the transverse Earth model. On this basis, we design a polar coarse alignment method based on backtracking scheme and optimize the data storage scheme. Then, an inverse navigation algorithm based on the transverse inertial navigation mechanical arrangement scheme was derived, and a polar fine alignment method based on backtracking scheme was designed. Semi-physical simulation experiments showed that the alignment algorithm based on backtracking scheme can converge in a short time with high alignment accuracy.
ARTICLE | doi:10.20944/preprints202304.0858.v1
Subject: Computer Science And Mathematics, Applied Mathematics Keywords: Neutrosophic logic systems; Dai-Liao conjugate gradient method; Backtracking line search; Convergence; Unconstrained optimization.
Online: 24 April 2023 (12:43:01 CEST)
The influence of neutrosophy in the previous period is constantly growing in many areas of science and technology. Moreover, various applications of the neutrosophic approach have become more common in recent years. Our goal in this research is to utilize the neutrosophy to improve the performance of the Dai-Liao conjugate gradient (CG) method. Specifically, in this research, we propose and investigate a new neutrosophic logic system to calculate the key parameter t involved in the Dai–Liao CG iterations. Theoretical analysis and numerical experience indicate that the efficiency and robustness of the new rule for determining t. Combining the neutrosophy and the Dai-Liao conjugate gradient method, we propose and explore a new Dai-Liao CG iterations for solving large-scale unconstrained optimization models. The global convergence is established under common assumptions and the backtracking line search. Finally, by conducting numerical experiments, computational evidence demonstrates that the new fuzzy neutrosophic Dai-Liao conjugate gradient method is computationally effective and robust.
Subject: Social Sciences, Tourism, Leisure, Sport And Hospitality Keywords: Covid-19; social distancing; route planning inside a destination; urban tourism; backtracking algorithm; Brașov, sustainable development; tourist route optimization
Online: 7 May 2021 (09:00:17 CEST)
he paper presents an innovative method for tourist route planning inside a destination. The necessity of reorganizing the tourist routes within a destination comes as an immediate response to the Covid-19 crisis. The implementation of the method inside tourist destinations can bring an important advantage in transforming a destination into a safer destination in times of Covid-19 and post-Covid-19. The existing trend of shortening the tourist stay length has been accelerated while the epidemic became a pandemic. Moreover, the wariness for future pandemics has brought into spotlight the issue of overcrowded attractions inside a destination at certain moments. The method presented in this paper proposes a backtracking algorithm, more precisely an adaptation of the travelling salesman problem. The method presented is aimed to facilitate the navigation inside a destination and to revive certain less-visited sightseeing spots inside a destination while facilitating conformation with the social distancing measures imposed for Covid-19 control.