講者：Tsai-Yen Li
日期：2020-04-04
觀看: 1093
  • 00:00 1.
    Design of Motion Planning Algorithms
  • 05:48 2.
    Design Guidelines
  • 19:27 3.
    Artificial Potential Fields for Lower-Dimensional C-Space
  • 29:08 4.
    Examples of Arbitration Functions
  • 41:34 5.
    Best-First Search Algorithm
  • 42:01 6.
    Best-First Search Algorithm
  • 55:11 7.
    Randomized Path Planning with Potential Fields for High DOF
  • 1:15:28 8.
    Probabilistic Roadmap (PRM)
  • 1:16:42 9.
    Probabilistic Roadmap (PRM)
  • 1:16:54 10.
    Probabilistic Roadmap (PRM)
  • 1:17:00 11.
    Probabilistic Roadmap (PRM)
  • 1:17:04 12.
    Probabilistic Roadmap (PRM)
  • 1:17:19 13.
    Probabilistic Roadmap (PRM)
  • 1:17:49 14.
    Probabilistic Roadmap (PRM)
  • 1:17:55 15.
    Probabilistic Roadmap (PRM)
  • 1:19:04 16.
    Probabilistic Roadmap (PRM)
  • 1:20:01 17.
    Probabilistic Roadmap (PRM)
  • 1:20:12 18.
    Probabilistic Roadmap (PRM)
  • 1:21:47 19.
    The Growing Process of Rapidly-exploring Random Tree (RRT)
  • 1:26:09 20.
    The RRT Algorithm
  • 1:30:01 21.
    The RRT-Connect Algorithm
  • 1:33:30 22.
    The RRT-Connect Algorithm
  • 1:33:58 23.
    The RRT-Connect Algorithm
  • 1:42:50 24.
    The RRT-Connect Algorithm
  • 1:43:13 25.
    The RRT-Connet Algorithm
  • 1:46:57 26.
    Conclusions
  • 索引
  • 筆記
  • 全螢幕
gra02-4
長度: 1:53:51, 瀏覽: 1094, 最近修訂: 2020-04-04
    上一篇 下一篇
    • 00:00 1.
      Design of Motion Planning Algorithms
    • 05:48 2.
      Design Guidelines
    • 19:27 3.
      Artificial Potential Fields for Lower-Dimensional C-Space
    • 29:08 4.
      Examples of Arbitration Functions
    • 41:34 5.
      Best-First Search Algorithm
    • 42:01 6.
      Best-First Search Algorithm
    • 55:11 7.
      Randomized Path Planning with Potential Fields for High DOF
    • 1:15:28 8.
      Probabilistic Roadmap (PRM)
    • 1:16:42 9.
      Probabilistic Roadmap (PRM)
    • 1:16:54 10.
      Probabilistic Roadmap (PRM)
    • 1:17:00 11.
      Probabilistic Roadmap (PRM)
    • 1:17:04 12.
      Probabilistic Roadmap (PRM)
    • 1:17:19 13.
      Probabilistic Roadmap (PRM)
    • 1:17:49 14.
      Probabilistic Roadmap (PRM)
    • 1:17:55 15.
      Probabilistic Roadmap (PRM)
    • 1:19:04 16.
      Probabilistic Roadmap (PRM)
    • 1:20:01 17.
      Probabilistic Roadmap (PRM)
    • 1:20:12 18.
      Probabilistic Roadmap (PRM)
    • 1:21:47 19.
      The Growing Process of Rapidly-exploring Random Tree (RRT)
    • 1:26:09 20.
      The RRT Algorithm
    • 1:30:01 21.
      The RRT-Connect Algorithm
    • 1:33:30 22.
      The RRT-Connect Algorithm
    • 1:33:58 23.
      The RRT-Connect Algorithm
    • 1:42:50 24.
      The RRT-Connect Algorithm
    • 1:43:13 25.
      The RRT-Connet Algorithm
    • 1:46:57 26.
      Conclusions
    位置
    1. 知識庫
    2. ...
    3. 資科系 李蔡彥老師
    資料夾名稱
    資科系 李蔡彥老師
    上傳者
    李蔡彥
    單位
    nccu
    建立
    2020-04-04 00:53:10
    最近修訂
    2020-04-04 05:45:47
    長度
    1:53:51
    © Copyright since 2016 by NATIONAL CHENGCHI UNIVERSITY
    All rights reserved.