Archak Mittal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Archak Mittal has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Abhishek Gupta
Indian Institute of Technology Bombay
3 shared publications - Richard Twumasi-Boakye
Research & Advanced Engineering, Mobility & Robotics Department, Ford Motor Company, Dearborn, MI
3 shared publications - Shiping Shao
Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA
2 shared publications - Ali Zockaie
Michigan State University
1 shared publication - Armin Mokhtarian
RWTH Aachen University, Aachen, Germany
1 shared publication - Bassam Alrifaee
University of the Bundeswehr Munich
1 shared publication
Latest Publications
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Intelligent Transportation Systems Magazine
- Vol. PP (19391390) , 2-16
Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms: Challenges and a Roadmap
This article proposes a roadmap to address the current challenges in small-scale testbeds for connected and automated vehicles (CAVs) and robot swarms. The roadmap is a joint effort of participants in the workshop “First Workshop on Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms,” held on 2 June at the IEEE Intelligent Vehicles Symposium (IV) 2024 in Jeju, South Korea. The roadmap contains three parts: 1) enhancing accessibility and diversity, especially for underrepresented communities, 2) sharing best practices for the development and maintenance of testbeds, and 3) global testbed connectivity, e.g., through an abstraction layer, to support collaboration. The workshop features invited speakers, contributed papers, and a presentation of a survey paper on testbeds. The survey paper provides an online comparative table of more than 25 testbeds, available at https://bassamlab.github.io/testbeds-survey. The workshop’s own website is available at https://cpm.lrt.unibw.de/workshop.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Intelligent Transportation Systems Magazine
- Vol. PP (19391390) , 2-16
Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms: Challenges and a Roadmap
This article proposes a roadmap to address the current challenges in small-scale testbeds for connected and automated vehicles (CAVs) and robot swarms. The roadmap is a joint effort of participants in the workshop “First Workshop on Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms,” held on 2 June at the IEEE Intelligent Vehicles Symposium (IV) 2024 in Jeju, South Korea. The roadmap contains three parts: 1) enhancing accessibility and diversity, especially for underrepresented communities, 2) sharing best practices for the development and maintenance of testbeds, and 3) global testbed connectivity, e.g., through an abstraction layer, to support collaboration. The workshop features invited speakers, contributed papers, and a presentation of a survey paper on testbeds. The survey paper provides an online comparative table of more than 25 testbeds, available at https://bassamlab.github.io/testbeds-survey. The workshop’s own website is available at https://cpm.lrt.unibw.de/workshop.
- Open Access
- 19 September 2022
- Published by MDPI AG in Preprints.org
Towards Building a Naturalistic Cycling Dataset Capturing Bicycle/Car Interactions
As machine learning and computer vision techniques and methods continue to advance, the collection of naturalistic traffic data from video feeds is becoming more and more feasible. That is especially true for the case of bicycles, for which the collection of naturalistic data is not achievable in the traditional vehicle approach. This study describes a research effort that aims to extract naturalistic cycling data from a video dataset for use in safety and mobility applications. The used videos come from a dataset collected in a previous Virginia Tech Transportation Institute study in collaboration with SPIN in which continuous video data at a non-signalized intersection on the Virginia Tech campus was recorded. The research team applied computer vision and machine learning techniques to develop a comprehensive framework for the extraction of naturalistic cycling trajectories. In total, this study resulted in the collection and classification of 619 bicycle trajectories based on their type of interactions with other road users. The results confirm the success of the proposed methodology in relation to extracting the locations, speeds, and accelerations of the bicycles at a high level of precision. Furthermore, preliminary insights into the acceleration and speed behavior of bicyclists around motorists are determined.
- 19 September 2022
- Published by MDPI AG in Preprints.org
Open AccessTowards Building a Naturalistic Cycling Dataset Capturing Bicycle/Car Interactions
As machine learning and computer vision techniques and methods continue to advance, the collection of naturalistic traffic data from video feeds is becoming more and more feasible. That is especially true for the case of bicycles, for which the collection of naturalistic data is not achievable in the traditional vehicle approach. This study describes a research effort that aims to extract naturalistic cycling data from a video dataset for use in safety and mobility applications. The used videos come from a dataset collected in a previous Virginia Tech Transportation Institute study in collaboration with SPIN in which continuous video data at a non-signalized intersection on the Virginia Tech campus was recorded. The research team applied computer vision and machine learning techniques to develop a comprehensive framework for the extraction of naturalistic cycling trajectories. In total, this study resulted in the collection and classification of 619 bicycle trajectories based on their type of interactions with other road users. The results confirm the success of the proposed methodology in relation to extracting the locations, speeds, and accelerations of the bicycles at a high level of precision. Furthermore, preliminary insights into the acceleration and speed behavior of bicyclists around motorists are determined.
- 21 August 2022
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2677 (3) , 371-388
Assessing the Network-Wide Impacts of Dedicated Lanes for Connected Autonomous Vehicles
Dedicated lanes for autonomous vehicles (AV) are introduced as an effective strategy to improve mobility in mixed traffic of AVs and heterogeneous drivers. However, adding a new lane is costly, and dedicating an existing lane may increase traffic congestion in other lanes. Previous studies investigated the impacts of AV dedicated lanes on throughput at the segment level and/or assumed a fixed route choice. However, AV dedicated lanes change route choice behavior, which affects traffic distribution over the network. Therefore, this study explores the impacts of AV dedicated lanes on the traffic performance of large-scale networks by conducting a network-level cost–benefit analysis on the implementation of AV dedicated lanes under different demand and AV market penetration rate (MPR) scenarios. This study examines the impacts of implementing AV dedicated lanes to freeway links on traffic congestion at corridor and network levels. Various factors are explored: changes in aggregate flow–density relationships, throughput, and average travel times. To this end, DYNASMART-P software is updated to consider AV dedicated lanes and is used to simulate the mixed traffic. Traffic simulation analyses on the large-scale network of Chicago indicate that these impacts depend on the AV MPR, demand level, and AV dedicated lane implementation approach. Dedicated lanes for AVs are beneficial for a high demand level scenario at all AV MPRs. However, for the base demand scenario, (760,000 vehicles during a.m. peak), deploying such lanes is only justified for low AV MPRs. Furthermore, the impacts of AV dedicated lanes on traffic at the network level are different from those on single segments.
- 21 August 2022
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2677 (3) , 371-388
Assessing the Network-Wide Impacts of Dedicated Lanes for Connected Autonomous Vehicles
Dedicated lanes for autonomous vehicles (AV) are introduced as an effective strategy to improve mobility in mixed traffic of AVs and heterogeneous drivers. However, adding a new lane is costly, and dedicating an existing lane may increase traffic congestion in other lanes. Previous studies investigated the impacts of AV dedicated lanes on throughput at the segment level and/or assumed a fixed route choice. However, AV dedicated lanes change route choice behavior, which affects traffic distribution over the network. Therefore, this study explores the impacts of AV dedicated lanes on the traffic performance of large-scale networks by conducting a network-level cost–benefit analysis on the implementation of AV dedicated lanes under different demand and AV market penetration rate (MPR) scenarios. This study examines the impacts of implementing AV dedicated lanes to freeway links on traffic congestion at corridor and network levels. Various factors are explored: changes in aggregate flow–density relationships, throughput, and average travel times. To this end, DYNASMART-P software is updated to consider AV dedicated lanes and is used to simulate the mixed traffic. Traffic simulation analyses on the large-scale network of Chicago indicate that these impacts depend on the AV MPR, demand level, and AV dedicated lane implementation approach. Dedicated lanes for AVs are beneficial for a high demand level scenario at all AV MPRs. However, for the base demand scenario, (760,000 vehicles during a.m. peak), deploying such lanes is only justified for low AV MPRs. Furthermore, the impacts of AV dedicated lanes on traffic at the network level are different from those on single segments.
- 5 July 2022
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 163, 1-21
Incentive design and profit sharing in multi-modal transportation networks
- 5 July 2022
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 163, 1-21
Incentive design and profit sharing in multi-modal transportation networks
- Open Access
Incentive Design and Profit Sharing in Multi-modal Transportation Network
We consider the situation where multiple transportation service providers cooperate to offer an integrated multi-modal platform to enhance the convenience to the passengers through ease in multi-modal journey planning, payment, and first and last mile connectivity. This market structure allows the multi-modal platform to coordinate profits across modes and also provide incentives to the passengers. Accordingly, in this paper, we use cooperative game theory coupled with the hyperpath-based stochastic user equilibrium framework to study such a market. We assume that the platform sets incentives (price discount or excess charge on passengers) along every edge in the transportation network. We derive the continuity and monotonicity properties of the equilibrium flow with respect to the incentives along every edge. The optimal incentives that maximize the profit of the platform are obtained through a two time-scale stochastic approximation algorithm. We use the asymmetric Nash bargaining solution to design a fair profit sharing scheme among the service providers. We show that the profit for each service provider increases after cooperation on such a platform. Finally, we complement the theoretical results through two numerical simulations.
Open AccessIncentive Design and Profit Sharing in Multi-modal Transportation Network
We consider the situation where multiple transportation service providers cooperate to offer an integrated multi-modal platform to enhance the convenience to the passengers through ease in multi-modal journey planning, payment, and first and last mile connectivity. This market structure allows the multi-modal platform to coordinate profits across modes and also provide incentives to the passengers. Accordingly, in this paper, we use cooperative game theory coupled with the hyperpath-based stochastic user equilibrium framework to study such a market. We assume that the platform sets incentives (price discount or excess charge on passengers) along every edge in the transportation network. We derive the continuity and monotonicity properties of the equilibrium flow with respect to the incentives along every edge. The optimal incentives that maximize the profit of the platform are obtained through a two time-scale stochastic approximation algorithm. We use the asymmetric Nash bargaining solution to design a fair profit sharing scheme among the service providers. We show that the profit for each service provider increases after cooperation on such a platform. Finally, we complement the theoretical results through two numerical simulations.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (2) , 670-681
Fair Pricing of Ridehailing Services With Asymmetric Demand and Travel Time
This article devises a novel fair pricing policy for the on-demand transportation system under asymmetrical demand patterns. We assume that the city comprises multiple nodes with directed edges connecting the nodes. At each node, passengers arrive according to a Poisson distribution. Based on the arrival processes of the passengers and the operational cost of moving a vehicle from one node to another, we devise a fair pricing scheme for the passengers using the Shapley value. We show that at certain nodes, as the arrival rate or the valuation distribution of the passengers increases, the fair pricing policy increases up to a threshold, and then decreases after a different threshold. Our numerical simulations illustrate the theoretical findings.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (2) , 670-681
Fair Pricing of Ridehailing Services With Asymmetric Demand and Travel Time
This article devises a novel fair pricing policy for the on-demand transportation system under asymmetrical demand patterns. We assume that the city comprises multiple nodes with directed edges connecting the nodes. At each node, passengers arrive according to a Poisson distribution. Based on the arrival processes of the passengers and the operational cost of moving a vehicle from one node to another, we devise a fair pricing scheme for the passengers using the Shapley value. We show that at certain nodes, as the arrival rate or the valuation distribution of the passengers increases, the fair pricing policy increases up to a threshold, and then decreases after a different threshold. Our numerical simulations illustrate the theoretical findings.
- 12 July 2021
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2675 (11) , 498-508
Estimation of Path Travel Time Distributions in Stochastic Time-Varying Networks with Correlations
Transportation research has increasingly focused on the modeling of travel time uncertainty in transportation networks. From a user’s perspective, the performance of the network is experienced at the level of a path, and, as such, knowledge of variability of travel times along paths contemplated by the user is necessary. This paper focuses on developing approaches for the estimation of path travel time distributions in stochastic time-varying networks so as to capture generalized correlations between link travel times. Specifically, the goal is to develop methods to estimate path travel time distributions for any path in the networks by synthesizing available trajectory data from various portions of the path, and this paper addresses that problem in a two-fold manner. Firstly, a Monte Carlo simulation (MCS)-based approach is presented for the convolution of time-varying random variables with general correlation structures and distribution shapes. Secondly, a combinatorial data-mining approach is developed, which aims to utilize sparse trajectory data for the estimation of path travel time distributions by implicitly capturing the complex correlation structure in the network travel times. Numerical results indicate that the MCS approach allowing for time-dependence and a time-varying correlation structure outperforms other approaches, and that its performance is robust with respect to different path travel time distributions. Additionally, using the path segmentations from the segment search approach with a MCS approach with time-dependence also produces accurate and robust estimates of the path travel time distributions with the added benefit of shorter computation times.
- 12 July 2021
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2675 (11) , 498-508
Estimation of Path Travel Time Distributions in Stochastic Time-Varying Networks with Correlations
Transportation research has increasingly focused on the modeling of travel time uncertainty in transportation networks. From a user’s perspective, the performance of the network is experienced at the level of a path, and, as such, knowledge of variability of travel times along paths contemplated by the user is necessary. This paper focuses on developing approaches for the estimation of path travel time distributions in stochastic time-varying networks so as to capture generalized correlations between link travel times. Specifically, the goal is to develop methods to estimate path travel time distributions for any path in the networks by synthesizing available trajectory data from various portions of the path, and this paper addresses that problem in a two-fold manner. Firstly, a Monte Carlo simulation (MCS)-based approach is presented for the convolution of time-varying random variables with general correlation structures and distribution shapes. Secondly, a combinatorial data-mining approach is developed, which aims to utilize sparse trajectory data for the estimation of path travel time distributions by implicitly capturing the complex correlation structure in the network travel times. Numerical results indicate that the MCS approach allowing for time-dependence and a time-varying correlation structure outperforms other approaches, and that its performance is robust with respect to different path travel time distributions. Additionally, using the path segmentations from the segment search approach with a MCS approach with time-dependence also produces accurate and robust estimates of the path travel time distributions with the added benefit of shorter computation times.