A Graph Neural Network Approach for Solving the Ranked Assignment Problem in Multi-Object Tracking
Associating measurements with tracks is a crucial step in Multi-Object Tracking (MOT) to guarantee the safety of autonomous vehicles. To manage the exponentially growing number of track hypotheses, truncation becomes necessary. In the $δ$-Generalized Labeled Multi-Bernoulli ($δ$-GLMB) filter application, this truncation typically involves the ranked assignment problem, solved by Murty's algorithm or the Gibbs sampling approach, both with limitations in terms of complexity or accuracy, respectively. With the motivation to improve these limitations, this paper addresses the ranked assignment problem arising from data association tasks with an approach that employs Graph Neural Networks (GNNs). The proposed Ranked Assignment Prediction Graph Neural Network (RAPNet) uses bipartite graphs to model the problem, harnessing the computational capabilities of deep learning. The conclusive evaluation compares the RAPNet with Murty's algorithm and the Gibbs sampler, showing accuracy improvements compared to the Gibbs sampler.
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-Object TrackingGraph Neural NetworkAutonomous VehiclesSimilar Papers 제목 키워드 기반
A Universal Approach to Feature Representation in Dynamic Task Assignment Problems
Dynamic task assignment concerns the optimal assignment of resources to tasks in a business process. Recently, Deep Reinforcement Learning (DRL) has been proposed as the state of the art for solving assignment problems. …
Reinforcement LearningSolving Multi-Agent Multi-Goal Path Finding Problems in Polynomial Time
In this paper, we plan missions for a fleet of agents in undirected graphs, such as grids, with multiple goals. In contrast to regular multi-agent path-finding, the solver finds and updates the assignment of goals to the…
Evidential supplier selection based on interval data fusion
Supplier selection is a typical multi-criteria decision making (MCDM) problem and lots of uncertain information exist inevitably. To address this issue, a new method was proposed based on interval data fusion. Our method…
Decision MakingMulti-Class Traffic Assignment using Multi-View Heterogeneous Graph Attention Networks
Solving traffic assignment problem for large networks is computationally challenging when conventional optimization-based methods are used. In our research, we develop an innovative surrogate model for a traffic assignme…
Graph AttentionLearning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning
This paper explores the possibility of near-optimally solving multi-agent, multi-task NP-hard planning problems with time-dependent rewards using a learning-based algorithm. In particular, we consider a class of robot/ma…
Combinatorial OptimizationDecision MakingGraph EmbeddingQ-Learning+3