Tasks - Path finding

Pathfinding algorithm - design and implementation steps

  1. Pahtfinding algorithm for grid maps
    • A* with more heuristic functions
    • simple/robust trace
  2. Unit syncronization
    • units must not overlap
    • units must go around them in an inteligent mode
    • units must move from their position to let other units pass and then go back
  3. Using nxn units type
  4. Group moving
    • making group configuration
    • groups does not keep their configuration
    • groups does not keep their configuration while moving but they remake it at the destionation
    • groups keep their configuration while moving
    • groups try to keep the configuration as long as possible
  5. Adapt to the map-engine
  6. Scripts for moving the units
    • record commands to run them later
SourceForge.net Logo