Coordinated area partitioning method by autonomous agents for continuous cooperative tasks

Vourchteang Sea, Chihiro Kato, Toshiharu Sugawara

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    We describe a method for decentralized task/area partitioning for coordination in cleaning/sweeping domains with learning to identify the easy-to-dirty areas. Ongoing advances in computer science and robotics have led to applications for covering large areas that require coordinated tasks by multiple control programs including robots. Our study aims at coordination and cooperation by multiple agents, and we discuss it using an example of the cleaning tasks to be performed by multiple agents with potentially different performances and capabilities. We then developed a method for partitioning the target area on the basis of their performances in order to improve the overall efficiency through their balanced collective efforts. Agents, i.e., software for controlling devices and robots, autonomously decide in a cooperative manner how the task/area is partitioned by taking into account the characteristics of the environment and the differences in agents’ software capability and hardware performance. During this partitioning process, agents also learn the locations of obstacles and the probabilities of dirt accumulation that express what areas are easy to be dirty. Experimental evaluation showed that even if the agents use different algorithms or have the batteries with different capacities resulting in different performances, and even if the environment is not uniform such as different locations of easy-to-dirty areas and obstacles, the proposed method can adaptively partition the task/area among the agents with the learning of the probabilities of dirt accumulations. Thus, agents with the proposed method can keep the area clean effectively and evenly.

    Original languageEnglish
    Pages (from-to)75-87
    Number of pages13
    JournalJournal of Information Processing
    Volume25
    DOIs
    Publication statusPublished - 2017

    Fingerprint

    Autonomous agents
    Software agents
    Cleaning
    Robots
    Computer science
    Computer hardware
    Robotics

    Keywords

    • Area partitioning
    • Autonomous task division
    • Continuous sweeping
    • Cooperation
    • Coordination
    • Division of labor
    • Multi-agent systems
    • Security surveillance

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Coordinated area partitioning method by autonomous agents for continuous cooperative tasks. / Sea, Vourchteang; Kato, Chihiro; Sugawara, Toshiharu.

    In: Journal of Information Processing, Vol. 25, 2017, p. 75-87.

    Research output: Contribution to journalArticle

    @article{efef762de78d4a039f533e77551b1c1c,
    title = "Coordinated area partitioning method by autonomous agents for continuous cooperative tasks",
    abstract = "We describe a method for decentralized task/area partitioning for coordination in cleaning/sweeping domains with learning to identify the easy-to-dirty areas. Ongoing advances in computer science and robotics have led to applications for covering large areas that require coordinated tasks by multiple control programs including robots. Our study aims at coordination and cooperation by multiple agents, and we discuss it using an example of the cleaning tasks to be performed by multiple agents with potentially different performances and capabilities. We then developed a method for partitioning the target area on the basis of their performances in order to improve the overall efficiency through their balanced collective efforts. Agents, i.e., software for controlling devices and robots, autonomously decide in a cooperative manner how the task/area is partitioned by taking into account the characteristics of the environment and the differences in agents’ software capability and hardware performance. During this partitioning process, agents also learn the locations of obstacles and the probabilities of dirt accumulation that express what areas are easy to be dirty. Experimental evaluation showed that even if the agents use different algorithms or have the batteries with different capacities resulting in different performances, and even if the environment is not uniform such as different locations of easy-to-dirty areas and obstacles, the proposed method can adaptively partition the task/area among the agents with the learning of the probabilities of dirt accumulations. Thus, agents with the proposed method can keep the area clean effectively and evenly.",
    keywords = "Area partitioning, Autonomous task division, Continuous sweeping, Cooperation, Coordination, Division of labor, Multi-agent systems, Security surveillance",
    author = "Vourchteang Sea and Chihiro Kato and Toshiharu Sugawara",
    year = "2017",
    doi = "10.2197/ipsjjip.25.75",
    language = "English",
    volume = "25",
    pages = "75--87",
    journal = "Journal of Information Processing",
    issn = "0387-5806",
    publisher = "Information Processing Society of Japan",

    }

    TY - JOUR

    T1 - Coordinated area partitioning method by autonomous agents for continuous cooperative tasks

    AU - Sea, Vourchteang

    AU - Kato, Chihiro

    AU - Sugawara, Toshiharu

    PY - 2017

    Y1 - 2017

    N2 - We describe a method for decentralized task/area partitioning for coordination in cleaning/sweeping domains with learning to identify the easy-to-dirty areas. Ongoing advances in computer science and robotics have led to applications for covering large areas that require coordinated tasks by multiple control programs including robots. Our study aims at coordination and cooperation by multiple agents, and we discuss it using an example of the cleaning tasks to be performed by multiple agents with potentially different performances and capabilities. We then developed a method for partitioning the target area on the basis of their performances in order to improve the overall efficiency through their balanced collective efforts. Agents, i.e., software for controlling devices and robots, autonomously decide in a cooperative manner how the task/area is partitioned by taking into account the characteristics of the environment and the differences in agents’ software capability and hardware performance. During this partitioning process, agents also learn the locations of obstacles and the probabilities of dirt accumulation that express what areas are easy to be dirty. Experimental evaluation showed that even if the agents use different algorithms or have the batteries with different capacities resulting in different performances, and even if the environment is not uniform such as different locations of easy-to-dirty areas and obstacles, the proposed method can adaptively partition the task/area among the agents with the learning of the probabilities of dirt accumulations. Thus, agents with the proposed method can keep the area clean effectively and evenly.

    AB - We describe a method for decentralized task/area partitioning for coordination in cleaning/sweeping domains with learning to identify the easy-to-dirty areas. Ongoing advances in computer science and robotics have led to applications for covering large areas that require coordinated tasks by multiple control programs including robots. Our study aims at coordination and cooperation by multiple agents, and we discuss it using an example of the cleaning tasks to be performed by multiple agents with potentially different performances and capabilities. We then developed a method for partitioning the target area on the basis of their performances in order to improve the overall efficiency through their balanced collective efforts. Agents, i.e., software for controlling devices and robots, autonomously decide in a cooperative manner how the task/area is partitioned by taking into account the characteristics of the environment and the differences in agents’ software capability and hardware performance. During this partitioning process, agents also learn the locations of obstacles and the probabilities of dirt accumulation that express what areas are easy to be dirty. Experimental evaluation showed that even if the agents use different algorithms or have the batteries with different capacities resulting in different performances, and even if the environment is not uniform such as different locations of easy-to-dirty areas and obstacles, the proposed method can adaptively partition the task/area among the agents with the learning of the probabilities of dirt accumulations. Thus, agents with the proposed method can keep the area clean effectively and evenly.

    KW - Area partitioning

    KW - Autonomous task division

    KW - Continuous sweeping

    KW - Cooperation

    KW - Coordination

    KW - Division of labor

    KW - Multi-agent systems

    KW - Security surveillance

    UR - http://www.scopus.com/inward/record.url?scp=85009935513&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85009935513&partnerID=8YFLogxK

    U2 - 10.2197/ipsjjip.25.75

    DO - 10.2197/ipsjjip.25.75

    M3 - Article

    AN - SCOPUS:85009935513

    VL - 25

    SP - 75

    EP - 87

    JO - Journal of Information Processing

    JF - Journal of Information Processing

    SN - 0387-5806

    ER -