CE 56601 - Network Models For Connected And Autonomous Vehicles

Credit Hours: 3.00. This course provides an introduction to mathematical foundations of the analysis of transportation networks. The course will be divided into two main sections. Section 1 will introduce the basic foundations of network routing problems including user equilibrium (selfish routing) and system optimal games on networks. Various optimization-based formulations, algorithms and extensions will be discussed. A particular emphasis will be on devising efficient algorithms and computation on city networks. Students will be expected to know how to design efficient algorithms for network analysis and implement them on various datasets. The second half of the course will tailor the network models learned in the first half to understanding the impacts of connected and autonomous vehicles (CAVs). This will be done by taking specific example problems such as autonomous intersection control, parking design, network design for CAVs, etc. Recent research papers will form the basis for developing these models. Extensive use of intuitive arguments, counterintuitive phenomenon (paradoxes) and network structures will be utilized to illustrate many situations graphically. In addition, computing the solutions efficiently using various network algorithms will be discussed. The course is research based and students in addition to learning the concepts will extend the concepts to a research project to be finished within the semester.Credits: 3.00

CE 56601 - Network Models For Connected And Autonomous Vehicles

Communication

Campus

Services

Other