Related papers: Constant Delay Lattice Train Schedules
Lattice-linear systems allow nodes to execute asynchronously. We introduce eventually lattice-linear algorithms, where lattices are induced only among the states in a subset of the state space. The algorithm guarantees that the system…
This paper proposes an adaptive lattice-based motion planning solution to address the problem of generating feasible trajectories for systems, represented by a linearly parameterizable non-linear model operating within a cluttered…
An exact solution for a high speed deterministic traffic model with open boundaries and synchronous update rule is presented. Because of the strong correlations in the model, the qualitative structure of the stationary state can be…
In this paper, we consider a dynamic equilibrium transportation problem. There is a fixed number of cars moving from origin to destination areas. Preferences for arrival times are expressed as a cost of arriving before or after the…
F.-H. Lin studied minimal graphs of the Dirichlet problem in the hyperbolic space and proved that any such minimal graph has the same global regularity as the boundary if the dimension of the minimal graph is even and that there is an…
Exact mean field equations are derived analytically to give the fundamental diagrams, i.e., the average speed - car density relations, for the Fukui-Ishibashi one-dimensional traffic flow cellular automaton model of high speed vehicles…
This paper continues the study of [11, 13] for stationary solutions of stochastic linear retarded functional differential equations with the emphasis on delays which appear in those terms including spatial partial derivatives. As a…
We consider optimal transport problems where the cost is optimized over controlled dynamics and the end time is free. Unlike the classical setting, the search for optimal transport plans also requires the identification of optimal "stopping…
Practical deployments of coordinated fleets of mobile robots in different environments have revealed the benefits of maintaining small distances between robots, especially as they move at higher speeds. However, this is counter-intuitive in…
This paper studies optimal control and stabilization problems for continuous-time mean-field systems with input delay, which are the fundamental development of control and stabilization problems for mean-field systems. There are two main…
We consider the broad problem of analyzing safety properties of asynchronous concurrent programs under arbitrary thread interleavings. Delay-bounded deterministic scheduling, introduced in prior work, is an efficient bug-finding technique…
The characteristic equation for a linear delay differential equation (DDE) has countably infinite roots on the complex plane. This paper considers linear DDEs that are on the verge of instability, i.e. a pair of roots of the characteristic…
Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicate} representing such problems is that it induces…
Reachability questions are one of the most fundamental algorithmic primitives in temporal graphs -- graphs whose edge set changes over discrete time steps. A core problem here is the NP-hard Short Restless Temporal Path: given a temporal…
Motivated by a real problem in steel production, we introduce and analyze a general class of singularly perturbed linear hybrid systems with both switches and impulses, in which the slow or fast nature of the variables can be…
The difference between the speed of the actions of different processes is typically considered as an obstacle that makes the achievement of cooperative goals more difficult. In this work, we aim to highlight potential benefits of such…
We study real-time routing policies in smart transit systems, where the platform has a combination of cars and high-capacity vehicles (e.g., buses or shuttles) and seeks to serve a set of incoming trip requests. The platform can use its…
Setting traffic light signals is a classical topic in traffic engineering, and important in heavy-traffic conditions when green times become scarce and longer queues are inevitably formed. For the fixed-cycle traffic-light queue, an…
Modern networks exhibit a high degree of variability in link rates. Cellular network bandwidth inherently varies with receiver motion and orientation, while class-based packet scheduling in datacenter and service provider networks induces…
The Regge Calculus approximates a continuous manifold by a simplicial lattice, keeping the connectivities of the underlying lattice fixed and taking the edge lengths as degrees of freedom. The Discrete Regge model employed in this work…