From Real-Time Planning to Reliable Execution:Scalable Coordination for Heterogeneous Multi-Robot Fleets in Industrial Environments

Bo Cao; Hesheng Wang; Zhe Liu

arxiv: 2607.00591 · v1 · pith:H6EZ74CZnew · submitted 2026-07-01 · 💻 cs.RO · cs.MA

From Real-Time Planning to Reliable Execution:Scalable Coordination for Heterogeneous Multi-Robot Fleets in Industrial Environments

Bo Cao , Zhe Liu , Hesheng Wang This is my paper

Pith reviewed 2026-07-02 11:36 UTC · model grok-4.3

classification 💻 cs.RO cs.MA

keywords multi-robot coordinationonline path planningheterogeneous robotsindustrial roboticsconflict resolutionprecedence relationsreactive coordination

0 comments

The pith

SCALE enables real-time path planning for heterogeneous robot fleets while handling execution disturbances through adaptive precedence adjustments.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces SCALE as a reactive online coordination framework for heterogeneous multi-robot fleets operating in industrial environments. It addresses the dual challenge of generating feasible paths in real time under high densities and varying robot capabilities, while preventing deviations from disturbances like delays from causing widespread waiting or congestion. The central mechanisms are a motion-induced conflict reduction process that supports online path generation and a generalized Conjugate Action-Precedence Hypergraph that dynamically revises robot ordering. A reader would care because these features aim to keep fleets productive without centralized replanning at every disruption.

Core claim

SCALE is a reactive online coordination framework that enables real-time planning while maintaining robust execution for heterogeneous multi-robot fleets by introducing a motion-induced conflict reduction mechanism to support the online generation of feasible paths for online conflict resolution and a generalized Conjugate Action-Precedence Hypergraph that adaptively adjusts precedence relations among robots to mitigate the effects of disturbances.

What carries the argument

The generalized Conjugate Action-Precedence Hypergraph (CAPH) that adaptively adjusts precedence relations among robots, paired with a motion-induced conflict reduction mechanism for generating feasible paths online.

If this is right

Online path generation remains computationally tractable even at high robot densities with heterogeneous speeds and sizes.
Disturbance-induced deviations are contained locally rather than propagating through the fleet.
Precedence relations update without requiring full replanning of all paths.
The framework supports sustained operation over multi-day periods as shown in the warehouse test.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same adaptive precedence structure might apply to mixed human-robot teams if disturbance models are extended to include human variability.
If CAPH updates stay local, the approach could reduce reliance on a single central planner for very large fleets.
Testing under sensor noise or partial map knowledge would reveal whether the conflict reduction step remains reliable.

Load-bearing premise

The motion-induced conflict reduction and adaptive CAPH adjustments will prevent congestion propagation and excessive waiting without introducing new computational bottlenecks or infeasible paths when real disturbances occur.

What would settle it

A warehouse deployment or simulation where communication delays cause SCALE-controlled robots to show higher total waiting time or more deadlocks than a baseline planner under identical disturbance levels.

read the original abstract

With the increasing deployment of heterogeneous robot fleets in industrial environments, efficient coordination remains a critical challenge. Real-time path planning must simultaneously accommodate high robot densities and heterogeneous motion capabilities, while communication delays, execution uncertainties, and other disturbances may cause robots to deviate from the temporal assumptions underlying planned paths. Such deviations can lead to excessive waiting and congestion propagation across the fleet. This paper presents SCALE, a reactive online coordination framework that enables real-time planning while maintaining robust execution. Within this framework, we introduce a motion-induced conflict reduction mechanism to support the online generation of feasible paths for online conflict resolution. To mitigate the effects of disturbances, we further design a generalized Conjugate Action-Precedence Hypergraph (CAPH) that adaptively adjusts precedence relations among robots. Extensive validation experiments, together with a three-day deployment in a warehouse, demonstrate the

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

SCALE and CAPH target a real industrial multi-robot problem with a deployment story, but the abstract gives no numbers to check whether the mechanisms actually work.

read the letter

The paper's main offering is SCALE, a reactive online framework that adds a motion-induced conflict reduction step and a generalized Conjugate Action-Precedence Hypergraph (CAPH) to adjust robot precedence on the fly when disturbances hit.

It does a reasonable job laying out the practical setting—high densities, heterogeneous speeds, communication delays, and execution drift—and it includes a three-day warehouse deployment, which is the kind of evidence that matters for coordination work.

The soft spot is the complete absence of any metrics, baselines, or error analysis in the text provided. Without those, there is no way to tell whether CAPH actually cuts waiting time or congestion propagation, or whether the online planning stays fast enough under load. The central claims rest on mechanisms that sound plausible but remain unquantified here.

This is for robotics groups working on warehouse or factory fleets who need deployable coordination rather than pure theory. A reader already familiar with multi-agent planning might skim the deployment section for ideas, but the work needs the full experimental section to be useful.

Send it for peer review so the experiments and comparisons can be checked directly.

Referee Report

1 major / 1 minor

Summary. The paper presents SCALE, a reactive online coordination framework for heterogeneous multi-robot fleets in industrial environments. It introduces a motion-induced conflict reduction mechanism to enable online generation of feasible paths for conflict resolution, along with a generalized Conjugate Action-Precedence Hypergraph (CAPH) that adaptively adjusts precedence relations among robots to handle disturbances such as communication delays and execution uncertainties. The central claim is that this framework supports real-time planning while maintaining robust execution, preventing congestion propagation and excessive waiting, as demonstrated by extensive validation experiments and a three-day warehouse deployment.

Significance. If the mechanisms hold under real disturbances, the work could advance scalable coordination for high-density heterogeneous fleets by addressing the gap between planned paths and execution deviations, which is a key practical challenge in industrial robotics. The adaptive CAPH and conflict reduction approach offer a potentially generalizable way to maintain feasibility without new bottlenecks, though the lack of reported metrics limits assessment of improvement magnitude or generalizability.

major comments (1)

[Abstract] Abstract: the claim of 'extensive validation experiments, together with a three-day deployment in a warehouse, demonstrate the' effectiveness is load-bearing for the central claim of real-time planning and robust execution, yet the abstract (and provided text) supplies no data, metrics, baselines, error analysis, or quantitative comparison to prior methods. This prevents evaluation of whether motion-induced conflict reduction and adaptive CAPH adjustments actually prevent congestion propagation without introducing infeasible paths or computational overhead.

minor comments (1)

[Abstract] The abstract text is truncated mid-sentence after 'demonstrate the'.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed review and for identifying the need for quantitative support in the abstract to substantiate the central claims. We address the major comment below.

read point-by-point responses

Referee: [Abstract] Abstract: the claim of 'extensive validation experiments, together with a three-day deployment in a warehouse, demonstrate the' effectiveness is load-bearing for the central claim of real-time planning and robust execution, yet the abstract (and provided text) supplies no data, metrics, baselines, error analysis, or quantitative comparison to prior methods. This prevents evaluation of whether motion-induced conflict reduction and adaptive CAPH adjustments actually prevent congestion propagation without introducing infeasible paths or computational overhead.

Authors: We agree that the abstract, in its current form, does not include specific metrics, baselines, or quantitative comparisons, which limits the ability to immediately assess the magnitude of improvements from the proposed mechanisms. The full manuscript contains detailed results from the validation experiments and warehouse deployment (including planning times, conflict resolution rates, congestion metrics, and comparisons), but these are not summarized in the abstract. To address this, we will revise the abstract to incorporate a concise summary of key quantitative findings from the experiments and deployment, enabling readers to evaluate the claims regarding real-time performance and robustness under disturbances. revision: yes

Circularity Check

0 steps flagged

No circularity detected; derivation chain not visible in text

full rationale

The provided abstract and context contain no equations, derivations, parameter fittings, or self-citations that could reduce any claim to its inputs by construction. The described mechanisms (motion-induced conflict reduction and generalized CAPH) are presented at a conceptual level without mathematical steps that permit circularity analysis. This is the expected outcome when no load-bearing formal content is available for inspection.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no equations, parameters, or modeling choices; ledger left empty.

pith-pipeline@v0.9.1-grok · 5678 in / 955 out tokens · 24707 ms · 2026-07-02T11:36:15.698296+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

29 extracted references · 1 canonical work pages

[1]

An mpc scheme for traffic coordination in open and irreversible, zone-controlled, guidepath-based transport systems,

S. Reveliotis, “An mpc scheme for traffic coordination in open and irreversible, zone-controlled, guidepath-based transport systems,”IEEE Transactions on Automation Science and Engineering, vol. 17, no. 3, pp. 1528–1542, 2020

2020
[2]

Optimal petri-net controller for avoiding collisions in a class of automated guided vehicle systems,

J. Luo, Y . Wan, W. Wu, and Z. Li, “Optimal petri-net controller for avoiding collisions in a class of automated guided vehicle systems,” IEEE Transactions on Intelligent Transportation Systems, vol. 21, no. 11, pp. 4526–4537, 2019

2019
[3]

Collision avoidance and give way of heterogeneous and variable-sized multiple mobile robots based on glued nodes,

Z. Xing, H. Yue, T. Zhang, W. Wu, and R. Hu, “Collision avoidance and give way of heterogeneous and variable-sized multiple mobile robots based on glued nodes,”IEEE Transactions on Automation Science and Engineering, vol. 21, no. 3, pp. 3627–3638, 2023

2023
[4]

Mapf-lns2: Fast repairing for multi-agent path finding via large neighborhood search,

J. Li, Z. Chen, D. Harabor, P. J. Stuckey, and S. Koenig, “Mapf-lns2: Fast repairing for multi-agent path finding via large neighborhood search,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 9, 2022, pp. 10 256–10 265

2022
[5]

LaCAM: Search-based algorithm for quick multi-agent pathfinding,

K. Okumura, “LaCAM: Search-based algorithm for quick multi-agent pathfinding,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 10, 2023, pp. 11 655–11 662

2023
[6]

Improving LaCAM for scalable eventually optimal multi- agent pathfinding,

K. Okumura, “Improving LaCAM for scalable eventually optimal multi- agent pathfinding,” inProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, 8 2023, pp. 243– 251

2023
[7]

Multi-agent path finding for large agents,

J. Li, P. Surynek, A. Felner, H. Ma, T. S. Kumar, and S. Koenig, “Multi-agent path finding for large agents,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, 2019, pp. 7627– 7634

2019
[8]

Improving Continuous-time Conflict Based Search

E. Boyarski, R. Stern, K. S. Yakovlev, and A. Andreychuk, “Improving Continuous-time Conflict Based Search.”arXiv: Artificial Intelligence, Jan. 2021

2021
[9]

Symmetry breaking for k-robust multi-agent path finding,

Z. Chen, D. D. Harabor, J. Li, and P. J. Stuckey, “Symmetry breaking for k-robust multi-agent path finding,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 14, 2021, pp. 12 267– 12 274

2021
[10]

Persistent and robust execution of mapf schedules in warehouses,

W. H ¨onig, S. Kiesel, A. Tinka, J. W. Durham, and N. Ayanian, “Persistent and robust execution of mapf schedules in warehouses,”IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 1125–1131, 2019

2019
[11]

Receding horizon re-ordering of multi-agent execution schedules,

A. Berndt, N. Van Duijkeren, L. Palmieri, A. Kleiner, and T. Keviczky, “Receding horizon re-ordering of multi-agent execution schedules,” IEEE Transactions on Robotics, vol. 40, pp. 1356–1372, 2023

2023
[12]

Breaking the limit on the number of robots through the conflict-free scheduling in robotic mobile fulfillment systems,

Y . Sun, N. Zhao, L. Tang, and L. Luo, “Breaking the limit on the number of robots through the conflict-free scheduling in robotic mobile fulfillment systems,”IEEE Transactions on Automation Science and Engineering, vol. 22, pp. 7324–7334, 2024

2024
[13]

Agv traffic manage- ment in automated industrial plants: An enhanced lifelong multi-agent path finding approach,

A. Bonetti, S. Proia, S. Guidetti, and L. Sabattini, “Agv traffic manage- ment in automated industrial plants: An enhanced lifelong multi-agent path finding approach,” in2024 IEEE 20th International Conference on Automation Science and Engineering (CASE). IEEE, 2024, pp. 626– 632

2024
[14]

Lifelong path planning with kinematic constraints for multi-agent pickup and de- livery,

H. Ma, W. H ¨onig, T. S. Kumar, N. Ayanian, and S. Koenig, “Lifelong path planning with kinematic constraints for multi-agent pickup and de- livery,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, 2019, pp. 7651–7658

2019
[15]

Lifelong multi-agent path finding in large-scale warehouses,

J. Li, A. Tinka, S. Kiesel, J. W. Durham, T. S. Kumar, and S. Koenig, “Lifelong multi-agent path finding in large-scale warehouses,” inPro- ceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, 2021, pp. 11 272–11 281

2021
[16]

Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,

M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,” inProceedings of the Seventh Annual Symposium on Combinatorial Search, 2014, pp. 19–27

2014
[17]

Searching with consistent prioritization for multi-agent path finding,

H. Ma, D. Harabor, P. J. Stuckey, J. Li, and S. Koenig, “Searching with consistent prioritization for multi-agent path finding,” inProceedings of the AAAI conference on artificial intelligence, vol. 33, no. 01, 2019, pp. 7643–7650

2019
[18]

Conflict-based search for optimal multi-agent pathfinding,

G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,”Artificial intelligence, vol. 219, pp. 40–66, 2015

2015
[19]

Priority inheri- tance with backtracking for iterative multi-agent path finding,

K. Okumura, M. Machida, X. D ´efago, and Y . Tamura, “Priority inheri- tance with backtracking for iterative multi-agent path finding,”Artificial Intelligence, vol. 310, p. 103752, 2022

2022
[20]

Generalizing multi-agent path finding for heterogeneous agents,

D. Atzmon, Y . Zax, E. Kivity, L. Avitan, J. Morag, and A. Felner, “Generalizing multi-agent path finding for heterogeneous agents,” in Proceedings of the International Symposium on Combinatorial Search, vol. 11, no. 1, 2020, pp. 101–105

2020
[21]

Conflict-based search for multi-robot motion planning with kinodynamic constraints,

J. Kottinger, S. Almagor, and M. Lahijanian, “Conflict-based search for multi-robot motion planning with kinodynamic constraints,” in2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022, pp. 13 494–13 499

2022
[22]

db-lacam: Fast and scalable multi-robot kinodynamic motion planning with discontinuity-bounded search and lightweight mapf,

A. Moldagalieva, K. Okumura, A. Prorok, and W. H ¨onig, “db-lacam: Fast and scalable multi-robot kinodynamic motion planning with discontinuity-bounded search and lightweight mapf,”arXiv preprint arXiv:2512.06796, 2025

work page arXiv 2025
[23]

Probabilistic robust multi-agent path finding,

D. Atzmon, R. Stern, A. Felner, N. R. Sturtevant, and S. Koenig, “Probabilistic robust multi-agent path finding,” inProceedings of the In- ternational Conference on Automated Planning and Scheduling, vol. 30, 2020, pp. 29–37

2020
[24]

Multi-agent path finding with kinematic constraints,

W. H ¨onig, T. Kumar, L. Cohen, H. Ma, H. Xu, N. Ayanian, and S. Koenig, “Multi-agent path finding with kinematic constraints,” in Proceedings of the International Conference on Automated Planning and Scheduling, vol. 26, 2016, pp. 477–485

2016
[25]

Time-independent planning for multiple moving agents,

K. Okumura, Y . Tamura, and X. D ´efago, “Time-independent planning for multiple moving agents,”Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, pp. 11 299–11 307, 2021

2021
[26]

Concurrent planning and execution in lifelong multi-agent path finding with delay probabilities,

Y . Zhang, Z. Chen, D. Harabor, P. Le Bodic, and P. J. Stuckey, “Concurrent planning and execution in lifelong multi-agent path finding with delay probabilities,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 39, no. 22, 2025, pp. 23 387–23 394

2025
[27]

Traffic flow optimisation for lifelong multi-agent path finding,

Z. Chen, D. Harabor, J. Li, and P. J. Stuckey, “Traffic flow optimisation for lifelong multi-agent path finding,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 18, 2024, pp. 20 674– 20 682

2024
[28]

A formal basis for the heuristic determination of minimum cost paths,

P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,”IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968

1968
[29]

Deadlock-free online plan repair in multi-robot coordination with disturbances,

A. Coskun, J. M. O’Kane, and M. Valtorta, “Deadlock-free online plan repair in multi-robot coordination with disturbances,” inProceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference. Florida Online Journals, 2021

2021

[1] [1]

An mpc scheme for traffic coordination in open and irreversible, zone-controlled, guidepath-based transport systems,

S. Reveliotis, “An mpc scheme for traffic coordination in open and irreversible, zone-controlled, guidepath-based transport systems,”IEEE Transactions on Automation Science and Engineering, vol. 17, no. 3, pp. 1528–1542, 2020

2020

[2] [2]

Optimal petri-net controller for avoiding collisions in a class of automated guided vehicle systems,

J. Luo, Y . Wan, W. Wu, and Z. Li, “Optimal petri-net controller for avoiding collisions in a class of automated guided vehicle systems,” IEEE Transactions on Intelligent Transportation Systems, vol. 21, no. 11, pp. 4526–4537, 2019

2019

[3] [3]

Collision avoidance and give way of heterogeneous and variable-sized multiple mobile robots based on glued nodes,

Z. Xing, H. Yue, T. Zhang, W. Wu, and R. Hu, “Collision avoidance and give way of heterogeneous and variable-sized multiple mobile robots based on glued nodes,”IEEE Transactions on Automation Science and Engineering, vol. 21, no. 3, pp. 3627–3638, 2023

2023

[4] [4]

Mapf-lns2: Fast repairing for multi-agent path finding via large neighborhood search,

J. Li, Z. Chen, D. Harabor, P. J. Stuckey, and S. Koenig, “Mapf-lns2: Fast repairing for multi-agent path finding via large neighborhood search,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 9, 2022, pp. 10 256–10 265

2022

[5] [5]

LaCAM: Search-based algorithm for quick multi-agent pathfinding,

K. Okumura, “LaCAM: Search-based algorithm for quick multi-agent pathfinding,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 10, 2023, pp. 11 655–11 662

2023

[6] [6]

Improving LaCAM for scalable eventually optimal multi- agent pathfinding,

K. Okumura, “Improving LaCAM for scalable eventually optimal multi- agent pathfinding,” inProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, 8 2023, pp. 243– 251

2023

[7] [7]

Multi-agent path finding for large agents,

J. Li, P. Surynek, A. Felner, H. Ma, T. S. Kumar, and S. Koenig, “Multi-agent path finding for large agents,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, 2019, pp. 7627– 7634

2019

[8] [8]

Improving Continuous-time Conflict Based Search

E. Boyarski, R. Stern, K. S. Yakovlev, and A. Andreychuk, “Improving Continuous-time Conflict Based Search.”arXiv: Artificial Intelligence, Jan. 2021

2021

[9] [9]

Symmetry breaking for k-robust multi-agent path finding,

Z. Chen, D. D. Harabor, J. Li, and P. J. Stuckey, “Symmetry breaking for k-robust multi-agent path finding,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 14, 2021, pp. 12 267– 12 274

2021

[10] [10]

Persistent and robust execution of mapf schedules in warehouses,

W. H ¨onig, S. Kiesel, A. Tinka, J. W. Durham, and N. Ayanian, “Persistent and robust execution of mapf schedules in warehouses,”IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 1125–1131, 2019

2019

[11] [11]

Receding horizon re-ordering of multi-agent execution schedules,

A. Berndt, N. Van Duijkeren, L. Palmieri, A. Kleiner, and T. Keviczky, “Receding horizon re-ordering of multi-agent execution schedules,” IEEE Transactions on Robotics, vol. 40, pp. 1356–1372, 2023

2023

[12] [12]

Breaking the limit on the number of robots through the conflict-free scheduling in robotic mobile fulfillment systems,

Y . Sun, N. Zhao, L. Tang, and L. Luo, “Breaking the limit on the number of robots through the conflict-free scheduling in robotic mobile fulfillment systems,”IEEE Transactions on Automation Science and Engineering, vol. 22, pp. 7324–7334, 2024

2024

[13] [13]

Agv traffic manage- ment in automated industrial plants: An enhanced lifelong multi-agent path finding approach,

A. Bonetti, S. Proia, S. Guidetti, and L. Sabattini, “Agv traffic manage- ment in automated industrial plants: An enhanced lifelong multi-agent path finding approach,” in2024 IEEE 20th International Conference on Automation Science and Engineering (CASE). IEEE, 2024, pp. 626– 632

2024

[14] [14]

Lifelong path planning with kinematic constraints for multi-agent pickup and de- livery,

H. Ma, W. H ¨onig, T. S. Kumar, N. Ayanian, and S. Koenig, “Lifelong path planning with kinematic constraints for multi-agent pickup and de- livery,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 01, 2019, pp. 7651–7658

2019

[15] [15]

Lifelong multi-agent path finding in large-scale warehouses,

J. Li, A. Tinka, S. Kiesel, J. W. Durham, T. S. Kumar, and S. Koenig, “Lifelong multi-agent path finding in large-scale warehouses,” inPro- ceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, 2021, pp. 11 272–11 281

2021

[16] [16]

Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,

M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,” inProceedings of the Seventh Annual Symposium on Combinatorial Search, 2014, pp. 19–27

2014

[17] [17]

Searching with consistent prioritization for multi-agent path finding,

H. Ma, D. Harabor, P. J. Stuckey, J. Li, and S. Koenig, “Searching with consistent prioritization for multi-agent path finding,” inProceedings of the AAAI conference on artificial intelligence, vol. 33, no. 01, 2019, pp. 7643–7650

2019

[18] [18]

Conflict-based search for optimal multi-agent pathfinding,

G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,”Artificial intelligence, vol. 219, pp. 40–66, 2015

2015

[19] [19]

Priority inheri- tance with backtracking for iterative multi-agent path finding,

K. Okumura, M. Machida, X. D ´efago, and Y . Tamura, “Priority inheri- tance with backtracking for iterative multi-agent path finding,”Artificial Intelligence, vol. 310, p. 103752, 2022

2022

[20] [20]

Generalizing multi-agent path finding for heterogeneous agents,

D. Atzmon, Y . Zax, E. Kivity, L. Avitan, J. Morag, and A. Felner, “Generalizing multi-agent path finding for heterogeneous agents,” in Proceedings of the International Symposium on Combinatorial Search, vol. 11, no. 1, 2020, pp. 101–105

2020

[21] [21]

Conflict-based search for multi-robot motion planning with kinodynamic constraints,

J. Kottinger, S. Almagor, and M. Lahijanian, “Conflict-based search for multi-robot motion planning with kinodynamic constraints,” in2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2022, pp. 13 494–13 499

2022

[22] [22]

db-lacam: Fast and scalable multi-robot kinodynamic motion planning with discontinuity-bounded search and lightweight mapf,

A. Moldagalieva, K. Okumura, A. Prorok, and W. H ¨onig, “db-lacam: Fast and scalable multi-robot kinodynamic motion planning with discontinuity-bounded search and lightweight mapf,”arXiv preprint arXiv:2512.06796, 2025

work page arXiv 2025

[23] [23]

Probabilistic robust multi-agent path finding,

D. Atzmon, R. Stern, A. Felner, N. R. Sturtevant, and S. Koenig, “Probabilistic robust multi-agent path finding,” inProceedings of the In- ternational Conference on Automated Planning and Scheduling, vol. 30, 2020, pp. 29–37

2020

[24] [24]

Multi-agent path finding with kinematic constraints,

W. H ¨onig, T. Kumar, L. Cohen, H. Ma, H. Xu, N. Ayanian, and S. Koenig, “Multi-agent path finding with kinematic constraints,” in Proceedings of the International Conference on Automated Planning and Scheduling, vol. 26, 2016, pp. 477–485

2016

[25] [25]

Time-independent planning for multiple moving agents,

K. Okumura, Y . Tamura, and X. D ´efago, “Time-independent planning for multiple moving agents,”Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, pp. 11 299–11 307, 2021

2021

[26] [26]

Concurrent planning and execution in lifelong multi-agent path finding with delay probabilities,

Y . Zhang, Z. Chen, D. Harabor, P. Le Bodic, and P. J. Stuckey, “Concurrent planning and execution in lifelong multi-agent path finding with delay probabilities,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 39, no. 22, 2025, pp. 23 387–23 394

2025

[27] [27]

Traffic flow optimisation for lifelong multi-agent path finding,

Z. Chen, D. Harabor, J. Li, and P. J. Stuckey, “Traffic flow optimisation for lifelong multi-agent path finding,” inProceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 18, 2024, pp. 20 674– 20 682

2024

[28] [28]

A formal basis for the heuristic determination of minimum cost paths,

P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,”IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968

1968

[29] [29]

Deadlock-free online plan repair in multi-robot coordination with disturbances,

A. Coskun, J. M. O’Kane, and M. Valtorta, “Deadlock-free online plan repair in multi-robot coordination with disturbances,” inProceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference. Florida Online Journals, 2021

2021