Pith Number

pith:VNNV6CDR

pith:2026:VNNV6CDREO3AKLU3EHX25PJQFX

not attested not anchored not stored refs pending

Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price

Anoop Bhat, Geordan Gutow, Howie Choset, Sivakumar Rathinam, Surya Singh, Zhongqiang Ren

Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles.

arxiv:2603.21880 v4 · 2026-03-23 · cs.RO

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{VNNV6CDREO3AKLU3EHX25PJQFX}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Lazy BPRC finds optimal solutions for the MT-VRP-O and runs up to an order of magnitude faster than two ablations by deferring true cost computations via lower bounds from relaxed continuity constraints solved on a Graph of Convex Sets.

C2weakest assumption

The lower bounds obtained from motion planning with relaxed continuity constraints are sufficiently tight that the branch-and-price procedure still finds the true optimum without prematurely discarding optimal tours.

C3one line summary

Lazy BPRC finds optimal solutions for the Moving Target Vehicle Routing Problem with Obstacles up to an order of magnitude faster than ablations by using lower bounds from relaxed-continuity motion planning.

Receipt and verification

First computed	2026-05-25T02:02:14.571043Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6

Aliases

arxiv: 2603.21880 · arxiv_version: 2603.21880v4 · doi: 10.48550/arxiv.2603.21880 · pith_short_12: VNNV6CDREO3A · pith_short_16: VNNV6CDREO3AKLU3 · pith_short_8: VNNV6CDR

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/VNNV6CDREO3AKLU3EHX25PJQFX \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "748c9d028b917e40c122bd23c5680758c509fc1a84d07b6acf5715ac24fc17d2",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.RO",
    "submitted_at": "2026-03-23T12:10:12Z",
    "title_canon_sha256": "73758bc476db282b25ee212f38b1400660186bc9b69bac21fef4209e976c67e4"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2603.21880",
    "kind": "arxiv",
    "version": 4
  }
}