MODIFICATION OF INTERSECTION TECHNIQUE IN MONITORING THE ENGINEERING STRUCTURES

Similar documents
The Accuracy of Determining the Volumes Using Close Range Photogrammetry

A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP

The Mathematics of Engineering Surveying (1)

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra

NEW MONITORING TECHNIQUES ON THE DETERMINATION OF STRUCTURE DEFORMATIONS

International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

Using Genetic Algorithms to Solve the Box Stacking Problem

PROCESSING OF CALIBRATION MEASUREMENTS ON EZB-3

Chapter -7- Traversing. 1/28/2018 Assistant Lecturer / Asmaa Abdulmajeed 1. Contents

Offspring Generation Method using Delaunay Triangulation for Real-Coded Genetic Algorithms

5 Classifications of Accuracy and Standards

Guidelines for proper use of Plate elements

Synthesis of Planar Mechanisms, Part IX: Path Generation using 6 Bar 2 Sliders Mechanism

C quantities. The usual calibration method consists of a direct measurement of. Calibration of Storage Tanks B. SHMUTTER U. ETROG

The Genetic Algorithm for finding the maxima of single-variable functions

Solving ISP Problem by Using Genetic Algorithm

APPROXIMATING THE MAXMIN AND MINMAX AREA TRIANGULATIONS USING ANGULAR CONSTRAINTS. J. Mark Keil, Tzvetalin S. Vassilev

Graphical Approach to Solve the Transcendental Equations Salim Akhtar 1 Ms. Manisha Dawra 2

Topological Machining Fixture Layout Synthesis Using Genetic Algorithms

Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization

VISUALIZATION OF GEOINFORMATION IN DAM DEFORMATION MONITORING

Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

Standards Level by Objective Hits Goals Objs # of objs by % w/in std Title Level Mean S.D. Concurr.

Students will understand 1. that numerical expressions can be written and evaluated using whole number exponents

Fundamentals of Surveying MSS 220 Prof. Gamal El-Fiky

Pack 12. Surveying processes. Equipment 12.1 Method 12.2 Checklist 12.3 Calculations 12.4

Graphics and Interaction Transformation geometry and homogeneous coordinates

COMP30019 Graphics and Interaction Transformation geometry and homogeneous coordinates

Central Manufacturing Technology Institute, Bangalore , India,

Position Error Reduction of Kinematic Mechanisms Using Tolerance Analysis and Cost Function

and how to label right triangles:

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2

The movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat

REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN

Module 1 Session 1 HS. Critical Areas for Traditional Geometry Page 1 of 6

MATHEMATICS 105 Plane Trigonometry

Automatic Visual Inspection of Bump in Flip Chip using Edge Detection with Genetic Algorithm

Applications of Triple Integrals

An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid

Chapter 3. Physical phenomena: plane parallel plate. This chapter provides an explanation about how rays of light physically behave when

GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL

Chapter 9: Right Triangle Trigonometry

Houghton Mifflin MATHSTEPS Level 7 correlated to Chicago Academic Standards and Framework Grade 7

QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION

CHAPTER 1 INTRODUCTION

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

Using Genetic Algorithms to optimize ACS-TSP

Carnegie Learning Math Series Course 2, A Florida Standards Program

Double Integrals, Iterated Integrals, Cross-sections

Subpixel Corner Detection Using Spatial Moment 1)

18.2 Sine and Cosine Ratios

STUDY ON APPLICATION OF MICROTRILATERATION GEODETIC NETWORK FOR MONITORING OF HYDROTECHNICAL CONSTRUCTIONS

SIMULATION APPROACH OF CUTTING TOOL MOVEMENT USING ARTIFICIAL INTELLIGENCE METHOD

Hybrid of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

Part Images Formed by Flat Mirrors. This Chapter. Phys. 281B Geometric Optics. Chapter 2 : Image Formation. Chapter 2: Image Formation

Computer Vision. Coordinates. Prof. Flávio Cardeal DECOM / CEFET- MG.

Optimum Establishment of Total Station

YEAR 12 Core 1 & 2 Maths Curriculum (A Level Year 1)

Chapter 34. Images. In this chapter we define and classify images, and then classify several basic ways in which they can be produced.

Solving Traveling Salesman Problem Using Parallel Genetic. Algorithm and Simulated Annealing

High Altitude Balloon Localization from Photographs

X Std. Topic Content Expected Learning Outcomes Mode of Transaction

THE SIMPLE POLYNOMAIL TECHNIQUE TO COMPUTE THE ORTHOMETRIC HEIGHT IN EGYPT

ADVANCED SURVEYING (S-II)

CAMI Education links: Maths NQF Level 2

AN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS

Dimensional Synthesis of Mechanism using Genetic Algorithm

Two-Dimensional Fitting of Brightness Profiles in Galaxy Images with a Hybrid Algorithm

Unit Maps: Grade 8 Math

Synthesis of Planar Mechanisms, Part XI: Al-Jazari Quick Return-Motion Mechanism Galal Ali Hassaan Emeritus Professor, Mechanical Design & Production

Comparative study between the proposed shape independent clustering method and the conventional methods (K-means and the other)

Development of a Test Field for the Calibration and Evaluation of Kinematic Multi Sensor Systems

Visualisation Pipeline : The Virtual Camera

Mapping Common Core State Standard Clusters and. Ohio Grade Level Indicator. Grade 5 Mathematics

Object Dimension Inspection Utilizing 3D Laser Scanner

Abstract. Introduction

Optimization of Association Rule Mining through Genetic Algorithm

Chapters 1 7: Overview

Genetic Algorithm based Fractal Image Compression

Global Optimal Analysis of Variant Genetic Operations in Solar Tracking

Elements of three dimensional geometry

ANALYSIS OF BOX CULVERT - COST OPTIMIZATION FOR DIFFERENT ASPECT RATIOS OF CELL

CE 103. Surveying. Course Instructor. Shayok Ghosh. Senior Lecturer Department of Civil Engineering East West University.

Analysis of Directional Beam Patterns from Firefly Optimization

MAXIMUM LIKELIHOOD ESTIMATION USING ACCELERATED GENETIC ALGORITHMS

Genetic Algorithms Variations and Implementation Issues

GENETIC ALGORITHM with Hands-On exercise

Distributed Probabilistic Model-Building Genetic Algorithm

Navigation coordinate systems

Train schedule diagram drawing algorithm considering interrelationship between labels

Faculty of Science and Technology MASTER S THESIS

7-5 Parametric Equations

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES

Late Parallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms

AQA GCSE Maths - Higher Self-Assessment Checklist

Introduction to Genetic Algorithms

Evolutionary Computation Algorithms for Cryptanalysis: A Study

Optimizing scale factors of the PolyJet rapid prototyping procedure by genetic programming

Transcription:

International ITRTIOL Journal of ivil ngineering JOURL and Technology OF IVIL (IJIT), GIRIG ISS 0976 608 D (rint), ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM TOLOG (IJIT) ISS 0976 608 (rint) ISS 0976 66(Online) Volume 5, Issue, December (04), pp. 56-66 IM: www.iaeme.com/ijciet.asp Journal Impact Factor (04): 7.990 (alculated by GISI) www.jifactor.com IJIT IM MODIFITIO OF ITRSTIO TIQU I MOITORIG T GIRIG STRUTURS ossam l-din Fawzy Lecturer, ivil ngineering Department, Faculty of ngineering, Kafr l-sheikh University, Kafr l-sheikh, GT STRT ost and accuracy required are the two important factors that decide on the appropriateness of intersection technique method for a certain setting out and deformation problems. In this paper, modification of intersection technique by three methods used to determine the coordinates of points and its associated accuracy during the process of setting out and structural deformation of engineering structures by three methods is presented. The main objective of this paper is tried to find the best location of two/three total stations with respect to the building facade under consideration. pplication of Genetic lgorithm for finding an ideal solution for the accuracy problem is presented also to make it possible for determining the optimum layout of the total station and also to determine the object accuracy, for any instrument set- up, right in the field. This paper gives also the sequence of the field operations and computational steps for this task. numerical example is included to reinforce the theoretical aspects. Keywords: Intersection, Total Station, ccuracy, Monitoring, Genetic lgorithm. - ITRODUTIO Deformation of structures is a problem that demands the engineer s attention. The intersection method has been widely used for determine the dimensional coordinates of any points. In this work, the three methods of intersection (angular, linear and multi stations) are modified to obtain a minimal error in coordinates of any point under monitoring system. The problem which faces the intersection is in determining the optimum positions of the total stations relative to the object in order to achieve the required accuracy. So far, there have been no satisfactory mathematical formulas, in the field of intersection, which allows determine the optimum layout of the total stations. 56

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM - MODIFITIO OF GULR ITRSTIO FOR LULTIG T OIT OORDITS ngular intersection is a well known method used to determine the artesian coordinates of any point during the process of setting out and monitoring the deformation of engineering structures []. ngular intersection can be done practically by using Theodolite or total station. For achieving accurate results of observations of the process of setting out and structural deformation monitoring, the suggested geodetic technique recommend that each monitoring point must be observed from three occupied stations as shown in figure. The four horizontal angles to each object point i are α, β, α and β. These observations must be observed from three occupied known stations, and respectively (Fig. ). These observations can be done using advanced accurate theodolite or total station. Figure (): Geometry of observations using the suggested modified angular intersection The suggested modification technique can be summarized by determining the coordinates and associated accuracy of observed point from three occupied stations (oints, and, Fig. ). The coordinates of observed point will be calculated from each two individual points (from and then from and ) and its associated accuracy. y comparing the results values and accuracy, the corrected values can be determined. The horizontal coordinates (, ) of observed points can be calculated by using formulae of angular intersection in dependence on the two angular measurements α, β from two occupied known points as follows (Fig. ): cot β cot α ; ot α ot β cot β cot α. ot β ot α () The horizontal coordinates (, ) of observed points can be calculated by using formulae of angular intersection in dependence on the two azimuths line from two occupied known points as follows: 57

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM Where: azimuth of line () azimuth of line () or disadvantage of this method of point positioning is that there is no check on the calculations []. In dependence on the errors of measuring horizontal angles, the error in point position M can be determined using the following formula: M // b mα // ρ sinγ sin sin α β. () Where: (b) ase line (the distance between the two occupied stations and can be calculated from the coordinates); (m // α ) mean square error of measuring horizontal angles (taken from specifications of applied instrument or from experimental study); ρ // 0665 //. So the coordinates and accuracy of point position can be determined from the two triangles and (Fig. ). This means that point has two values of coordinates and two values of position error (M and M ). For accepting the observations and resulted coordinates of point from the two triangles and, it is necessary that the coordinates must satisfy the following condition. () r M t, Where: ; and M t M M., - oordinates of point from first triangle ();, - oordinates from second triangle (); M, M rror in point position for the first and second triangles respectively. If the coordinates satisfy condition in equation (), the corrected coordinates of point can be determined by the arithmetic mean of two values. (4) ;. - MODIFITIO OF LIR ITRSTIO TO LULT T OIT OORDITS Linear intersection can be used also to determine the coordinates of observed points during setting out or structural deformation. For achieving accurate measurements, especially in monitoring the structural deformation, it is recommended that each observed point on the structure must be observed from three occupied known coordinates stations. The linear intersection observations can be done using the reflectorless total station. The coordinates of point (Fig. ) can be determined by two methods as follows: 58

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM t first two distances (q and h) must be determined as following []: 0 q.5( h ) q (5) Then secondly, the coordinates of point can be determined []. q ) h ( ). q ) h ( ) (6) ( ( S S S (, ) (, ) (, ) Figure (): Geometry of observations using the suggested modified linear intersection In dependence on errors of measuring horizontal distances m position can be determined using the following formula m,, the error in point M m m sin, (7) y the same way for accepting the observations and the resulted coordinates of point from the two triangles and (Fig. ), it is necessary that the coordinates of point must satisfy the following condition: r M t, (8) Where: ; and M t M M. 59

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM 4- MODIFITIO OF D OIT OORDITS USIG MULTI STTIOS OSRVLS ( I, I, Z I ) Target point ( O, O, Z O ) Figure (): Geometry of observed point in D space coordinates From Figure (), a local three-dimensional coordinates system is needed to calculate the spatial coordinates of any target point. Such a system, presumably, has -axis is chosen as a horizontal line, which the -axis is a horizontal line perpendicular to the -axis, the Z- axis is a vertical line determined by the vertical axis of the instrument at occupied station. The space coordinates (,, Z) of any point I (Figure ) can be determined mathematically as follows: I o S os β osθ S os β Sinθ I o Z Zo S Sinβ Where: S distance between point 0 and the point I. θ the bearing angle to point I. Β the vertical angle to point I. I (9) The multi stations technique can be summarized as follows: Let points, and be the location of the three-leveled total stations (Figure 4) and I be the observed point. Let (θ, θ, θ ) and (β, β, β ) be the bearing and vertical angles of point I from points, and, respectively. Then and are the horizontal distances in -direction between the total station centers ( and, and respectively) and and are the coordinate s differences in -direction between the total stations center and the other total stations centers and, respectively but h h are the height differences between the total station center and the other total stations centers and, respectively. Direction cosines of each total station pointing can be obtained as follows: Let the vertical angles be the following: earing I θ, earing I θ, earing I θ II β II β II β 60

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM 6 Figure (4): Geometry of D intersection using multi stations technique The above observables enable us to calculate direction cosines of I, I and I: os β os θ, os β os θ, os β os θ, os β Sin θ, os β Sin θ, os β Sin θ, Sin β, Sin β, Sin β (0) So using the equations (9) and (0), the coordinates of point I can be determined as following: () The most probable value of, and can be obtained by solving equations (0) and () using the least square adjustment technique [5]. y substitution of and into quation (), two possible coordinates of I are obtained. Taking the mean of these two values, the most probable value of unknown coordinate point (I) is thus obtained. The shortest distance (d) between two directions can be determined directly from the following equation: () Where: Z D, D, D, 4 D The equation () assigns a numeric value to an arrangement of the total stations, for a given measurement. Z Z Z Z I I I 4 ) ( ) ( ) ( D D D D d

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM 5- OTIMIZTIO OF T OFIGURTIO OF T ISTRUMT OSITIO USIG GTI LGORITM (G) Genetic lgorithms are computationally simple, powerful with probabilistic transition rules, and not limited by assumptions about the search space and are non-deterministic stochastic search/optimization methods that utilize the evolution theories to solve a problem within a complex solution space [6]. onsequently, constrained numerical optimization of this index over the set of all instrument positions will produce the optimal disposition of the total stations for that measurement. Genetic lgorithm will be used to perform this task. Genetic lgorithms are well suited for this problem. The suggested whole optimization process using Genetic lgorithm is outlined in Figure 5. The genetic algorithm loops over an iteration process to make the population evolve. ach iteration consists of the following steps: - The first step consists in selecting the total stations position parameters (positions { i & i & Z i }) for reproduction. This selection is done randomly with a probability depending on the relative fitness of the individuals so that best twos are often chosen for reproduction than poor twos. These are the only parameters that will be changed in the optimization process. This means that, each individual of the population will consist of the three coordinates (i & i & Z i ) of the three total stations, this means that we have 9 parameters. These 9 real parameters will be codified with a standard floating point based representation. Figure (5): Flow chart of the suggested optimization process using Genetic lgorithm - In the second step, offspring are bred by the selected total stations position parameters. For generating new chromosomes, the algorithm can use both recombination and mutation. 6

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM - The fitness of the new chromosomes is evaluated [6]. - During the last step, individuals from the old total stations position parameters (population) are deleted and replaced by the new ones. The algorithm is stopped when the population converges toward the optimal solution. In this study, the stopping criteria were the minimum value of the trace of the variance covariance matrix [4]. 6- RIMTL WORKS D FILD STUD The accuracy of points coordinates (point positioning) that have been observed through the process of setting out or deformation monitoring using the presented geodetic techniques must be studied. It is necessary also to study the effect of the used instrument position distances and the observations angle on the accuracy of observed point positioning to get the optimum instrument positions. To achieve that goal, several observations were done on horizontal area. This section illustrates the results of practical measurements on area of land (8.0 m x.0 m) inside Kafr l- Sheikh University represented by an extensive number of well-distributed targets in Figure 6. Figure (6): Geometry of experimental study (layout of occupied and observed points) The test was carried out in the daytime when sunlight and temperature was 0. mesh of seventeen observed points on area (8.0 m x.0 m) is distributed for coordinating a building foundation (as shown in Table ). local three-dimensional rectangular coordinates system is needed to calculate the spatial coordinates of any target points on the mesh. Such a system, presumably, has -axis is chosen as a horizontal line parallel to the base direction (side 8m), which the -axis is a horizontal line perpendicular to the base direction and positive in the direction towards the object area, the Z- axis is a vertical line determined by the vertical axis of the instrument. 6

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM Table (): The oordinate of test field points point no. Z point no. Z 46 9.79 0 6.5 5.5 8.7 8 46 8.79.5 5.5 8.9 4 46 9.04 0.5 5.5 8.78 4 0 46 8.94.5 0 9.6 5 6 46 9.6 4 8.5 0 9.5 6 5 4.5 9.9 5.5 0 9.7 7 4.5 9.4 6 8.5 0 9.4 8 7 4.5 8.8 7.5 0 8.68 9 4.5 8.99 In this study, we applied the Genetic lgorithm. In this context, we used the same test field with the same conditions, specifications and instruments that have been used in the angular intersection, linear intersection and multi stations intersection. Table shows the parameters of the genetic algorithm. The coordinates of the positions of the total stations, the base distance ratio and the angle of triangle (φ) after the optimization process are shown in Table. Table (): Genetic algorithm parameters arameter Value opulation size 00 Tournament size rossover probability 5 70% Mutation probability 0.5% Table (): The oordinates of Total Stations (in m), base height ratio and the angle of triangle in different techniques of intersection using Genetic lgorithm optimization ase the eight of The method Z Distance ϕ station instrument ratio ngular Intersection Linear Intersection Multi-Station Intersection 5. 0.5 8.5.5. 5.5 8.7 0.95 0.84.5 8.6.4 6.8.54 8.4..4 7. 8.7.7 9.45. 8.5. -.05-0 8.5 0.65 4 6 8.75. -0 8.58 0.9 0.88 7 0 0 \.4 \\ 0.84 5 0 55 \ 5. \\ 0.98 9 0 \ 48.78 \\ 64

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM Table 4: The accuracy and standard deviations (Std.) for the test field coordinates (in mm) in different techniques of intersection after using Genetic lgorithm optimization ngular Intersection Linear Intersection Multi-Station Intersection Max. ( ) in mm 7.87087695 9.90865 0.479070 Min. ( ) in mm -4.660990 0.47869-0.85777 verage ( ) in mm.94585 5.678674-0.04697488 Std. ( ) in mm.655076 6.004 0.70566 Max. ( ) in mm.85478 0.809698.478004558 Min. ( ) in mm -0.5499.60876 -.4578947 verage ( ) in mm.5686 6.9867646 0.0478645 Std. ( ) in mm.47994 7.5008777.87867 Max. ( Z) in mm 0.55665085 0.6798099 0.47865 Min. ( Z) in mm -0.408978-0.78784-0.600586 verage ( Z) in mm -0.056964-0.08644574-0.054667 Std. ( Z) in mm 0.5764 0.050459 0.00774 ositioning in mm.5486 8.9995467 0.0846998 In case of using the angular intersection, linear intersection and multi stations intersection with genetic algorithm optimization, the evaluated accuracy and standard deviations (SD) for the test field coordinates will also be presented in tabular form (see Table 4). It is to be mentioned that, the standard deviation (SD), as calculated from the least-squares adjustment will be considered as a measure of precision and the obtained results of the verage ( ), verage ( ), verage ( Z) and ositioning will be considered as a measure of accuracy [5]. 7- OLUSIOS In this paper, the uses of different intersection techniques are investigated. The multi station intersection technique to be very efficient for setting out and deformation problems in ngineering Structures. The achieved accuracy using multi station intersection technique is more accurate than that obtained by the conventional methods (angular and linear intersection). In the intersection techniques, the best estimated accuracy for the object space coordinate is achieved when the least squares adjustment technique was used. ased on experimental results, the genetic algorithm technique for determine the optimal total station placement in intersection (optimization problems) is efficient, easy to computerize and is considered more simple and economic than the other techniques. The best estimated accuracy is achieved when the genetic algorithm used for solving the optimization problem. 65

ISS 0976 66(Online), Volume 5, Issue, December (04), pp. 56-66 IM 8- RFRS [] llan.., 996 Surveying uilding Surface by Theodolite Intersection Survey Review. [] eshr., 004 " ccurate surveying measurements for smart structural members", M.Sc. Thesis, Mansoura university, Mansoura gypt, 94 p. [] higiator R., hiorobo J., higiator O., eshr., 0 "Modification of Geodetic Methods for Determining The Monitoring Station oordinates on The Surface of ylindrical Oil Storage Tank" Research Journal in ngineering and pplied Sciences () 58-6. [4] Matlab Online Support website, 04. http://www.mathworks.com/support/. [5] Mittermayer,., 97. Zur usgleichung freier etze.zfv(97), S.48-489. [6] Sivanandam, S.., Deepa, S.., 008 " Introduction to Genetic lgorithms" IS 978--540-789-4 Springer erlin eidelberg ew ork. 66