By Topic

Cooperative graph search by a system of autonomous agents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Hill, J.C. ; Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA ; Nokleby, M.S. ; Archibald, J.K. ; Frost, R.L.
more authors

Searching a random graph is known to be computationally complex. The classic example for the single agent case is the traveling salesman problem. In this paper, we generalize to the multi-agent case where n autonomous agents must cooperate to visit all the nodes of a random graph in an efficient manner. We impose a limitation on the agent's ability to communicate with each other. A satisficing game approach is ideally suited to this problem since it accommodates multiple solutions for each player and provides the opportunity for negotiation. We demonstrate performance of this approach on both deterministic and random graphs with up to 100 nodes.

Published in:

Systems, Man and Cybernetics, 2005 IEEE International Conference on  (Volume:1 )

Date of Conference:

10-12 Oct. 2005