Biased sink mobility with adaptive stop times for low latency data collection in sensor networks

A Kinalis, S Nikoletseas, D Patroumpa, J Rolim - Information fusion, 2014 - Elsevier
Collecting sensory data using a mobile data sink has been shown to drastically reduce
energy consumption at the cost of increasing delivery delay. Towards improved energy …

Sensing and filtering: A fresh perspective based on preimages and information spaces

SM LaValle - Foundations and Trends® in Robotics, 2012 - nowpublishers.com
This monograph presents an unusual perspective on sensing uncertainty and filtering with
the intention of understanding what information is minimally needed to achieve a specified …

I-Bug: An intensity-based bug algorithm

K Taylor, SM LaValle - 2009 IEEE International Conference on …, 2009 - ieeexplore.ieee.org
This paper introduces a sensor-based planning algorithm that uses less sensing information
than any others within the family of bug algorithms. The robot is unable to access precise …

Simple robots with minimal sensing: From local visibility to global geometry

S Suri, E Vicari, P Widmayer - The International Journal of …, 2008 - journals.sagepub.com
We consider problems of geometric exploration and self-deployment for simple robots that
can only sense the combinatorial (non-metric) features of their surroundings. Even with such …

Shadow information spaces: Combinatorial filters for tracking targets

J Yu, SM LaValle - IEEE Transactions on Robotics, 2011 - ieeexplore.ieee.org
This paper introduces and solves a problem of maintaining the distribution of hidden targets
that move outside the field of view while a sensor sweep is being performed, resulting in a …

Intensity-based navigation with global guarantees

K Taylor, SM LaValle - Autonomous Robots, 2014 - Springer
This article introduces simple, information-feedback plans that guide a robot through an
unknown obstacle course using the sensed information from a single intensity source. The …

Simple robots in polygonal environments: A hierarchy

J Brunner, M Mihalák, S Suri, E Vicari… - Algorithmic Aspects of …, 2008 - Springer
With the current progress in robot technology and related areas, sophisticated moving and
sensing capabilities are at hand to design robots capable of solving seemingly complex …

Target counting under minimal sensing: Complexity and approximations

S Gandhi, R Kumar, S Suri - … on Algorithms and Experiments for Sensor …, 2008 - Springer
We consider the problem of counting a set of discrete point targets using a network of
sensors under a minimalistic model. Each sensor outputs a single integer, the number of …

Tracking hidden agents through shadow information spaces

J Yu, SM LaValle - 2008 IEEE International Conference on …, 2008 - ieeexplore.ieee.org
This paper addresses problems of inferring the locations of moving agents from
combinatorial data extracted by robots that carry sensors. The agents move unpredictably …

[PDF][PDF] Filtering and planning in information spaces

SM LaValle - IROS tutorial notes, 2009 - oulu.cs.illinois.edu
This tutorial presents a fresh perspective on modeling sensors and then using them for
filtering and planning. The concepts and tools are motivated by many problems of current …