Pith. sign in

Paper Citation Record · LEDGER

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

As of 10 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-09T06:31:02.800959+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:e27be52932d80e1118917d36c01557dd56bd680d8ed4dca4918a2f14318faa17

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:9d393bf815d481908a243bdf7a7f66083d50913d4d530ccb623cb4432f9cfa68

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:573467ee5e8bd6dd819ab48c8a505e65cafdba72c944a126466a42faf92c2af8

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:05d0ae2671952d0cf362893a2d46c91c1393ef20ebffbfebd7d71672e5d8012a

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:c179287460cd0f29fa9ded801972d9ba34dd7eaa47f0b33b4093e09418c449ed

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:f3fb8689c44ada2ee19271be12076fd51d74c8f19d0de73fc74067e1804c9f12

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:06ddb9ecbcae62df8557796b5409a6cec25cb4749cd2fdd47e077317d0455f79

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:d26bb1bc0d67f4b9eec1510e4b3cf6fdfc54744b7f0e567b06ac08c37e55627c

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:ae5f5afe155a6d2117b0f0354b56e373f6811296493f9af05c42452921b13e6d

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:f685abc79f43c3778bea4ad787579a64746a53d782e104bb735345283223cc09

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:9eb1f119c0e66f0dff5d2df6f375f0c9e9c4aca9d5e7d4a8edfc6d44bfd6d6f2

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:d68d1f1f322cad08b52ac7e9fdae0dda13ce1f587de71c5b9768cb95e012bf19

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:cbf96429a373ad858d72a6a5d3d54a0e28552333651ef3c9af9a9664c597bd3d

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:b90be0cf9746ee63432ace3d1b7dd503937926d320a87e0b8a5ebc726b84e9f4

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:61a8fbf010738c3362785040f5c09c61ba31abe340a2df7011d7bbf193232e2b

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:a884c567e68ce045f25461710d91a9e2c7a063d73904637f0179d0af5b0abdc7

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:1d45c420f974e477c996f062150a4c87feb53d96f125e11c29fb95ab75f07fc5

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:11aeed999547f7cac248a6c3dc6cc8252de59a228f49cd4ddf8781a1271a4a93

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:53664dee038264ada8a768b90dc675b2bb11122f322cd4019203f642075421fb

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:566db3d4c0c5070d365ae0d2a6da2c814f6cb673588f95a13163094e59435ed0

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:a29dce88fe993fa89676a075ca49d7ed70234a77103af5231919f6c8b2b95797

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:4e44250c32d837cbae6e43bf2c345b397fc827818967925f925ea77f23b54d72

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:aef33d381c5df93beb2f1e9a68cbb19432f9a44b84fcbac02d6e57f84dd70417

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:31ddae03024458e9f227f587d8336a94b91daf24abf2374c3dc3a2a4e73f2a66

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:ae6b1220de0197cb75a18a61d986689986f7952711a008d0a1d86be0e773efa2

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:e14f2f33f317d0b5202699ef1014529a9e9f792f5a4beeda8035d352d85f5978

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:2cf84d13513c9e8c121df850a88551689c463755b2a1a6ceae3c90b4cc39e2e6

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:1962cb79a62d1ee8ca5bd0ce3d7b5322ac96b50809223d8bde704be3d5e9b807

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:d6313a0461e2dfe2a62aac3e81346e08b45fd8a922aef4fed299aeb2e499e3bd

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:53a35f77c6f088cd666aa22be7cad73dbe5f27ac09f8c1d6fa7a092a4f6aa122

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:7b1f1e0780fcaa57f5ae9768101fb99a57801a7c640b6f1b71e9091ed2ced9f6

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:bab2739eb3351c480dd257d23ff31545a9b6e3ea70c1db39dbe646ade30ed75f

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:4956ef8c3d185ae983b273f022a2fdbd0c431ebf7253f9f2073273c5ba11d308

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-09T06:31:02.800959+00:00.

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

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:205f317dd89e369304061cca8256114115da85d0b6fc44f6dd3a2ac4d69072c6