Metraipolis › archive › dc_337fe6106e22

CLIPPER: Replayable Shortlisted Optimization for Repeated Spatial Coverage Planning — arXiv:2608.26819

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.26819
License (as archived): CC0-1.0
Archived: 2026-10-17T19:21:13.668Z
SHA-256 of the archived text: 7ff8555b0514837408dc0e086595e9586afb84c9f3f772770240311e0d41d094
Stable URL of this page: https://metraipolis.com/documento/dc_337fe6106e22

How to cite

CLIPPER: Replayable Shortlisted Optimization for Repeated Spatial Coverage Planning — arXiv:2608.26819 — arXiv (en), https://arxiv.org/abs/2608.26819 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_337fe6106e22 (Metraipolis archive dc_337fe6106e22, sha256 7ff8555b0514837408dc0e086595e9586afb84c9f3f772770240311e0d41d094)

BibTeX

@misc{dc337fe6106e22,
  title = {CLIPPER: Replayable Shortlisted Optimization for Repeated Spatial Coverage Planning — arXiv:2608.26819},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.26819},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_337fe6106e22; sha256 7ff8555b0514837408dc0e086595e9586afb84c9f3f772770240311e0d41d094},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.26819. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Operational requirements developed with the City of Braunschweig frame municipal micromobility planning under geofenced exclusions, mandatory retained sites, spacing rules, and area-level caps. Each policy edit requires a new feasible plan; full-set greedy takes tens of seconds per alternative at city scale. We present CLIPPER (Constraint-exact Low-latency Iterative Planning with Pooled Evaluation and Replay). It forms bounded candidate pools but recomputes exact current gains and checks every active constraint before selection. Coverage from each candidate alone sets the initial order. Offline full-set scans measure gains omitted by the pool; online, a conservative bound triggers expansion or audit. CLIPPER-F gives each proposal group the same number of candidate slots. Across Braunschweig, Munich, and Berlin, its mean coverage over complete chains stays within 0.245 percentage points of full-set greedy under the same policy, with 13.6--28.9 times lower mean rollout time. CLIPPER-A instead distributes one shared candidate budget across the groups. Under its coverage-prioritized policy, it uses 9--15% of full-set greedy's rollout time under the same policy, with mean gaps of 1.82 percentage points in Braunschweig, 0.12 in Munich, and 0.27 in Berlin. Together, CLIPPER enables rapid, replayable comparison of recorded city-scale planning states while enforcing every encoded model constraint.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-28 in cs.DS).
Categorie arXiv: Robotics (cs.RO) ; Computational Geometry (cs.CG); Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.26819 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T19:16:36.844Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).