{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-3017"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-3017","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Minimizing the Disruption of Traffic Flow of Automated Vehicles During Lane Changes","abstract":"In intelligent transportation systems, most of the research work has focused on lane change assistant systems. No existing work considers minimizing the interruption of traffic flow by maximizing the number of lane changes while eliminating the collisions. In this thesis, we develop qualitative and quantitative approaches for minimizing the interruption of traffic flow for three lane scenarios and show that we can extend our approach to any random number of lanes. The algorithm we propose in this thesis is able to achieve the maximum number of lane changes provided that only one vehicle per group (novel concept which is described in this thesis) is allowed to change lanes at a time. Simulation results show that our approach provides much better performance when compared with different lane change algorithms without incurring large overhead, and is hence suitable for online use.","abstract_html":"In intelligent transportation systems, most of the research work has focused on lane change assistant systems. No existing work considers minimizing the interruption of traffic flow by maximizing the number of lane changes while eliminating the collisions. In this thesis, we develop qualitative and quantitative approaches for minimizing the interruption of traffic flow for three lane scenarios and show that we can extend our approach to any random number of lanes. The algorithm we propose in this thesis is able to achieve the maximum number of lane changes provided that only one vehicle per group (novel concept which is described in this thesis) is allowed to change lanes at a time. Simulation results show that our approach provides much better performance when compared with different lane change algorithms without incurring large overhead, and is hence suitable for online use.","abstract_has_math":false,"creators":["Desiraju, Divya"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Tam Chantem","Edmund Spencer","Chris Winstead"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:47:19Z","subjects":["minimizing","traffic flow","disruption","automated vehicles","lane changes","Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/30c2-d735"],"render_values":[{"text":"https://doi.org/10.26076/30c2-d735","href":"https://doi.org/10.26076/30c2-d735","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/2010","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/2010","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-3017","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Tam Chantem","Edmund Spencer","Chris Winstead"]},{"key":"dc:creator","label":"Author","values":["Desiraju, Divya"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2013-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["minimizing","traffic flow","disruption","automated vehicles","lane changes","Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/2010"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/30c2-d735"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In intelligent transportation systems, most of the research work has focused on lane change assistant systems. No existing work considers minimizing the interruption of traffic flow by maximizing the number of lane changes while eliminating the collisions. In this thesis, we develop qualitative and quantitative approaches for minimizing the interruption of traffic flow for three lane scenarios and show that we can extend our approach to any random number of lanes. The algorithm we propose in this thesis is able to achieve the maximum number of lane changes provided that only one vehicle per group (novel concept which is described in this thesis) is allowed to change lanes at a time. Simulation results show that our approach provides much better performance when compared with different lane change algorithms without incurring large overhead, and is hence suitable for online use."]},{"key":"dc:title","label":"Title","values":["Minimizing the Disruption of Traffic Flow of Automated Vehicles During Lane Changes"]}]}],"canonical_facts":{"dc:contributor":["Tam Chantem","Edmund Spencer","Chris Winstead"],"dc:creator":["Desiraju, Divya"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2013-05-01T07:00:00Z"],"dc:description.abstract":["In intelligent transportation systems, most of the research work has focused on lane change assistant systems. No existing work considers minimizing the interruption of traffic flow by maximizing the number of lane changes while eliminating the collisions. In this thesis, we develop qualitative and quantitative approaches for minimizing the interruption of traffic flow for three lane scenarios and show that we can extend our approach to any random number of lanes. The algorithm we propose in this thesis is able to achieve the maximum number of lane changes provided that only one vehicle per group (novel concept which is described in this thesis) is allowed to change lanes at a time. Simulation results show that our approach provides much better performance when compared with different lane change algorithms without incurring large overhead, and is hence suitable for online use."],"dc:identifier":["https://digitalcommons.usu.edu/etd/2010"],"dc:identifier.doi":["https://doi.org/10.26076/30c2-d735"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["minimizing","traffic flow","disruption","automated vehicles","lane changes","Computer Engineering"],"dc:title":["Minimizing the Disruption of Traffic Flow of Automated Vehicles During Lane Changes"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:47:19Z"}