Multi-agent multi-target tracking has a wide range of applications, including wildlife patrolling, security surveillance or environment monitoring. Such algorithms often make restrictive assumptions: the number of targets and/or their initial locations may be assumed known, or agents may be pre-assigned to monitor disjoint partitions of the environment, reducing the burden of exploration. This also limits applicability when there are fewer agents than targets, since agents are unable to continuously follow the targets in their fields of view. Multi-agent tracking algorithms additionally assume inter-agent synchronization of observations, or the presence of a central controller to coordinate joint actions. Instead, we focus on the setting of decentralized multi-agent, multi-target, simultaneous active search-and-tracking with asynchronous inter-agent communication. Our proposed algorithm DecSTER uses a sequential monte carlo implementation of the probability hypothesis density filter for posterior inference combined with Thompson sampling for decentralized multi-agent decision making. We compare different action selection policies, focusing on scenarios where targets outnumber agents. In simulation, we demonstrate that DecSTER is robust to unreliable inter-agent communication and outperforms information-greedy baselines in terms of the Optimal Sub-Pattern Assignment (OSPA) metric for different numbers of targets and varying teamsizes.

多智能体多目标追踪问题中的去中心化、主动搜索和跟踪以及异步智能体通信的解决方案 DecSTER，在目标数量超过智能体数量的情况下，通过使用概率假设密度滤波器的顺序蒙特卡罗算法进行后验推断，并结合汤普森采样进行智能体的分散决策。通过比较不同的动作选择策略，在模拟中证明了 DecSTER 算法在面对不可靠智能体通信时的鲁棒性，并在不同目标数量和团队规模下优于信息贪婪基准的优化子模式分配 (OSPA) 指标。

分散式多智能体主动搜索和追踪：当目标超过智能体数量