The Sensing Capacity of Sensor Networks

This paper demonstrates fundamental limits of sensor networks for detection problems where the number of hypotheses is exponentially large. Such problems characterize many important applications including detection and classification of targets in a geographical area using a network of sensors, and detecting complex substances with a chemical sensor array. We refer to such applications as largescale detection problems. Using the insight that these problems share fundamental similarities with the problem of communicating over a noisy channel, we define a quantity called the sensing capacity and lower bound it for a number of sensor network models. The sensing capacity expression differs significantly from the channel capacity due to the fact that a fixed sensor configuration encodes all states of the environment. As a result, codewords are dependent and non-identically distributed. The sensing capacity provides a bound on the minimal number of sensors required to detect the state of an environment to within a desired accuracy. The results differ significantly from classical detection theory, and provide an ntriguing connection between sensor networks and communications. In addition, we discuss the insight that sensing capacity provides for the problem of sensor selection.Comment: Submitted to IEEE Transactions on Information Theory, November 200

Aerospace medicine and biology: A continuing bibliography with indexes (supplement 320)

This bibliography lists 125 reports, articles and other documents introduced into the NASA Scientific and Technical Information System during January, 1989. Subject coverage includes: aerospace medicine and psychology, life support systems and controlled environments, safety equipment, exobiology and extraterrestrial life, and flight crew behavior and performance

Eyes in the Dark: Distributed Scene Understanding for Disaster Management

Robotic is a great substitute for human to explore the dangerous areas, and will also be a great help for disaster management. Although the rise of depth sensor technologies gives a huge boost to robotic vision research, traditional approaches cannot be applied to disaster-handling robots directly due to some limitations. In this paper, we focus on the 3D robotic perception, and propose a view-invariant Convolutional Neural Network (CNN) Model for scene understanding in disaster scenarios. The proposed system is highly distributed and parallel, which is of great help to improve the efficiency of network training. In our system, two individual CNNs are used to, respectively, propose objects from input data and classify their categories. We attempt to overcome the difficulties and restrictions caused by disasters using several specially-designed multi-task loss functions. The most significant advantage in our work is that the proposed method can learn a view-invariant feature with no requirement on RGB data, which is essential for harsh, disordered and changeable environments. Additionally, an effective optimization algorithm to accelerate the learning process is also included in our work. Simulations demonstrate that our approach is robust and efficient, and outperforms the state-of-the-art in several related tasks

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

Sensor Path Planning for Emitter Localization

The localization of a radio frequency (RF) emitter is relevant in many military and civilian applications. The recent decade has seen a rapid progress in the development of small and mobile unmanned aerial vehicles (UAVs), which offer a way to perform emitter localization autonomously. The path a UAV travels influences the localization significantly, making path planning an important part of a mobile emitter localization system. The topic of this thesis is path planning for a UAV that uses bearing measurements to localize a stationary emitter. Using a directional antenna, the direction towards the target can be determined by the UAV rotating around its own vertical axis. During this rotation the UAV is required to remain at the same position, which induces a trade-off between movement and measurement that influences the optimal trajectories. This thesis derives a novel path planning algorithm for localizing an emitter with a UAV. It improves the current state of the art by providing a localization with defined accuracy in a shorter amount of time compared to other algorithms in simulations. The algorithm uses the policy rollout principle to perform a nonmyopic planning and to incorporate the uncertainty of the estimation process into its decision. The concept of an action selection algorithm for policy rollout is introduced, which allows the use of existing optimization algorithms to effectively search the action space. Multiple action selection algorithms are compared to optimize the speed of the path planning algorithm. Similarly, to reduce computational demand, an adaptive grid-based localizer has been developed. To evaluate the algorithm an experimental system has been built and the algorithm was tested on this system. Based on initial experiments, the path planning algorithm has been modified, including a minimal distance to the emitter and an outlier detection step. The resulting algorithm shows promising results in experimental flights

NASA Tech Briefs, September 2007

Topics covered include; Rapid Fabrication of Carbide Matrix/Carbon Fiber Composites; Coating Thermoelectric Devices To Suppress Sublimation; Ultrahigh-Temperature Ceramics; Improved C/SiC Ceramic Composites Made Using PIP; Coating Carbon Fibers With Platinum; Two-Band, Low-Loss Microwave Window; MCM Polarimetric Radiometers for Planar Arrays; Aperture-Coupled Thin-Membrane L-Band Antenna; WGM-Based Photonic Local Oscillators and Modulators; Focal-Plane Arrays of Quantum-Dot Infrared Photodetectors; Laser Range and Bearing Finder With No Moving Parts; Microrectenna: A Terahertz Antenna and Rectifier on a Chip; Miniature L-Band Radar Transceiver; Robotic Vision-Based Localization in an Urban Environment; Programs for Testing an SSME-Monitoring System; Cathodoluminescent Source of Intense White Light; Displaying and Analyzing Antenna Radiation Patterns; Payload Operations Support Team Tools; Space-Shuttle Emulator Software; Soft Real-Time PID Control on a VME Computer; Analyzing Radio-Frequency Coverage for the ISS; Nanorod-Based Fast-Response Pressure-Sensitive Paints; Capacitors Would Help Protect Against Hypervelocity Impacts; Diaphragm Pump With Resonant Piezoelectric Drive; Improved Quick-Release Pin Mechanism; Designing Rolling-Element Bearings; Reverse-Tangent Injection in a Centrifugal Compressor; Inertial Measurements for Aero-assisted Navigation (IMAN); Analysis of Complex Valve and Feed Systems; Improved Path Planning Onboard the Mars Exploration Rovers; Robust, Flexible Motion Control for the Mars Explorer Rovers; Solar Sail Spaceflight Simulation; Fluorine-Based DRIE of Fused Silica; Mechanical Alloying for Making Thermoelectric Compounds; Process for High-Rate Fabrication of Alumina Nanotemplates; Electroform/Plasma-Spray Laminates for X-Ray Optics; An Automated Flying-Insect Detection System; Calligraphic Poling of Ferroelectric Material; Blackbody Cavity for Calibrations at 200 to 273 K; KML Super Overlay to WMS Translator; High-Performance Tiled WMS and KML Web Server; Modeling of Radiative Transfer in Protostellar Disks; Composite Pulse Tube; Photometric Calibration of Consumer Video Cameras; Criterion for Identifying Vortices in High- Pressure Flows; Amplified Thermionic Cooling Using Arrays of Nanowires; Delamination-Indicating Thermal Barrier Coatings; Preventing Raman Lasing in High-Q WGM Resonators; Procedures for Tuning a Multiresonator Photonic Filter; Robust Mapping of Incoherent Fiber-Optic Bundles; Extended-Range Ultrarefractive 1D Photonic Crystal Prisms; Rapid Analysis of Mass Distribution of Radiation Shielding; Modeling Magnetic Properties in EZTB; Deep Space Network Antenna Logic Controller; Modeling Carbon and Hydrocarbon Molecular Structures in EZTB; BigView Image Viewing on Tiled Displays; and Imaging Sensor Flight and Test Equipment Software

Resilient Submodular Maximization For Control And Sensing

Fundamental applications in control, sensing, and robotics, motivate the design of systems by selecting system elements, such as actuators or sensors, subject to constraints that require the elements not only to be a few in number, but also, to satisfy heterogeneity or interdependency constraints (called matroid constraints). For example, consider the scenarios: - (Control) Actuator placement: In a power grid, how should we place a few generators both to guarantee its stabilization with minimal control effort, and to satisfy interdependency constraints where the power grid must be controllable from the generators? - (Sensing) Sensor placement: In medical brain-wearable devices, how should we place a few sensors to ensure smoothing estimation capabilities? - (Robotics) Sensor scheduling: At a team of mobile robots, which few on-board sensors should we activate at each robot ---subject to heterogeneity constraints on the number of sensors that each robot can activate at each time--- so both to maximize the robots\u27 battery life, and to ensure the robots\u27 capability to complete a formation control task? In the first part of this thesis we motivate the above design problems, and propose the first algorithms to address them. In particular, although traditional approaches to matroid-constrained maximization have met great success in machine learning and facility location, they are unable to meet the aforementioned problem of actuator placement. In addition, although traditional approaches to sensor selection enable Kalman filtering capabilities, they do not enable smoothing or formation control capabilities, as required in the above problems of sensor placement and scheduling. Therefore, in the first part of the thesis we provide the first algorithms, and prove they achieve the following characteristics: provable approximation performance: the algorithms guarantee a solution close to the optimal; minimal running time: the algorithms terminate with the same running time as state-of-the-art algorithms for matroid-constrained maximization; adaptiveness: where applicable, at each time step the algorithms select system elements based on both the history of selections. We achieve the above ends by taking advantage of a submodular structure of in all aforementioned problems ---submodularity is a diminishing property for set functions, parallel to convexity for continuous functions. But in failure-prone and adversarial environments, sensors and actuators can fail; sensors and actuators can get attacked. Thence, the traditional design paradigms over matroid-constraints become insufficient, and in contrast, resilient designs against attacks or failures become important. However, no approximation algorithms are known for their solution; relevantly, the problem of resilient maximization over matroid constraints is NP-hard. In the second part of this thesis we motivate the general problem of resilient maximization over matroid constraints, and propose the first algorithms to address it, to protect that way any design over matroid constraints, not only within the boundaries of control, sensing, and robotics, but also within machine learning, facility location, and matroid-constrained optimization in general. In particular, in the second part of this thesis we provide the first algorithms, and prove they achieve the following characteristics: resiliency: the algorithms are valid for any number of attacks or failures; adaptiveness: where applicable, at each time step the algorithms select system elements based on both the history of selections, and on the history of attacks or failures; provable approximation guarantees: the algorithms guarantee for any submodular or merely monotone function a solution close to the optimal; minimal running time: the algorithms terminate with the same running time as state-of-the-art algorithms for matroid-constrained maximization. We bound the performance of our algorithms by using notions of curvature for monotone (not necessarily submodular) set functions, which are established in the literature of submodular maximization. In the third and final part of this thesis we apply our tools for resilient maximization in robotics, and in particular, to the problem of active information gathering with mobile robots. This problem calls for the motion-design of a team of mobile robots so to enable the effective information gathering about a process of interest, to support, e.g., critical missions such as hazardous environmental monitoring, and search and rescue. Therefore, in the third part of this thesis we aim to protect such multi-robot information gathering tasks against attacks or failures that can result to the withdrawal of robots from the task. We conduct both numerical and hardware experiments in multi-robot multi-target tracking scenarios, and exemplify the benefits, as well as, the performance of our approach