KAIST Logo

Department of Computer Science
Korea Advanced Institute of Science and Technology (KAIST)

CS686: Robot Motion Planning and Applications (Spring 2017)


CS686: Robot Motion Planning and Applications (Spring 2017)

Instructor: Sung-eui Yoon


When and where: 13:00-14:15pm on TTh at Room 3444 in the 3rd floor of the CS building(E3-1)
First class: 1:00 pm on Mar-2 (Th) (please come to first class for more information)
Please refer to the first lecture slide for other course information
Textbook: Planning Algorithms, Steven M. LaValle, 2006 (online version is available)
My ongoing book: Lecture on Advanced Techniques for Motion Planning and Collision Detection, Sung-eui Yoon, 2017 Draft version
Discussion: Noah board
Previous Board(Fall 2013): Noah board(2013)
Question Page: Question submission form
Paper Summary Page: Paper summary submission form


Line

Outline

  • Course overview
  • Lectures and tentative schedule
  • Student presentations
  • Additional reference materials
  • Line

    Course overview

    A robot in a complex 3D CAD model (a power plant model)

    It is expected that robots with some sort of intelligence will be a part of our lives in future. Many challenges are ahead of us to realize robots to be a part of our lives. In this course, we will consider issues of motion planning of real and virtual robots for various applications. We will focus more on virtual robots and their applications in games, movies, virtual prototyping, crowd simulations. We will go over basic materials related to motion planning and their applications.

    What you will get at the end of the course:

  • Broad understanding on various motion planning methods
  • In-depth knowledge on recent methods related to motion planning
  • What you will do:

  • Choose and present a few papers from recent robotics conf. like ICRA, IROS, etc.
  • Final project: come up with your own idea related to the topic, (optionally) implement it to improve the state-of-the-art techniques
  • Mid-term exam: reviewing basic motion planning methods
  • Line

    Lecture schedule (subject to change)

    # of lecture, date Topics and slides Related material(s) / Note(s)
    Mar - 2 Overview on the course and course policy
    Mar - 7 Path Planning for Point Robots
    Mar - 9 Classic Motion Planning Methods
    Mar - 14 Configuration Space I
    Mar - 16 Configuration Space II
    Mar - 21 Proximity Queries
    Mar - 23 Probabilistic Roadmaps
    Mar - 28
    Mar - 30
    No class due to attending a conference
    Apr - 4
    Apr - 6
    Apr - 11
    Apr - 13
    Apr - 18 Mid-term exam
    Apr - 20 No calss (midterm week)
    Apr - 25 Student Presentation I
    Apr - 27 Student Presentation I
    May - 2 Student Presentation I
    May - 4 Student Presentation I
    May - 9 No class due to presidential election
    May - 11 Mid-term project presentation
    May - 16 Mid-term project presentation
    May - 18 Student Presentation II
    May - 23 Student Presentation II
    May - 25 Student Presentation II
    May - 30 Student Presentation II
    Jun - 1 Final-term project presentation
    Jun - 8 Final-term project presentation
    Jun - 13 Reserved
    Line

    Student presentations and reports

    For your presentations, please use the this powerpoint template; paper presentation guideline is available.

    Line

    Additional reference materials and links


    Public software:

    The Open Motion Planning Library (OMPL) from the Kavraki Lab at Rice University

    Possible project topics from Prof. Latombe's class

    Previous course homepage: Fall 15 Fall 13 Fall 11 Fall 09

    Links to websites of some well-known researchers in motion planning

    Paper search:

  • Google scholar
  • Tim Rowley's graphics paper collections
  • Ke-Sen Huang's graphics paper collections
  • Line

    Acknowledgements: The course materials are based on those of Prof. Dinesh Manocha (UNC-Chapel Hill) and Prof. David Hsu (NUS). Thank you so much! Line

    Copyright 2011. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the author.

    This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.