Stack Overflow
Stack Overflow

Questions tagged [d-star]

D* is a search algorithm, capable of planning paths in unknown, partially known, and changing environments in an efficient, optimal, and complete manner. It is of particular interest in mobile robotics. (Do not use for questions related to digital voice and data protocol specification for amateur radio.)

Reference:

wikipedia

22 questions
1
vote
1 answer

Defining path directions on D*Lite

I'm currently working on an implementation of the D*Lite algorithm from Sven Koenig. http://idm-lab.org/bib/abstracts/papers/aaai02b.pdf. Basically I'm trying to understand all the details before starting to implement it. It seems that the algorithm…
Ned112
  • 25
  • 5
0
votes
0 answers

D* Lite ComputeShortestPath while loop question

The ComputeShortestPath function of D* Lite looks like this: while ( U.TopKey() < CalculateKey(Sstart) OR rhs(Sstart) != g(Sstart) ) In my experience with the algorithm the first path (U.TopKey() < CalculateKey(Sstart)) is true for the very first…
OverDemon
  • 103
  • 1
  • 3
  • 8
0
votes
0 answers

D* Lite with multiple new obstacles

Summary: Is the D Lite algorithm capable of handling a lot of new obstacles at once?* Hello ^^ I've been working on implementing the D*-Lite pathfinding algorithm, as described in the 2002 article by Koenig and Likhachev, in a C++ program but am…
OverDemon
  • 103
  • 1
  • 3
  • 8
0
votes
1 answer

D* lite: what heuristic function should I use?

I'm trying to implement the D*-Lite pathfinding algorithm, as described in the 2002 article by Koenig and Likhachev for grid based navgraph. But I don't see any heuristic functions in that paper. So, what functions should I choose? Can I use…
Robotex
  • 1,064
  • 6
  • 17
  • 41
0
votes
1 answer

Implementing D * lite in UE4 for a project

I have asked this question on the forums but had no luck so far. Im a student currently trying to implement dynamic pathfinding for my fyp. Im been working with UE4 for the past few weeks because I decide to try and implement the D * lite…
Ethan Macnamara
  • 3
  • 3
0
votes
1 answer

Dynamic obstacles avoidance in navigation mesh system

I've built my path finding system with unreal engine, somehow the path finding part works just fine while i can't find a proper way to solve dynamic obstacles avoidance problem. My characters are walking allover the map and collide with each other…
Variable
  • 1
  • 1
  • 1
0
votes
1 answer

Optimized pseudo code for D*Lite

I'm looking at the optimized version of the DLite: procedure CalculateKey(s) {01”} return [min(g(s), rhs(s)) + h(s_start, s) + km;min(g(s), rhs(s))]; procedure Initialize() {02”} U = ∅; {03”} km = 0; {04”} for all s ∈ S rhs(s) = g(s) = ∞; {05”}…
Ned112
  • 25
  • 5
1
2