Metraipolis › archive › dc_157dfb58e333

Multi-Group Pipe Routing under Permanent Geometric Occupancy: Problem, Benchmark, and Classical Baselines — arXiv:2608.28697

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28697
License (as archived)
CC0-1.0
Archived
2026-10-17T10:06:37.707Z
SHA-256 of the archived text
3c4857e332b664b073984eb6ad187cbaf75af9bb817d708c8cb8ef8f35e21eb3
Stable URL of this page
https://metraipolis.com/documento/dc_157dfb58e333

How to cite

Multi-Group Pipe Routing under Permanent Geometric Occupancy: Problem, Benchmark, and Classical Baselines — arXiv:2608.28697 — arXiv (en), https://arxiv.org/abs/2608.28697 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_157dfb58e333 (Metraipolis archive dc_157dfb58e333, sha256 3c4857e332b664b073984eb6ad187cbaf75af9bb817d708c8cb8ef8f35e21eb3)
BibTeX
@misc{dc157dfb58e333,
  title = {Multi-Group Pipe Routing under Permanent Geometric Occupancy: Problem, Benchmark, and Classical Baselines — arXiv:2608.28697},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28697},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_157dfb58e333; sha256 3c4857e332b664b073984eb6ad187cbaf75af9bb817d708c8cb8ef8f35e21eb3},
  year = {2026}
}

Archived text

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

Additive manufacturing (AM) enables compact hydraulic components whose internal fluid channels can follow free-form 3D paths rather than conventionally drilled holes. A representative case is multi-group channel layout in rotary direct-drive servo valves: once a channel is placed it permanently occupies volume, so later channels must clear earlier geometry--unlike classical multi-agent pathfinding (MAPF), where agents free space after moving. We study this setting as multi-group pipe routing under permanent geometric occupancy. Our contributions are a problem formalization with geometric dual-witness conflicts, a constructive 3D benchmark (two corridor generators x two obstacle painters, controlled difficulty, feasibility witnesses), and baseline results for CBS, PBS, and priority planning adapted to this coupling. We evaluate by success rate under a fixed time budget. PlaneSlice hard instances clearly rank CBS above PBS and PP, while easier cells validate the pipeline. The goal is a reproducible problem definition, suite, and classical baselines--not a new optimal MAPF algorithm.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-01 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2608.28697 — 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-17T09:58:57.746Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).