Pith. sign in

Paper Citation Record · LEDGER

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding

As of 22 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 2 inbound Pith citation observations for arXiv:2602.12024.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2602.12024 v3

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T00:03:10.927860Z

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T13:57:14.224655Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-07-02T18:47:16.862926Z

Reference resolution

33 of 33 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved33
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9c45676f-c723-44f5-803f-4453d5c7d475 · outbound

This paper cites Multi-agent pathfinding: Definitions, variants, and benchmarks,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Multi-agent pathfinding: Definitions, variants, and benchmarks,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:07.187105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:07.187105Z digest=sha256:572a2d2fb9c20646b1f36b915636f80b8d627d3d82ca0b09aac40c6ee83f33f5

Observation 29f73e77-5b76-4492-bc49-effebac2c904 · outbound

This paper cites Guest editorial: A revolution in the warehouse: A retrospective on kiva systems and the grand challenges ahead,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Guest editorial: A revolution in the warehouse: A retrospective on kiva systems and the grand challenges ahead,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:07.304221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:07.304221Z digest=sha256:6f14047199adf8b8e32c81f4e366b154775bffdc909379f4800cd8592657ddbb

Observation 1ef0eb4f-f931-47b3-83b2-ecb694515d61 · outbound

This paper cites Accelerating search- based planning for multi-robot manipulation by leveraging online- generated experiences,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Accelerating search- based planning for multi-robot manipulation by leveraging online- generated experiences,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:07.461767Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:07.461767Z digest=sha256:6542901063370237a1ca83ff4bfbdf7951daa5eecbbe070d0c043888c19853cf

Observation e1c1278f-5e0d-4e7d-8659-76244dfa325e · outbound

This paper cites Lns2+ rl: Combining multi-agent reinforcement learning with large neighborhood search in multi-agent path finding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Lns2+ rl: Combining multi-agent reinforcement learning with large neighborhood search in multi-agent path finding,

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:07.664415Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:07.664415Z digest=sha256:acffb2a018db487b7b433d07c2c0d9f2e98db545f9c899f51e868de2628018b0

Observation ff2e1604-8800-4cf4-989f-b7765c3eef26 · outbound

This paper cites Multi Agent Path Finding using Evolutionary Game Theory.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Multi Agent Path Finding using Evolutionary Game Theory

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:07.790414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:07.790414Z digest=sha256:c4164051b878d538c274c24189a874024474efa04b7e253efff1d2f2218a6db7

Observation 0cbdf3c2-4a93-4455-a225-0eb34f37c6a5 · outbound

This paper cites Coordinating hundreds of cooperative, autonomous vehicles in warehouses,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Coordinating hundreds of cooperative, autonomous vehicles in warehouses,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:07.948991Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:07.948991Z digest=sha256:90480084e1cc5e1ad771e4d3c904c5cf183133743b0a23a350c5ae04877eda39

Observation afa093ab-5625-4830-afce-6a3504d8383f · outbound

This paper cites Finding optimal solutions to cooperative pathfinding problems,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Finding optimal solutions to cooperative pathfinding problems,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.074732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.074732Z digest=sha256:47ad9586fbfa091276c49c6f15f4fea69a7810117ce3436d858c75db8c10e33f

Observation f97afe12-2bbf-4666-9984-3a017f65aaad · outbound

This paper cites Planning optimal paths for multiple robots on graphs,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Planning optimal paths for multiple robots on graphs,

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.250017Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.250017Z digest=sha256:c697ff79e6919162e4650fbbe7887843b56d47dd18a1275b33eb5086eaa33061

Observation 594b15d1-2165-4e24-80ec-042240e86b10 · outbound

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

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Mapf- lns2: Fast repairing for multi-agent path finding via large neighborhood search,

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.332144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.332144Z digest=sha256:92239192eab1667e0192a1795960059672ce48d62b6498c4d5ad0537f603011a

Observation aea3dbff-577e-4270-a0f0-15ce39ee9c1f · outbound

This paper cites Lacam: Search-based algorithm for quick multi-agent pathfinding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Lacam: Search-based algorithm for quick multi-agent pathfinding,

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.418047Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.418047Z digest=sha256:9543e11ee5cb6778b3f1fb2c44657ffe7cbfdb12b1697c2bd5adaaba4df137eb

Observation 677c50fe-9673-4fc3-ac1b-70642f4cd91a · outbound

This paper cites Anytime multi-agent path finding via large neighborhood search,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Anytime multi-agent path finding via large neighborhood search,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.505791Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.505791Z digest=sha256:d3b23692fd769e68ec52e9cf4e5c005fa0194349407e72fda3910389b694c167

Observation 5e388148-1ea9-4926-8194-4d31eb5ff535 · outbound

This paper cites Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.597775Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.597775Z digest=sha256:d092ec471e2bb90fe6b3f6735e475ea189afbe59959a35f4f8dd3bfa1d37e2a4

Observation 216f7256-202c-4d89-acd6-02b3e60e034a · outbound

This paper cites Engineering LaCAM$^\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Engineering LaCAM$^\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.688527Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.688527Z digest=sha256:ab2498aae778138b9fb24d47d517496805f438e07b80ca840c3c55802c8f5b7e

Observation daa672ea-c980-4e9f-bae7-0daec21e0a10 · outbound

This paper cites Tracking Progress in Multi-Agent Path Finding.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Tracking Progress in Multi-Agent Path Finding

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:08.841240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:08.841240Z digest=sha256:19a46827ee8510faf03d0b46024439194a7fc44d2b8b3e074d0dd0bc5a7ce862

Observation 7afbff44-f5de-4676-a7e1-965634a2ed61 · outbound

This paper cites Conflict-based search for optimal multi-agent pathfinding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Conflict-based search for optimal multi-agent pathfinding,

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.019657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.019657Z digest=sha256:53ce4dc9a8709ef74bfc5412e27ca8b62831953166819bc9d813acd7d9e24e86

Observation 4b4dc03a-37fd-428e-99b7-a37357554281 · outbound

This paper cites Branch-and- cut-and-price for multi-agent path finding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Branch-and- cut-and-price for multi-agent path finding,

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.139239Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.139239Z digest=sha256:e636f3dfb3279455c4d4cae81b826306706692ba244dc9b1cc429e2630144092

Observation 486683e6-c540-4c49-a4aa-953bc028e637 · outbound

This paper cites The increasing cost tree search for optimal multi-agent pathfinding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding The increasing cost tree search for optimal multi-agent pathfinding,

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.262914Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.262914Z digest=sha256:8aef33817b905fd3468db2e674756a3976fc38cbcc882e0be61ef4e40234dd7d

Observation 945e3fc9-3000-499f-b922-d5f88a127044 · outbound

This paper cites Icbs: The improved conflict-based search algorithm for multi-agent pathfinding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Icbs: The improved conflict-based search algorithm for multi-agent pathfinding,

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.429217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.429217Z digest=sha256:e1d752f64c2c1f294b1f5744e5e61e00801fdf38e63521ac43675123a202da4e

Observation 21d15ab1-3960-416b-b0a5-2be9bb267693 · outbound

This paper cites Eecbs: A bounded-suboptimal search for multi-agent path finding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Eecbs: A bounded-suboptimal search for multi-agent path finding,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.539394Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.539394Z digest=sha256:613af574d43623c228238b0cf35ac2209bebbd305e4875e4d5d9add068442ad4

Observation edd83a92-76c9-4e26-9f10-ef6b7ae1a9bd · outbound

This paper cites Subdimensional expansion for multirobot path planning,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Subdimensional expansion for multirobot path planning,

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.720413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.720413Z digest=sha256:2aaffa8825f546c65f06980a00a8ba301e15263676be82b8ef631c21af3900b1

Observation c6418a58-b6f4-4f94-8b68-a1a2b2792661 · outbound

This paper cites Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges,

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.883412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.883412Z digest=sha256:20412f53e6a807768d2e81b0e7009b245663a7075ae505346e6a692cb7cfca90

Observation 95c04ca7-f7c3-423f-a9c5-cc7be5f40dd8 · outbound

This paper cites Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:09.997355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:09.997355Z digest=sha256:14ebddd764288091681e052ab4aaac95c172a5f390e912f38b15b6d73f5aa1af

Observation d5c67f35-8479-4060-9baa-0b0e627a7338 · outbound

This paper cites Fico: Finite- horizon closed-loop factorization for unified multi-agent path finding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Fico: Finite- horizon closed-loop factorization for unified multi-agent path finding,

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.167637Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.167637Z digest=sha256:c125422944da830bef92604be6477f15a5f37b5b9af2abb5afec027a14cd66ed

Observation 7b56fafd-50c8-4f68-a4ba-8e962f7e941d · outbound

This paper cites Constrained model predictive control: Stability and optimality,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Constrained model predictive control: Stability and optimality,

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.286074Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.286074Z digest=sha256:684e9730bbce0dd2c4fa2bcfe4ed59e171e38c324958269461eb038ad82abb77

Observation 8d8efb35-ad24-4952-bdc3-fe1643e37338 · outbound

This paper cites Continuity and monotonicity of the mpc value function with respect to sampling time and prediction horizon,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Continuity and monotonicity of the mpc value function with respect to sampling time and prediction horizon,

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.393592Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.393592Z digest=sha256:a849a2f183a1042d39bdceb14743e4bb6f66f515e5463774e80a357bfef422ca

Observation b00634ac-4684-4b50-9c75-2fa247250b5e · outbound

This paper cites Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.501753Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.501753Z digest=sha256:e02dbee7298fd9c1fcc1a70d4761d12f96375274b8f8f87d5e4fe15cceee6611

Observation ad977fd4-1ddd-4fda-b801-aeccaf7c0833 · outbound

This paper cites Multi-agent path finding with delay probabilities,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Multi-agent path finding with delay probabilities,

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.571165Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.571165Z digest=sha256:d319d1d7a6d99a38cecca697a8b1d5823339b1466b611677f528e11cdc0a810f

Observation 790fa181-2423-40cb-8565-86b01dd65047 · outbound

This paper cites Lifelong multi-agent path finding in large-scale warehouses,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Lifelong multi-agent path finding in large-scale warehouses,

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.643466Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.643466Z digest=sha256:80c57140eebf372ff69a04fd9ddc73bacf6847c919be07e0b4be019f60b5bed4

Observation 4b6440a8-78ae-4029-b9b7-13d6db5bba65 · outbound

This paper cites an unresolved cited work.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Unresolved cited work

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.718418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.718418Z digest=sha256:a69411c71065fa3116744a8ac12556133d7d25a29974cdb4f433cad1d1995eef

Observation 59ffcf19-bcaf-47e6-a35e-d9b9c5f69713 · outbound

This paper cites Priority inheritance with backtracking for iterative multi-agent path finding,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Priority inheritance with backtracking for iterative multi-agent path finding,

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.776958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.776958Z digest=sha256:5fc4f95d6d9801dad9ecfb572e2f373260799384029f290ed9ad7ed749d5c8d8

Observation 8d6dce36-7f2d-4901-9e28-31d9a992bb09 · outbound

This paper cites Anytime Single-Step MAPF Planning with Anytime PIBT.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Anytime Single-Step MAPF Planning with Anytime PIBT

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.826703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.826703Z digest=sha256:d573bf3ef39e8d4f1bc85aed11ae7e13ef0f1ccb93becb95357445feb5ce00ee

Observation d47423cc-874f-409d-9aa8-a24036a49f24 · outbound

This paper cites An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives,.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives,

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.886737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.886737Z digest=sha256:7a4835f683b8bf6e557cab2f5820aae10dbd87a8ae2a32878dab87cb211b23b2

Observation 3d616f21-a2d9-4f76-92b8-6b825c2a7d85 · outbound

This paper cites Grne and J.

Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding Grne and J

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-03T00:03:10.927860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T00:03:10.927860Z digest=sha256:3f22bcc06f4bd8611ddb5edb89fb1908b31bd7ed220aaa4d68134dd3585b7151

Pith citing papers

Observation 64752cb5-d76e-42ef-bc93-b79410a3fd49 · inbound

Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search cites this paper.

Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding

Reference 14

Resolution
verified exact
local_arxiv, observed 2026-07-02T18:47:16.864147Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-07-02T18:46:43.417975Z digest=sha256:e0fb5e99d65d6a95c1eee5ed90cd70666f3160243f362a2454ca5669a99233a9

Observation 5293ed49-9b86-43cc-8c0b-b966a55da970 · inbound

PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3 cites this paper.

PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3 Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-06T13:57:14.224655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T13:57:14.224655Z digest=sha256:07b5b497714b14d36fe561da98301a6e0a325cf601ede29677acaf9d2e5edf15