Related papers: On the Separability of Targets Using Binary Proxim…
Two important ingredients necessary for obtaining Bell nonlocal correlations between two spatially separated parties are an entangled state shared between them and an incompatible set of measurements employed by each of them. We focus on…
The problem of distributed control and estimation for multi-agent systems with limited sensing capabilities is a practical challenge motivated by incomplete and imperfect sensing. This article addresses an important case where each agent in…
In this paper we use the MAP criterion to locate a region containing a source. Sensors placed in a field of interest divide the latter into smaller regions and take measurements that are transmitted over noisy wireless channels. We propose…
Archetypal scenarios for change detection generally consider two images acquired through sensors of the same modality. However, in some specific cases such as emergency situations, the only images available may be those acquired through…
In this work we develop clustering techniques for the Bearing Only Target Localization (BOTL) problem. Our scenario has a receiver move along some path, generating bearing estimates on some interval. Multiple emitting targets exist in the…
Similarity is a fundamental measure in network analyses and machine learning algorithms, with wide applications ranging from personalized recommendation to socio-economic dynamics. We argue that an effective similarity measurement should…
The \emph{sensor placement problem} for stochastic linear inverse problems consists of determining the optimal manner in which sensors can be employed to collect data. Specifically, one wishes to place a limited number of sensors over a…
Emerging applications of sensor networks for detection sometimes suggest that classical problems ought be revisited under new assumptions. This is the case of binary hypothesis testing with independent - but not necessarily identically…
We propose a method to optimally position a sensor system, which consists of multiple sensors, each has limited range and viewing angle, and they may fail with a certain failure rate. The goal is to find the optimal locations as well as the…
Determining whether nodes can be localized, called localizability detection, is essential for wireless sensor networks (WSNs). This step is required for localizing nodes, achieving low-cost deployments, and identifying prerequisites in…
Good geometrical calibration is essential in the use of high resolution detectors. The individual sensors in the detector have to be calibrated with an accuracy better than the intrinsic resolution, which typically is of the order of 10 um.…
A given region in 2-D Euclidean space is divided by a unknown linear classifier in to two sets each carrying a label. The objective of an agent with known dynamics traversing the region is to identify the true classifier while paying a…
In this paper we consider the problem of monitoring detecting separation of agents from a base station in robotic and sensor networks. Such separation can be caused by mobility and/or failure of the agents. While separation/cut detection…
In future wireless communication networks, existing active localization will gradually evolve into more sophisticated (passive) sensing functionalities. One main enabler for this process is the merging of information collected from the…
Assume that a target is known to be present at an unknown point among a finite set of locations in the plane. We search for it using a mobile robot that has imperfect sensing capabilities. It takes time for the robot to move between…
Sequential detection problems in sensor networks are considered. The true state of nature/true hypothesis is modeled as a binary random variable $H$ with known prior distribution. There are $N$ sensors making noisy observations about the…
In this paper, we mathematically characterize the improvement in device localizability achieved by allowing collaboration among devices. Depending on the detection sensitivity of the receivers in the devices, it is not unusual for a device…
Consider $n$ mobile sensors placed independently at random with the uniform distribution on a barrier represented as the unit line segment $[0,1]$. The sensors have identical sensing radius, say $r$. When a sensor is displaced on the line a…
We consider the problem of sensor selection for time-optimal detection of a hypothesis. We consider a group of sensors transmitting their observations to a fusion center. The fusion center considers the output of only one randomly chosen…
We address the problem of attack detection and isolation for a class of discrete-time nonlinear systems under (potentially unbounded) sensor attacks and measurement noise. We consider the case when a subset of sensors is subject to additive…