This paper presents HV-LIOM (Adaptive Hash-Voxel LiDAR–Inertial Odometry and Mapping), a unified LiDAR–inertial SLAM and autonomous exploration framework for real-time 3D mapping in dynamic, GNSS-denied environments. We propose an adaptive hash-voxel mapping scheme that improves memory efficiency and real-time state estimation by subdividing voxels according to local geometric complexity and point density. To enhance robustness to poor initialization, we introduce a multi-resolution relocalization strategy that enables reliable localization against a prior map under large initial pose errors. A learning-based loop-closure module further detects revisited places and injects global constraints, while global pose-graph optimization maintains long-term map consistency. For autonomous exploration, we integrate a Soft Actor–Critic (SAC) policy that selects informative navigation targets online, improving exploration efficiency in unknown scenes. We evaluate HV-LIOM on public datasets (Hilti and NCLT) and a custom mobile robot platform. Results show that HV-LIOM improves absolute pose accuracy by up to 15.2% over FAST-LIO2 in indoor settings and by 7.6% in large-scale outdoor scenarios. The learned exploration policy achieves comparable or superior area coverage with reduced travel distance and exploration time relative to sampling-based and learning-based baselines.
The accurate detection and precise spatial localization of rebar intersection points are essential for advancing automation in construction tasks, such as robotic rebar tying. This paper presents a vision-based methodology that integrates RGB-D sensing, camera calibration, and coordinate transformation techniques to robustly detect and localize rebar crossing points. A structured detection framework efficiently extracts intersection coordinates from RGB-D imagery, subsequently mapping these points to a global reference frame using extrinsic camera calibration parameters. To achieve comprehensive site coverage and optimize operational efficiency, the path planning challenge is reformulated as a sequencing optimization problem of the identified intersections. We propose a greedy optimization algorithm that generates smooth, snake-like traversal paths in an efficient manner. Experimental validation confirms the effectiveness of our approach, demonstrating detection accuracy exceeding 99%, an average processing time below 125 ms per intersection point, and a maximum coordinate transformation error under 2 mm. The presented solution offers a lightweight, precise, and scalable framework, significantly facilitating the integration of vision-based methods into automated construction workflows.