Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6024
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKalra, Prabhjot Singh-
dc.contributor.authorBhatt, Ravindra [Guided by]-
dc.date.accessioned2022-09-01T04:45:00Z-
dc.date.available2022-09-01T04:45:00Z-
dc.date.issued2015-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6024-
dc.description.abstractRecently the modernization of transport system is a new area of research in wireless communication system. Such transport system aims to create a more secure, reliable and efficient system to improve road safety, driver assistance and user comfort on road. This gives the new idea of intelligence transportation system (ITS) which is very popular in developed countries. Shortest Path problems are inevitable in road network applications such as city emergency handling and drive guiding system, in where the optimal routings have to be found. We propose a path finding in the city map to the VANET application utilizing the well-known A* algorithm. In our work the details of A* algorithm are addressed as a basis of delivering a number of optimization techniques to find the best possible path. This project aims to investigate the single source shortest path problems and intends to obtain some general conclusions by examining A* algorithm approach. Our work is carried out into three different scenarios and respective results are obtained and compared with each other.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectVANETen_US
dc.subjectTransportation networken_US
dc.subjectAlgorithmen_US
dc.titleIntelligent Transport System and Path Finding in City Environmenten_US
dc.typeProject Reporten_US
Appears in Collections:B.Tech. Project Reports

Files in This Item:
File Description SizeFormat 
Intelligent Transport System and Path Finding in City Environment.pdf1.41 MBAdobe PDFView/Open


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