Search
 
loader loading subjects...
cover
Negotiation Based Branch & Bound and the Negotiating Salesmen Problem
Dave De Jonge, Carles Sierra
91 - 100
10.3233/978-1-60750-842-7-91
Frontiers in Artificial Intelligence and Applications
Volume 232: Artificial Intelligence Research and Development
Abstract

We introduce a new multiagent negotiation algorithm that explores the space of joint plans of action: NB3. Each negotiator generates a search tree by considering both actions performed by itself and actions performed by others. In order to test the algorithm we present a new variant of the Traveling Salesman Problem, in which there is not one, but many salesmen. The salesmen need to negotiate with each other in order to minimize the distances they have to cover. Finally we present the results of some tests we did with a simple implementation of the algorithm for this problem.

$35.00 / €27.50 / £22.00
Add PDF to cart