This demo project applies the Hungarian Algorithm to the problem of reforming units of "vehicles" efficiently in two dimensions. The problem statement:
Let a vehicle unit be a collection of n > 0 vehicles.
Let a unit's formation F: [1, n] => R2 be a mapping between each member of the unit to a position.
A unit is said to satisfy a formation if each member is at its corresponding assigned position.
Let there be two formations F1 and F2. Given is a unit U satisfying F1, and a set of n target positions T. What is the optimal assignment F2: [1, n] => T that results in a minimal total traveling distance over all members of U to satisfy F2?
| Directory | Description |
|---|---|
common/ |
Common dependencies. |
core/ |
Formation description project files. |
demo/ |
Demo application project files. |
documentation/ |
Doxygen configuration. |