Professor:Tsai-Yen Li
Date:2022-01-31
views: 136
  • 14:27 1.
    Computer Science Special Project
  • 03:08 2.
    Introduction
  • 06:11 3.
    Position of the Field: Motion Planning
  • 04:51 4.
    Motivations and Applications
  • 04:26 5.
    Application: Movie Generation
  • 04:49 6.
    Applications: Automatic Robot Programming
  • 01:53 7.
    Applications: Maintenance Planning
  • 02:36 8.
    Applications: Radiosurgery of the Brain
  • 07:17 9.
    Applications: Generation of Plausible Docking Motions
  • 14:39 10.
    The General Path Planning Problem
  • 10:19 11.
    The General Path Planning Problem
  • 00:36 12.
    An Example with Few DOF
  • 01:00 13.
    An Example with Many DOF
  • 04:26 14.
    An Example: Coordination of Multiple Robots
  • 00:37 15.
    An Example: Manipulation Planning
  • 01:16 16.
    An Example: Nonholonomic Planning for Car-Like Robot
  • 03:06 17.
    An Example: Tractor-Trailor
  • 12:35 18.
    Defining a Simplified Problem
  • 00:21 19.
    A Sample Problem
  • 02:24 20.
    General Principle
  • 02:33 21.
    Planning Methods Overview:Cell Decomposition
  • 02:02 22.
    Exact Cell Decomposition
  • 01:31 23.
    Approximate Cell Decomposition: 2D Quadtree
  • 00:07 24.
    Approximate Cell Decomposition 3D OcTree
  • 01:17 25.
    Planning Methods Overview:Roadmap Methods
  • 01:28 26.
    Roadmap Methods
  • 01:58 27.
    Planning Methods Overview:Potential Field Methods
  • 01:42 28.
    Different Types of Potential Fields
  • 02:23 29.
    Example of Analytical Definition
  • 02:20 30.
    Local Minima in a Potential Field
  • Index
  • Notes
  • Fullscreen
csproj.fsp
Duration: 1:58:34, Browse: 136, Last Updated: 2022-01-31
    • 14:27 1.
      Computer Science Special Project
    • 03:08 2.
      Introduction
    • 06:11 3.
      Position of the Field: Motion Planning
    • 04:51 4.
      Motivations and Applications
    • 04:26 5.
      Application: Movie Generation
    • 04:49 6.
      Applications: Automatic Robot Programming
    • 01:53 7.
      Applications: Maintenance Planning
    • 02:36 8.
      Applications: Radiosurgery of the Brain
    • 07:17 9.
      Applications: Generation of Plausible Docking Motions
    • 14:39 10.
      The General Path Planning Problem
    • 10:19 11.
      The General Path Planning Problem
    • 00:36 12.
      An Example with Few DOF
    • 01:00 13.
      An Example with Many DOF
    • 04:26 14.
      An Example: Coordination of Multiple Robots
    • 00:37 15.
      An Example: Manipulation Planning
    • 01:16 16.
      An Example: Nonholonomic Planning for Car-Like Robot
    • 03:06 17.
      An Example: Tractor-Trailor
    • 12:35 18.
      Defining a Simplified Problem
    • 00:21 19.
      A Sample Problem
    • 02:24 20.
      General Principle
    • 02:33 21.
      Planning Methods Overview:Cell Decomposition
    • 02:02 22.
      Exact Cell Decomposition
    • 01:31 23.
      Approximate Cell Decomposition: 2D Quadtree
    • 00:07 24.
      Approximate Cell Decomposition 3D OcTree
    • 01:17 25.
      Planning Methods Overview:Roadmap Methods
    • 01:28 26.
      Roadmap Methods
    • 01:58 27.
      Planning Methods Overview:Potential Field Methods
    • 01:42 28.
      Different Types of Potential Fields
    • 02:23 29.
      Example of Analytical Definition
    • 02:20 30.
      Local Minima in a Potential Field
    Location
    Folder name
    資科系 李蔡彥老師
    Author
    李蔡彥
    Branch
    nccu
    Created
    2022-01-31 15:51:54
    Last Updated
    2022-01-31 16:42:54
    Browse
    136
    Duration
    1:58:34