{'fraction_non_alphanumeric': 0.029288702928870293, 'fraction_numerical': 0.0, 'mean_word_length': 5.298245614035087, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Tight GNSS/INS integration as a constrained least-squares problem

In this paper, we study a new GNSS/INS tight integration algorithm. The underlying idea is to obtain user's position as the solution to a constrained version of the GNSS optimization problem, where classical trilateralization is constrained by INS measurements. This leads to a linearly constrained least-squares problem that can be efficiently solved in worst-case polynomial time. The performance of the algorithm has been validated through simulations under challenging scenarios (namely, multipath and weak signal conditions), showing an improved performance w.r.t. GNSS stand-alone and GNSS/INS Kalman filter solutions under the same conditions.