Change detection (CD) in time series data is a critical problem as it reveal changes in the underlying generative processes driving the time series. Despite having received significant attention, one important unexplored aspect is how to efficiently utilize additional correlated information to improve the detection and the understanding of changepoints. We propose hierarchical quickest change d...

Reflexive responses are often in direct competition with voluntary control. We test two opposing explanations for how this competition is resolved with respect to eye movements. One states that the quickest activation wins. The other states that the strongest activation wins. We show that an eye movement is executed according to the strongest activation, with the competition being staged at a c...

Consider the motion of a Brownian particle that initially takes place in a twodimensional plane and then after some random/unobservable time continues in the three-dimensional space. Given that only the distance of the particle to the origin is being observed, the problem is to detect the time at which the particle departs from the plane as accurately as possible. We solve this problem in the m...

The problem of quickest detection of an anomalous process among M processes is considered. At each time, a subset of the processes can be observed, and the observations from each chosen process follow two different distributions, depending on whether the process is normal or abnormal. The objective is a sequential search strategy that minimizes the expected detection time subject to an error pr...

We introduce and solve the problem of Byzantine fault tolerant distributed quickest change detection in both continuous and discrete time setups. In this problem, multiple sensors sequentially observe random signals from the environment and send their observations to a control center that will determine whether there is a change in the statistical behavior of the observations. An unknown subset...

Let s be a point in a polygonal domain P of h−1 holes and n vertices. We consider the following quickest visibility query problem. Given a query point q in P, the goal is to find a shortest path in P to move from s to see q as quickly as possible. Previously, Arkin et al. (SoCG 2015) built a data structure of size O(n22α(n) logn) that can answer each query in O(K log2 n) time, where α(n) is the...

This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions an...

Abstract: We study Bayesian quickest detection problems with sensor arrays. An underlying signal is assumed to gradually propagate through a network of several sensors, triggering a cascade of inter-dependent change-points. The aim of the decision-maker is to centrally fuse all available information to find an optimal detection rule that minimizes Bayes risk. We develop a tractable continuous-t...

A method to detect and isolate power system transmission line outages in near real-time is proposed. In particular, a linearized power system model is presented and a statistical model for line outage detection and isolation is developed using this model. To detect and isolate the line outage quickly, algorithms based on statistical quickest change detection are employed.