Learning To Switch Among Agents In A Team Via 2-layer Markov Decision Processes

Abstract

Reinforcement learning agents have been mostly developed and evaluated under the assumption that they will operate in a fully autonomous manner -- they will take all actions. In this work, our goal is to develop algorithms that, by learning to switch control between agents, allow existing reinforcement learning agents to operate under different automation levels. To this end, we first formally define the problem of learning to switch control among agents in a team via a 2-layer Markov decision process. Then, we develop an online learning algorithm that uses upper confidence bounds on the agents' policies and the environment's transition probabilities to find a sequence of switching policies. The total regret of our algorithm with respect to the optimal switching policy is sublinear in the number of learning steps and, whenever multiple teams of agents operate in a similar environment, our algorithm greatly benefits from maintaining shared confidence bounds for the environments' transit

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keybalazadeh2020learning

Related papers

• Learning To Collaborate In Markov Decision Processes (2019)0.00
• Learning When To Switch: Adaptive Policy Selection Via Reinforcement Learning (2025)0.00
• Achieving Fairness In Multi-agent Markov Decision Processes Using Reinforcement Learning (2023)0.00
• Online Reinforcement Learning In Markov Decision Process Using Linear Programming (2023)3.58
• Intrinsically Motivated Hierarchical Policy Learning In Multi-objective Markov Decision Processes (2023)4.52
• Optimal Decision-making In Mixed-agent Partially Observable Stochastic Environments Via Reinforcement Learning (2019)0.00
• Research On Multi-agent Communication And Collaborative Decision-making Based On Deep Reinforcement Learning (2023)0.00
• Configurable Markov Decision Processes (2018)0.00