Drastic refactoring of the separable optimal flow optimizer (iterative planner) work in progress
Conflict generator can be given a rectangular region in which the conflict should be located.
Conflict generator improved
- now it generates a start and target points ONLY ON the predefined grid- all agents share the very same grid- code cleaned a bit
few minor fixes
1) Vizualization now shows the algorithm name2) OD now has a option to stop3) All the edges returned by od has a fixed time duration
problem with visualization of PP fixed
PP was throwing UnsuportedOperation exceptions while trying to visualize motion graph
obsolete todos removed
Fixed unhandled exception
Unhandled exception was thrown if the algorithm did not find an initial solution
Fixed problem with paths
All paths shorter than a maximum length (in the number of edges) had unnecessary zero length edges as it suffix.
Fixed problem with subobtimality.
Algorithm did not stop exploring the search space subspace of agent after finding its state to be a goal state.
Time limit was not properly implemented in OD solvere. Also null pointer exception was thrown if the algorithm did not found solution.
OD renamed to ODCN
testsuite and instance generator uses the name ODCN
OD_PIN renamed to ODPIN
testsuite and instance generator uses the name ODPIN
Prioritized Planning uses perfect heuristics
added setter to prioritized planning solver just to add the option to use different heuristics
Fixed visualization exceptions
Merge with b103e25ca12afee6a5ae8eab5905f5b4a2c8c740
Merge with e2234922273a1875c97911cbe45158d5a35e6eb7
New solver replaced old one
and also Enum containing implemented algorithms was extracted. Test for OD introduced.
super class solver was refactored into multiple of simple classes
ODCN solver implemented