addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgooglegroupsimageimagesinstagramlinklocation-pinm-swarmSearchmailmessagesminusmoremuplabelShape 3 + Rectangle 1outlookpersonJoin Group on CardStartprice-ribbonImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruseryahoo

Data meets nice people IV

Dear nice people,

everything's set up for the next event. Please find the schedule below.

As always, if you cannot attend, then remove your registration. This helps us a lot with the planning. Thanks.

I'm looking forward to the evening.





19:00 doors open

19:15 Welcome @ GameDuell

19:25 Talk: Dror Atariah - On Sampling Based Algorithms for Solving the Motion Planning Problem  (30 mins + 5 mins questions; see abstract below)

20:00 break

20:10 Talk: Tom Ron - Learning Chess from Data (20 mins + 5 mins questions)

20:35 Talk: Daniel Waeber - Prediction and More with Convergent Cross Mapping (20 mins + 5 mins questions)

21:00 eating, drinking, socializing

23:00 doors closed


Abstract: Dror Atariah - On Sampling Based Algorithms for Solving the Motion Planning Problem

Given a robot and a workspace scattered with obstacles, a natural problem to consider is the motion planning problem (a.k.a. the "piano movers problem"). That is, given the source and target placements of the robot in the workspace, determine whether the robot can move from one placement to the other. Additionally, if such movement is possible, a feasible description is also desired. This problem was first posed over four decades ago.
A sample based algorithm for solving the motion planning problem functions in two phases. First, it studies the connectivity of the corresponding configuration space. Second, based on the study phase, it answers queries determining whether and how the robot can be moved from one placement to the other.
In this talk we present in detail one of the most celebrated sample based algorithms: the Probabilistic Roadmap Method. We elaborate on some implementation details of the method and prove that it is probabilistically complete. Furthermore, we briefly present a more recent sampling based algorithm known as the Motion Planning via Manifold Samples.

Join or login to comment.

  • Michael K.

    The event was brilliant. Many thanks to the organizers!

    September 20, 2014

  • Dror A.

    Great talks! great event! Great venue! Big thanks to all how took part in it! BTW, you can find the sources of my slides here:

    1 · September 19, 2014

  • Alexander W.

    Thanks all for coming. It was a great event.

    The slides are already available:

    See you in November.

    2 · September 19, 2014

  • Bernd Jürgen S.

    It was nice to meet people again which I already knew from Haskell, Scala, Python, C++, Radical Honesty and of cause Algorithms & Data Challenges Meetups. ;-)

    September 19, 2014

  • Ines

    Was nice meeting all of you. :)

    September 19, 2014

  • Michael Arthur B.

    Thank you a lot for the meetup. Enjoyed it a lot :=)

    September 18, 2014

  • Alexander W.

    Schedule finalized! Looking forward to a great event.

    6 · September 2, 2014

  • Alexander W.

    Third talk confirmed! Daniel Waeber - Prediction and More with Convergent Cross Mapping.

    1 · August 25, 2014

  • Alexander W.

    Second talk confirmed! Tom Ron - Learning Chess from Data.

    1 · August 5, 2014

  • Alexander W.

    First talk confirmed! Dror Atariah - On Sampling Based Algorithms for Solving the Motion Planning Problem.

    June 20, 2014

  • Alexander W.

    Location found! The September's event will take place at GameDuell's impressive office close to Gendarmenmarkt.

    June 19, 2014

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy