Zhe Chen

Affiliations:
  • Monash University, VIC, Australia


According to our database1, Zhe Chen authored at least 16 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Prioritised Planning with Guarantees.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Scalable Rail Planning and Replanning with Soft Deadlines.
CoRR, 2023

Tracking Progress in Multi-Agent Path Finding.
CoRR, 2023

Beyond Pairwise Reasoning in Multi-Agent Path Finding.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Multi-Train Path Finding Revisited.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery.
IEEE Robotics Autom. Lett., 2021

Anytime Multi-Agent Path Finding via Large Neighborhood Search.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Symmetry Breaking for k-Robust Multi-Agent Path Finding.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020


  Loading...