Cooperative Auctions for Agent or Robot Coordination

Speaker:  Sven Koenig – Los Angeles, CA, United States
Topic(s):  Artificial Intelligence, Machine Learning, Computer Vision, Natural language processing

Abstract

Teams of agents are more robust and potentially more efficient than single agents. However, coordinating teams of agents so that they can successfully complete their mission is a challenging task. In this talk, I cover one way of efficiently and effectively coordinating teams of agents, namely auction-based methods for agent coordination, where agents bid on tasks and the tasks are then allocated to the agents by methods that resemble winner determination methods in auctions. I use multi-robot routing tasks as examples, a class of problems where a team of mobile robots has to visit a given set of locations (for example, to deliver material at construction sites or acquire rock probes from Martian rocks) so that their routes minimize the consumed energy or the task-completion time. I give an overview of various auction-based methods for agent coordination, discuss their advantages and disadvantages and compare them to each other and other coordination methods. (This talk is suitable for both audiences with a general computer science background to find out more about artificial intelligence as well as audiences with an artificial intelligence background to find out more about recent trends in artificial intelligence.)

About this Lecture

Number of Slides:  60
Duration:  50 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.