Publications

2018

2017

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks

Optimal Combinations and Variable Departure Intervals for Micro Bus System

Jiaoyang Li, Jianming Hu and Yi Zhang. (2017). "Optimal Combinations and Variable Departure Intervals for Micro Bus System." Tsinghua Science and Technology. 22(3).

Planning for Eletric Taxi Charging System from the Perspective of Transprotation Energy Supply Chain: A Data-Driven Approach in Beijing

Yinghao Jia, Huimiao Chen, Jiaoyang Li, Fang He, Meng Li, Zechun Hu and Zuo-Jun Max Shen. (2017). "Planning for Eletric Taxi Charging System from the Perspective of Transprotation Energy Supply Chain: A Data-Driven Approach in Beijing." IEEE Transportation Electrification Conference and Expo, Asia-Pacific (ITEC Asia-Pacific). 1(2).

Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding

Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar and Sven Koenig. (2017). "Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding." In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS). (in print).

Multi-Agent Path Finding with Deadlines: Preliminary Results

Hang Ma, Glenn Wager, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar and Sven Koenig. (2018). "Multi-Agent Path Finding with Deadlines: Preliminary Results." In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS). (in print).

Conflict-Tolerant and Conflict-Free Multi-Agent Meeting

Multi-Directional Heuristic Search

Iterative-Deepening Conflict-Based Search

Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding

Nested ECBS for Bounded-Suboptimal Multi-Agent Path Finding

Symmetry Breaking for k-Robust Multi-Agent Path Finding

Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding

Multi-Train Path Finding Revisited

Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints (extended abstract)

Model AI Assignments 2020

Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding

A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution

Scalable Mechanism Design for Multi-Agent Path Finding

Cost Splitting for Multi-Objective Conflict-Based Search

Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search

Deadline-Aware Multi-Agent Tour Planning

Scaling Lifelong Multi-Agent Path Finding to More Realistic Settings: Research Challenges and Opportunities

Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search

Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World

Shard Systems: Scalable, Robust and Persistent Multi-Agent Path Finding with Performance Guarantees

Multi-Agent Path Finding for Large Agents

Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding

EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding

Lifelong Multi-Agent Path Finding in Large-Scale Warehouses

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search

Intersection Coordination with Priority-Based Search for Autonomous Vehicles

Moving Agents in Formation in Congested Environments

Scheduling and Airport Taxiway Path Planning under Uncertainty

A Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search

Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search

Using FastMap to Solve Graph Problems in a Euclidean Space

New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding

Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge

Improved Heuristics for Conflict-Based Search for Multi-Agent Path Finding

Anytime Multi-Agent Path Finding via Large Neighborhood Search

Efficient and Effective Techniques for Large-Scale Multi-Agent Path Finding

Task and Path Planning for Multi-Agent Pickup and Delivery

Searching with Consistent Prioritization for Multi-Agent Path Finding

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks

Multi-Agent Path Finding with Deadlines

A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination (extended abstract)

Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding

Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences

Unconstraining Multi-Robot Manipulation: Enabling Arbitrary Constraints in ECBS with Bounded Sub-Optimality

Beyond Pairwise Reasoning in Multi-Agent Path Finding

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution

Mutex Propagation for SAT-based Multi-Agent Path Finding

Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree

ITA-ECBS: A Bounded-Suboptimal Algorithm for The Combined Target-Assignment and Path-Finding Problem

Which MAPF Model Works Best for Automated Warehousing?

Improving Learnt Local MAPF Policies with Heuristic Search

Conflict-Based Increasing Cost Search

A New Constraint Satisfaction Perspective on Multi-Agent Path Finding

MAPF in 3D Warehouses: Dataset and Analysis

Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding

Multi-Goal Multi-Agent Pickup and Delivery

Multi-Agent Motion Planning With Bézier Curve Optimization Under Kinodynamic Constraints

Multi-Agent Path Finding for Precedence-Constrained Goal Sequences

Multi-Agent Path Finding with Mutex Propagation

Multi-Robot Geometric Task-and-Motion Planning for Collaborative Manipulation Tasks

A MIP-Based Approach for Multi-Robot Geometric Task-and-Motion Planning

A Hierarchical Approach to Multi-Agent Path Finding

Multi-Agent Path Finding with Mutex Propagation

Multi-Robot Coordination and Layout Design for Automated Warehousing

Guidance Graph Optimization for Lifelong Multi-Agent Path Finding

Arbitrarily Scalable Environment Generators via Neural Cellular Automata

Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding

Mutex Propagation in Multi-Agent Path Finding for Large Agents

Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding