Demo Data from EDBT 2026 / reviewers in the wild / expert
Ying Zhang 0099
dblp:13/6769-99
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-7060-1655ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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 manipulation · 38% Multi-agent systems · 38% Motion planning and robot control · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems › task allocation
multi-robot task allocation |
1.0 | 1 | 2026 | PushingBots: Collaborative Pushing via Neural Accelerated Combinatorial Hybrid Optimization · IEEE Trans. Robotics 2026 |
Robotics › Robot manipulation
nonprehensile manipulation |
1.0 | 1 | 2026 | PushingBots: Collaborative Pushing via Neural Accelerated Combinatorial Hybrid Optimization · IEEE Trans. Robotics 2026 |
Robotics › Motion planning and robot control › robot dynamics › contact dynamics
contact-mode switching |
0.3 | 1 | 2026 | PushingBots: Collaborative Pushing via Neural Accelerated Combinatorial Hybrid Optimization · IEEE Trans. Robotics 2026 |
Robotics › Motion planning and robot control › robot control
hybrid control |
0.3 | 1 | 2026 | PushingBots: Collaborative Pushing via Neural Accelerated Combinatorial Hybrid Optimization · IEEE Trans. Robotics 2026 |
Methods — techniques the papers use, named apart from their topics
keyframe-guided hybrid search · 1.0diffusion-based accelerator · 1.0combinatorial hybrid optimization · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PushingBots: Collaborative Pushing via Neural Accelerated Combinatorial Hybrid OptimizationabstractMany robots are not equipped with a manipulator and many objects are not suitable for prehensile manipulation (such as large boxes and cylinders). In these cases, pushing is a simple yet effective non-prehensile skill for robots to interact with and further change the environment. Existing work often assumes a set of predefined pushing modes and fixed-shape objects. This work tackles the general problem of controlling a robotic fleet to push collaboratively numerous arbitrary objects to respective destinations, within complex environments of cluttered and movable obstacles. It incorporates several characteristic challenges for multi-robot systems such as online task coordination under large uncertainties of cost and duration, and for contact-rich tasks such as hybrid switching among different contact modes, and under-actuation due to constrained contact forces. The proposed method is based on combinatorial hybrid optimization over dynamic task assignments and hybrid execution via sequences of pushing modes and associated forces. It consists of three main components: (I) the decomposition, ordering and rolling assignment of pushing subtasks to robot subgroups; (II) the keyframe guided hybrid search to optimize the sequence of parameterized pushing modes for each subtask; (III) the hybrid control to execute these modes and transit among them. Last but not least, a diffusion-based accelerator is adopted to predict the keyframes and pushing modes that should be prioritized during hybrid search; and further improve planning efficiency. The framework is complete under mild assumptions. Its efficiency and effectiveness under different numbers of robots and general -shaped objects are validated extensively in simulations and hardware experiments, as well as generalizations to heterogeneous robots, planar assembly and 6D pushing. Zili Tang, Ying Zhang 0099, Meng Guo 0002 |
IEEE Trans. Robotics | 2 |