We are pleased to invite you to attend the lunch seminar:
Tuesday September 4 2018,12.30-13.30
3ME, collegezaal C, Mekelweg 2
lunch buffet open from 12.00
*Please forward this invitation to interested students and employees
Multi-Robot Motion Planning: The Easy, the Hard and the Uncharted
Tel Aviv University
Early results in robot motion planning had forecast a bleak future for the field by showing that problems with many degrees of freedom, and in particular those involving fleets of robots, are intractable.
Then came sampling-based planners, which have been successfully, and
often easily, solving a large variety of problems with many degrees of freedom.
We strive to formally determine what makes a motion-planning problem with many degrees of freedom easy or hard. In the first part of the talk I'll describe our quest to resolve this (still wide open) problem, and some progress we have made in the context of multi-robot motion planning.
In the second part of the talk I'll review recent algorithms that we have developed for multi-robot motion planning, which come with near-or asymptotic-optimality guarantees.
Dan Halperin received his Ph.D. in Computer Science from Tel Aviv University.
He then spent three years at the Computer Science Robotics Laboratory at Stanford University.
In 1996 he joined the School of Computer Science at Tel Aviv University, where he is currently a full professor. Halperin's main field of research is Computational Geometry and its Applications.
A major focus of his work has been in research and development of robust geometric software, principally as part of the CGAL project and library.
The application areas he is interested in include robotics, automated manufacturing, algorithmic motion planning and 3D printing.
Halperin was named an IEEE Fellow in 2015. http://acg.cs.tau.ac.il/danhalperin
We are looking forward to see you all on September 4th
Karin van Tongeren
Secretary Robotics Institute