Metraipolis › archive › dc_0b8fd13fc67d
Approximate Multi-Objective Search Under Rulebooks — arXiv:2608.04398
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04398
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:14:13.021Z
- SHA-256 of the archived text
f4fcec4d09973796e2126fe46a062a001dab931c8076d542b4dab042533a4867- Stable URL of this page
https://metraipolis.com/documento/dc_0b8fd13fc67d
How to cite
Approximate Multi-Objective Search Under Rulebooks — arXiv:2608.04398 — arXiv (en), https://arxiv.org/abs/2608.04398 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0b8fd13fc67d (Metraipolis archive dc_0b8fd13fc67d, sha256 f4fcec4d09973796e2126fe46a062a001dab931c8076d542b4dab042533a4867)
BibTeX
@misc{dc0b8fd13fc67d,
title = {Approximate Multi-Objective Search Under Rulebooks — arXiv:2608.04398},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04398},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0b8fd13fc67d; sha256 f4fcec4d09973796e2126fe46a062a001dab931c8076d542b4dab042533a4867},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04398. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Robotic planning often involves multiple objectives with complex priority relationships, such as safety, efficiency, and regulatory compliance. Rulebooks formalize these relationships, allowing partial ordering of objectives that generalizes both Pareto and lexicographic dominance. Computing the full set of rulebook-optimal solutions, however, is computationally expensive. To address this challenge, we introduce the concept of epsilon-rule-dominance, a principled notion of approximate dominance under rulebooks, and propose RA*pex, a best-first search algorithm that efficiently computes a compact set of epsilon-approximate rulebook-optimal solutions. RA*pex leverages dimensionality reduction, a technique used to speed up existing multi-objective search algorithms, while respecting rule hierarchies by maintaining separate closed sets and performing dominance checks over truncated and residual rule sets. We provide a formal analysis of RA*pex, proving that every rulebook-optimal solution is epsilon-rule-dominated (a generalization of approximate dominance we introduce) by at least one solution in the returned set. Empirical results demonstrate that our approach achieves computation times over two orders of magnitude faster than existing methods. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.AI). Categorie arXiv: Robotics (cs.RO) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.04398 — 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-31T11:02:13.504Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).