activity
20172025
most citedMatching-Based Capture Strategies for 3D Heterogeneous Multiplayer Reach-Avoid Differential Games

6 citations · 18 across the 20 of their papers we have counts for

collaborators

20 papers

math.OC2025

A Communication-Efficient Distributed Optimization Algorithm for Problems with Coupling Constraints

Yuzhu Duan, Ziwen Yang, Xiaoming Duan +1

Resource allocation is a fundamental problem in Industrial Internet of Things (IIoT) systems, in which devices work together under limited communication bandwidth to complete diver…

eess.SY2023

Multiplayer Homicidal Chauffeur Reach-Avoid Games: A Pursuit Enclosure Function Approach

Rui Yan, Xiaoming Duan, Rui Zou +3

This paper presents a multiplayer Homicidal Chauffeur reach-avoid differential game, which involves Dubins-car pursuers and simple-motion evaders. The goal of the pursuers is to co…

eess.SY2023★ 4 cited

A Stochastic Surveillance Stackelberg Game: Co-Optimizing Defense Placement and Patrol Strategy

Yohan John, Gilberto Diaz-Garcia, Xiaoming Duan +2

Stochastic patrol routing is known to be advantageous in adversarial settings; however, the optimal choice of stochastic routing strategy is dependent on a model of the adversary.…

cs.RO2023

Control Input Inference of Mobile Agents under Unknown Objective

Chendi Qu, Jianping He, Xiaoming Duan +1

Trajectory and control secrecy is an important issue in robotics security. This paper proposes a novel algorithm for the control input inference of a mobile agent without knowing i…

cs.AI2023

Reinforcement Learning with Temporal-Logic-Based Causal Diagrams

Yash Paliwal, Rajarshi Roy, Jean-Raphaël Gaglione +5

We study a class of reinforcement learning (RL) tasks where the objective of the agent is to accomplish temporally extended goals. In this setting, a common approach is to represen…

cs.LG2023

Revisiting Estimation Bias in Policy Gradients for Deep Reinforcement Learning

Haoxuan Pan, Deheng Ye, Xiaoming Duan +4

We revisit the estimation bias in policy gradients for the discounted episodic Markov decision process (MDP) from Deep Reinforcement Learning (DRL) perspective. The objective is fo…

cs.GT2022

Finite-horizon Equilibria for Neuro-symbolic Concurrent Stochastic Games

Rui Yan, Gabriel Santos, Xiaoming Duan +2

We present novel techniques for neuro-symbolic concurrent stochastic games, a recently proposed modelling formalism to represent a set of probabilistic agents operating in a contin…

cs.RO2022

Learning-Based Motion Planning with Mixture Density Networks

Yinghan Wang, Xiaoming Duan, Jianping He

The trade-off between computation time and path optimality is a key consideration in motion planning algorithms. While classical sampling based algorithms fall short of computation…

cs.GT2022

Evaluation and Learning in Two-Player Symmetric Games via Best and Better Responses

Rui Yan, Weixian Zhang, Ruiliang Deng +3

Artificial intelligence and robotic competitions are accompanied by a class of game paradigms in which each player privately commits a strategy to a game system which simulates the…

math.OC2021★ 1 cited

On the Detection of Markov Decision Processes

Xiaoming Duan, Yagiz Savas, Rui Yan +2

We study the detection problem for a finite set of Markov decision processes (MDPs) where the MDPs have the same state and action spaces but possibly different probabilistic transi…

cs.IT2021

Privacy-Utility Trade-Offs Against Limited Adversaries

Xiaoming Duan, Zhe Xu, Rui Yan +1

We study privacy-utility trade-offs where users share privacy-correlated useful information with a service provider to obtain some utility. The service provider is adversarial in t…

eess.SY2021

Robust Pandemic Control Synthesis with Formal Specifications: A Case Study on COVID-19 Pandemic

Zhe Xu, Xiaoming Duan

Pandemics can bring a range of devastating consequences to public health and the world economy. Identifying the most effective control strategies has been the imperative task all a…

math.OC2020★ 1 cited

Stochastic Strategies for Robotic Surveillance as Stackelberg Games

Xiaoming Duan, Dario Paccagnan, Francesco Bullo

This paper studies a stochastic robotic surveillance problem where a mobile robot moves randomly on a graph to capture a potential intruder that strategically attacks a location on…

math.OC2020★ 1 cited

Markov Chain-Based Stochastic Strategies for Robotic Surveillance

Xiaoming Duan, Francesco Bullo

This article surveys recent advancements of strategy designs for persistent robotic surveillance tasks with the focus on stochastic approaches. The problem describes how mobile rob…

cs.GT2020

Policy Evaluation and Seeking for Multi-Agent Reinforcement Learning via Best Response

Rui Yan, Xiaoming Duan, Zongying Shi +3

This paper introduces two metrics (cycle-based and memory-based metrics), grounded on a dynamical game-theoretic solution concept called sink equilibrium, for the evaluation, ranki…

cs.RO2019★ 2 cited

Robotic Surveillance Based on the Meeting Time of Random Walks

Xiaoming Duan, Mishel George, Rushabh Patel +1

This paper analyzes the meeting time between a pair of pursuer and evader performing random walks on digraphs. The existing bounds on the meeting time usually work only for certain…

math.OC2019★ 6 cited

Matching-Based Capture Strategies for 3D Heterogeneous Multiplayer Reach-Avoid Differential Games

Rui Yan, Xiaoming Duan, Zongying Shi +2

This paper studies a 3D multiplayer reach-avoid differential game with a goal region and a play region. Multiple pursuers defend the goal region by consecutively capturing multiple…

math.OC2019

Graph-Theoretic Stability Conditions for Metzler Matrices and Monotone Systems

Xiaoming Duan, Saber Jafarpour, Francesco Bullo

This paper studies the graph-theoretic conditions for stability of positive monotone systems. Using concepts from input-to-state stability and network small-gain theory, we first e…

math.OC2018★ 3 cited

Markov Chains with Maximum Return Time Entropy for Robotic Surveillance

Xiaoming Duan, Mishel George, Francesco Bullo

Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with trave…

math.OC2017

Linear Stochastic Approximation Algorithms and Group Consensus over Random Signed Networks: A Technical Report with All Proofs

Ge Chen, Xiaoming Duan, Wenjun Mei +1

This paper studies linear stochastic approximation (SA) algorithms and their application to multi-agent systems in engineering and sociology. As main contribution, we provide neces…