FW: [Arianne-devel] Path finding

[Young, J. (UK Warton) <jam...@ba...>]

This is my fourth attempt at sending this email, minus attachment :-(

I was reading something recently that was quite interesting but I've not
looked at your code to see how you've implemented path finding.

This will mostly benefit path finding over a larger distance - the map
was split into little nodes and big nodes (say 16 - 32 small node). The
big nodes were used to find a general path from A to B and when moving
from one big node to the next a path was calculated within the new big
node using its smaller nodes. This obviously spreads the calculations
over number of frames and could be extended to not perform small node
calculations if it is known there are no obstacles in the big node. If
memory isn't too much of an issue some paths through some of the big
nodes could be pre calculated.

I've attached a diagram which may explain it better.

The dark blue squares are the big nodes, grey smaller nodes, yellow is
current big node being processed, light blue filled in squares are
obstacles, and red line is route.

It shows that a route has been calculated to the big node containing
destination B but it is still to be calculated at a finer level.

Hope this provides some ideas and apologies if you have already
implemented something similar.

Cheers

Jim

>_____________________________________
>James Young
>Software Design Engineer
>
>BAE SYSTEMS
>JSF VS PHM - Warton W354D
>*: +44 (0)1772 8 55481
>*: jam...@ba...
>

********************************************************************
This email and any attachments are confidential to the intended
recipient and may also be privileged. If you are not the intended
recipient please delete it from your system and notify the sender.
You should not copy it or use it for any purpose nor disclose or
distribute its contents to any other person.
********************************************************************