We consider a multi-agent system where agents compete for the access to the radio resource. By combining some application-level parameters, such as the resilience, with a knowledge of the radio environment, we propose a new way of modeling the scheduling problem as an optimization problem. We design accordingly a low-complexity solver. The performance are compared with state-of-the-art schedulers via simulations. The numerical results show that this application-oriented scheduler performs better than standard schedulers. As a result, it offers more space for the selection of the application-level parameters to reach any arbitrary performance.

翻译：我们考虑一个多智能体系统，其中智能体竞争无线资源的访问权限。通过结合应用层面的参数（如抗干扰能力）与对无线环境的认知，我们提出了一种将调度问题建模为优化问题的新方法。据此，我们设计了一个低复杂度的求解器。通过仿真，我们将该求解器的性能与现有最先进的调度器进行了比较。数值结果表明，该面向应用的调度器性能优于标准调度器。因此，它为选择应用层面参数来实现任意期望性能提供了更大的空间。