gra02-2 | NCCU eLearning materials

索引

00:00 1.
Planning Methods Overview:Potential Field Methods
02:24 2.
Different Types of Potential Fields
02:44 3.
Example of Analytical Definition
03:44 4.
Local Minima in a Potential Field
05:46 5.
Best-First Search Algorithm
05:54 6.
Numerical Potential Field Method
06:34 7.
Basic Incremental Scan-Line Algorithm
11:51 8.
Bresenham’s Line Scan-Conversion Algorithm (I)
20:20 9.
Bresenham’s Line Scan-Conversion Algorithm (II)
20:54 10.
Bresenham’s Line Scan-Conversion Algorithm (I)
21:15 11.
Bresenham’s Line Scan-Conversion Algorithm (II)
22:02 12.
Bresenham’s Line Scan-Conversion Algorithm (I)
22:10 13.
Bresenham’s Line Scan-Conversion Algorithm (II)
22:21 14.
Bresenham’s Line Scan-Conversion Algorithm (III)
25:22 15.
Local-Minima-Free Potential (NF1)
31:10 16.
The NF1 Algorithm
42:14 17.
Local-Minima-Free Potential (NF2)
43:03 18.
Local-Minima-Free Potential (NF2)
50:29 19.
Computing the Distance Mapfor NF2 Potential Fields
58:35 20.
Computing the Skeletonfor NF2 Potential Fields
1:04:25 21.
The NF2 Algorithm (I)
1:13:03 22.
The NF2 Algorithm (II)

筆記 (0)

未登入或權限不足!

講者：Tsai-Yen Li

日期：2020-03-19

觀看: 1108

00:00 1.
Planning Methods Overview:Potential Field Methods
02:24 2.
Different Types of Potential Fields
02:44 3.
Example of Analytical Definition
03:44 4.
Local Minima in a Potential Field
05:46 5.
Best-First Search Algorithm
05:54 6.
Numerical Potential Field Method
06:34 7.
Basic Incremental Scan-Line Algorithm
11:51 8.
Bresenham’s Line Scan-Conversion Algorithm (I)
20:20 9.
Bresenham’s Line Scan-Conversion Algorithm (II)
20:54 10.
Bresenham’s Line Scan-Conversion Algorithm (I)
21:15 11.
Bresenham’s Line Scan-Conversion Algorithm (II)
22:02 12.
Bresenham’s Line Scan-Conversion Algorithm (I)
22:10 13.
Bresenham’s Line Scan-Conversion Algorithm (II)
22:21 14.
Bresenham’s Line Scan-Conversion Algorithm (III)
25:22 15.
Local-Minima-Free Potential (NF1)
31:10 16.
The NF1 Algorithm
42:14 17.
Local-Minima-Free Potential (NF2)
43:03 18.
Local-Minima-Free Potential (NF2)
50:29 19.
Computing the Distance Mapfor NF2 Potential Fields
58:35 20.
Computing the Skeletonfor NF2 Potential Fields
1:04:25 21.
The NF2 Algorithm (I)
1:13:03 22.
The NF2 Algorithm (II)

分享
- 嵌入網址
- QR code

索引
筆記
全螢幕

gra02-2

長度: 1:15:38, 瀏覽: 1109, 最近修訂: 2020-03-20

上一篇下一篇

索引
詳細

00:00 1.
Planning Methods Overview:Potential Field Methods
02:24 2.
Different Types of Potential Fields
02:44 3.
Example of Analytical Definition
03:44 4.
Local Minima in a Potential Field
05:46 5.
Best-First Search Algorithm
05:54 6.
Numerical Potential Field Method
06:34 7.
Basic Incremental Scan-Line Algorithm
11:51 8.
Bresenham’s Line Scan-Conversion Algorithm (I)
20:20 9.
Bresenham’s Line Scan-Conversion Algorithm (II)
20:54 10.
Bresenham’s Line Scan-Conversion Algorithm (I)
21:15 11.
Bresenham’s Line Scan-Conversion Algorithm (II)
22:02 12.
Bresenham’s Line Scan-Conversion Algorithm (I)
22:10 13.
Bresenham’s Line Scan-Conversion Algorithm (II)
22:21 14.
Bresenham’s Line Scan-Conversion Algorithm (III)
25:22 15.
Local-Minima-Free Potential (NF1)
31:10 16.
The NF1 Algorithm
42:14 17.
Local-Minima-Free Potential (NF2)
43:03 18.
Local-Minima-Free Potential (NF2)
50:29 19.
Computing the Distance Mapfor NF2 Potential Fields
58:35 20.
Computing the Skeletonfor NF2 Potential Fields
1:04:25 21.
The NF2 Algorithm (I)
1:13:03 22.
The NF2 Algorithm (II)

位置

資料夾名稱

資科系李蔡彥老師

發表人

李蔡彥

單位

nccu

建立

2020-03-19 23:39:00

最近修訂

2020-03-20 03:45:48

長度

1:15:38