Yaobin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yaobin Chen has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Stanley Chien
Elmore Family School of Electrical and Computer Engineering, Purdue University, Indianapolis, Indiana, USA
5 shared publications Jue Zhou
Purdue University
4 shared publications- Lingxi Li
Elmore Family School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA
4 shared publications - Abin Mathew
Purdue University
3 shared publications - Bojan Mohar
Department of Mathematics Simon Fraser University Burnaby British Columbia Canada
3 shared publications - Hehui Wu
Shanghai Center for Mathematical Sciences Fudan University 200438 Shanghai China
3 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Electrification Magazine
- Vol. 14 (3) , 2-130
The Future of Integrated Bidirectional Energy and Transport Systems [From the Editor]
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Electrification Magazine
- Vol. 14 (3) , 2-130
The Future of Integrated Bidirectional Energy and Transport Systems [From the Editor]
- Open Access
Note on the trace of random walks on pseudorandom graphs
We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,λ)$-graph $G$ with $d/λ\ge C$ is at most $(1+\varepsilon)n\log n$, meaning the expected number of steps needed to reach all vertices at least once is at most $(1+\varepsilon)n\log n$ regardless of the starting vertex. Furthermore, we prove that with high probability, the trace of a random walk of length $(1+\varepsilon)n\log n$ on $G$ is Hamiltonian, regardless of the starting vertex. These results also hold for random $d$-regular graphs with sufficiently large $d$. These findings answer two questions proposed by Frieze, Krivelevich, Michaeli, and Peled [PLMS, 2018]. Notably, our results imply a bound on a stronger version of the cover time: with high probability, all vertices are covered after $(1+\varepsilon)n\log n$ steps, regardless of the starting vertex. Our proofs rely on the spectral properties of the adjacency matrix and the graph expansion. All results are asymptotically optimal.Open AccessNote on the trace of random walks on pseudorandom graphs
We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,λ)$-graph $G$ with $d/λ\ge C$ is at most $(1+\varepsilon)n\log n$, meaning the expected number of steps needed to reach all vertices at least once is at most $(1+\varepsilon)n\log n$ regardless of the starting vertex. Furthermore, we prove that with high probability, the trace of a random walk of length $(1+\varepsilon)n\log n$ on $G$ is Hamiltonian, regardless of the starting vertex. These results also hold for random $d$-regular graphs with sufficiently large $d$. These findings answer two questions proposed by Frieze, Krivelevich, Michaeli, and Peled [PLMS, 2018]. Notably, our results imply a bound on a stronger version of the cover time: with high probability, all vertices are covered after $(1+\varepsilon)n\log n$ steps, regardless of the starting vertex. Our proofs rely on the spectral properties of the adjacency matrix and the graph expansion. All results are asymptotically optimal. - 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Electrification Magazine
- Vol. 13 (4) , 2-5
Technology Innovation From Intelligent, Interconnected Transportation and Electric Grid Technology to Electrified Roadways With Dynamic Wireless Power Transfer [From the Editor]
Happy holidays to our readers and authors! We are excited to publish the last issue of IEEE Electrification Magazine for 2025. This issue continues to highlight recent advances and innovations in electrified transportation from intelligent, interconnected transportation and power grids to emerging dynamic wireless power transfer and fuel cell hybrid vehicle technology. I truly hope you enjoy reading all the articles in this issue.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Electrification Magazine
- Vol. 13 (4) , 2-5
Technology Innovation From Intelligent, Interconnected Transportation and Electric Grid Technology to Electrified Roadways With Dynamic Wireless Power Transfer [From the Editor]
Happy holidays to our readers and authors! We are excited to publish the last issue of IEEE Electrification Magazine for 2025. This issue continues to highlight recent advances and innovations in electrified transportation from intelligent, interconnected transportation and power grids to emerging dynamic wireless power transfer and fuel cell hybrid vehicle technology. I truly hope you enjoy reading all the articles in this issue.
- 1 January 2026
- Published by Purdue University Press
Vehicle Moving Pattern Analysis of Road Merge and Split Weaving Areas Involving Highway and Local Streets
The origin–destination (OD) proportions of vehicles related to highway weaving between entry ramp and next exit ramps are difficult to measure with conventional point detectors. Manual counting from videos is labor intensive and does not scale. This project developed an automated, camera-based system that measures OD proportions directly from existing interchange surveillance video, allowing the Indiana Department of Transportation (INDOT) to quantify the proportion of vehicles from local streets to highway ramps, and vice versa. The system reconstructs each vehicle’s full path through intersections in two stages. First, it detects and tracks every vehicle within each camera’s field of view using a deep-learning object detector coupled with a multiobject tracker and frame stabilization. Second, it reidentifies the same vehicle traveling from upstream to downstream intersections in their corresponding recorded camera videos by comparing learned appearance embeddings, constrained by realistic vehicle travel-time windows and travel direction, so that only plausible matches are considered. Because automated cross-camera matching can produce false matches between similar-looking vehicles, the system incorporates a web-based, human-in-the-loop verification step in which an analyst confirms or rejects candidate matches before results are finalized. From the verified matches, the system computes OD proportions and presents them in a user-friendly report with Sankey diagrams that visualize the traffic flow for all vehicles. A companion ground-truth annotation tool lets analysts generate manual counts and matches that are used to measure system accuracy. The results show that the approach reconstructs weaving OD proportions with accuracy suitable for planning and safety analysis while substantially reducing manual effort.
- 1 January 2026
- Published by Purdue University Press
Vehicle Moving Pattern Analysis of Road Merge and Split Weaving Areas Involving Highway and Local Streets
The origin–destination (OD) proportions of vehicles related to highway weaving between entry ramp and next exit ramps are difficult to measure with conventional point detectors. Manual counting from videos is labor intensive and does not scale. This project developed an automated, camera-based system that measures OD proportions directly from existing interchange surveillance video, allowing the Indiana Department of Transportation (INDOT) to quantify the proportion of vehicles from local streets to highway ramps, and vice versa. The system reconstructs each vehicle’s full path through intersections in two stages. First, it detects and tracks every vehicle within each camera’s field of view using a deep-learning object detector coupled with a multiobject tracker and frame stabilization. Second, it reidentifies the same vehicle traveling from upstream to downstream intersections in their corresponding recorded camera videos by comparing learned appearance embeddings, constrained by realistic vehicle travel-time windows and travel direction, so that only plausible matches are considered. Because automated cross-camera matching can produce false matches between similar-looking vehicles, the system incorporates a web-based, human-in-the-loop verification step in which an analyst confirms or rejects candidate matches before results are finalized. From the verified matches, the system computes OD proportions and presents them in a user-friendly report with Sankey diagrams that visualize the traffic flow for all vehicles. A companion ground-truth annotation tool lets analysts generate manual counts and matches that are used to measure system accuracy. The results show that the approach reconstructs weaving OD proportions with accuracy suitable for planning and safety analysis while substantially reducing manual effort.
- 1 January 2026
- Published by Purdue University Press
RampCast Phase II: Connected Vehicles Traffic Management Application on Indiana Highways
This project advances connected vehicle applications by developing and testing an enhanced RampCast system, a comprehensive traffic management system using C-V2X technology for Indiana highways. The system features a dual-mode architecture integrating both short-range (PC5) and long-range cellular (Uu) Cellular Vehicle-to-Everything (C-V2X) communication pathways, utilizing commercial-grade Cohda MK6 hardware and adhering to SAE J2735 standards to ensure interoperability. A key innovation is the integration of an AI-based prioritization framework, which leverages a large language model to enhance the contextual relevance of traffic messages. This AI system introduces two intelligent agents: one to dynamically estimate the appropriate display distance for an event based on its severity, and another to prioritize the order of messages based on urgency and potential driver impact. Field tests conducted on I-65 and I-70 in Indianapolis validated the system’s hybrid design. Results confirmed that the PC5 link provides very low latency (around 25 ms), ideal for time-critical alerts, while the Uu link ensures highly reliable coverage in complex environments, albeit with higher latency (around 45 ms). The AI framework was successfully shown to reorder and present messages based on real-time context, improving the clarity and usefulness of information provided to the driver. These findings support a hybrid C-V2X architecture as a robust model for future smart highway deployments.
- 1 January 2026
- Published by Purdue University Press
RampCast Phase II: Connected Vehicles Traffic Management Application on Indiana Highways
This project advances connected vehicle applications by developing and testing an enhanced RampCast system, a comprehensive traffic management system using C-V2X technology for Indiana highways. The system features a dual-mode architecture integrating both short-range (PC5) and long-range cellular (Uu) Cellular Vehicle-to-Everything (C-V2X) communication pathways, utilizing commercial-grade Cohda MK6 hardware and adhering to SAE J2735 standards to ensure interoperability. A key innovation is the integration of an AI-based prioritization framework, which leverages a large language model to enhance the contextual relevance of traffic messages. This AI system introduces two intelligent agents: one to dynamically estimate the appropriate display distance for an event based on its severity, and another to prioritize the order of messages based on urgency and potential driver impact. Field tests conducted on I-65 and I-70 in Indianapolis validated the system’s hybrid design. Results confirmed that the PC5 link provides very low latency (around 25 ms), ideal for time-critical alerts, while the Uu link ensures highly reliable coverage in complex environments, albeit with higher latency (around 45 ms). The AI framework was successfully shown to reorder and present messages based on real-time context, improving the clarity and usefulness of information provided to the driver. These findings support a hybrid C-V2X architecture as a robust model for future smart highway deployments.
- 1 January 2026
- Published by Purdue University Press
Feasibility Study on the Development of Indiana’s Connected and Automated Vehicle Roadmap and Strategic Plan
This study provides INDOT with critical insights into major OEMs’ connected and autonomous vehicle (CAV) development plans and related research and demonstration activities in several surrounding states, guiding infrastructure investment and policy decisions. The report delivers three outputs that guide the CAV technologies implementation in Indiana. First, it synthesizes the best regional practices and industry direction to distinguish what is feasible now from what requires further development. Second, it establishes a technical baseline that links priority applications to sensing and communications architectures with explicit attention to interoperability, security, and maintainability. Third, it defines an implementation framework that connects capital and operating investments to organizational capabilities, funding sources, and measurable outcomes for safety and mobility. Together, these outputs provide a basis for deciding where to pilot, where to scale, and how to manage assets and data over time. By understanding technological roadmaps, INDOT can strategically position Indiana, ensuring it aligns with industry advancements, enhancing road safety and traffic efficiency, and facilitating seamless integration of CAVs on its transportation network in the near future.
- 1 January 2026
- Published by Purdue University Press
Feasibility Study on the Development of Indiana’s Connected and Automated Vehicle Roadmap and Strategic Plan
This study provides INDOT with critical insights into major OEMs’ connected and autonomous vehicle (CAV) development plans and related research and demonstration activities in several surrounding states, guiding infrastructure investment and policy decisions. The report delivers three outputs that guide the CAV technologies implementation in Indiana. First, it synthesizes the best regional practices and industry direction to distinguish what is feasible now from what requires further development. Second, it establishes a technical baseline that links priority applications to sensing and communications architectures with explicit attention to interoperability, security, and maintainability. Third, it defines an implementation framework that connects capital and operating investments to organizational capabilities, funding sources, and measurable outcomes for safety and mobility. Together, these outputs provide a basis for deciding where to pilot, where to scale, and how to manage assets and data over time. By understanding technological roadmaps, INDOT can strategically position Indiana, ensuring it aligns with industry advancements, enhancing road safety and traffic efficiency, and facilitating seamless integration of CAVs on its transportation network in the near future.
- Top Cited Papers
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 114 (4) , 1-36
LLM4AD: Large Language Models for Autonomous Driving—Concept, Review, Benchmark, Experiments, and Future Trends
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 114 (4) , 1-36
Top Cited PapersLLM4AD: Large Language Models for Autonomous Driving—Concept, Review, Benchmark, Experiments, and Future Trends
- Open Access
Robustness for expander graphs
We study robust versions of properties of $(n,d,λ)$-graphs, namely, the property of a random sparsification of an $(n,d,λ)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the containment problem of perfect matchings, Hamiltonian cycles, and triangle factors. These results address a series of problems posed by Frieze and Krivelevich. First we prove that given $γ>0$, for sufficient large $n$, any $(n,d,λ)$-graph $G$ with $λ=o(d)$, $d=Ω(\log n)$ and $p\ge\frac{(1+γ)\log n}{d}$, $G\cap G(n,p)$ contains a Hamiltonian cycle (and thus a perfect matching if $n$ is even) with high probability. This result is asymptotically optimal. Moreover, we show that for sufficient large $n$, any $(n,d,λ)$-graph $G$ with $λ=o(\frac{d^2}{n})$, $d=Ω(n^{\frac{5}{6}}\log^{\frac{1}{2}}n)$ and $p\gg d^{-1}n^{\frac{1}{3}}\log^{\frac{1}{3}} n$, $G\cap G(n,p)$ contains a triangle factor with high probability. Here, the restrictions on $p$ and $λ$ are asymptotically optimal. Our proof for the triangle factor problem uses the iterative absorption approach to build a spread measure on the triangle factors, and we also prove and use a coupling result for triangles in the random subgraph of an expander $G$ and the hyperedges in the random subgraph of the triangle-hypergraph of $G$.Open AccessRobustness for expander graphs
We study robust versions of properties of $(n,d,λ)$-graphs, namely, the property of a random sparsification of an $(n,d,λ)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the containment problem of perfect matchings, Hamiltonian cycles, and triangle factors. These results address a series of problems posed by Frieze and Krivelevich. First we prove that given $γ>0$, for sufficient large $n$, any $(n,d,λ)$-graph $G$ with $λ=o(d)$, $d=Ω(\log n)$ and $p\ge\frac{(1+γ)\log n}{d}$, $G\cap G(n,p)$ contains a Hamiltonian cycle (and thus a perfect matching if $n$ is even) with high probability. This result is asymptotically optimal. Moreover, we show that for sufficient large $n$, any $(n,d,λ)$-graph $G$ with $λ=o(\frac{d^2}{n})$, $d=Ω(n^{\frac{5}{6}}\log^{\frac{1}{2}}n)$ and $p\gg d^{-1}n^{\frac{1}{3}}\log^{\frac{1}{3}} n$, $G\cap G(n,p)$ contains a triangle factor with high probability. Here, the restrictions on $p$ and $λ$ are asymptotically optimal. Our proof for the triangle factor problem uses the iterative absorption approach to build a spread measure on the triangle factors, and we also prove and use a coupling result for triangles in the random subgraph of an expander $G$ and the hyperedges in the random subgraph of the triangle-hypergraph of $G$.