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

Nikhil Angad Bakshi

dblp:200/8270 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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
Reinforcement learning · 61% Multi-agent systems · 30% Legged, aerial and field robots · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › bandit › pure-exploration bandit
active search
0.712023
GUTS: Generalized Uncertainty-Aware Thompson Sampling for Multi-Agent Active Search · ICRA 2023
Knowledge, reasoning and agents › Multi-agent systems › multi-robot systems
heterogeneous robot teams
0.712023
GUTS: Generalized Uncertainty-Aware Thompson Sampling for Multi-Agent Active Search · ICRA 2023
Machine learning › Reinforcement learning
thompson sampling
0.712023
GUTS: Generalized Uncertainty-Aware Thompson Sampling for Multi-Agent Active Search · ICRA 2023
Robotics › Legged, aerial and field robots › field robotics
disaster response
0.212023
GUTS: Generalized Uncertainty-Aware Thompson Sampling for Multi-Agent Active Search · ICRA 2023

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

thompson sampling · 0.7simulation experiments · 0.7field tests · 0.7
YearPublicationVenuePosition
2023 GUTS: Generalized Uncertainty-Aware Thompson Sampling for Multi-Agent Active Search
abstract
Robotic solutions for quick disaster response are essential to ensure minimal loss of life, especially when the search area is too dangerous or too vast for human rescuers. We model this problem as an asynchronous multi-agent active-search task where each robot aims to efficiently seek objects of interest (OOIs) in an unknown environment. This formulation addresses the requirement that search missions should focus on quick recovery of OO1s rather than full coverage of the search region. Previous approaches fail to accurately model sensing uncertainty, account for occlusions due to foliage or terrain, or consider the requirement for heterogeneous search teams and robustness to hardware and communication failures. We present the Generalized Uncertainty-aware Thompson Sampling (GUTS) algorithm, which addresses these issues and is suitable for deployment on heterogeneous multi-robot systems for active search in large unstructured environments. We show through simulation experiments that GUTS consistently outperforms existing methods such as parallelized Thompson Sampling and exhaustive search, recovering all OOIs in 80% of all runs. In contrast, existing approaches recover all OOIs in less than 40% of all runs. We conduct field tests using our multirobot system in an unstructured environment with a search area of ≈75,000 m2. Our system demonstrates robustness to various failure modes, achieving full recovery of OOIs (where feasible) in every field run, and significantly outperforming our baseline.
Nikhil Angad Bakshi, Tejus Gupta, Ramina Ghods, Jeff G. Schneider
ICRA1