Plan reuse in cooperative, distributed problem-solving

    Research output: Contribution to journalArticle

    Abstract

    This paper considers cooperative and distributed problem-solving in an environment where similar problems are repeatedly posed, and discusses methods for plan reuse. In distributed planning including multiple agents, the agents generate the plan cooperatively from various viewpoints which results in a plan with high cost. The reuse of the plan realizes efficient planning by utilizing the plan for similar previous problems. The first feature to note in applying plan reuse to a multi-agent system is the problem similarity. Even if an agent decides that two problems are the same, another agent may consider a totally different goal or viewpoint. In this paper, it is shown that under certain conditions, the reuse of a plan is effective independently of the goals of other agents. A planning method including reuse is presented. Finally, it is shown experimentally that efficient planning can be realized.

    Original languageEnglish
    Pages (from-to)60-67
    Number of pages8
    JournalSystems and Computers in Japan
    Volume28
    Issue number6
    Publication statusPublished - 1997 Jun 15

    Fingerprint

    Reuse
    Planning
    Multi agent systems
    Multi-agent Systems
    Costs

    Keywords

    • Cooperation
    • Distributed artificial intelligence
    • Distribution
    • Elimination of competition
    • Learning
    • Multi-agent system
    • Planning

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Information Systems
    • Theoretical Computer Science
    • Computational Theory and Mathematics

    Cite this

    Plan reuse in cooperative, distributed problem-solving. / Sugawara, Toshiharu.

    In: Systems and Computers in Japan, Vol. 28, No. 6, 15.06.1997, p. 60-67.

    Research output: Contribution to journalArticle

    @article{fcee7837f7ab4223a92f8d9a6aa1673b,
    title = "Plan reuse in cooperative, distributed problem-solving",
    abstract = "This paper considers cooperative and distributed problem-solving in an environment where similar problems are repeatedly posed, and discusses methods for plan reuse. In distributed planning including multiple agents, the agents generate the plan cooperatively from various viewpoints which results in a plan with high cost. The reuse of the plan realizes efficient planning by utilizing the plan for similar previous problems. The first feature to note in applying plan reuse to a multi-agent system is the problem similarity. Even if an agent decides that two problems are the same, another agent may consider a totally different goal or viewpoint. In this paper, it is shown that under certain conditions, the reuse of a plan is effective independently of the goals of other agents. A planning method including reuse is presented. Finally, it is shown experimentally that efficient planning can be realized.",
    keywords = "Cooperation, Distributed artificial intelligence, Distribution, Elimination of competition, Learning, Multi-agent system, Planning",
    author = "Toshiharu Sugawara",
    year = "1997",
    month = "6",
    day = "15",
    language = "English",
    volume = "28",
    pages = "60--67",
    journal = "Systems and Computers in Japan",
    issn = "0882-1666",
    publisher = "John Wiley and Sons Inc.",
    number = "6",

    }

    TY - JOUR

    T1 - Plan reuse in cooperative, distributed problem-solving

    AU - Sugawara, Toshiharu

    PY - 1997/6/15

    Y1 - 1997/6/15

    N2 - This paper considers cooperative and distributed problem-solving in an environment where similar problems are repeatedly posed, and discusses methods for plan reuse. In distributed planning including multiple agents, the agents generate the plan cooperatively from various viewpoints which results in a plan with high cost. The reuse of the plan realizes efficient planning by utilizing the plan for similar previous problems. The first feature to note in applying plan reuse to a multi-agent system is the problem similarity. Even if an agent decides that two problems are the same, another agent may consider a totally different goal or viewpoint. In this paper, it is shown that under certain conditions, the reuse of a plan is effective independently of the goals of other agents. A planning method including reuse is presented. Finally, it is shown experimentally that efficient planning can be realized.

    AB - This paper considers cooperative and distributed problem-solving in an environment where similar problems are repeatedly posed, and discusses methods for plan reuse. In distributed planning including multiple agents, the agents generate the plan cooperatively from various viewpoints which results in a plan with high cost. The reuse of the plan realizes efficient planning by utilizing the plan for similar previous problems. The first feature to note in applying plan reuse to a multi-agent system is the problem similarity. Even if an agent decides that two problems are the same, another agent may consider a totally different goal or viewpoint. In this paper, it is shown that under certain conditions, the reuse of a plan is effective independently of the goals of other agents. A planning method including reuse is presented. Finally, it is shown experimentally that efficient planning can be realized.

    KW - Cooperation

    KW - Distributed artificial intelligence

    KW - Distribution

    KW - Elimination of competition

    KW - Learning

    KW - Multi-agent system

    KW - Planning

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

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

    M3 - Article

    AN - SCOPUS:0031170051

    VL - 28

    SP - 60

    EP - 67

    JO - Systems and Computers in Japan

    JF - Systems and Computers in Japan

    SN - 0882-1666

    IS - 6

    ER -