| http://www.w3.org/ns/prov#value | - Using the straight-line code we might never get there!So, how do you anticipate performing a local grid search that will approximate a straight line, yet still be able to move around global obstacles?ReplyDeleteMikko MononenFebruary 25, 2012 at 6:33 AMhere is a couple of my older posts, which should give some more detailed answers:Firstly, global path finding.
|
