Contextual bandit algorithms (epsilon-greedy and LinUCB) with SPANet features let a feeding robot acquire previously unseen foods after about ten attempts per food.
Bandit-Based Model Selection for Deformable Object Manipulation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We present a novel approach to deformable object manipulation that does not rely on highly-accurate modeling. The key contribution of this paper is to formulate the task as a Multi-Armed Bandit problem, with each arm representing a model of the deformable object. To "pull" an arm and evaluate its utility, we use the arm's model to generate a velocity command for the gripper(s) holding the object and execute it. As the task proceeds and the object deforms, the utility of each model can change. Our framework estimates these changes and balances exploration of the model set with exploitation of high-utility models. We also propose an approach based on Kalman Filtering for Non-stationary Multi-armed Normal Bandits (KF-MANB) to leverage the coupling between models to learn more from each arm pull. We demonstrate that our method outperforms previous methods on synthetic trials, and performs competitively on several manipulation tasks in simulation.
fields
cs.RO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Adaptive Robot-Assisted Feeding: An Online Learning Framework for Acquiring Previously Unseen Food Items
Contextual bandit algorithms (epsilon-greedy and LinUCB) with SPANet features let a feeding robot acquire previously unseen foods after about ten attempts per food.