Near-Quadratic Inapproximability of Multi-Agent Pathfinding on Strongly Biconnected Digraphs

Authors

Shardul Mishra (ORCID: https://orcid.org/0009-0005-4164-7569)

Publication Details

Journal: Zenodo (CERN European Organization for Nuclear Research)
Published: 2026-10-30
DOI: https://doi.org/10.5281/zenodo.23808342
Primary Topic: Robotic Path Planning Algorithms
Type: preprint

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

preprint

Near-Quadratic Inapproximability of Multi-Agent Pathfinding on Strongly Biconnected Digraphs

Shardul Mishra

Oct 30, 2026

2 links

Zenodo (CERN European Organization for Nuclear Research)

Robotic Path Planning Algorithms

preprint

Near-Quadratic Inapproximability of Multi-Agent Pathfinding on Strongly Biconnected Digraphs

Shardul Mishra

October 30, 2026preprint en

Abstract

No abstract available for this paper.

Zenodo (CERN European Organization for Nuclear Research)

Robotic Path Planning Algorithms

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon

Near-Quadratic Inapproximability of Multi-Agent Pathfinding on Strongly Biconnected Digraphs — Shardul Mishra · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS