Related papers: Constant Delay Lattice Train Schedules
We derive an analytic formula for the lateral dynamics of solitons in a general inhomogeneous nonlinear media, and show that it can be valid over tens of diffraction lengths. In particular, we show that solitons centered at a lattice…
We study a fundamental problem called Minimum Length Link Scheduling (MLLS) which is crucial to the efficient operations of wireless networks. Given a set of communication links of arbitrary length spread and assume each link has one unit…
Supersymmetry plays prominent roles in the study of quantum field theory and in many proposals for potential new physics beyond the standard model. Lattice field theory provides a non-perturbative regularization suitable for strongly…
Bus bunching and unevenly dispersed buses along a bus line lead to a low service level and deteriorate the operational stability of the bus line. Speed adjustment as a control means has been proposed to solve the above problem. But due to…
We determine the nonlinear time-dependent response of a tracer on a lattice with randomly distributed hard obstacles as a force is switched on. The calculation is exact to first order in the obstacle density and holds for arbitrarily large…
The presence of (partially) automated vehicles on the roads presents an opportunity to compensate the unstable behaviour of conventional vehicles. Vehicles subject to perturbations should (i) recover their equilibrium speed, (ii) react not…
We consider the regularity of stationary solutions to the linearized Boltzmann equations in bounded $C^1$ convex domains in $\mathbb{R}^3$ for gases with cutoff hard potential and cutoff Maxwellian gases. We prove that the stationary…
In this paper we present a method for automatically planning robust optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition…
In this paper we study the problem of convergence and generalization error bound of stochastic momentum for deep learning from the perspective of regularization. To do so, we first interpret momentum as solving an $\ell_2$-regularized…
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can…
We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its…
A metro-line crossing minimization problem is to draw multiple lines on an underlying graph that models stations and rail tracks so that the number of crossings of lines becomes minimum. It has several variations by adding restrictions on…
This paper proposes a robust lattice-based motion-planning algorithm for nonlinear systems affected by a bounded disturbance. The proposed motion planner utilizes the nominal disturbance-free system model to generate motion primitives,…
India runs the fourth largest railway transport network size carrying over 8 billion passengers per year. However, the travel experience of passengers is frequently marked by delays, i.e., late arrival of trains at stations, causing…
Given $N$ instances $(X_1,t_1),\ldots,(X_N,t_N)$ of Subset Sum, the AND Subset Sum problem asks to determine whether all of these instances are yes-instances; that is, whether each set of integers $X_i$ has a subset that sums up to the…
We study a class of mass transport models where mass is transported in a preferred direction around a one-dimensional periodic lattice and is globally conserved. The model encompasses both discrete and continuous masses and parallel and…
We demonstrate that in Optimal Velocity Model (OVM) delay times of vehicles coming from the dynamical equation of motion of OVM almost explain the order of delay times observed in actual traffic flows without introducing explicit delay…
We present in this article traffic flow and control models for the train dynamics in metro lines. The first model, written in the max-plus algebra, takes into account minimum running, dwell and safety time constraints, without any control…
We consider a graph theoretic approach to the performance and robustness of a platoon of vehicles, where each vehicle communicates with its $k$-nearest neighbors. In particular, we quantify the platoon's stability margin, robustness to…
We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traffic pattern, delay bound, timely-throughput requirement, and…