Events Calendar

PhD Defense - Hang Ma

Time: Friday, December 13, 2019, 9:00 AM-11:00 AM

Location: SAL 322

Candidate: Hang Ma

Committee: Sven Koenig (Chair), T. K. Satish Kumar, Satyandra K. Gupta (Outside Member), Peter Stone (External Member)

Title: Task and Path Planning for Teams of Agents

Abstract: In many real-world applications of multi-agent systems, teams of agents must assign tasks among themselves and plan collision-free paths to the task locations. The resulting coordination problems are fundamental for these multi-agent systems but, at the same time, computationally challenging, as there are often many agents and their operating time is long. We formalize two types of multi-agent coordination problems: (a) One-shot coordination problems that assign given tasks to and plan paths for a given set of agents on a given graph that models the environment. (b) Long-term coordination problems that repeatedly assign new tasks and plan paths for the agents after they finish their current tasks. We study the theoretical properties of these problems, develop algorithms for solving them, and demonstrate our algorithms using simulated and real-world agents.

Location: Henry Salvatori Computer Science Center (SAL) - 322

Audiences: Everyone Is Invited

Contact: Lizsl De Leon