研究追击中追踪者可达集的几何特性，提出新优化方法。
Dependent Reachable Sets for the Constant Bearing Pursuit Strategy
- 以恒定方位追击策略为案例，定义依赖可达集
- 给出依赖可达集的几何边界，理论可验证
- 适合控制与路径规划方向的研究者
本文针对两个智能体的追击场景，提出一种新的可达性问题，其中一个智能体通过反馈策略追随另一个。以恒定方位追击策略为例，刻画了称为“依赖可达集”的智能体可达区域的几何结构。文中给出了该依赖可达集的几何边界，并通过仿真验证其形状。在此过程中，构建并分析了一个原创的优化问题，为追击策略的设计提供理论支撑。
原文摘要 · Abstract (English)
This paper introduces a novel reachability problem for the scenario involving two agents, where one agent follows another agent using a feedback strategy. The geometry of the reachable set for an agent, termed \emph{dependent reachable set}, is characterized using the constant bearing pursuit strategy as a case study. Key theoretical results are presented that provide geometric bounds for the associated dependent reachable set. Simulation results are presented to empirically establish the shape of the dependent reachable set. In the process, an original optimization problem is formulated and analyzed for the constant bearing pursuit strategy.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。