IMPROVED REFERENCE KEY FRAME ALGORITHM

The autonomous vehicles, such as wheeled robots and drones, efficiently contribute in the search and rescue operations. Specially for indoor environments, these autonomous vehicles rely on simultaneous localization and mapping approach (SLAM) to construct a map for the unknown environment and simultaneously to estimate the vehicle’s position inside this map. The result of the scan matching process, which is a key step in many of SLAM approaches, has a fundamental role of the accuracy of the map construction. Typically, local and global scan matching approaches, that utilize laser scan rangefinder, suffer from accumulated errors as both approaches are sensitive to previous history. The reference key frame (RKF) algorithm reduces errors accumulation as it decreases the dependency on the accuracy of the previous history. However, the RKF algorithm still suffers; as most of the SLAM approaches, from scale shrinking problem during scanning corridors that exceed the maximum detection range of the laser scan rangefinder. The shrinking in long corridors comes from the unsuccessful estimation of the longitudinal movement from the implemented RKF algorithm and the unavailability of this information from external source as well. This paper proposes an improvement for the RKF algorithm. This is achieved by integrating the outcomes of the optical flow with the RKF algorithm using extended Kalman filter (EKF) to overcome the shrinking problem. The performance of the proposed algorithm is compared with the RKF, iterative closest point (ICP), and Hector SLAM in corridors that exceed the maximum detection range of the laser scan rangefinder

ENHANCEMENT OF REAL-TIME SCAN MATCHING FOR UAV INDOOR NAVIGATION USING VEHICLE MODEL

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

DEVELOPMENT OF A VOXEL BASED LOCAL PLANE FITTING FOR MULTI-SCALE REGISTRATION OF SEQUENTIAL MLS POINT CLOUDS

The Mobile Laser Scanner (MLS) system is one of the most accurate and fastest data acquisition systems for indoor and outdoor environments mapping. Today, to use this system in an indoor environment where it is impossible to capture GNSS data, Simultaneous Localization and Mapping (SLAM) is used. Most SLAM research has used probabilistic approaches to determine the sensor position and create a map, which leads to drift error in the final result due to their uncertainty. In addition, most SLAM methods give less importance to geometry and mapping concepts. This research aims to solve the SLAM problem by considering the adjustment concepts in mapping and geometrical principles of the environment and proposing an algorithm for reducing drift. For this purpose, a model-based registration is suggested. Correspondence points fall in the same voxel by voxelization, and the registration process is done using a plane model. In this research, two pyramid and simple registration methods are proposed. The results show that the simple registration algorithm is more efficient than the pyramid when the distance between sequential scans is not large otherwise, the pyramid registration is used. In the evaluation, by using simulated data in both pyramid and simple methods, 96.9% and 97.6% accuracy were obtained, respectively. The final test compares the proposed method with a SLAM method and ICP algorithm, which are described further

A Novel Real-Time Reference Key Frame Scan Matching Method

Unmanned aerial vehicles represent an effective technology for indoor search and rescue operations. Typically, most indoor missions’ environments would be unknown, unstructured, and/or dynamic. Navigation of UAVs in such environments is addressed by simultaneous localization and mapping approach using either local or global approaches. Both approaches suffer from accumulated errors and high processing time due to the iterative nature of the scan matching method. Moreover, point-to-point scan matching is prone to outlier association processes. This paper proposes a low-cost novel method for 2D real-time scan matching based on a reference key frame (RKF). RKF is a hybrid scan matching technique comprised of feature-to-feature and point-to-point approaches. This algorithm aims at mitigating errors accumulation using the key frame technique, which is inspired from video streaming broadcast process. The algorithm depends on the iterative closest point algorithm during the lack of linear features which is typically exhibited in unstructured environments. The algorithm switches back to the RKF once linear features are detected. To validate and evaluate the algorithm, the mapping performance and time consumption are compared with various algorithms in static and dynamic environments. The performance of the algorithm exhibits promising navigational, mapping results and very short computational time, that indicates the potential use of the new algorithm with real-time systems