Since the last two decades, the use of laser scanners for generating accurate and dense 3D models has been rapidly growing in multiple disciplines. The reliance on human-expertise to perform an efficient scanning in terms of completeness and quality encouraged the researchers to develop strategies for carrying out an optimized and automated scan planning. Nevertheless, due to the predominant use of static terrestrial laser scanners (TLS), the most of developed methods have been focused on scan optimization by fixing standpoints on basis of static scanning. The increasing use of portable mobile laser scanning systems (MLS) enables faster non-stop acquisition which demands the planning of optimal scan trajectories. Therefore, a novel method addressing the absence of dynamic scan planning is proposed considering specific MLS constraints such as maximum acquisition time or closed-loops requirement. First, an initial analysis is carried out to determinate key-positions to reach during data acquisition. From these positions a navigable graph is generated to compute routes satisfying specific MLS constraints by a three-step process. This starts by estimating the number of routes necessary to subsequently carry out a coarse graph partition based on Kmedoids clustering. Next, a balancing algorithm was implemented to compute a balanced graph partition by node exchanging. Finally, partitions are extended by adding key nodes from their adjacent ones in order to provide a desirable overlapping between scans. The method was tested by simulating three laser scanner configurations in four indoor and outdoor real case studies. The acquisition quality of the computed scan planning was evaluated in terms of 3D completeness and point cloud density with the simulator Helios++.

Optimal scan planning for surveying large sites with static and mobile mapping systems

Previtali M.;Scaioni M.;
2022-01-01

Abstract

Since the last two decades, the use of laser scanners for generating accurate and dense 3D models has been rapidly growing in multiple disciplines. The reliance on human-expertise to perform an efficient scanning in terms of completeness and quality encouraged the researchers to develop strategies for carrying out an optimized and automated scan planning. Nevertheless, due to the predominant use of static terrestrial laser scanners (TLS), the most of developed methods have been focused on scan optimization by fixing standpoints on basis of static scanning. The increasing use of portable mobile laser scanning systems (MLS) enables faster non-stop acquisition which demands the planning of optimal scan trajectories. Therefore, a novel method addressing the absence of dynamic scan planning is proposed considering specific MLS constraints such as maximum acquisition time or closed-loops requirement. First, an initial analysis is carried out to determinate key-positions to reach during data acquisition. From these positions a navigable graph is generated to compute routes satisfying specific MLS constraints by a three-step process. This starts by estimating the number of routes necessary to subsequently carry out a coarse graph partition based on Kmedoids clustering. Next, a balancing algorithm was implemented to compute a balanced graph partition by node exchanging. Finally, partitions are extended by adding key nodes from their adjacent ones in order to provide a desirable overlapping between scans. The method was tested by simulating three laser scanner configurations in four indoor and outdoor real case studies. The acquisition quality of the computed scan planning was evaluated in terms of 3D completeness and point cloud density with the simulator Helios++.
2022
3D digitalization
Autonomous navigation
Computational geometry
Path planning
Scan-vs-BIM
Spatial analysis
File in questo prodotto:
File Dimensione Formato  
Optimal_Scan__Planning_For_Surveying_Large_Sites_with__Static_and_Mobile_Mapping__Systems (3).pdf

accesso aperto

Dimensione 4.94 MB
Formato Adobe PDF
4.94 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1220932
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 2
social impact