Software > Software
D star light
RoenZ:
Does anyone know how to implemented it in Delphi???
Thx
JesseWelling:
I just found out the algorithm I really need to use. it's called.... dun dun dun.... Field D* of all things. It works by doing an linear approximation of path between nodes to travel between them. It's very 1337. I have a good paper (1.8MB pdf) by Dave Ferguson and Anthony Stentz of CMU (Admin might know them of them) explaining it. If any one is interested just pm me with an e-mail address and I'll send it to you.
As for the Delphi question: Make the cell struct an object and go from there. I've never worked with Delphi (seems like a pretty niche language compared to C, C++ or Java) So I have no Idea but insofar as it is an object oriented language I'd start with any structs and make them objects and then make object methods and functions and then a heap container for said objects and so on.
henry:
hi...I'm college student and now I'm doing my final project in robotic...
I use D*lite in my mobile robot for path planning...
now...
I confused on the increment of open list and the sorting to find the grid which has min priority to be explored first...
I don't have any idea...where I should place the function
I'm doing my final project in delphi 7.0
can anybody help me...
henry:
any idea ???
JesseWelling:
I'm studying the papers on it.... I'll let you know when I know.
Navigation
[0] Message Index
[#] Next page
[*] Previous page
Go to full version