Station point optimization of total station in shield tunneling method based on set-covering

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposed a method for station point optimization of the total station of automatic guidance system in shield tunneling, which is not analyzed widely at present. In this paper, station point optimization is converted into a set-covering problem. In order to express the measurability of the active target station for the total station, a 0-1 measurability matrix is introduced, and each element in the matrix represents a measurability judgment, which includes the visibility test, the distance test, and the incidence angle test. Then, the greedy algorithm is used to find the approximate optimal solution of this set-covering problem. Furthermore, an application example affirmed that our method was effective. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, B., Zhang, X., & Zhu, L. (2010). Station point optimization of total station in shield tunneling method based on set-covering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6424 LNAI, pp. 372–382). https://doi.org/10.1007/978-3-642-16584-9_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free