IEEE NSW QLD RAS Joint DL Event: Multi-Robot Motion Planning

Share

IEEE Robotics and Automation Society NSW and QLD Chapters present a joint Distinguished Lecture Event titled "Multi-Robot Motion Planning: The Easy, the Hard and the Uncharted" by Prof. Dan Halperin, FIEEE. 


Multi-Robot Motion Planning: The Easy, the Hard and the Uncharted
Dan Halperin, Tel Aviv University

Abstract:
There are multi-robot motion planning (MRMP) problems involving dozens of robots, which can be speedily solved, while others are practically unsolvable. What makes an MRMP problem easy or hard?  In the first part of the talk the DL will describe their quest to resolve this issue, and some progress they have made in the context of unlabeled MRMP.


In the second part of the talk, the DL will review recent algorithms that they have developed for various types of MRMP problems in tight obstacle-cluttered environments: from sampling-based methods tailored to the coordination of a few complex robots, to complete and exact solutions for hundreds of simply shaped robots. The talk will conclude with surprisingly open problems for the coordinated motion of two robots.

 

Biosketch:

Dan Halperin is a professor of Computer Science at Tel Aviv University. His 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 algorithms, 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 is an IEEE Fellow and an ACM Fellow. 

Webpage: http://acg.cs.tau.ac.il/danhalperin

Time:

1700HRS Sydney Time
1600HRS Brisbane Time
1900HRS Auckland Time
0800HRS Tel-Aviv Time
1130HRS India / Sri Lanka Time
1200HRS Bangladesh Time
1400HRS Singapore TIme
1500HRS Tokyo Time

Zoom Info:

Time: 

Feb 24, 2021, 05:00 PM Canberra, Melbourne, Sydney

Feb 24, 2021, 04:00 PM Brisbane    
Join from a PC, Mac, iPad, iPhone, or Android device:
    Please click this URL to start or join: https://macquarie.zoom.us/j/84504392197
 
Join from dial-in phone line:

 Israel +972 55 330 1762, +972 3 978 6688

 Australia +61 8 7150 1149, +61 2 8015 6011, +61 3 7018 2005, +61 7 3185 3730, +61 8 6119 3900,
    Meeting ID: 845 0439 2197
    International numbers available: https://macquarie.zoom.us/u/kxvNJiS5R

Join from a H.323/SIP room system:
    Dial: SIP:84504392197@zmau.us
    or 103.122.166.55
    Meeting ID: 845 0439 2197



  Date and Time

  Location

  Hosts

  Registration



  • Date: 24 Feb 2021
  • Time: 05:00 PM to 07:00 PM
  • All times are (UTC+10:00) Sydney
  • Add_To_Calendar_icon Add Event to Calendar

 

https://macquarie.zoom.us/j/84504392197
 

Feb 24, 2021, 05:00 PM Canberra, Melbourne, Sydney, 04:00 PM Brisbane    

  • SYDNEY, New South Wales
  • Australia

  • Starts 25 January 2021 01:00 AM
  • Ends 24 February 2021 05:00 PM
  • All times are (UTC+10:00) Sydney
  • No Admission Charge


  Speakers

Dan Halperin Dan Halperin

Topic:

Multi-Robot Motion Planning: The Easy, the Hard and the Uncharted

Abstract:
There are multi-robot motion planning (MRMP) problems involving dozens of robots, which can be speedily solved, while others are practically unsolvable. What makes an MRMP problem easy or hard?  In the first part of the talk the DL will describe their quest to resolve this issue, and some progress they have made in the context of unlabeled MRMP.


In the second part of the talk, the DL will review recent algorithms that they have developed for various types of MRMP problems in tight obstacle-cluttered environments: from sampling-based methods tailored to the coordination of a few complex robots, to complete and exact solutions for hundreds of simply shaped robots. The talk will conclude with surprisingly open problems for the coordinated motion of two robots.

Biography:

Dan Halperin is a professor of Computer Science at Tel Aviv University. His 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 algorithms, 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 is an IEEE Fellow and an ACM Fellow.