Subspace-Based Detection in OFDM ISAC Systems under Different Constellations

This paper investigates subspace-based target detection in OFDM integrated sensing and communications (ISAC) systems, considering the impact of various constellations. To meet diverse communication demands, different constellation schemes with varying modulation orders (e.g., PSK, QAM) can be employed, which in turn leads to variations in peak sidelobe levels (PSLs) within the radar functionality. These PSL fluctuations pose a significant challenge in the context of multi-target detection, particularly in scenarios where strong sidelobe masking effects manifest. To tackle this challenge, we have devised a subspace-based approach for a step-by-step target detection process, systematically eliminating interference stemming from detected targets. Simulation results corroborate the effectiveness of the proposed method in achieving consistently high target detection performance under a wide range of constellation options in OFDM ISAC systems.

Maximum Correntropy Value Decomposition for Multi-agent Deep Reinforcemen Learning

We explore value decomposition solutions for multi-agent deep reinforcement learning in the popular paradigm of centralized training with decentralized execution(CTDE). As the recognized best solution to CTDE, Weighted QMIX is cutting-edge on StarCraft Multi-agent Challenge (SMAC), with a weighting scheme implemented on QMIX to place more emphasis on the optimal joint actions. However, the fixed weight requires manual tuning according to the application scenarios, which painfully prevents Weighted QMIX from being used in broader engineering applications. In this paper, we first demonstrate the flaw of Weighted QMIX using an ordinary One-Step Matrix Game (OMG), that no matter how the weight is chosen, Weighted QMIX struggles to deal with non-monotonic value decomposition problems with a large variance of reward distributions. Then we characterize the problem of value decomposition as an Underfitting One-edged Robust Regression problem and make the first attempt to give a solution to the value decomposition problem from the perspective of information-theoretical learning. We introduce the Maximum Correntropy Criterion (MCC) as a cost function to dynamically adapt the weight to eliminate the effects of minimum in reward distributions. We simplify the implementation and propose a new algorithm called MCVD. A preliminary experiment conducted on OMG shows that MCVD could deal with non-monotonic value decomposition problems with a large tolerance of kernel bandwidth selection. Further experiments are carried out on Cooperative-Navigation and multiple SMAC scenarios, where MCVD exhibits unprecedented ease of implementation, broad applicability, and stability.