The paper "Lose the Order, Keep the Hierarchy: Deordering HTN Plans" adapts two classical plan deordering techniques to the Hierarchical Task Network (HTN) planning framework, extending them to respect hierarchical decomposition constraints. The authors evaluate their methods on the IPC 2023 Partial-Order HTN benchmarks and compare them with Optiplan, an HTN planner that generates partially ordered plans directly. Results show a substantial reduction in ordering constraints, with a smaller but noticeable decrease in critical path length.
By Takudzwa Togarepi, Gaspard Quenard, Damien Pellier, Humbert Fiorino
arXiv:2609.39559v1 Announce Type: new
Abstract: In this work we study the problem of MAPFC, a post-optimization step for Multi-Agent Path Finding (MAPF) plans where we are given a feasible plan produ...
By Oren Salzman
arXiv:2608. 11500v1 Announce Type: cross Abstract: Full justified representation (FJR) is among the strongest known satisfiable proportionality axioms for approval-based committee elections.
By Nicholas Teh
arXiv:2601. 06542v2 Announce Type: replace-cross Abstract: In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for production scheduling, where energy price is part of the criteria and one highly energy-demanding machine can be in one of the following three states: proc, idle, or off.
By Corentin Juvigny, Anton\'in Nov\'ak, Jan Mand\'ik, Zden\v{e}k Hanz\'alek
arXiv:2605. 27000v2 Announce Type: replace-cross Abstract: Repeated sampling with a verifier is the standard way to allocate test-time compute for code generation, with pass@$K$ as the canonical metric.
By Yilong Li, Suman Banerjee, Tong Che
arXiv:2608. 04398v1 Announce Type: cross Abstract: Robotic planning often involves multiple objectives with complex priority relationships, such as safety, efficiency, and regulatory compliance.
By Omar Muhammetkulyyev, Oren Salzman, Tichakorn Wongpiromsarn