Thursday, November 17, 2016
4–5 p.m., Avery 115
3:30 p.m., Avery 348
Sven Koenig - Distinguished SpeakerProfessor, University of Southern California
Path planning is an important technology for a large number of applications. In this talk, I discuss recent advances in path planning in the context of game programming and robotics, building on the heuristic search algorithm A*. Examples include incremental heuristic search (that is, heuristic search methods that reuse information from previous searches to search faster than repeated A* searches), any-angle search (that is, heuristic search methods that propagate information on graphs but do not restrict the resulting paths to the edges of the graph) and multi-agent path planning (that is, heuristic search methods that find collision-free paths for robot teams).
Sven Koenig is a professor in computer science at the University of Southern California. Most of his research centers around techniques for decision making (planning and learning) that enable single situated agents (such as robots or decision-support systems) and teams of agents to act intelligently in their environments and exhibit goal-directed behavior in real-time, even if they have only incomplete knowledge of their environment, imperfect abilities to manipulate it, limited or noisy perception or insufficient reasoning speed. He co-founded both Robotics: Science and Systems and the International Symposium on Combinatorial Search (SoCS) and was conference or program co-chair of SARA 2002, ICAPS 2004, AAMAS 2005, SoCS 2009, AAAI 2015, and EAAI 2016 and 2017. He is chair of the ACM Special Interest Group on Artificial Intelligence, an editor of AI Magazine and CACM, and an associate editor of AIJ, JAA! MAS, and ACS. He was a councillor of AAAI, a member of the advisory board of JAIR, an associate editor of Computational Intelligence, and a member of the steering committees of ICAPS, SoCS, and SARA. Additional information about Sven can be found on his webpages: idm-lab.org.