Mojtaba Abdolmaleki

• Researcher at University of Michigan

This paper investigates intersection control in a fully connected and automated vehicles (CAV) environment, which aims to coordinate in real-time conflicting traffic movements under safety and kinodynamic constraints to maximize intersection throughput or minimize traffic delay. Given the problem’s NP-hardness, we leverage graph coloring to devise...

Verifying the provenance of content is crucial to the function of many organizations, e.g., educational institutions, social media platforms, firms, etc. This problem is becoming increasingly challenging as text generated by Large Language Models (LLMs) becomes almost indistinguishable from human-generated content. In addition, many institutions ut...

A cooperative truck platoon is a set of virtually linked trucks driving with a small intra-vehicle headway enabled by connected and automated vehicle technologies. One of the primary benefits of truck platooning is energy savings due to the reduction of aerodynamic drag on the platooned vehicles. The focus of this paper is on scheduling travel itin...

Truck platooning enabled by connected automated vehicle (CAV) technology has been demonstrated to effectively reduce fuel consumption for trucks in a platoon. However, given the limited number of trucks in the traffic stream, it remains questionable how great an energy saving it may yield for a practical freight system if we only rely on ad-hoc pla...

The problem of dispatching shuttles to serve trip requests can be mathematically formulated as a dial-a-ride problem (DARP). With on-demand mobility services gaining more popularity due to the recent developments in gig economy, communication technologies, and urbanization, the real-time application of DARP is attracting ever more interest. However...

The problem of dispatching shuttles to serve trip requests can be mathematically formulated as a dial-a-ride problem (DARP). With on-demand mobility services gaining more popularity due to the recent developments in the gig economy, communication technologies, and urbanization, the real-time application of DARP is attracting ever more interest. How...

In this paper, we study the Minimum Weight Pairwise Distance Preservers (MWPDP) problem. Consider a positively weighted undirected/directed connected graph $G = (V, E, c)$ and a subset $P$ of pairs of vertices, also called demand pairs. A subgraph $G'$ is a distance preserver with respect to $P$ if and only if every pair $(u, w) \in P$ satisfies $d...

This paper aims to synchronize timetables in a transit network so as to minimize the total passenger transfer waiting time. Assuming a fixed headway for each line, we first formulate the problem as an optimization problem with congruence constraints. We show that the problem is NP-hard, and investigate several special cases of the problem that are...

The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph $K_{r,s,t}$ into 5-cycles was first considered by E.S. Mahmoodian and Maryam Mirzakhani (1995). They stated some necessary conditions and conjectured that those conditions are also sufficient. Since then, many cases of the problem have been solved by...

To date, three major hurdles have hindered widespread adoption of electric vehicles (EVs): the high cost of batteries, insufficient public charging infrastructure, and the limited driving range of EVs. This study overcomes these three hurdles by introducing a new concept of vehicle-to-vehicle wireless power transfer (V2V WPT) between EVs to facilit...

A cooperative truck platoon is a set of virtually linked trucks driving with a small intra-vehicle gap enabled by connected and automated vehicle technologies. One of the primary benefits of truck platooning is energy savings due to the reduction of aerodynamic drag on the platooned vehicles. The focus of this paper is on scheduling travel itinerar...

A graph $G$ is called uniquely k-list colorable (U$k$LC) if there exists a list of colors on its vertices, say $L=\lbrace S_v \mid v \in V(G) \rbrace $, each of size $k$, such that there is a unique proper list coloring of $G$ from this list of colors. A graph $G$ is said to have property $M(k)$ if it is not uniquely $k$-list colorable. Mahmoodian...

A graph $G$ is called uniquely k-list colorable (U$k$LC) if there exists a list of colors on its vertices, say $L=\lbrace S_v \mid v \in V(G) \rbrace $, each of size $k$, such that there is a unique proper list coloring of $G$ from this list of colors. A graph $G$ is said to have property $M(k)$ if it is not uniquely $k$-list colorable. Mahmoodian...