在随机对抗环境中,优化路径的代价与安全风险权衡。
Stochastic Multi-Objective Kinodynamic Planning Against Adversaries

- 用闭环策略替代开环轨迹,提升规划反应能力
- 通过蒙特卡洛采样评估风险,实现概率安全约束
- 适用于自动驾驶、多智能体等复杂场景
本文研究在存在随机混合对抗者环境下的多目标运动规划问题,对抗者会根据自身状态概率性进入敌对模式。目标是构建路径的帕累托前沿,平衡执行成本与安全约束违反的概率(风险)。现有机会约束规划方法基于开环轨迹评估风险,导致过度保守且忽略主体的反应能力。为此,本文将规划空间转换为闭环策略序列,并通过蒙特卡洛粒子仿真直接集成风险评估到树结构构建中。提出两种算法:随机多目标RRT(SMO-RRT),证明其概率完备性;以及随机多目标稳定稀疏RRT(SMO-SST),通过选择性剪枝提升数值性能,但牺牲完备性。针对非高斯、状态依赖不确定系统,推导出有限样本下机会约束违反概率的上界,从而支持在广泛环境中的概率安全规划,适用于多智能体系统、社交导航与自动驾驶。
原文摘要 · Abstract (English)
This paper addresses multi-objective kinodynamic planning in environments with stochastic hybrid adversaries that probabilistically transition to adversarial modes based on the ego state. The goal is to construct the Pareto-front of paths that trade off execution cost and the probability of safety constraint violation (risk). Existing chance-constrained planners evaluate risk over open-loop trajectories, yielding overly conservative solutions that fail to account for ego-agent reactivity. To address this limitation, we shift the planning space to sequences of closed-loop policies, and integrate sample-based risk evaluation directly into tree construction via Monte-Carlo particle rollouts. We first introduce Stochastic Multi-Objective RRT (SMO-RRT), for which we prove probabilistic completeness, followed by Stochastic Multi-Objective Stable Sparse RRT (SMO-SST), which leverages selective pruning to improve numerical performance at the cost of completeness. For both algorithms, we derive a finite-sample bound on the probability of chance constraint violation for systems with non-Gaussian, state-dependent uncertainty, enabling probabilistically safe planning in a broad class of environments applicable to multi-agent systems, social navigation, and autonomous driving.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。