多体资产保护对策的迭代最佳对策
Iterative Best Response for Multi-Body Asset-Guarding Games
摘要：
我们提出了一个数值方法来寻找最佳轨迹的球员在多体，资产守卫游戏的非线性动力学和非凸约束。使用迭代最佳响应（IBR）方案，我们假设其他参与者的轨迹已知且固定，求解每个参与者的最佳策略。利用序列凸规划（SCP）的最新进展，我们使用SCP作为IBR算法中的子例程，以有效地解决每个玩家的约束轨迹优化问题的近似值。我们将该方法应用于涉及多个追赶者和单个逃避者的资产守卫游戏示例（即，n对1的约定）。所得的规避轨迹进行了仿真测试，以验证成功的规避使用传统的拦截制导律对追击者。
英文摘要：
We present a numerical approach to finding optimal trajectories for players in a multi-body, asset-guarding game with nonlinear dynamics and non-convex constraints. Using the Iterative Best Response (IBR) scheme, we solve for each player's optimal strategy assuming the other players' trajectories are known and fixed. Leveraging recent advances in Sequential Convex Programming (SCP), we use SCP as a subroutine within the IBR algorithm to efficiently solve an approximation of each player's constrained trajectory optimization problem. We apply the approach to an asset-guarding game example involving multiple pursuers and a single evader (i.e., n-versus-1 engagements). Resulting evader trajectories are tested in simulation to verify successful evasion against pursuers using conventional intercept guidance laws.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
