activity
20182026
most citedInfinite-Horizon Reach-Avoid Zero-Sum Games via Deep Reinforcement Learning

5 citations · 13 across the 24 of their papers we have counts for

collaborators
Showing eess.SYShow all

11 papers · 1 filter

eess.SY2026

Inverse Safety Filtering: Inferring Constraints from Safety Filters for Decentralized Coordination

Minh Nguyen, Jingqi Li, Gechen Qu +1

Safe multi-agent coordination in uncertain environments can benefit from learning constraints from other agents. Implicitly communicating safety constraints through actions is a pr…

eess.SY2026

From Global to Local: Hierarchical Probabilistic Verification for Reachability Learning

Ebonye Smith, Sampada Deglurkar, Jingqi Li +2

Hamilton-Jacobi (HJ) reachability provides formal safety guarantees for nonlinear systems. However, it becomes computationally intractable in high-dimensional settings, motivating…

eess.SY2026

Active Calibration of Reachable Sets Using Approximate Pick-to-Learn

Sampada Deglurkar, Ebonye Smith, Jingqi Li +1

Reachability computations that rely on approximate or learned models require calibration in order to uphold confidence about their guarantees. Calibration generally involves sampli…

eess.SY2025

Multi-Agent Guided Policy Search for Non-Cooperative Dynamic Games

Jingqi Li, Gechen Qu, Jason J. Choi +2

Multi-agent reinforcement learning (MARL) optimizes strategic interactions in non-cooperative dynamic games, where agents have misaligned objectives. However, data-driven methods s…

eess.SY2025

Coordinating Distributed Energy Resources with Nodal Pricing in Distribution Networks: a Game-Theoretic Approach

Eli Brock, Jingqi Li, Javad Lavaei +1

We propose a real-time nodal pricing mechanism for cost minimization and voltage control in a distribution network with autonomous distributed energy resources and analyze the resu…

eess.SY2024

Deep Reinforcement Learning for Reach-Avoid-Stay Problems

Gabriel Chenevert, Jingqi Li, Achyuta kannan +2

Reach-Avoid-Stay (RAS) tasks are essential in applications where systems must safely reach a target set and remain within it under all bounded disturbances. Existing approaches eit…

eess.SY2024

To What Extent do Open-loop and Feedback Nash Equilibria Diverge in General-Sum Linear Quadratic Dynamic Games?

Chih-Yuan Chiu, Jingqi Li, Maulik Bhatt +1

Dynamic games offer a versatile framework for modeling the evolving interactions of strategic agents, whose steady-state behavior can be captured by the Nash equilibria of the game…

eess.SY2024

Certifiable Reachability Learning Using a New Lipschitz Continuous Value Function

Jingqi Li, Donggun Lee, Jaewon Lee +3

We propose a new reachability learning framework for high-dimensional nonlinear systems, focusing on reach-avoid problems. These problems require computing the reach-avoid set, whi…

eess.SY2024

Intent Demonstration in General-Sum Dynamic Games via Iterative Linear-Quadratic Approximations

Jingqi Li, Anand Siththaranjan, Somayeh Sojoudi +2

Autonomous agents should coordinate effectively without prior knowledge of others' intents. While prior work has focused on intent inference, we address the inverse problem: how ag…

eess.SY2023

Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games

Jingqi Li, Chih-Yuan Chiu, Lasse Peters +6

Decision-making in multi-player games can be extremely challenging, particularly under uncertainty. In this work, we propose a new sample-based approximation to a class of stochast…

eess.SY2022★ 5 cited

Infinite-Horizon Reach-Avoid Zero-Sum Games via Deep Reinforcement Learning

Jingqi Li, Donggun Lee, Somayeh Sojoudi +1

In this paper, we consider the infinite-horizon reach-avoid zero-sum game problem, where the goal is to find a set in the state space, referred to as the reach-avoid set, such that…