Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Suresh Kannan

dblp:84/10385 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Multi-agent systems · 50% Robot navigation and mapping · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping
coverage control
0.112012
Coverage control of mobile sensors for adaptive search of unknown number of targets · ICRA 2012
Knowledge, reasoning and agents › Multi-agent systems › multi-robot systems
multi-robot search
0.112012
Coverage control of mobile sensors for adaptive search of unknown number of targets · ICRA 2012

Methods — techniques the papers use, named apart from their topics

sequential probability ratio test · 0.1recursive least squares · 0.1
YearPublicationVenuePosition
2012 Coverage control of mobile sensors for adaptive search of unknown number of targets
abstract
We present a multiscale adaptive search algorithm for efficiently searching an unknown number of stationary targets using a team of multiple mobile sensors. We first derive a Spectral Multiscale Coverage (SMC) control law for a Dubins vehicle model. Given a search prior, the SMC control leads to uniform coverage dynamics for the mobile sensors such that the amount of time spent observing a region is proportional to finding a target in it. In order to make the search robust to sensor uncertainties and Automatic Target Detection algorithm errors (i.e. false alarm, missed detections), we combine the SMC control with decision and estimation theoretic techniques. As new targets are discovered we use the Sequential Ratio Probability Test and Recursive Least Squares estimation to quantify the current uncertainty in target detection and location, respectively. This uncertainty is used to update the search prior so as to balance exploitation (reduce uncertainty in state of already discovered potential targets) and exploration (discover new targets). We demonstrate this adaptive search methodology in a high fidelity simulation environment and show an improved performance over lawnmower type search.
Amit Surana, George Mathew, Suresh Kannan
ICRA3