path planning by D star

hi, now there are many method for path planning,as A*,D*,and dijkstra and so on.when the environment is unknown or partially known,the best way is D star.are there some people interested in D*,and already simulate the algorithm? expect to communicate with you:)

[282 byte] By [tiandaochouqina] at [2007-10-2 6:58:26]

«« uploading a file using jsp and com.oreilly.servlet lib package
»» Oracle in Java

# 1

HelloI am trying to work on the same algorithms that you mentioned.<A* D*>did u implement them. I am a college student and these algorithms ve attracted me.Niket.

niksa at 2007-7-16 20:27:24 >

top of Java-index,Other Topics,Algorithms...

# 2

could anyone give me a link or a short description of D* ? thanks :)

stga at 2007-7-16 20:27:24 >

# 3

I'd be interested in knowing as well...I did a quick search and didn't find anything useful.

Autolykosa at 2007-7-16 20:27:24 >

# 4

http://www.frc.ri.cmu.edu/projects/mars/dstar.html

rkippena at 2007-7-16 20:27:24 >

# 5

HelloI am also trying to work on the same algorithm that you mentioned D* .Did u get them?I am a college student and I磀 like to see it working.ThanksRnone.

rnonea at 2007-7-16 20:27:24 >

# 6

Hi, my name is Jorge Nieto, I am PhD student and am working with D star , at the moment, I am simulating the algorithm when the map is totally known, it has worked but, when I the robot discovers a new obstacle my implementation is not working well.

Anyway, you can reach me at yunieto at hotmail dot com.

Greetings from Germany,

Jorge

Jorge_PhDa at 2007-7-16 20:27:24 >

Java programming resources: FAQs, tutorials, compiler and browser download sites, documentation, books lists, IDEs, etc.

path planning by D star

Other Topics New Topic

Other Topics Hot Topic

Other Topics

All Classified