Presentation 2001/6/18
Optimal Multi-Agent Traversal Algorithms for Trees and Rings
Toshimitsu MASUZAWA, Hideo MASUDA, Masao MOTOYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper introduces the multi-agent traversal problem: the problem to find a travel schedule of each mobile agent so that each agent can visit all nodes and return to its originating node. The problem requires us to find the schedule with the minimum travel time under the constraint that no two agents can simultaneously occupy a node. The problem is clearly NP-hard in arbitrary networks. This paper considers the problem for trees and rings and presents the optimal traversal plans of n agents in these networks, where n is the number of nodes in a network.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) distributed system / mobile agent / multi-agent traversal problem / tree / ring
Paper # COMP2001-21
Date of Issue

Conference Information
Committee COMP
Conference Date 2001/6/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Optimal Multi-Agent Traversal Algorithms for Trees and Rings
Sub Title (in English)
Keyword(1) distributed system
Keyword(2) mobile agent
Keyword(3) multi-agent traversal problem
Keyword(4) tree
Keyword(5) ring
1st Author's Name Toshimitsu MASUZAWA
1st Author's Affiliation Graduate School of Engineering Science Osaka University()
2nd Author's Name Hideo MASUDA
2nd Author's Affiliation Cybermedia Center Osaka University
3rd Author's Name Masao MOTOYAMA
3rd Author's Affiliation Matsushita System Engineering Co.
Date 2001/6/18
Paper # COMP2001-21
Volume (vol) vol.101
Number (no) 133
Page pp.pp.-
#Pages 8
Date of Issue