Path Planning Algorithm D*(Dstar) Algorithm's Time, Space, Complexity?

2018-06-13 22:24:49

I have studied about path planning.

And I know number of search algorithm like A*(Astar) and D*(Dstar) Algorithm.

1. A* is path planning algorithm in Static environment.

D* is path planning algorithm in Dynamic environment.

That's right?

If Question 1 is Correct, D*'s time or space or complexity depends on environment?

I know A*'s time Complexity O(b^d) and space Complexity O(b^d).

I want to know D*'s time and space complexity like A* in Big-O.

I'm sorry that I can't english very well. Thank you for reading my question.

链接地址: http://www.djcxy.com/p/39692.html