Demo Data from SIGIR 2026 / reviewers in the wild / expert
Steven Gray 0003
dblp:18/10091-3
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2013
0000-0001-7673-9993ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author
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 · 61% Motion planning and robot control · 39% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation › mobile manipulation
door opening |
0.2 | 1 | 2013 | A single planner for a composite task of approaching, opening and navigating through non-spring and spring-loaded doors · ICRA 2013 |
Robotics › Robot manipulation
mobile manipulation |
0.2 | 1 | 2013 | A single planner for a composite task of approaching, opening and navigating through non-spring and spring-loaded doors · ICRA 2013 |
Robotics › Motion planning and robot control
motion planning |
0.2 | 1 | 2013 | A single planner for a composite task of approaching, opening and navigating through non-spring and spring-loaded doors · ICRA 2013 |
Robotics › Motion planning and robot control › motion planning
contact planning |
0.0 | 1 | 2013 | A single planner for a composite task of approaching, opening and navigating through non-spring and spring-loaded doors · ICRA 2013 |
Methods — techniques the papers use, named apart from their topics
graph-based search · 0.2force workspace precomputation · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | A single planner for a composite task of approaching, opening and navigating through non-spring and spring-loaded doorsabstractOpening and navigating through doors remains a challenging problem, particularly in cluttered environments and for spring-loaded doors. Passing through doors, especially spring-loaded doors, requires making and breaking contacts with the door and preventing the door from closing while passing through. In this work, we present a planning framework that handles non-spring and spring-loaded doors, in cluttered or confined workspaces, planning the approach to the door, pushing or pulling it open, and passing through. Because the problem is solved in a combined search space, the planner yields an overall least-cost path. The planner is able to insert a transition between robot-door contacts at any point along the plan. We utilize a compact graph-based representation of the problem to keep planning times low. We precompute the force workspace of the end-effectors to eliminate checks against joint torque limits at plan time. We have validated our solution in both simulation and real-world experiments on the PR2 mobile manipulation platform; the robot is able to successfully open a variety of spring-loaded and non-spring-loaded doors by pushing and pulling. Steven Gray 0003, Sachin Chitta, Vijay Kumar 0001, Maxim Likhachev |
ICRA | 1 |
| 2010 | Reconfiguring Chain-Type Modular Robots Based on the Carpenter's Rule Theorem
Jungwon Seo, Steven Gray 0003, Vijay Kumar 0001, Mark Yim |
WAFR | 2 |