Has anyone ever done any thinking on how to do path finding with using the A* algorithm. I''m asking because I''m working in an environment where objects are moving on a pixel by pixel basis and are of a large number of sizes. The only easy attribute is that the objects can be represented as parallel lines. So far I''ve figured out that the easyest approach would be to create an array/link list with all the currently ''blocking'' objects in the environment, with their sizes increased by half the size of the moving object divided by 2 on each size, that way any line that does not intersect those rectangle will be a usable path. From there it would be a matter of creating a something that makes a path out of vectors that do not cross any enlarged object. Any other ideas?

hi,

read this, it might helps.

http://www.student.nada.kth.se/~f93-maj/pathfinder/index.html


cu

Peter