If you ever need to assign agents to tasks. First build a matrix where each row represents a task,each column represents an agent, and each element representsthe cost of having an agent performing a specific task. Then sent this matrix to the linked function to obtain a list of pairs representing which agent and task matchupshave the minimal overall cost. An example:https://github.com/Mathieu-Desrochers/Scheme-Experimentations/blob/master/documentation/infrastructure/matrix.md#matrix-solve-maximum-assignment-problem The source code:https://github.com/Mathieu-Desrochers/Scheme-Experimentations/blob/master/sources/infrastructure/matrix/matrix-intern.scm *Credits to: http://www.informatik.uni-freiburg.de/~stachnis/
_______________________________________________ Chicken-users mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/chicken-users
