Select a calendar:
Filter December Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for December 13, 2019
-
Meet USC: Admission Presentation, Campus Tour, and Engineering TalkFri, Dec 13, 2019
Viterbi School of Engineering Undergraduate Admission
Workshops & Infosessions
This half day program is designed for prospective freshmen (HS seniors and younger) and family members. Meet USC includes an information session on the University and the Admission process, a student led walking tour of campus, and a meeting with us in the Viterbi School. During the engineering session we will discuss the curriculum, research opportunities, hands-on projects, entrepreneurial support programs, and other aspects of the engineering school. Meet USC is designed to answer all of your questions about USC, the application process, and financial aid.
Reservations are required for Meet USC. This program occurs twice, once at 8:30 a.m. and again at 12:30 p.m.
Please make sure to check availability and register online for the session you wish to attend. Also, remember to list an Engineering major as your "intended major" on the webform!
Register Here
Location: Ronald Tutor Campus Center (TCC) -
Audiences: Everyone Is Invited
Contact: Viterbi Admission
-
PhD Defense - Hang Ma
Fri, Dec 13, 2019 @ 09:00 AM - 11:00 AM
Thomas Lord Department of Computer Science
University Calendar
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
