In this paper, we propose an approach for solving an energy-optimal goal assignment problem to generate the desired formation in multi-agent systems. Each agent solves a decentralized optimization problem with only local information about its neighboring agents and the goals. The optimization problem consists of two sub-problems. The first problem seeks to minimize the energy for each agent to reach certain goals, while the second problem entreats an optimal combination of goal and agent pairs that minimizes the energy cost. By assuming the goal trajectories are given in a polynomial form, we prove the solution to the formulated problem exists globally. Finally, the effectiveness of the proposed approach is validated through the simulation.
翻译:在本文中,我们提出了一个解决能源最佳目标分配问题的方法,以便在多试剂系统中产生理想的形成。每个代理商只用其邻近物剂和目标的当地信息来解决分散化的优化问题。优化问题由两个子问题组成。第一个问题力求最大限度地减少每种物剂达到某些目标的能量,而第二个问题则要求将目标和物剂配对最佳地结合起来,以尽量减少能源成本。如果假设目标轨迹以多元形式给出,我们就能证明已形成问题的解决方案存在于全球。最后,拟议方法的有效性通过模拟得到验证。