|Subject:||[Chicken-users] Solving the assignment problem using Chicken Scheme by interfacing with libhungarian|
|Date:||Sun, 16 Feb 2014 15:48:41 -0500|
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 represents
the 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 matchups
have the minimal overall cost.
The source code:
*Credits to: http://www.informatik.uni-freiburg.de/~stachnis/
|[Prev in Thread]||Current Thread||[Next in Thread]|