SICSA DVF Professor Esra Erdem “A Declarative Method for Dynamic Multi-Agent Path Finding”

Map Unavailable

Date(s) - 09/10/2019
11:00 am - 12:00 pm

University of St Andrews

SICSA DVF Professor Esra Erdem,  Professor in Computer Science and Engineering at Sabanci University will be giving a talk on ‘A Declarative Method for Dynamic Multi-Agent Path Finding’ at the University of St Andrews on 9th October.

he multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents such that no two agents collide with each other. We study a dynamic variant of MAPF, called D-MAPF, which allows changes in the environment (e.g., some existing obstacles may be removed from the environment or moved to some other location, or new obstacles may be included in the environment), and/or changes in the team (e.g., some existing agents may leave and some new agents may join the team) at different times. We introduce a new method to solve D-MAPF, using answer set programming

Short Bio:
Esra Erdem is an associate professor in computer science and engineering at Sabanci University. She received her Ph.D. in computer sciences at the University of Texas at Austin (2002), and carried out postdoctoral research at the University of Toronto and Vienna University of Technology from 2002 to 2006. Her research is in the area of artificial intelligence, in particular, the mathematical foundations of knowledge representation and reasoning, and their applications to cognitive robotics and computational biology.

Professor Erdem is being hosted by Professor Subramanian Ramamoorth and this talk is being organised by Professor Özgür Akgün, University of St Andrews

This entry was posted in .