Abstract:Sensing with RF signals such as mmWave radar has gained considerable interest in recent years. This is particularly relevant to 6G networks, which aim to integrate sensing and communication (ISAC) capabilities for enhanced functionality. The contextual information provided by such sensing, whether collected by standalone non-ISAC units or integrated within ISAC, can not only optimize cellular network assets but can also serve as a valuable tool for a wide range of applications beyond network optimization. In this context, we present a novel methodology for crowd size estimation using monostatic mmWave radar, which is capable of accurately counting large crowds that are unevenly distributed across space. Our estimation approach relies on the rigorous derivation of occlusion probabilities, which are then used to mathematically characterize the probability distributions that describe the number of agents visible to the radar as a function of the crowd size. We then estimate the true crowd size by comparing these derived mathematical models to the empirical distribution of the number of visible agents detected by the radar. This method requires minimal sensing capabilities (e.g., angle-of-arrival information is not needed), thus being well suited for either a dedicated mmWave radar or an ISAC system. Extensive numerical simulations validate our methodology, demonstrating strong performance across diverse spatial distributions and for crowd sizes of up to (and including) 30 agents. We achieve a mean absolute error (MAE) of 0.48 agents, significantly outperforming a baseline which assumes that the agents are uniformly distributed in the area. Overall, our approach holds significant promise for a variety of applications including network resource allocation, crowd management, and urban planning.
Abstract:This paper considers trajectory planning for a mobile robot which persistently relays data between pairs of far-away communication nodes. Data accumulates stochastically at each source, and the robot must move to appropriate positions to enable data offload to the corresponding destination. The robot needs to minimize the average time that data waits at a source before being serviced. We are interested in finding optimal robotic routing policies consisting of 1) locations where the robot stops to relay (relay positions) and 2) conditional transition probabilities that determine the sequence in which the pairs are serviced. We first pose this problem as a non-convex problem that optimizes over both relay positions and transition probabilities. To find approximate solutions, we propose a novel algorithm which alternately optimizes relay positions and transition probabilities. For the former, we find efficient convex partitions of the non-convex relay regions, then formulate a mixed-integer second-order cone problem. For the latter, we find optimal transition probabilities via sequential least squares programming. We extensively analyze the proposed approach and mathematically characterize important system properties related to the robot's long-term energy consumption and service rate. Finally, through extensive simulation with real channel parameters, we verify the efficacy of our approach.
Abstract:In this paper, we consider the problem of wireless channel prediction, where we are interested in predicting the channel quality at unvisited locations in an area of interest, based on a small number of prior received power measurements collected by an unmanned vehicle in the area. We propose a new framework for channel prediction that can not only predict the detailed variations of the received power, but can also predict the detailed makeup of the wireless rays (i.e., amplitude, angle-of-arrival, and phase of all the incoming paths). More specifically, we show how an enclosure-based robotic route design ensures that the received power measurements at the prior measurement locations can be utilized to fully predict detailed ray parameters at unvisited locations. We then show how to first estimate the detailed ray parameters at the prior measurement route and then fully extend them to predict the detailed ray makeup at unvisited locations in the workspace. We experimentally validate our proposed framework through extensive real-world experiments in three different areas, and show that our approach can accurately predict the received channel power and the detailed makeup of the rays at unvisited locations in an area, considerably outperforming the state-of-the-art in wireless channel prediction.
Abstract:Detection of nocturnal seizures in epilepsy patients is essential, both for the quick management of the seizure complications, and for the assessment of the ongoing seizure treatment. Traditional seizure detection products (e.g., wearables), however, are either very costly, uncomfortable, or unreliable. In this paper, we then propose to utilize everyday WiFi signals for robust, fast, and non-invasive detection of nocturnal seizures. We first present a new and rigorous mathematical characterization for the spectral content/bandwidth of the WiFi signal, measured on a WiFi device placed near a sleeping patient, during different kinds of sleep motions: seizures, normal movements (e.g. posture adjustments), and breathing. Based on this mathematical modeling, we propose a novel pipeline for processing the received WiFi signals to robustly detect all nocturnal non-breathing movements, and then classify them into normal body movements or seizures. In order to validate this, we carry out extensive experiments in 7 different typical bedroom locations, where a set of 20 actors simulate the state of having seizures (total of 260 instances), as well as normal sleep movements (total of 410 instances). Our proposed system detects 93.85% of the seizures with a mean response time of only 5.69 seconds since the onset of the seizure. Moreover, our proposed system achieves a probability of false alarm of only 0.0097, when classifying normal sleep movements. Overall, our new mathematical modeling and experimental results show the great potential the ubiquitous WiFi signals have for detecting nocturnal seizures, which can provide better support for epilepsy patients and their caregivers.
Abstract:Consider a general path planning problem of a robot on a graph with edge costs, and where each node has a Boolean value of success or failure (with respect to some task) with a given probability. The objective is to plan a path for the robot on the graph that minimizes the expected cost until success. In this paper, it is our goal to bring a foundational understanding to this problem. We start by showing how this problem can be optimally solved by formulating it as an infinite horizon Markov Decision Process, but with an exponential space complexity. We then formally prove its NP-hardness. To address the space complexity, we then propose a path planner, using a game-theoretic framework, that asymptotically gets arbitrarily close to the optimal solution. Moreover, we also propose two fast and non-myopic path planners. To show the performance of our framework, we do extensive simulations for two scenarios: a rover on Mars searching for an object for scientific studies, and a robot looking for a connected spot to a remote station (with real data from downtown San Francisco). Our numerical results show a considerable performance improvement over existing state-of-the-art approaches.
Abstract:In this paper, we consider a scenario where a robot needs to establish connectivity with a remote operator or another robot, as it moves along a path. We are interested in answering the following question: what is the distance traveled by the robot along the path before it finds a connected spot? More specifically, we are interested in characterizing the statistics of the distance traveled along the path before it gets connected, in realistic channel environments experiencing path loss, shadowing and multipath effects. We develop an exact mathematical analysis of these statistics for straight-line paths and also mathematically characterize a more general space of paths (beyond straight paths) for which the analysis holds, based on the properties of the path such as its curvature. Finally, we confirm our theoretical analysis using extensive numerical results with real channel parameters from downtown San Francisco.
Abstract:The ability to estimate the perceptual error between images is an important problem in computer vision with many applications. Although it has been studied extensively, however, no method currently exists that can robustly predict visual differences like humans. Some previous approaches used hand-coded models, but they fail to model the complexity of the human visual system. Others used machine learning to train models on human-labeled datasets, but creating large, high-quality datasets is difficult because people are unable to assign consistent error labels to distorted images. In this paper, we present a new learning-based method that is the first to predict perceptual image error like human observers. Since it is much easier for people to compare two given images and identify the one more similar to a reference than to assign quality scores to each, we propose a new, large-scale dataset labeled with the probability that humans will prefer one image over another. We then train a deep-learning model using a novel, pairwise-learning framework to predict the preference of one distorted image over the other. Our key observation is that our trained network can then be used separately with only one distorted image and a reference to predict its perceptual error, without ever being trained on explicit human perceptual-error labels. The perceptual error estimated by our new metric, PieAPP, is well-correlated with human opinion. Furthermore, it significantly outperforms existing algorithms, beating the state-of-the-art by almost 3x on our test set in terms of binary error rate, while also generalizing to new kinds of distortions, unlike previous learning-based methods.