Multi-Agent Path Finding (MAPF) involves computing collision-free paths for multiple agents from their starting locations to given destinations in a known environment. This problem finds diverse applications, from robot coordination to traffic management. Researchers in artificial intelligence, robotics, and theoretical computer science have been actively exploring various MAPF problem variants and solution approaches. This workshop aims to bring these researchers together to present their research, discuss future research directions, and cross-fertilize the different communities.

WoMAPF 2025 is kindly supported by Symbotic and SoCS.

News


Important Dates

Note: all deadlines are “anywhere on earth” (UTC-12)

Topics

All works that relate to collision-free path planning or navigation for multiple agents are welcome, including but not limited to:

Format of Workshop

The workshop is a One-Day workshop including:

The industry panel, newly introduced, aims to foster stronger connections and bridge the gap between industry and the MAPF research community.

Please note that AAAI requires all presentations to be delivered in person and virtual attendance is permitted for general participation only.

Workshop Schdule

Time (EST) Activities and Presentation Topic Authors/Presenters
08:55 Opening Remarks  
09:00 Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields Arseni Pertzovskiy, Roni Stern, Roie Zivan, Ariel Felner
  Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding Hongzhi Zang, Yulun Zhang, He Jiang, Zhe Chen, Daniel Harabor, Peter Stuckey, Jiaoyang Li
  Early Results with LF: Online Multi-Robot Path Planning meets Optimal Trajectory Control Ajay Shankar, Keisuke Okumura, Amanda Prorok
  Concurrent Planning and Execution in Lifelong Multi-Agent Path Finding with Delay Probabilities Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter Stuckey
  Optimized Solving Anonymous and Combinatorial Multi-Agent Path Finding Problems in Polynomial Time Stefan Edelkamp
09:40 Break (15 mins)  
09:55 Invited Talk (45 minutes) Chuchu Fan
10:40 Tea Break (20 mins)  
11:00 On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning Thayne T. Walker, Nathan R. Sturtevant
  Goal Distribution in Conflict-Based Search for Multi-Agent Pathfinding and its Implications to Monte-Carlo Sampling Colton Simpson, Sumedh Pendurkar, Guni Sharon
  Minimizing Makespan with Conflict-Based Search for Optimal Multi-Agent Path Finding Amir Maliah, Dor Atzmon, Ariel Felner
  CBS with Continuous-Time Revisit Andy Li, Zhe Chen, Daniel Harabor
  Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Search Jingtian Yan, Jiaoyang Li
  How Constraints Define Control for Multi-Agent Navigation Robots Boyang Zhang
  Measure Preserving Flows for Ergodic Search in Convoluted Environments Albert Xu, Bhaskar Vundurthy, Geordan Gutow, Ian Abraham, Jeff Schneider, Howie Choset
  Hierarchical Large Scale Multirobot Path (Re)Planning Lishuo Pan, Kevin Hsu, Nora Ayanian
12:10 Poster Session with Lunch in Workshop (80 mins)  
     
  Presentations above are assigned to the morning poster session / below to the afternoon  
     
13:30 Deep Reinforcement Learning based Truck Dispatcher for Open-pit Mines Vaibhav Mukundan, Apurva Narayan
  Multi-Robot Motion Planning with Diffusion Models Yorai Shaoul, Itamar Mishani, Shivam Vats, Jiaoyang Li, Maxim Likhachev
  Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models Jinhao Liang, Jacob Christopher, Sven Koenig, Ferdinando Fioretto
  Multi-Agent Path Finding for Schedule Constrained Automation Kareem Eissa, Rayal Prasad, Ankur Kapoor
  A Quality Diversity Approach to Automatically Generate Multi-Agent Path Finding Benchmark Maps Cheng Qian, Yulun Zhang, Varun Bhatt, Matthew Fontaine, Stefanos Nikolaidis, Jiaoyang Li
14:10 Break (15 mins)  
14:25 Industry Panel Presentations (35 mins)  
16:00 Industry Panel Discussion (5 mins prep + 35 mins)  
15:40 Tea Break (20 mins)  
16:00 100-Mouse System: a Swarm Robotics Platform and its Intuitive State Management User Interface Ryusei Matsumoto, Shota Yamamoto, Yoko Sasaki, Keisuke Okumura
  COLREG-CBS: COLREGs-Compliant Search-based Path Planning for Autonomous Surface Vehicles Kumar Jaiswal, Rahul Kulkarni, Saifullah Khan, Shwitaan Iyer, Sujit P. Baliyarasimhuni
  Generalized Multi-Agent Multi-Objective Ergodic Search Bhaskar Vundurthy, Geordan Gutow, Akshaya Kesarimangalam Srinivasan, Albert Xu, Burhanuddin Shirose, Howie Choset
  Toward Multi-Agent Moving Target Traveling Salesman Problems Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
  Generating Safe Policies for Multi-Agent Path Finding with Temporal Uncertainty Jiří Švancara, David Zahradka, Mrinalini Subramanian, Roman Barták, Miroslav Kulich
16:40 Community Discussion  
16:50 Poster Session with Snacks and Drinks (60 mins)  
17:50 Closing  

Poster Only Presentation

  Activities and Presentation Topic Authors/Presenters
All Day Poster Board Usage Lifelong MAPF and Task Assignment Considering Workers in Warehouses Naoki Mizumoto, Katsuhide Fujita, Yoshihiro Ueda, Takayoshi Mori

Invited Talk

Recent Advances in MAPF: Constrained Planning, Temporal Logic, and LLM-Assisted Planning, by Chuchu Fan (MIT)

Abstract: In this talk, we explore recent advances from my group that tackle complex planning challenges in multi-robot systems. First, we present a hierarchical framework for solving the Constrained Multiple Depot Traveling Salesman Problem (CMDTSP), efficiently incorporating real-world constraints such as battery limits and inter-agent conflicts to improve solution quality and computational efficiency. Next, we discuss a novel approach to multi-agent motion planning under complex temporal constraints using signal temporal logic (STL), where timed waypoints enable task allocation and collision-free motion planning for nonlinear and nonholonomic agents. Finally, we introduce AutoTAMP, a method that leverages large language models (LLMs) as translators and checkers to bridge natural language task descriptions with task-and-motion planning, enabling robots to jointly reason about tasks and motion under intricate environmental and temporal constraints.

Bio: Dr. Chuchu Fan is a pre-tenure associate professor at AeroAstro and LIDS at MIT. Before that, she was a postdoc researcher at Caltech and got her Ph.D. from ECE at the University of Illinois at Urbana-Champaign. Her research group, Realm at MIT, works on using rigorous mathematics, including formal methods, machine learning, and control theory, for the design, analysis, and verification of safe autonomous systems. Chuchu is the recipient of an NSF CAREER Award, an AFOSR Young Investigator Program (YIP) Award, an ONR Young Investigator Program (YIP) Award, and the 2020 ACM Doctoral Dissertation Award.

Industry Panel

We’ve confirmed the participation from Amazon Robotics and Symbotic – both are leading companies in robotics and warehouse automation. We’re also reaching out to other companies who are applying automation in diverse and innovative ways to further enrich the discussions.

Submission Requirements (Closed)

Submissions can contain relevant work in all possible stages, including work that was recently published, is under submission elsewhere, was only recently finished, or is still ongoing.

All submissions will receive at least 2 light reviews. The review process will be single-blind.

Submission Site (Closed)

https://cmt3.research.microsoft.com/WoMAPF2025/Submission/Index

Call for Student Travel Grants (Closed)

Thanks to the generous support of our sponsor Symbotic and SoCS, we are pleased to announce the WoMAPF Student Travel Grants. Winners will receive a fixed amount of travel support, which is expected to be around 1,000 USD. The exact amount will depend on the number of other applicants.

To be eligible, an applicant must be either:

The organizing committee will select several winners based on:

Additionally, it would be helpful if you could indicate the amount of other funding you have already received. Priority will be given to students who are actively involved in MAPF, taking into account their place of residence.

Please submit your application via the following page.

https://forms.gle/13BXVT2fA7tCEaBY6

The deadline for applications is 13 January 2025, UTC-12. Notification is expected within that week. Instructions for the transfer process will be provided after notification. We plan to transfer the grants after the workshop day.

We are looking forward to your applications!

Workshop Committee

Advisory Board

PC Members

WoMAPF 2025 is kindly supported by:

and

SoCS (International Symposium on Combinatorial Search)