Demo Data from EDBT 2026 / reviewers in the wild / expert
Xiaoxin Lin
dblp:193/4178
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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 |
Robot navigation and mapping · 77% Multi-agent systems · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems
multi-agent search |
0.3 | 1 | 2026 | Human-Centric Open-Future Task Discovery: Formulation, Benchmark, and Scalable Tree-Based Search · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
tree search · 1.0large multimodal model · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Human-Centric Open-Future Task Discovery: Formulation, Benchmark, and Scalable Tree-Based SearchabstractRecent progress in robotics and embodied AI is largely driven by Large Multimodal Models (LMMs). However, a key challenge remains underexplored: how can we advance LMMs to discover tasks that assist humans in open-future scenarios, where human intentions are highly concurrent and dynamic. In this work, we formalize the problem of Human-centric Open-future Task Discovery (HOTD), focusing particularly on identifying tasks that reduce human effort across plausible futures. To facilitate this study, we propose HOTD-Bench, which features over 2K real-world videos, a semi-automated annotation pipeline, and a simulation-based protocol tailored for open-set future evaluation. Additionally, we propose the Collaborative Multi-Agent Search Tree (CMAST) framework, which decomposes complex reasoning through a multi-agent system and structures the reasoning process through a scalable search tree module. In our experiments, CMAST achieves the best performance on the HOTD-Bench, significantly surpassing existing LMMs. It also integrates well with existing LMMs, consistently improving performance. Xiaoxin Lin, Tao Pu 0002, Zhenlong Yuan, Guangrun Wang, Liang Lin 0004 |
AAAI | 2 |