一个能量最优的自治Agent团队分配和轨迹生成框架
An Energy-Optimal Framework for Assignment and Trajectory Generation in Teams of Autonomous Agents
摘要:
在本文中,我们提出了一种方法来解决问题的移动$N$同质代理到$M \geq N$目标位置沿能量最小化的轨迹。我们提出了一个分散的框架,只需要每个代理的目标位置和部分观测的全局状态的知识。该框架包括通过动态约束对安全性的保证,以及对代理施加动态的全局优先级排序的方法。以二进制程序和非线性系统方程的形式导出了目标分配和轨迹生成问题的解。然后,我们提出了最优性的条件和特征的条件下,我们的算法是保证收敛到一个独特的分配代理的目标。我们还解决了完全约束分散轨迹生成问题,考虑到状态,控制和安全约束。最后,我们通过MATLAB中的数值模拟验证了我们的方法的有效性。
英文摘要:
In this paper, we present an approach for solving the problem of moving $N$ homogeneous agents into $M \geq N$ goal locations along energy-minimizing trajectories. We propose a decentralized framework that only requires knowledge of the goal locations and partial observations of the global state by each agent. The framework includes guarantees on safety through dynamic constraints, and a method to impose a dynamic, global priority ordering on the agents. A solution to the goal assignment and trajectory generation problems are derived in the form of a binary program and a nonlinear system of equations. Then, we present the conditions for optimality and characterize the conditions under which our algorithm is guaranteed to converge to a unique assignment of agents to goals. We also solve the fully constrained decentralized trajectory generation problem considering the state, control, and safety constraints. Finally, we validate the efficacy of our approach through a numerical simulation in MATLAB.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。