Composing Option Sequences by Adaptation: Initial Results
<|reference_start|>Composing Option Sequences by Adaptation: Initial Results: Robot manipulation in real-world settings often requires adapting the robot's behavior to the current situation, such as by changing the sequences in which policies execute to achieve the desired task. Problematically, however, we show that composing a novel sequence of five deep RL options to perform a pick-and-place task is unlikely to successfully complete, even if their initiation and termination conditions align. We propose a framework to determine whether sequences will succeed a priori, and examine three approaches that adapt options to sequence successfully if they will not. Crucially, our adaptation methods consider the actual subset of points that the option is trained from or where it ends: (1) trains the second option to start where the first ends; (2) trains the first option to reach the centroid of where the second starts; and (3) trains the first option to reach the median of where the second starts. Our results show that our framework and adaptation methods have promise in adapting options to work in novel sequences.<|reference_end|>
@article{meehan2024composing,
    title={Composing Option Sequences by Adaptation: Initial Results},
    author={Charles A. Meehan and Paul Rademacher and Mark Roberts and Laura M.
  Hiatt},
    journal={arXiv preprint arXiv:2409.08195},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08195},
    primaryClass={cs.RO}
}