相关论文: The lonely runner with seven runners

We address the problem of tracking and detecting interactions between the different groups of runners that form during a race. In athletic races control points are set to monitor the progress of athletes over the course. Intuitively, a {\it…

A planar herding problem is considered, where a superior pursuer herds a flock of non-cooperative, inferior evaders around a predefined target point. An inverse square law of repulsion is assumed between the pursuer and each evader. Two…

We study a simple motion differential game of many pursuers and one evader in the plane. We give a nonempty closed convex set in the plane, and the pursuers and evader move on this set. They cannot leave this set during the game. Control…

We consider the model of the one-dimensional cookie random walk when the initial cookie distribution is spatially uniform and the number of cookies per site is finite. We give a criterion to decide whether the limiting speed of the walk is…

Multiple people tracking is a key problem for many applications such as surveillance, animation or car navigation, and a key input for tasks such as activity recognition. In crowded environments occlusions and false detections are common,…

An analysis of marathon pacing and elevation change is presented. It is based on an empirical observation of how the pace of elite and non-elite marathon runners change over the course of the marathon and a simple approximation of the…

We examine the problem of gathering $k \geq 2$ agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected ($1$-interval connectivity) [KLO10]. The agents are identical and…

Writing concurrent programs is notoriously hard due to scheduling non-determinism. The most common concurrency bugs are data races, which are accesses to a shared resource that can be executed concurrently. Dynamic data-race prediction is…

An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive…

Consider two entities with constant but not necessarily equal velocities, moving on two given piece-wise linear trajectories inside a simple polygon $P$. The Trajectory Range Visibility problem deals with determining the sub-trajectories on…

In this work the results of a bottleneck experiment with pedestrians are presented in the form of total times, fluxes, specific fluxes, and time gaps. A main aim was to find the dependence of these values from the bottleneck width. The…

A path partition (also referred to as a linear forest) of a graph $G$ is a set of vertex-disjoint paths which together contain all the vertices of $G$. An isolated vertex is considered to be a path in this case. The path partition…

We consider a random walk in the plane which takes steps uniformly distributed on the unit circle centered around the walker's current position but avoids the convex hull of its past positions. This model has been introduced by Angel,…

We study the vertex pursuit game of \emph{Cops and Robbers}, in which cops try to capture a robber on the vertices of the graph. The minimum number of cops required to win on a given graph $G$ is called the cop number of $G$. We focus on…

Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph's edges with perfect information about each…

We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…

We study an optimization problem that arises in the design of covering strategies for multi-robot systems. Consider a team of $n$ cooperating robots traveling along predetermined closed and disjoint trajectories. Each robot needs to…

An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy models for prime walks to predict the long-time…

The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…

We prove that there is a matching between 2 intervals of positive integers of the same even length, with corresponding pairs coprime, provided the intervals are in $[n]$ and their lengths are $>c(\log n)^2$, for a positive constant $c$.…