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 language | English |
---|---|
Pages (from-to) | 60-67 |
Number of pages | 8 |
Journal | Systems and Computers in Japan |
Volume | 28 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1997 Jun 15 |
Keywords
- Cooperation
- Distributed artificial intelligence
- Distribution
- Elimination of competition
- Learning
- Multi-agent system
- Planning
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Hardware and Architecture
- Computational Theory and Mathematics