K-Best Assignment Algorithm
This implementation is based on the 1968 Murty algorithm for finding a ranked list of the best assignments for an arbitrary cost matrix.
This algorithm uses a user-supplied assignment algorithm, such as the Munkres (Hungarian) algorithm or the JV algorithm to obtain an arbitrary number of best assignment solutions.
Implementations of Munkres and JV algorithms by Yi Cao can be found here:
Munkres: http://www.mathworks.com/matlabcentral/fileexchange/20328
JV: http://www.mathworks.com/matlabcentral/fileexchange/26836
Zitieren als
Eric Trautmann (2024). K-Best Assignment Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/30837-k-best-assignment-algorithm), MATLAB Central File Exchange. Abgerufen.
Kompatibilität der MATLAB-Version
Plattform-Kompatibilität
Windows macOS LinuxKategorien
- Robotics and Autonomous Systems > Sensor Fusion and Tracking Toolbox > Multi-Object Trackers >
- Radar > Sensor Fusion and Tracking Toolbox > Multi-Object Trackers >
Tags
Quellenangaben
Inspiriert von: Munkres Assignment Algorithm, LAPJV - Jonker-Volgenant Algorithm for Linear Assignment Problem V3.0
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
Murty k-best assignment/
Version | Veröffentlicht | Versionshinweise | |
---|---|---|---|
1.0.0.0 |