Pattern Analysis and Machine Intelligence (TPAMI), 33(9):1806-1819,
2011.
-It works with negative edge lengths and stops computing new path when
-it can not find one of negative total length, instead of fixing the
-total number of paths to a constant K.
+This implementation is not the reference implementation used for the
+experiments presented in this article.
* INSTALLATION
- the allowed motions between them (a Boolean flag for each pair
of locations from/to)
- - the entrances (a Boolean flag for each location)
+ - the entrances (a Boolean flag for each location and time step)
- - the exits (a Boolean flag for each location)
+ - the exits (a Boolean flag for each location and time step)
(2) to define a number of time steps
...
bool:allowed_motion_from_L_to_1 ... bool:allowed_motion_from_L_to_L
-bool:force_empty_first_frame bool:force_empty_last_frame
-
-bool:is_an_entrance_1 ... bool:is_an_entrance_L
+bool:entrance_1_1 ... bool:entrance_1_L
+...
+bool:entrance_T_1 ... bool:entrance_T_L
-bool:is_an_exit_1 ... bool:is_an_exit_L
+bool:exit_1_1 ... bool:exit_1_L
+...
+bool:exit_T_1 ... bool:exit_T_L
float:detection_score_1_1 ... float:detection_score_1_L
...