aiqbench analysis
This research introduces CLIPPER, an optimization framework designed to accelerate municipal micromobility planning by reducing reoptimization time from tens of seconds to milliseconds while maintaining high spatial coverage accuracy. The system incorporates deterministic candidate pooling and optional offline audit functions to ensure transparency and allow stakeholders to verify that no superior policy alternatives were omitted during the decision-making process. By enabling rapid, auditable comparison of parking policies across multiple cities, this work addresses critical scalability challenges in deploying AI-driven tools for urban infrastructure management.
CLIPPER Beyond Shortlisting: Auditable Decision Support for Changing Municipal Micromobility Policies
arXiv:2609.39054v1 Announce Type: new Abstract: In municipal planning workshops, planners and other stakeholders compare shared-micromobility parking policies by varying no-parking zones, retained sites, spacing, or area allocations. Each edit changes feasible sites and how much demand they cover, so the alternative must be reoptimized on the same spatial data. Full-set greedy, the transparent reference for this task, takes tens of seconds per alternative at city scale. We present Constraint-exact Low-latency Iterative Planning with Pooled Evaluation and Replay (CLIPPER), an optimizer with audit functions developed for requirements elicited with the City of Braunschweig. In each greedy round, it forms a deterministic candidate pool of bounded size, computes how much still-uncovered demand each candidate would add, and rejects candidates that violate an active constraint. An optional offline audit scans every remaining feasible candidate and records what the restricted pool omitted. We evaluate these functions on complete eleven-state edit chains ($E_0,\ldots,E_{10}$) in Braunschweig, Munich, and Berlin. With $K=1024$ candidates per group, the fixed-width mode CLIPPER-F has mean coverage gaps to full-set greedy under the same policy of 0.245, 0.003, and 0.001 percentage points in Braunschweig, Munich, and Berlin, respectively, while mean rollout time falls by factors of 13.6--28.9; no audited run terminates while a candidate outside the pool could still increase coverage. Plans computed from two checksummed versions of Braunschweig's official no-parking-zone data differ in 30 of about 540 selected sites although coverage moves by only about 0.1 percentage points. These changes still require municipal assessment and implementation. The findings inform a proposed municipal process that versions policy inputs, reports site changes beside coverage, and scans the full candidate set before a final decision.
Abstract:In municipal planning workshops, planners and other stakeholders compare shared-micromobility parking policies by varying no-parking zones, retained sites, spacing, or area allocations. Each edit changes feasible sites and how much demand they cover, so the alternative must be reoptimized on the same spatial data. Full-set greedy, the transparent reference for this task, takes tens of seconds per alternative at city scale. We present Constraint-exact Low-latency Iterative Planning with Pooled Evaluation and Replay (CLIPPER), an optimizer with audit functions developed for requirements elicited with the City of Braunschweig. In each greedy round, it forms a deterministic candidate pool of bounded size, computes how much still-uncovered demand each candidate would add, and rejects candidates that violate an active constraint. An optional offline audit scans every remaining feasible candidate and records what the restricted pool omitted. We evaluate these functions on complete eleven-state edit chains ($E_0,\ldots,E_{10}$) in Braunschweig, Munich, and Berlin. With $K=1024$ candidates per group, the fixed-width mode CLIPPER-F has mean coverage gaps to full-set greedy under the same policy of 0.245, 0.003, and 0.001 percentage points in Braunschweig, Munich, and Berlin, respectively, while mean rollout time falls by factors of 13.6--28.9; no audited run terminates while a candidate outside the pool could still increase coverage. Plans computed from two checksummed versions of Braunschweig's official no-parking-zone data differ in 30 of about 540 selected sites although coverage moves by only about 0.1 percentage points. These changes still require municipal assessment and implementation. The findings inform a proposed municipal process that versions policy inputs, reports site changes beside coverage, and scans the full candidate set before a final decision.
Author preprint. Accepted for publication in the proceedings of the 2nd ACM SIGSPATIAL International Workshop on Spatial Intelligence for Smart and Connected Communities (SpatialConnect 2026)
Robotics (cs.RO)
arXiv:2609.39054 [cs.RO]
(or arXiv:2609.39054v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2609.39054 arXiv-issued DOI via DataCite (pending registration)
Full text under the publisher's open licence · 308 words
Related coverage

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · Sep 24, 2026

AI customer service: strategy, agents, and solutions guide
Databricks · Jul 27, 2026

Choosing Data Governance Tools for Enterprise Data Governance
Databricks · Aug 25, 2026

AI in healthcare: applications and best practices
Databricks · Jul 24, 2026