Aug 2026· IEEE International Symposium on Robot and Human Interactive Communication· pp. 2469-2475· 0 citations· 23 references
Computer ScienceEngineering
TL;DR
A cooperative game-theoretic framework for authority switching in shared autonomy is developed, forming the control switching problem as an identical-interest dynamic game in which authority transitions are embedded into the system dynamics, yielding optimal switching policies rather than ad hoc rules.
Abstract
Shared autonomy requires principled mechanisms for allocating and transferring control between a human and an autonomous agent. Existing approaches often rely on blending control inputs or heuristic switching rules, which lack theoretical guarantees and fail to account for the human's likelihood of intervention. This paper presents Flip-Team, a cooperative framework for authority switching in shared autonomy. We formulate the control switching problem as a team-optimal decision problem in which authority transitions are embedded into the system dynamics, yielding optimal switching policies rather than ad hoc rules. We model the human's override propensity, the likelihood of exercising override authority, and derive a critical threshold that determines when human intervention is cost-effective. For linear-quadratic systems, we derive closed-form switching conditions and value function recursions, enabling efficient computation independent of the continuous state dimension. We further propose an online method to estimate override propensity from observed interventions, enabling adaptive switching without prior calibration. Evaluation on a quadrotor altitude regulation task demonstrates that Flip-Team achieves lower cost than always-human and always-autonomous baselines, with selective authority switching that balances human adaptability and autonomous efficiency.
A cooperative game-theoretic framework for authority switching in shared autonomy is developed, forming the control switching problem as an identical-interest dynamic game in which authority transitions are embedded into the system dynamics, yielding optimal switching policies rather than ad hoc rules.
This paper proposes a fully data-driven motion-planning framework for homogeneous linear multi-agent systems that operate in shared, obstacle-filled workspaces without access to explicit system models. Each agent independently learns its closed-loop behavior from experimental data by solving convex semidefinite program...
Babak Esmaeili, H. Modares· IEEE Open Journal of Control...· 0 citations
A novel way is presented to characterize collective belief dynamics as a discrete-time switched system in which communication topologies have distinct consensus-contraction rates and token costs, and defines a consensus safe set that jointly captures agreement and resource feasibility.
Research, innovation and practical capital investment have been increasing rapidly toward the realization of autonomous physical agents. This includes industrial and service robots, unmanned aerial vehicles, embedded control devices, and a number of other realizations of cybernetic/mechatronic implementations of inte...
V. Kungurtsev, Alessandro Di Frenna, Gustav Šír et al.· Expert systems· 0 citations
This paper considers decentralized contingency MPC for multi-agent control under a state-only information pattern, with particular focus on limited sensing and plug-and-play operation. The objective is to retain recursive feasibility, safety, and Lyapunov-type convergence while reducing conservatism in local interactio...
This paper presents an iterative Linear Quadratic (LQ) game framework for multi-manipulator motion planning, where each manipulator is modeled as an independent agent optimizing its own objective while interacting with other agents based on shared global states and collision constraints.
Junyoung Kim, Han-Wen Ren, Lei Zhang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.