TY - GEN
T1 - Shared Control with Black Box Agents Using Oracle Queries
AU - Avraham, Inbal
AU - Mirsky, Reuth
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025/1/1
Y1 - 2025/1/1
N2 - Shared control problems deal with an agent learning to act in collaboration with other agents or systems. When learning a shared control policy, often a short communication between the agents can significantly reduce running times and improve the system's accuracy. We extend the shared control problem to include the ability to directly query a cooperating agent. We consider two types of potential responses to a query, namely oracles: one that assumes that the oracle has a perfect knowledge of the shared system and can provide the learner with the best action it should take, even when that action might be myopically wrong (a teacher), and one with a bounded knowledge limited to its own part of the system (an expert). Given this additional information channel, this work presents several heuristics for choosing when to query: reinforcement learning-based, utility-based, and entropy-based. These heuristics are aimed at reducing the overall learning cost of a system. Empirical results on two domains show the benefits of querying to learn a better control policy and demonstrate the tradeoffs between the proposed heuristics.
AB - Shared control problems deal with an agent learning to act in collaboration with other agents or systems. When learning a shared control policy, often a short communication between the agents can significantly reduce running times and improve the system's accuracy. We extend the shared control problem to include the ability to directly query a cooperating agent. We consider two types of potential responses to a query, namely oracles: one that assumes that the oracle has a perfect knowledge of the shared system and can provide the learner with the best action it should take, even when that action might be myopically wrong (a teacher), and one with a bounded knowledge limited to its own part of the system (an expert). Given this additional information channel, this work presents several heuristics for choosing when to query: reinforcement learning-based, utility-based, and entropy-based. These heuristics are aimed at reducing the overall learning cost of a system. Empirical results on two domains show the benefits of querying to learn a better control policy and demonstrate the tradeoffs between the proposed heuristics.
KW - HumanAgent Interaction
KW - Interactive Learning
KW - Shared Control
UR - https://www.scopus.com/pages/publications/105016149236
U2 - 10.1109/ICAD65464.2025.11114031
DO - 10.1109/ICAD65464.2025.11114031
M3 - Conference contribution
AN - SCOPUS:105016149236
T3 - 2025 IEEE Conference on AI and Data Analytics, ICAD 2025
BT - 2025 IEEE Conference on AI and Data Analytics, ICAD 2025
PB - Institute of Electrical and Electronics Engineers
T2 - 2025 IEEE International Conference on AI and Data Analytics, ICAD 2025
Y2 - 24 June 2025
ER -