IEEE/ICACT20210203 Slide.13
[Big Slide]
Oral Presentation 
| Virual Oral Presentation Slide by Slide |
|
IEEE/ICACT20210203 Slide.13
[Big Slide]
| Oral Presentation |
|
|
|
The D star algorithm is also known as the dynamic version of the A star algorithm without the heuristic function. A star algorithm has an evaluation function fn as the equation below. From the equation, gn and hn are operating cost function and heuristic function, respectively. The D star algorithm process is to find the shortest path in graphs based on weight changes during the processing time. | |
| [Go to Next Slide] |