Pratap R. Tokekar - Research
about research publications projects cv

Sensor Placement

We study the problem of placing sensors yielding bearing measurements with bounded noise, in a square workspace to localize a stationary target upto a desired uncertainty. We show that by placing sensors on a triangular grid, we can guarantee that the target's uncertainty is within a constant-factor of that of an (unknown) optimal algorithm for any true target location and any set of measurements obtained. We show that this estimate can be obtained by activating a small number of sensors and the total number of sensors placed by our algorithm is at most a constant-factor as that of an optimal algorithm.

Optimal Coverage Tour

We study the problem of optimally covering a set of regions in a plane by a sensor with limited sensing radius. In our application, these regions correspond to those likely to contain the fish in the lake. This problem is a generalization of TSP with neighborhoods; in addition to finding the optimal order to visit each region, we also have to determine optimal coverage patterns within each region. We present a simple constant factor (a+b)-approximation for the general case, and a 3-approximation for the special case when the regions are rectangles and touching the boundary of a convex polygon.

Active Localization Using Bearing Sensors

Localization experiment

Multiple measurements are required to precisely localize a target using a bearing sensor. Uncertainty in the target's estimate depends on the measurement locations; some locations are more "informative" than others. Further, this information is only revealed in an online fashion: each new measurement yields more information about the target. We study the problem of choosing such informative sensing locations in an online fashion, seeking theoretical performance guarantees.

Robotic System for Monitoring Carp

We are working with researchers from the Dept. of Fisheries to develop a network of autonomous robotic boats and mobile robots to monitor radio-tagged fish in lakes (and on frozen lakes!). As part of our research, we study interesting algorithmic problems in search, coverage and tracking.

For further details see the project page.

Energy Efficient Motion Planning for Mobile Robots

Optimal velocity profile

For battery-powered mobile robots to operate for long periods of time, it is critical to optimize their motion so as to minimize energy consumption. The driving motors are a major source of power consumption. We studied the problem of finding energy-optimal velocity profiles for car-like robots given a path to travel. We have also recently investigated the problem of energy-efficient, time-limited path planning of a solar powered robot embedded in a terrestrial environment.

The views and opinions expressed in this page are strictly those of the page author.
The contents of this page have not been reviewed or approved by the University of Minnesota.