Table 1.

Summary of Key Notations.

Symbol	Description
$\mathcal{V}$	Set of all vehicles in the system.
$\mathcal{R}$	Set of all roadside units.
${\mathcal{G}}_{\mathcal{t}}$	The attributed graph representing the network state at time $\mathcal{t}$.
${\mathcal{N}}_{\mathcal{t}}$	Set of all nodes at time $\mathcal{t}$.
${\mathcal{E}}_{\mathcal{t}}$	Set of all communication links at time $\mathcal{t}$.
${\mathcal{X}}_{\mathcal{t}},{\mathbf{E}}_{\mathcal{t}}$	Node and edge attribute matrices.
${\mathcal{T}}_{\mathcal{i}}$	The $\mathcal{i}$-th computational task.
${\mathcal{d}}_{\mathcal{i}}$	Data size of task ${\mathcal{T}}_{\mathcal{i}}$(in KB).
${\mathcal{c}}_{\mathcal{i}}$	Computational complexity of task ${\mathcal{T}}_{\mathcal{i}}$ (in giga-cycles).
$A_{\mathcal{i}}$	The joint action taken for task ${\mathcal{T}}_{\mathcal{i}}$.
${\mathcal{K}}_{\mathcal{i}}$	Discrete offloading destination for task ${\mathcal{T}}_{\mathcal{i}}$.
${\lambda }_{\mathcal{i}}$	Continuous offloading ratio for task ${\mathcal{T}}_{\mathcal{i}}$.
${\alpha }_{\mathcal{i}}$	Continuous computational resource allocation ratio for task ${\mathcal{T}}_{\mathcal{i}}$.
${\mathcal{L}}_{local}$	Latency for local computation.
${\mathcal{L}}_{edge}$	Latency for computation on an edge server.
${\mathcal{L}}_{v2r}$, ${\mathcal{L}}_{r2r}$	Communication latency over a V2R or R2R link.
${\mathcal{L}}_{\mathcal{i}}^{total}$	Total end-to-end completion latency for a task.
${\mathcal{L}}_{avg}$, ${\mathcal{C}}_{cong}$	Average task latency and average R2R link congestion.
$\mathcal{J}\left(\mathbf{X}\right)$	The multi-objective function to be minimized.