Recent methods of cooperative multiagent rein-forcement learning built upon the individual global max value decomposition principle show promising results using variants of deep mixing networks, and credit assignment plays a crucial role in it. However, each agent in a multiagent system requires not only credit assignment but also credit feedback which tells each agent how many rewards it should obtain to maximize expected cumulative global rewards. In this work, we propose TLMIX, a novel Twin Leader Mixing Network for multiagent cooperation reinforcement learning while maintaining the centralized training and decentralized execution paradigm. TLMIX introduces a leader network to address the credit feedback issue by utilizing global information to provide reasonable objectives for agent networks. TLMIX also introduces a twin mixing network to find a more accurate target function from the Q-value functions, which avoids the rapid increase in parameter scale caused by introducing individual agents' twin networks and effectively mitigates the accumulation of high overestimation errors caused by temporal difference updates. Extensive results on SMAC experimental scenarios and the Predator-Prey environment demonstrate that TLMIX significantly outperforms comparable benchmark algorithms on convergence speed and performance.
17 February 2025 in Biological Trace Element Research
In this paper, for extended object tracking in the case of mutation of irregular stars convex shape, using Random Hypersurface Model (RHM ) to model the object, then the target shape is expressed as parameter by radial function. Considering that using circle as a prior shape information requires a long filter consumption time, the RHM-CC-IOU-UKF algorithm proposed in this paper uses the center contour method to correct the prior shape information of the object, and then uses the Intersection over Union (IOU) method to improve the object tracking accuracy in the mutation case. The object estimation shape is updated when combined with a simple filtering algorithm. Eventually, the effectiveness of this algorithm is demonstrated by simulation experiments in two scenarios.