Demo Data from SIGIR 2026 / reviewers in the wild / expert
Banghe Wu
dblp:274/2005
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-7214-1652ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 2 · 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 · 77% Robot navigation and mapping · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › exploration
autonomous exploration |
0.6 | 1 | 2022 | Ada-Detector: Adaptive Frontier Detector for Rapid Exploration · ICRA 2022 |
Robotics › Robot navigation and mapping › robot mapping
online mapping |
0.2 | 1 | 2022 | Ada-Detector: Adaptive Frontier Detector for Rapid Exploration · ICRA 2022 |
Methods — techniques the papers use, named apart from their topics
rapidly-exploring random tree · 0.6non-uniform sampling · 0.6adaptive sampling · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Ada-Detector: Adaptive Frontier Detector for Rapid ExplorationabstractIn this paper, we propose an efficient frontier detector method based on adaptive Rapidly-exploring Random Tree (RRT) for autonomous robot exploration. Robots can achieve real-time incremental frontier detection when they are exploring unknown environments. First, our detector adaptively adjusts the sampling space of RRT by sensing the surrounding environment structure. The adaptive sampling space can greatly improve the successful sampling rate of RRT (the ratio of the number of samples successfully added to the RRT tree to the number of sampling attempts) according to the environment structure and control the expansion bias of the RRT. Second, by generating non-uniform distributed samples, our method also solves the over-sampling problem of RRT in the sliding windows, where uniform random sampling causes over-sampling in the overlap area between two adjacent sliding windows. In this way, our detector is more inclined to sample in the latest explored area, which improves the efficiency of frontier detection and achieves incremental detection. We validated our method in three simulated benchmark scenarios. The experimental comparison shows that we reduce the frontier detection runtime by about 40% compared with the SOTA method, DSV Planner. Zezhou Sun, Banghe Wu, Cheng-Zhong Xu 0001, Hui Kong 0001 |
ICRA | 2 |
| 2020 | Frontier Detection and Reachability Analysis for Efficient 2D Graph-SLAM Based Active ExplorationabstractWe propose an integrated approach to active exploration by exploiting the Cartographer method as the base SLAM module for submap creation and performing efficient frontier detection in the geometrically co-aligned submaps induced by graph optimization. We also carry out analysis on the reachability of frontiers and their clusters to ensure that the detected frontier can be reached by robot. Our method is tested on a mobile robot in real indoor scene to demonstrate the effectiveness and efficiency of our approach. Zezhou Sun, Banghe Wu, Cheng-Zhong Xu 0001, Sanjay E. Sarma, Jian Yang 0003, Hui Kong 0001 |
IROS | 2 |