Search arXivSearch

arXiv · 2608.28154

From Small Talk to Rapport: Exploring Robot Self-Disclosure in Collaborative Tasks

Abstract

People naturally chat while collaborating and share personal information (i.e., self-disclose) to build rapport and maintain social connections. As robots are increasingly developed to work with people, the effective use of these social behaviors to enhance engagement and support teamwork becomes ever more important. While prior work has shown that robot-initiated small talk can benefit human-robot collaboration, less is known about how best to design such small talk. In this work, we explore how self-disclosure may be designed to support small talk within a human-robot team---especially when the robot is an industrial manipulator that lacks anthropomorphic cues and performs physical work. We first developed an LLM-driven manipulator capable of partaking in small talk, adopting either a low-disclosure or high-disclosure strategy. We then conducted a user study (N = 50) to investigate how self-disclosure in small talk influences human-robot dynamics. Unexpectedly, participants disclosed more in the low-disclosure condition and reported stronger teaming and coordination than those in the high-disclosure condition. This effect was more pronounced among users with prior experience teaming with robots. These results suggest that increasing robot self-disclosure does not necessarily foster rapport, social connection, or reciprocal disclosure; other factors, such as prior HRI experience, should be considered.

Explore related subjects

Keep this discovery

BibTeXRIS

Kaitlynn Taylor Pineda, Anvii Mishra, Brian Chien, Angela Guo, Toluwani Williams, Ziang Xiao, Chien-Ming Huang. 2026-08-28. From Small Talk to Rapport: Exploring Robot Self-Disclosure in Collaborative Tasks. https://arxiv.org/abs/2608.28154

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

SMILE: Smooth Motion for Improved Long-Horizon VLA Execution

Vision-Language-Action (VLA) models reduce inference cost by executing multiple actions per call, but longer horizons often degrade accuracy because raw chunks contain jitter and outliers. We introduce SMILE, an architecture-preserving interface that predicts B-spline coefficients and decodes them into smooth action sequences. SMILE changes only the action representation, enabling longer fixed horizons while retaining each baseline's backbone and model scale. We apply SMILE to SmolVLA, Evo1, VPP, and DAWN, improving accuracy and amortized inference efficiency across LIBERO, CALVIN, and real-world experiments. SMILE-Evo1 reaches 98.0% with a 1.1x speedup on LIBERO, while SMILE-VPP reaches an average length of 4.42 with a 1.5x speedup on CALVIN. At a matched execution horizon of 10, SMILE-SmolVLA reduces non-boundary acceleration by 78.6% and velocity sign-change rate by 42.3%. Real-world xArm tests show higher success, fewer drops, and fewer contacts. These results establish smooth coefficient-space generation as a route to accurate, efficient long-horizon VLA execution. Project page: jongwoopark7978.github.io/smilevla

cs.RO

Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers

Recent machine learning research has increasingly focused on equilibrium analysis in non-cooperative games rather than solely on optimal solutions. Many such problems involve shared constraints and can be formulated as Generalized Nash Equilibrium Problems (GNEPs). For strongly monotone games, existing methods compute consensus-based variational GNEs (v-GNEs) by exchanging Lagrange multipliers. We propose a fully distributed continuous-time algorithm for shared linear equality constraints that converges without multiplier exchange and reaches any GNE, reducing communication overhead and improving privacy. Discrete-time schemes are also provided, and the method is validated on a multi-robot placement task.

cs.LG

Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard

Anonymous Multi-Agent Path Finding (AMAPF) admits polynomial-time network-flow algorithms for several objectives, including makespan, total distance, and sum-of-costs (SoC) when agents disappear upon reaching goals. We show that standard goal-staying AMAPF is fundamentally different. We first formulate SoC minimization by augmenting the standard time-expanded flow model with goal-settlement constraints and show that the resulting linear programming relaxation is non-integral. We then prove that minimizing SoC in goal-staying AMAPF is NP-hard via a reduction from 3-SAT. Together with the polynomial-time result for the disappearing variant, this establishes a sharp complexity boundary determined by whether completed agents remain at their goals.

cs.MA