Logo: University of Southern California

Events Calendar



Select a calendar:



Filter June Events by Event Type:


SUNMONTUEWEDTHUFRISAT

Events for June 16, 2022

  • Repeating EventVirtual First-Year Admission Information Session

    Thu, Jun 16, 2022 @ 04:00 PM - 05:00 PM

    Viterbi School of Engineering Undergraduate Admission

    Workshops & Infosessions


    Our virtual information session is a live presentation from a USC Viterbi admission counselor designed for high school students and their family members to learn more about the USC Viterbi undergraduate experience. Our session will cover an overview of our undergraduate engineering programs, the application process, and more on student life. Guests will be able to ask questions and engage in further discussion toward the end of the session.

    Register Here!

    Audiences: Everyone Is Invited

    View All Dates

    Contact: Viterbi Admission

    OutlookiCal
  • PhD Defense - Jiaoyang Li

    Thu, Jun 16, 2022 @ 04:00 PM - 06:00 PM

    Computer Science

    University Calendar


    PhD Candidate: Jiaoyng Li

    Title:
    Efficient and Effective Techniques for Large-Scale Multi-Agent Path Finding

    Committee:
    Sven Koenig, T. K. Satish Kumar, Satyandra K. Gupta, Nora Ayanian , and Brian C. Williams.

    Abstract:
    There is no doubt that robots will play a crucial role in the future and need to work as a team in increasingly more complex applications. Advances in robotics have laid the hardware foundations for building large-scale multi-robot systems, such as for mobile robots, vehicles, and drones. But how to coordinate robots intelligently is a difficult problem. In this dissertation, I introduce planning algorithms for solving this challenge with a focus on one fundamental problem: letting a large team of agents navigate without collisions in congested environments while minimizing their travel times. I present techniques based on heuristic search, symmetry breaking, and stochastic local search that can efficiently and effectively coordinate hundreds of agents with rigorous guarantees of completeness and even optimality and thousands of agents with good empirical performance (although no theoretical guarantees). These techniques speed up optimal and bounded-suboptimal algorithms by up to four orders of magnitude without sacrificing their theoretical guarantees and improve the solution quality of non-optimal algorithms by up to thirty-six times.

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

    WebCast Link: https://usc.zoom.us/j/93790809266?pwd=SDVIMWFtYTVtaEZpeVNGM0MxSWM2dz09

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal