activity
20112026
most citedArtificial Intelligence for Social Good

68 citations · 131 across the 10 of their papers we have counts for

collaborators

10 papers

cs.RO2026

Lifelong Scalable Multi-Agent Realistic Testbed and A Comprehensive Study on Design Choices in Lifelong AGV Fleet Management Systems

Jingtian Yan, Yulun Zhang, Zhenting Liu +5

We present Lifelong Scalable Multi-Agent Realistic Testbed (LSMART), an open-source simulator to evaluate any Multi-Agent Path Finding (MAPF) algorithm in a Fleet Management System…

cs.AI2022★ 1 cited

Connection-Based Scheduling for Real-Time Intersection Control

Hsu-Chieh Hu, Joseph Zhou, Gregory J. Barlow +1

We introduce a heuristic scheduling algorithm for real-time adaptive traffic signal control to reduce traffic congestion. This algorithm adopts a lane-based model that estimates th…

cs.RO2019★ 1 cited

Cooperative Schedule-Driven Intersection Control with Connected and Autonomous Vehicles

Hsu-Chieh Hu, Stephen F. Smith, Rick Goldstein

Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to improve the efficiency of traffic flow in complex urban road networks. In this approac…

cs.AI2019★ 2 cited

Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control

Hsu-Chieh Hu, Stephen F. Smith

Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to improve the efficiency of traffic flow in complex urban road networks. In this approac…

cs.AI2019★ 3 cited

Coping with Large Traffic Volumes in Schedule-Driven Traffic Signal Control

Hsu-Chieh Hu, Stephen F. Smith

Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to significantly improve traffic flow efficiency in complex urban road networks. However,…

cs.NI2019★ 1 cited

Softpressure: A Schedule-Driven Backpressure Algorithm for Coping with Network Congestion

Hsu-Chieh Hu, Stephen F. Smith

We consider the problem of minimizing the delay of jobs moving through a directed graph of service nodes. In this problem, each node may have several links and is constrained to se…