To move from a
location to a new defined location, we use the Bresenham line drawing
algorithm to get a direct lined path to destination.
2. Obstacles
See features section.
3. Pathfinding
See features section.
4. Features
- Basic pathfinding
(using Bresenham) [OK]
- Obstacle
avoidance (now just say and don't go when destination is an obstacle.
We'll probably use a random movement avoidance for the moment : if an
obstacle is detected in the Bresenham determinated list of indermediate
points, the unit move to that point and then do some randomized
displacement. We just have to proceed the Bresenham alorithm again from
that new location. This method can only be used in low obstacle-blocked
areas. [!!]
- Waypointed
path following (defined to patrol, enchained Bresenham path) [!!]
Related
links
Bresenham line drawing explanation on GameDev.net - http://www.gamedev.net/reference/articles/article1275.asp
Wikipedia's article about Bresenham line drawing algorithm - http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm
Copyright
© 2005 by the Toward Destiny development team.