ENHANCEMENT OF REAL-TIME SCAN MATCHING FOR UAV INDOOR NAVIGATION USING VEHICLE MODEL
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract. Autonomous Unmanned Aerial Vehicles (UAVs) have drawn great attention from different organizations, because of the various applications that save time, cost, effort, and human lives. The navigation of autonomous UAV mainly depends on the fusion between Global Navigation Satellite System (GNSS) and Inertial Measurement System (IMU). Navigation in indoor environments is a challenging task, because of the GNSS signal unavailability, especially when the utilized IMU is low-cost. Light Detection and Ranging Radar (LIDAR) is one of the mainly utilized sensors in the indoor environment for localization through scan matching of successive scans. The process of calculating the rotation and translation from successive scans can employ different approaches, such as Iterative Closest Point (ICP) with its variants, and Hector SLAM. ICP and Hector SLAM iterative fashion can greatly increase the matching time, and the convergence is not guaranteed in case of harsh maneuvers, moving objects, and short-range LIDAR as it may get stuck in local minima. This paper proposes enhanced real-time ICP and Hector SLAM algorithms based on vehicle model (VM) during sharp maneuvers. The vehicle model serves as initialization step (coarse alignment) then the ICP/Hector serve as fine alignment step. Test cases of quadcopter flight with harsh maneuvers were carried out with LIDAR to evaluate the proposed approach to enhance the ICP/Hector convergence time and accuracy. The proposed algorithm is convenient for UAVs where there are limitations regarding the size, weight, and power limitations, as it is a stand-alone algorithm that does not require any additional sensors.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it