Markov Potential Game with Final-time Reach-Avoid Objectives
원문 초록
We formulate a Markov potential game with final-time reach-avoid objectives by integrating potential game theory with stochastic reach-avoid control. Our focus is on multi-player trajectory planning where players maximize the same multi-player reach-avoid objective: the probability of all participants reaching their designated target states by a specified time, while avoiding collisions with one another. Existing approaches require centralized computation of actions via a global policy, which may have prohibitively expensive communication costs. Instead, we focus on approximations of the global policy via local state feedback policies. First, we adapt the recursive single player reach-avoid value iteration to the multi-player framework with local policies, and show that the same recursion holds on the joint state space. To find each player's optimal local policy, the multi-player reach-avoid value function is projected from the joint state to the local state using the other players' occupancy measures. Then, we propose an iterative best response scheme for the multi-player value iteration to converge to a pure Nash equilibrium. We demonstrate the utility of our approach in finding collision-free policies for multi-player motion planning in simulation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Epona: Autoregressive Diffusion World Model for Autonomous Driving
OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model
GPD-1: Generative Pre-training for Driving
Reasonable Motion: A General ASP Foundation for Environment Constrained Movement Trajectory Computation
Mixed Bernstein-Fourier Approximants for Optimal Trajectory Generation with Periodic Behavior
Trajectory Planning with Signal Temporal Logic Costs using Deterministic Path Integral Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.