A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS
The optimal network design problem has been well addressed in geodesy and photogrammetry but has not received the same attention for terrestrial laser scanner (TLS) networks. The goal of this research is to develop a complete design system that can automatically provide an optimal plan for high-accu...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Copernicus Publications
2017-09-01
|
| Series: | ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| Online Access: | https://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/IV-2-W4/75/2017/isprs-annals-IV-2-W4-75-2017.pdf |
| _version_ | 1811332877879607296 |
|---|---|
| author | F. Jia D. Lichti |
| author_facet | F. Jia D. Lichti |
| author_sort | F. Jia |
| collection | DOAJ |
| description | The optimal network design problem has been well addressed in geodesy and photogrammetry but has not received the same attention for terrestrial laser scanner (TLS) networks. The goal of this research is to develop a complete design system that can automatically provide an optimal plan for high-accuracy, large-volume scanning networks. The aim in this paper is to use three heuristic optimization methods, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO), to solve the first-order design (FOD) problem for a small-volume indoor network and make a comparison of their performances. The room is simplified as discretized wall segments and possible viewpoints. Each possible viewpoint is evaluated with a score table representing the wall segments visible from each viewpoint based on scanning geometry constraints. The goal is to find a minimum number of viewpoints that can obtain complete coverage of all wall segments with a minimal sum of incidence angles. The different methods have been implemented and compared in terms of the quality of the solutions, runtime and repeatability. The experiment environment was simulated from a room located on University of Calgary campus where multiple scans are required due to occlusions from interior walls. The results obtained in this research show that PSO and GA provide similar solutions while SA doesn’t guarantee an optimal solution within limited iterations. Overall, GA is considered as the best choice for this problem based on its capability of providing an optimal solution and fewer parameters to tune. |
| first_indexed | 2024-04-13T16:43:38Z |
| format | Article |
| id | doaj.art-6f4a5b301d5e482bb9e159a7ba821a02 |
| institution | Directory Open Access Journal |
| issn | 2194-9042 2194-9050 |
| language | English |
| last_indexed | 2024-04-13T16:43:38Z |
| publishDate | 2017-09-01 |
| publisher | Copernicus Publications |
| record_format | Article |
| series | ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| spelling | doaj.art-6f4a5b301d5e482bb9e159a7ba821a022022-12-22T02:39:09ZengCopernicus PublicationsISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences2194-90422194-90502017-09-01IV-2-W4758210.5194/isprs-annals-IV-2-W4-75-2017A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKSF. Jia0D. Lichti1Dept. of Geomatics Engineering, University of Calgary, Calgary, AB, CanadaDept. of Geomatics Engineering, University of Calgary, Calgary, AB, CanadaThe optimal network design problem has been well addressed in geodesy and photogrammetry but has not received the same attention for terrestrial laser scanner (TLS) networks. The goal of this research is to develop a complete design system that can automatically provide an optimal plan for high-accuracy, large-volume scanning networks. The aim in this paper is to use three heuristic optimization methods, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO), to solve the first-order design (FOD) problem for a small-volume indoor network and make a comparison of their performances. The room is simplified as discretized wall segments and possible viewpoints. Each possible viewpoint is evaluated with a score table representing the wall segments visible from each viewpoint based on scanning geometry constraints. The goal is to find a minimum number of viewpoints that can obtain complete coverage of all wall segments with a minimal sum of incidence angles. The different methods have been implemented and compared in terms of the quality of the solutions, runtime and repeatability. The experiment environment was simulated from a room located on University of Calgary campus where multiple scans are required due to occlusions from interior walls. The results obtained in this research show that PSO and GA provide similar solutions while SA doesn’t guarantee an optimal solution within limited iterations. Overall, GA is considered as the best choice for this problem based on its capability of providing an optimal solution and fewer parameters to tune.https://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/IV-2-W4/75/2017/isprs-annals-IV-2-W4-75-2017.pdf |
| spellingShingle | F. Jia D. Lichti A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| title | A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS |
| title_full | A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS |
| title_fullStr | A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS |
| title_full_unstemmed | A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS |
| title_short | A COMPARISON OF SIMULATED ANNEALING, GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATION IN OPTIMAL FIRST-ORDER DESIGN OF INDOOR TLS NETWORKS |
| title_sort | comparison of simulated annealing genetic algorithm and particle swarm optimization in optimal first order design of indoor tls networks |
| url | https://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/IV-2-W4/75/2017/isprs-annals-IV-2-W4-75-2017.pdf |
| work_keys_str_mv | AT fjia acomparisonofsimulatedannealinggeneticalgorithmandparticleswarmoptimizationinoptimalfirstorderdesignofindoortlsnetworks AT dlichti acomparisonofsimulatedannealinggeneticalgorithmandparticleswarmoptimizationinoptimalfirstorderdesignofindoortlsnetworks AT fjia comparisonofsimulatedannealinggeneticalgorithmandparticleswarmoptimizationinoptimalfirstorderdesignofindoortlsnetworks AT dlichti comparisonofsimulatedannealinggeneticalgorithmandparticleswarmoptimizationinoptimalfirstorderdesignofindoortlsnetworks |