Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/5252
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhushan, Bharat-
dc.date.accessioned2014-10-09T04:28:41Z-
dc.date.available2014-10-09T04:28:41Z-
dc.date.issued2012-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/5252-
dc.guideGhosh, J. K.-
dc.description.abstractThe GPS provides position of a point on the surface of the earth with high degree of speed and accuracy. However, the GPS measurements are also fraught with different types of errors. Among these errors random errors are the most unpredictable. Many applications of GPS data require accurate point position which is possible by reducing the random error in the GPS data. One of the method of reducing the random error is to adjust the network formed by the GPS control points. GPS provides large amount of data continuously at an' interval as low as 0.001 second epoch. Thus huge amount of data may better be processed by an algorithm less complex requiring less memory and computational time. Kalman Filter is a recursive algorithm which requires only the present and the previous observations may be one such algorithm which applied on GPS control network which minimizes the random error. In this study the Kalman Filter algorithm has been applied to adjust a GPS based control network. The results of proposed Kalman filter technique give better accuracy with more consistency and are found superior to the standard one (least square). Keywords: GPS, Network Adjustment, Kalman filter, Recursive Algorithmen_US
dc.language.isoenen_US
dc.subjectCIVIL ENGINEERINGen_US
dc.subjectGPS RANDOM ERRORen_US
dc.subjectGPS NETWORKen_US
dc.subjectKALMAN FILTERen_US
dc.titleGPS NETWORK ADJUSTMENT USING KALMAN FILTERen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG21697en_US
Appears in Collections:MASTERS' THESES (Civil Engg)

Files in This Item:
File Description SizeFormat 
CEDG21697.pdf14.04 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.