Demo Data from SIGIR 2026 / reviewers in the wild / expert
Qandeel Sajid
dblp:117/4897
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 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.
| Human-computer interaction and pervasive computing
1 paper |
Human-robot interaction · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Human-robot interaction › social robot
robot personality |
0.2 | 1 | 2016 | Personality-Based Consistent Robot Behavior · HRI 2016 |
Human-robot interaction
social robot |
0.1 | 1 | 2016 | Personality-Based Consistent Robot Behavior · HRI 2016 |
Methods — techniques the papers use, named apart from their topics
big five personality model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Personality-Based Consistent Robot BehaviorabstractPersonality is essential to creating socially interactive robots. Prior work in Human-Robot Interaction (HRI) has focused on endowing robots with personality for the purpose of increasing the appeal of the robot and interaction to the user. In this paper, we propose the application of personality towards producing consistent and predictable behavior for robots. We provide an overview of personality and personality research in HRI, and describe a new research direction for using the Big Five personality types to enable robotic behavior that is consistent and easily predictable by human users. Qandeel Sajid |
HRI | 1 |
| 2012 | Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent PrimitivesabstractMulti-agent pathfinding is a challenging combinatorial problem that involves multiple agents moving on a graph from a set of initial nodes to a set of desired goals without inter-agent collisions. Searching the composite space of all agents has exponential complexity and does not scale well. Decoupled methods are more efficient but are generally incomplete. There are, however, polynomial time algorithms, which utilize single or few-agents primitives with completeness guarantees. One limitation of these alternatives is that the resulting solution is sequential, where only one agent moves at a time. Such solutions are of low quality when compared to methods where multiple agents can move simultaneously. This work proposes an algorithm for multi-agent pathfinding that utilizes similar single-agent primitives but allows all agents to move in parallel. The paper describes the algorithm and its properties. Experimental comparisons suggest that the resulting paths are considerably better than sequential ones, even after a post-processing, parallelization step, as well as solutions returned by decoupled and coupled alternatives. The experiments also suggest good scalability and competitive computational performance. Qandeel Sajid, Ryan Luna, Kostas E. Bekris |
SOCS | 1 |