Related papers: A Skorokhod Map on Measure-Valued Paths with Appli…
This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning…
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in…
We present a new partially linearized mapping-based approach for approximating real-time quantum correlation functions in condensed-phase nonadiabatic systems, called spin-PLDM. Within a classical trajectory picture, partially linearized…
This paper leverages macroscopic models and multi-source spatiotemporal data collected from automatic traffic counters and probe vehicles to accurately estimate traffic flow and travel time in links where these measurements are unavailable.…
We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis…
This paper extends previous work by the authors. We consider the local time process of a strong Markov process, add negative drift, and reflect it \`a la Skorokhod. The resulting process is used to model a fluid queue. We derive an…
In this paper, we consider a modified version of the control problem in a model free Markov decision process (MDP) setting with large state and action spaces. The control problem most commonly addressed in the contemporary literature is to…
Motivated by many practical applications in logistics and mobility-as-a-service, we study the top-k optimal sequenced routes (KOSR) querying on large, general graphs where the edge weights may not satisfy the triangle inequality, e.g., road…
Quantum algorithms need to be compiled to respect the constraints imposed by quantum processors, which is known as the mapping problem. The mapping procedure will result in an increase of the number of gates and of the circuit latency,…
An efficient algorithm to solve the $k$ shortest non-homotopic path planning ($k$-SNPP) problem in a 2D environment is proposed in this paper. Motivated by accelerating the inefficient exploration of the homotopy-augmented space of the 2D…
This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the…
With the increasing size of datasets and demand for real time response for interactive applications, improving runtime for algorithms with excessive computational requirements has become increasingly important. Many different algorithms…
In this article, we derive a Stratonovich and Skorohod type change of variables formula for a multidimensional Gaussian process with low H\"older regularity (typically lower than 1/4). To this aim, we combine tools from rough paths theory…
To describe non-equilibrium transport processes in a quantum device with infinite baths, we propose to formulate the problems as a reduced-order problem. Starting with the Liouville-von Neumann equation for the density-matrix, the…
3D Scene Graphs integrate both metric and semantic information, yet their structure remains underutilized for improving path planning efficiency and interpretability. In this work, we present S-Path, a situationally-aware path planner that…
In queueing systems, effective scheduling algorithms are essential for optimizing performance. Optimal scheduling for the M/G/k queue has been explored in the heavy traffic limit, but much remains unknown in the intermediate load regime. In…
The map-matching is an essential preprocessing step for most of the trajectory-based applications. Although it has been an active topic for more than two decades and, driven by the emerging applications, is still under development. There is…
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 serve one link at a time. As jobs move through the network,…
The Birkhoff Ergodic Theorem asserts under mild conditions that Birkhoff averages (i.e. time averages computed along a trajectory) converge to the space average. For sufficiently smooth systems, our small modification of numerical Birkhoff…
The linear transport equation allows to advect level-set functions to represent moving sharp interfaces in multiphase flows as zero level-sets. A recent development in computational fluid dynamics is to modify the linear transport equation…