-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Harold,
Harold Comere wrote:
> Hi jan, gdh
>
> Thank you for replies.
>
> I have looked what's path-planning and Corridor map method. But it
> look likes to common path finding algorithms with huge preprocessing
> offline step to build a graph. O
Hi jan, gdh
Thank you for replies.
I have looked what's path-planning and Corridor map method. But it look likes
to common path finding algorithms with huge preprocessing offline step to build
a graph.
One problem should be that path-planning seems to work good and fast in 2D with
"small" area
Hi Harold,
I know that people at Utrecht University (The Netherlands) are
actively working on the type of problems you describe. Maybe their
corridor map method is something for you:
"Current applications require a path planner that is fast (to ensure
real-time interaction with the environment) a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Harold,
Harold Comere wrote:
>
> Well, i'm a bit stuck and lack of ideas for now ... I have began to
> use osg 2 weeks ago, so maybe is there any kind of osg cool stuff
> wich could be usefull to do it that i ignore ?
This problem is outside of t
4 matches
Mail list logo