Modeling, Control, and Impact Analysis of The Next Generation Transportation System

This dissertation aims to develop a systematic tool designated for connected and autonomous vehicles, integrating the simulation of traffic dynamics, traffic control strategies, and impact analysis at the network level. The first part of the dissertation is devoted to the traffic flow modeling of connected vehicles. This task is the foundation step for transportation planning, optimized network design, efficient traffic control strategies, etc, of the next generation transportation system. Chapter 2 proposes a cell-based simulation approach to model the proactive driving behavior of connected vehicles. Firstly, a state variable of connected vehicle is introduced to track the trajectory of connected vehicles. Then the exit flow of cells containing connected vehicles is adjusted to simulate the proactive driving behavior, such that the traffic light is green when the connected vehicle arrives at the signalized intersection. Extensive numerical simulation results consistently show that the presence of connected vehicles contributes significantly to the smoothing of traffic flow and vehicular emission reductions in the network. Chapter 3 proposes an optimal estimation approach to calibrate connected vehicles\u27 car-following behavior in a mixed traffic environment. Particularly, the state-space system dynamics is captured by the simplified car-following model with disturbances, where the trajectory of non-connected vehicles are considered as unknown states and the trajectory of connected vehicles are considered as measurements with errors. Objective of the reformulation is to obtain an optimal estimation of states and model parameters simultaneously. It is shown that the customized state-space model is identifiable with the mild assumption that the disturbance covariance of the state update process is diagonal. Then a modified Expectation-Maximization (EM) algorithm based on Kalman smoother is developed to solve the optimal estimation problem. The second part of the dissertation is on traffic control strategies. This task drives the next generation transportation system to a better performance state in terms of safety, mobility, travel time saving, vehicular emission reduction, etc. Chapter 4 develops a novel reinforcement learning algorithm for the challenging coordinated signal control problem. Traffic signals are modeled as intelligent agents interacting with the stochastic traffic environment. The model is built on the framework of coordinated reinforcement learning. The Junction Tree Algorithm based reinforcement learning is proposed to obtain an exact inference of the best joint actions for all the coordinated intersections. The algorithm is implemented and tested with a network containing 18 signalized intersections from a microscopic traffic simulator. Chapter 5 develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only values in {-1, 0, 1}. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. Further, it shows that traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control. The third part of the dissertation moves on to the impact analysis of connected vehicles and autonomous vehicles at the network level. This task assesses the positive and negative impacts of the system and provides guidance on transportation planning, traffic control, transportation budget spending, etc. In this part, the impact of different penetration rates of connected vehicle and autonomous vehicles is revealed on the network efficiency of a transportation system. Chapter 6 sets out to model an efficient and fair transportation system accounting for both departure time choice and route choice of a general multi OD network within a dynamic traffic assignment environment. Firstly, a bi-level optimization formulation is introduced based on the link-based traffic flow model. The upper level of the formulation minimizes the total system travel time, whereas the lower level captures traffic flow propagation and the user equilibrium constraint. Then the bi-level formulation is relaxed to a linear programming formulation that produces a lower bound of an efficient and fair system state. An efficient iterative algorithm is proposed to obtain the exact solution. It is shown that the number of iterations is bounded, and the output traffic flow solution is efficient and fair. Finally, two numerical cases (including a single OD network and a multi-OD network) are conducted to demonstrate the performance of the algorithm. The results consistently show that the travel time of different departure rates of the same OD pair are identical and the algorithm converges within two iterations across all test scenarios

Transport Systems: Safety Modeling, Visions and Strategies

This reprint includes papers describing the synthesis of current theory and practice of planning, design, operation, and safety of modern transport, with special focus on future visions and strategies of transport sustainability, which will be of interest to scientists dealing with transport problems and generally involved in traffic engineering as well as design, traffic networks, and maintenance engineers

Towards the reduction of greenhouse gas emissions : models and algorithms for ridesharing and carbon capture and storage

Avec la ratification de l'Accord de Paris, les pays se sont engagés à limiter le réchauffement climatique bien en dessous de 2, de préférence à 1,5 degrés Celsius, par rapport aux niveaux préindustriels. À cette fin, les émissions anthropiques de gaz à effet de serre (GES, tels que CO2) doivent être réduites pour atteindre des émissions nettes de carbone nulles d'ici 2050. Cet objectif ambitieux peut être atteint grâce à différentes stratégies d'atténuation des GES, telles que l'électrification, les changements de comportement des consommateurs, l'amélioration de l'efficacité énergétique des procédés, l'utilisation de substituts aux combustibles fossiles (tels que la bioénergie ou l'hydrogène), le captage et le stockage du carbone (CSC), entre autres. Cette thèse vise à contribuer à deux de ces stratégies : le covoiturage (qui appartient à la catégorie des changements de comportement du consommateur) et la capture et le stockage du carbone. Cette thèse fournit des modèles mathématiques et d'optimisation et des algorithmes pour la planification opérationnelle et tactique des systèmes de covoiturage, et des heuristiques pour la planification stratégique d'un réseau de captage et de stockage du carbone. Dans le covoiturage, les émissions sont réduites lorsque les individus voyagent ensemble au lieu de conduire seuls. Dans ce contexte, cette thèse fournit de nouveaux modèles mathématiques pour représenter les systèmes de covoiturage, allant des problèmes d'affectation stochastique à deux étapes aux problèmes d'empaquetage d'ensembles stochastiques à deux étapes qui peuvent représenter un large éventail de systèmes de covoiturage. Ces modèles aident les décideurs dans leur planification opérationnelle des covoiturages, où les conducteurs et les passagers doivent être jumelés pour le covoiturage à court terme. De plus, cette thèse explore la planification tactique des systèmes de covoiturage en comparant différents modes de fonctionnement du covoiturage et les paramètres de la plateforme (par exemple, le partage des revenus et les pénalités). De nouvelles caractéristiques de problèmes sont étudiées, telles que l'incertitude du conducteur et du passager, la flexibilité de réappariement et la réservation de l'offre de conducteur via les frais de réservation et les pénalités. En particulier, la flexibilité de réappariement peut augmenter l'efficacité d'une plateforme de covoiturage, et la réservation de l'offre de conducteurs via les frais de réservation et les pénalités peut augmenter la satisfaction des utilisateurs grâce à une compensation garantie si un covoiturage n'est pas fourni. Des expériences computationnelles détaillées sont menées et des informations managériales sont fournies. Malgré la possibilité de réduction des émissions grâce au covoiturage et à d'autres stratégies d'atténuation, des études macroéconomiques mondiales montrent que même si plusieurs stratégies d'atténuation des GES sont utilisées simultanément, il ne sera probablement pas possible d'atteindre des émissions nettes nulles d'ici 2050 sans le CSC. Ici, le CO2 est capturé à partir des sites émetteurs et transporté vers des réservoirs géologiques, où il est injecté pour un stockage à long terme. Cette thèse considère un problème de planification stratégique multipériode pour l'optimisation d'une chaîne de valeur CSC. Ce problème est un problème combiné de localisation des installations et de conception du réseau où une infrastructure CSC est prévue pour les prochaines décennies. En raison des défis informatiques associés à ce problème, une heuristique est introduite, qui est capable de trouver de meilleures solutions qu'un solveur commercial de programmation mathématique, pour une fraction du temps de calcul. Cette heuristique comporte des phases d'intensification et de diversification, une génération améliorée de solutions réalisables par programmation dynamique, et une étape finale de raffinement basée sur un modèle restreint. Dans l'ensemble, les contributions de cette thèse sur le covoiturage et le CSC fournissent des modèles de programmation mathématique, des algorithmes et des informations managériales qui peuvent aider les praticiens et les parties prenantes à planifier des émissions nettes nulles.With the ratification of the Paris Agreement, countries committed to limiting global warming to well below 2, preferably to 1.5 degrees Celsius, compared to pre-industrial levels. To this end, anthropogenic greenhouse gas (GHG) emissions (such as CO2) must be reduced to reach net-zero carbon emissions by 2050. This ambitious target may be met by means of different GHG mitigation strategies, such as electrification, changes in consumer behavior, improving the energy efficiency of processes, using substitutes for fossil fuels (such as bioenergy or hydrogen), and carbon capture and storage (CCS). This thesis aims at contributing to two of these strategies: ridesharing (which belongs to the category of changes in consumer behavior) and carbon capture and storage. This thesis provides mathematical and optimization models and algorithms for the operational and tactical planning of ridesharing systems, and heuristics for the strategic planning of a carbon capture and storage network. In ridesharing, emissions are reduced when individuals travel together instead of driving alone. In this context, this thesis provides novel mathematical models to represent ridesharing systems, ranging from two-stage stochastic assignment problems to two-stage stochastic set packing problems that can represent a wide variety of ridesharing systems. These models aid decision makers in their operational planning of rideshares, where drivers and riders have to be matched for ridesharing on the short-term. Additionally, this thesis explores the tactical planning of ridesharing systems by comparing different modes of ridesharing operation and platform parameters (e.g., revenue share and penalties). Novel problem characteristics are studied, such as driver and rider uncertainty, rematching flexibility, and reservation of driver supply through booking fees and penalties. In particular, rematching flexibility may increase the efficiency of a ridesharing platform, and the reservation of driver supply through booking fees and penalties may increase user satisfaction through guaranteed compensation if a rideshare is not provided. Extensive computational experiments are conducted and managerial insights are given. Despite the opportunity to reduce emissions through ridesharing and other mitigation strategies, global macroeconomic studies show that even if several GHG mitigation strategies are used simultaneously, achieving net-zero emissions by 2050 will likely not be possible without CCS. Here, CO2 is captured from emitter sites and transported to geological reservoirs, where it is injected for long-term storage. This thesis considers a multiperiod strategic planning problem for the optimization of a CCS value chain. This problem is a combined facility location and network design problem where a CCS infrastructure is planned for the next decades. Due to the computational challenges associated with that problem, a slope scaling heuristic is introduced, which is capable of finding better solutions than a state-of-the-art general-purpose mathematical programming solver, at a fraction of the computational time. This heuristic has intensification and diversification phases, improved generation of feasible solutions through dynamic programming, and a final refining step based on a restricted model. Overall, the contributions of this thesis on ridesharing and CCS provide mathematical programming models, algorithms, and managerial insights that may help practitioners and stakeholders plan for net-zero emissions

On the Empty Miles of Ride-Sourcing Services: Theory, Observation and Countermeasures

The proliferation of smartphones in recent years has catalyzed the rapid growth of ride-sourcing services such as Uber, Lyft, and Didi Chuxing. Such on-demand e-hailing services significantly reduce the meeting frictions between drivers and riders and provide the platform with unprecedented flexibility and challenges in system management. A big issue that arises with service expansion is the empty miles produced by ride-sourcing vehicles. To overcome the physical and temporal frictions that separate drivers from customers and effectively reposition themselves towards desired destinations, ride-sourcing vehicles generate a significant number of vacant trips. These empty miles traveled result in inefficient use of the available fleet and increase traffic demand, posing substantial impacts on system operations. To tackle the issues, my dissertation is dedicated to deepening our understanding of the formation and the externalities of empty miles, and then proposing countermeasures to bolster system performance. There are two essential and interdependent contributors to empty miles generated by ride-sourcing vehicles: cruising in search of customers and deadheading to pick them up, which are markedly dictated by forces from riders, drivers, the platform, and policies imposed by regulators. In this dissertation, we structure our study of this complex process along three primary axes, respectively centered on the strategies of a platform, the behaviors of drivers, and the concerns of government agencies. In each axis, theoretical models are established to help understand the underlying physics and identify the trade-offs and potential issues that drive behind the empty miles. Massive data from Didi Chuxing, a dominant ride-sourcing company in China, are leveraged to evidence the presence of matters discussed in reality. Countermeasures are then investigated to strengthen management upon the empty miles, balance the interests of different stakeholders, and improve the system performance. Although this dissertation scopes out ride-sourcing services, the models, analyses, and solutions can be readily adapted to address related issues in other types of shared-use mobility services.PHDCivil EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/163209/1/xzt_1.pd

Advanced Map Matching Technologies and Techniques for Pedestrian/Wheelchair Navigation

Due to the constantly increasing technical advantages of mobile devices (such as smartphones), pedestrian/wheelchair navigation recently has achieved a high level of interest as one of smartphones’ potential mobile applications. While vehicle navigation systems have already reached a certain level of maturity, pedestrian/wheelchair navigation services are still in their infancy. By comparing vehicle navigation systems, a set of map matching requirements and challenges unique in pedestrian/wheelchair navigation is identified. To provide navigation assistance to pedestrians and wheelchair users, there is a need for the design and development of new map matching techniques. The main goal of this research is to investigate and develop advanced map matching technologies and techniques particular for pedestrian/wheelchair navigation services. As the first step in map matching, an adaptive candidate segment selection algorithm is developed to efficiently find candidate segments. Furthermore, to narrow down the search for the correct segment, advanced mathematical models are applied. GPS-based chain-code map matching, Hidden Markov Model (HMM) map matching, and fuzzy-logic map matching algorithms are developed to estimate real-time location of users in pedestrian/wheelchair navigation systems/services. Nevertheless, GPS signal is not always available in areas with high-rise buildings and even when there is a signal, the accuracy may not be high enough for localization of pedestrians and wheelchair users on sidewalks. To overcome these shortcomings of GPS, multi-sensor integrated map matching algorithms are investigated and developed in this research. These algorithms include a movement pattern recognition algorithm, using accelerometer and compass data, and a vision-based positioning algorithm to fill in signal gaps in GPS positioning. Experiments are conducted to evaluate the developed algorithms using real field test data (GPS coordinates and other sensors data). The experimental results show that the developed algorithms and the integrated sensors, i.e., a monocular visual odometry, a GPS, an accelerometer, and a compass, can provide high-quality and uninterrupted localization services in pedestrian/wheelchair navigation systems/services. The map matching techniques developed in this work can be applied to various pedestrian/wheelchair navigation applications, such as tracking senior citizens and children, or tourist service systems, and can be further utilized in building walking robots and automatic wheelchair navigation systems

Machine Learning Solutions for Transportation Networks

This thesis brings a collection of novel models and methods that result from a new look at practical problems in transportation through the prism of newly available sensor data. There are four main contributions: First, we design a generative probabilistic graphical model to describe multivariate continuous densities such as observed traffic patterns. The model implements a multivariate normal distribution with covariance constrained in a natural way, using a number of parameters that is only linear (as opposed to quadratic) in the dimensionality of the data. This means that learning these models requires less data. The primary use for such a model is to support inferences, for instance, of data missing due to sensor malfunctions. Second, we build a model of traffic flow inspired by macroscopic flow models. Unlike traditional such models, our model deals with uncertainty of measurement and unobservability of certain important quantities and incorporates on-the-fly observations more easily. Because the model does not admit efficient exact inference, we develop a particle filter. The model delivers better medium- and long- term predictions than general-purpose time series models. Moreover, having a predictive distribution of traffic state enables the application of powerful decision-making machinery to the traffic domain. Third, two new optimization algorithms for the common task of vehicle routing are designed, using the traffic flow model as their probabilistic underpinning. Their benefits include suitability to highly volatile environments and the fact that optimization criteria other than the classical minimal expected time are easily incorporated. Finally, we present a new method for detecting accidents and other adverse events. Data collected from highways enables us to bring supervised learning approaches to incident detection. We show that a support vector machine learner can outperform manually calibrated solutions. A major hurdle to performance of supervised learners is the quality of data which contains systematic biases varying from site to site. We build a dynamic Bayesian network framework that learns and rectifies these biases, leading to improved supervised detector performance with little need for manually tagged data. The realignment method applies generally to virtually all forms of labeled sequential data

Proceedings of the 4th Symposium on Management of Future Motorway and Urban Traffic Systems 2022

The 4th Symposium on Management of Future Motorway and Urban Traffic Systems (MFTS) was held in Dresden, Germany, from November 30th to December 2nd, 2022. Organized by the Chair of Traffic Process Automation (VPA) at the “Friedrich List” Faculty of Transport and Traffic Sciences of the TU Dresden, the proceedings of this conference are published as volume 9 in the Chair’s publication series “Verkehrstelematik” and contain a large part of the presented conference extended abstracts. The focus of the MFTS conference 2022 was cooperative management of multimodal transport and reflected the vision of the professorship to be an internationally recognized group in ITS research and education with the goal of optimizing the operation of multimodal transport systems. In 14 MFTS sessions, current topics in demand and traffic management, traffic control in conventional, connected and automated transport, connected and autonomous vehicles, traffic flow modeling and simulation, new and shared mobility systems, digitization, and user behavior and safety were discussed. In addition, special sessions were organized, for example on “Human aspects in traffic modeling and simulation” and “Lesson learned from Covid19 pandemic”, whose descriptions and analyses are also included in these proceedings.:1 Connected and Automated Vehicles 1.1 Traffic-based Control of Truck Platoons on Freeways 1.2 A Lateral Positioning Strategy for Connected and Automated Vehicles in Lane-free Traffic 1.3 Simulation Methods for Mixed Legacy-Autonomous Mainline Train Operations 1.4 Can Dedicated Lanes for Automated Vehicles on Urban Roads Improve Traffic Efficiency? 1.5 GLOSA System with Uncertain Green and Red Signal Phases 2 New Mobility Systems 2.1 A New Model for Electric Vehicle Mobility and Energy Consumption in Urban Traffic Networks 2.2 Shared Autonomous Vehicles Implementation for a Disrupted Public Transport Network 3 Traffic Flow and Simulation 3.1 Multi-vehicle Stochastic Fundamental Diagram Consistent with Transportations Systems Theory 3.2 A RoundD-like Roundabout Scenario in CARLA Simulator 3.3 Multimodal Performance Evaluation of Urban Traffic Control: A Microscopic Simulation Study 3.4 A MILP Framework to Solve the Sustainable System Optimum with Link MFD Functions 3.5 On How Traffic Signals Impact the Fundamental Diagrams of Urban Roads 4 Traffic Control in Conventional Traffic 4.1 Data-driven Methods for Identifying Travel Conditions Based on Traffic and Weather Characteristics 4.2 AI-based Multi-class Traffic Model Oriented to Freeway Traffic Control 4.3 Exploiting Deep Learning and Traffic Models for Freeway Traffic Estimation 4.4 Automatic Design of Optimal Actuated Traffic Signal Control with Transit Signal Priority 4.5 A Deep Reinforcement Learning Approach for Dynamic Traffic Light Control with Transit Signal Priority 4.6 Towards Efficient Incident Detection in Real-time Traffic Management 4.7 Dynamic Cycle Time in Traffic Signal of Cyclic Max-Pressure Control 5 Traffic Control with Autonomous Vehicles 5.1 Distributed Ordering and Optimization for Intersection Management with Connected and Automated Vehicles 5.2 Prioritization of an Automated Shuttle for V2X Public Transport at a Signalized Intersection – a Real-life Demonstration 6 User Behaviour and Safety 6.1 Local Traffic Safety Analyzer (LTSA) - Improved Road Safety and Optimized Signal Control for Future Urban Intersections 7 Demand and Traffic Management 7.1 A Stochastic Programming Method for OD Estimation Using LBSN Check-in Data 7.2 Delineation of Traffic Analysis Zone for Public Transportation OD Matrix Estimation Based on Socio-spatial Practices 8 Workshops 8.1 How to Integrate Human Aspects Into Engineering Science of Transport and Traffic? - a Workshop Report about Discussions on Social Contextualization of Mobility 8.2 Learning from Covid: How Can we Predict Mobility Behaviour in the Face of Disruptive Events? – How to Investigate the Mobility of the FutureDas 4. Symposium zum Management zukünftiger Autobahn- und Stadtverkehrssysteme (MFTS) fand vom 30. November bis 2. Dezember 2022 in Dresden statt und wurde vom Lehrstuhl für Verkehrsprozessautomatisierung (VPA) an der Fakultät Verkehrswissenschaften„Friedrich List“ der TU Dresden organisiert. Der Tagungsband erscheint als Band 9 in der Schriftenreihe „Verkehrstelematik“ des Lehrstuhls und enthält einen Großteil der vorgestellten Extended-Abstracts des Symposiums. Der Schwerpunkt des MFTS-Symposiums 2022 lag auf dem kooperativen Management multimodalen Verkehrs und spiegelte die Vision der Professur wider, eine international anerkannte Gruppe in der ITS-Forschung und -Ausbildung mit dem Ziel der Optimierung des Betriebs multimodaler Transportsysteme zu sein. In 14 MFTS-Sitzungen wurden aktuelle Themen aus den Bereichen Nachfrage- und Verkehrsmanagement, Verkehrssteuerung im konventionellen, vernetzten und automatisierten Verkehr, vernetzte und autonome Fahrzeuge, Verkehrsflussmodellierung und -simulation, neue und geteilte Mobilitätssysteme, Digitalisierung sowie Nutzerverhalten und Sicherheit diskutiert. Darüber hinaus wurden Sondersitzungen organisiert, beispielsweise zu „Menschlichen Aspekten bei der Verkehrsmodellierung und -simulation“ und „Lektionen aus der Covid-19-Pandemie“, deren Beschreibungen und Analysen ebenfalls in diesen Tagungsband einfließen.:1 Connected and Automated Vehicles 1.1 Traffic-based Control of Truck Platoons on Freeways 1.2 A Lateral Positioning Strategy for Connected and Automated Vehicles in Lane-free Traffic 1.3 Simulation Methods for Mixed Legacy-Autonomous Mainline Train Operations 1.4 Can Dedicated Lanes for Automated Vehicles on Urban Roads Improve Traffic Efficiency? 1.5 GLOSA System with Uncertain Green and Red Signal Phases 2 New Mobility Systems 2.1 A New Model for Electric Vehicle Mobility and Energy Consumption in Urban Traffic Networks 2.2 Shared Autonomous Vehicles Implementation for a Disrupted Public Transport Network 3 Traffic Flow and Simulation 3.1 Multi-vehicle Stochastic Fundamental Diagram Consistent with Transportations Systems Theory 3.2 A RoundD-like Roundabout Scenario in CARLA Simulator 3.3 Multimodal Performance Evaluation of Urban Traffic Control: A Microscopic Simulation Study 3.4 A MILP Framework to Solve the Sustainable System Optimum with Link MFD Functions 3.5 On How Traffic Signals Impact the Fundamental Diagrams of Urban Roads 4 Traffic Control in Conventional Traffic 4.1 Data-driven Methods for Identifying Travel Conditions Based on Traffic and Weather Characteristics 4.2 AI-based Multi-class Traffic Model Oriented to Freeway Traffic Control 4.3 Exploiting Deep Learning and Traffic Models for Freeway Traffic Estimation 4.4 Automatic Design of Optimal Actuated Traffic Signal Control with Transit Signal Priority 4.5 A Deep Reinforcement Learning Approach for Dynamic Traffic Light Control with Transit Signal Priority 4.6 Towards Efficient Incident Detection in Real-time Traffic Management 4.7 Dynamic Cycle Time in Traffic Signal of Cyclic Max-Pressure Control 5 Traffic Control with Autonomous Vehicles 5.1 Distributed Ordering and Optimization for Intersection Management with Connected and Automated Vehicles 5.2 Prioritization of an Automated Shuttle for V2X Public Transport at a Signalized Intersection – a Real-life Demonstration 6 User Behaviour and Safety 6.1 Local Traffic Safety Analyzer (LTSA) - Improved Road Safety and Optimized Signal Control for Future Urban Intersections 7 Demand and Traffic Management 7.1 A Stochastic Programming Method for OD Estimation Using LBSN Check-in Data 7.2 Delineation of Traffic Analysis Zone for Public Transportation OD Matrix Estimation Based on Socio-spatial Practices 8 Workshops 8.1 How to Integrate Human Aspects Into Engineering Science of Transport and Traffic? - a Workshop Report about Discussions on Social Contextualization of Mobility 8.2 Learning from Covid: How Can we Predict Mobility Behaviour in the Face of Disruptive Events? – How to Investigate the Mobility of the Futur

Towards A Self-calibrating Video Camera Network For Content Analysis And Forensics

Due to growing security concerns, video surveillance and monitoring has received an immense attention from both federal agencies and private firms. The main concern is that a single camera, even if allowed to rotate or translate, is not sufficient to cover a large area for video surveillance. A more general solution with wide range of applications is to allow the deployed cameras to have a non-overlapping field of view (FoV) and to, if possible, allow these cameras to move freely in 3D space. This thesis addresses the issue of how cameras in such a network can be calibrated and how the network as a whole can be calibrated, such that each camera as a unit in the network is aware of its orientation with respect to all the other cameras in the network. Different types of cameras might be present in a multiple camera network and novel techniques are presented for efficient calibration of these cameras. Specifically: (i) For a stationary camera, we derive new constraints on the Image of the Absolute Conic (IAC). These new constraints are shown to be intrinsic to IAC; (ii) For a scene where object shadows are cast on a ground plane, we track the shadows on the ground plane cast by at least two unknown stationary points, and utilize the tracked shadow positions to compute the horizon line and hence compute the camera intrinsic and extrinsic parameters; (iii) A novel solution to a scenario where a camera is observing pedestrians is presented. The uniqueness of formulation lies in recognizing two harmonic homologies present in the geometry obtained by observing pedestrians; (iv) For a freely moving camera, a novel practical method is proposed for its self-calibration which even allows it to change its internal parameters by zooming; and (v) due to the increased application of the pan-tilt-zoom (PTZ) cameras, a technique is presented that uses only two images to estimate five camera parameters. For an automatically configurable multi-camera network, having non-overlapping field of view and possibly containing moving cameras, a practical framework is proposed that determines the geometry of such a dynamic camera network. It is shown that only one automatically computed vanishing point and a line lying on any plane orthogonal to the vertical direction is sufficient to infer the geometry of a dynamic network. Our method generalizes previous work which considers restricted camera motions. Using minimal assumptions, we are able to successfully demonstrate promising results on synthetic as well as on real data. Applications to path modeling, GPS coordinate estimation, and configuring mixed-reality environment are explored