In this paper, we consider several autonomous robots with separate tasks that require coordination, but not a coupling at every decision step. We assume that each robot separately acquires its task, possibly from different providers. We address the problem of multiple robots incrementally acquiring tasks that require their sparse-coordination. To this end, we present an approach to provide tasks to multiple robots, represented as sequences, conditionals, and loops of sensing and actuation primitives. Our approach leverages principles from sparse-coordination to acquire and represent these joint-robot plans compactly. Specifically, each primitive has associated preconditions and effects, and robots can condition on the state of one another. Robots share their state externally using a common domain language. The complete sparse-coordination framework runs on several robots. We report on experiments carried out with a Baxter manipulator and a CoBot mobile service robot.


    Access

    Download


    Export, share and cite



    Title :

    Multi-robot task acquisition through sparse coordination



    Publication date :

    2015-01-01



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    MULTI-AGENT COORDINATION UNDER SPARSE NETWORKING

    LALONDE GEOFFREY / ANDERSON-SPRECHER PETER | European Patent Office | 2022

    Free access

    Multi-agent coordination under sparse networking

    LALONDE GEOFFREY / ANDERSON-SPRECHER PETER ELVING | European Patent Office | 2021

    Free access

    Multi-agent coordination under sparse networking

    LALONDE GEOFFREY / ANDERSON-SPRECHER PETER | European Patent Office | 2019

    Free access

    Temporal Logic Robot Task Planning with Active Acquisition of Information

    Zhao, Jiawei / Yin, Xiang / Li, Shaoyuan | IEEE | 2022


    Robust Visual Tracking via Structured Multi-Task Sparse Learning

    Zhang, T. / Ghanem, B. / Liu, S. et al. | British Library Online Contents | 2013