paper-with-me

홈 › Papers

SoftNash: Entropy-Regularized Nash Games for Non-Fighting Virtual Fixtures

2025-11-27 · Tai Inui, Jee-Hwan Ryu arxiv

Virtual fixtures (VFs) improve precision in teleoperation but often ``fight'' the user, inflating mental workload and eroding the sense of agency. We propose Soft-Nash Virtual Fixtures, a game-theoretic shared-control policy that softens the classic two-player linear-quadratic (LQ) Nash solution by inflating the fixture's effort weight with a single, interpretable scalar parameter $τ$. This yields a continuous dial on controller assertiveness: $τ=0$ recovers a hard, performance-focused Nash / virtual fixture controller, while larger $τ$ reduce gains and pushback, yet preserve the equilibrium structure and continuity of closed-loop stability. We derive Soft-Nash from both a KL-regularized trust-region and a maximum-entropy viewpoint, obtaining a closed-form robot best response that shrinks authority and aligns the fixture with the operator's input as $τ$ grows. We implement Soft-Nash on a 6-DoF haptic device in 3D tracking task ($n=12$). Moderate softness ($τ\approx 1-3$, especially $τ=2$) maintains tracking error statistically indistinguishable from a tuned classic VF while sharply reducing controller-user conflict, lowering NASA-TLX workload, and increasing Sense of Agency (SoAS). A composite BalancedScore that combines normalized accuracy and non-fighting behavior peaks near $τ=2-3$. These results show that a one-parameter Soft-Nash policy can preserve accuracy while improving comfort and perceived agency, providing a practical and interpretable pathway to personalized shared control in haptics and teleoperation.

📄 PDF Abstract BibTeX arXiv:2511.22087

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learning Nash Equilibria in Zero-Sum Stochastic Games via Entropy-Regularized Policy Approximation

2020-09-01 · Yue Guan, Qifan Zhang, Panagiotis Tsiotras

We explore the use of policy approximations to reduce the computational cost of learning Nash equilibria in zero-sum stochastic games. We propose a new Q-learning type algorithm that uses a sequence of entropy-regularize…

Multi-agent Reinforcement LearningQ-LearningScheduling

Exploratory LQG Mean Field Games with Entropy Regularization

2020-11-25 · Dena Firoozi, Sebastian Jaimungal

We study a general class of entropy-regularized multi-variate LQG mean field games (MFGs) in continuous time with $K$ distinct sub-population of agents. We extend the notion of actions to action distributions (explorator…

Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games

2024-03-25 · Muhammad Aneeq uz Zaman, Shubham Aggarwal, Melih Bastopcu, Tamer Başar

In this paper, we investigate the impact of introducing relative entropy regularization on the Nash Equilibria (NE) of General-Sum $N$-agent games, revealing the fact that the NE of such games conform to linear Gaussian …

Reinforcement Learning (RL)

Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes

2026-06-26 · Luis Leal arxiv

Many two-player zero-sum games admit not a unique Nash equilibrium but a convex set of them: a polytope of profiles that all share the minimax value V* yet prescribe different behaviour. Standard solvers each converge to…

Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization

2021-05-31 · NeurIPS 2021 12 · Shicong Cen, Yuting Wei, Yuejie Chi

This paper investigates the problem of computing the equilibrium of competitive games, which is often modeled as a constrained saddle-point optimization problem with probability simplex constraints. Despite recent effort…