Pith. sign in

REVIEW 3 cited by

Potential iLQR: A Potential-Minimizing Controller for Planning Multi-Agent Interactive Trajectories

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2107.04926 v1 pith:TFWAQUG5 submitted 2021-07-10 cs.RO cs.MA

classification cs.ROcs.MA
keywords algorithmcontroldifferentialoptimalgameinteractivemulti-agentproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many robotic applications involve interactions between multiple agents where an agent's decisions affect the behavior of other agents. Such behaviors can be captured by the equilibria of differential games which provide an expressive framework for modeling the agents' mutual influence. However, finding the equilibria of differential games is in general challenging as it involves solving a set of coupled optimal control problems. In this work, we propose to leverage the special structure of multi-agent interactions to generate interactive trajectories by simply solving a single optimal control problem, namely, the optimal control problem associated with minimizing the potential function of the differential game. Our key insight is that for a certain class of multi-agent interactions, the underlying differential game is indeed a potential differential game for which equilibria can be found by solving a single optimal control problem. We introduce such an optimal control problem and build on single-agent trajectory optimization methods to develop a computationally tractable and scalable algorithm for planning multi-agent interactive trajectories. We will demonstrate the performance of our algorithm in simulation and show that our algorithm outperforms the state-of-the-art game solvers. To further show the real-time capabilities of our algorithm, we will demonstrate the application of our proposed algorithm in a set of experiments involving interactive trajectories for two quadcopters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fast and Scalable Game-Theoretic Trajectory Planning with Intentional Uncertainties

    cs.RO 2025-07 conditional novelty 6.0 of 10

    Interactive trajectory planning under intentional uncertainties is shown to be a potential Bayesian game, solvable in real time via a distributed dual consensus ADMM.

  2. {\alpha}-RACER: Real-Time Algorithm for Game-Theoretic Motion Planning and Control in Autonomous Racing using Near-Potential Function

    cs.RO 2024-12 conditional novelty 6.0 of 10

    α-RACER learns an approximate α-potential function offline from simulated races and maximizes it online to obtain approximate Nash equilibrium strategies for multi-car autonomous racing.

  3. Synergizing Decision Making and Trajectory Planning Using Two-Stage Optimization for Autonomous Vehicles

    cs.RO 2024-11 conditional novelty 4.0 of 10

    A two-stage optimization planner jointly decides lane changes and generates collision-free trajectories, reporting better safety and efficiency than fixed-lane and pipeline baselines in simulated multi-lane driving.

Pith tools