3 papers
cs.AI2026
Unassigned Agents in Compilation-based Multi-agent Path Finding
Pavel Surynek
Compilation-based techniques represent an important stream of solvers for multi-agent path finding (MAPF) due to their modularity and adaptability for non-standard variants of the…
cs.AI2026
Portfolio of Solving Strategies in CEGAR-based Object Packing and Scheduling for Sequential 3D Printing
Pavel Surynek
Computing power that used to be available only in supercomputers decades ago especially their parallelism is currently available in standard personal computer CPUs even in CPUs for…
cs.CG2025
Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver
Pavel Surynek, VojtÄch BubnÃk, Lukáš MatÄna +1
We address the problem of object arrangement and scheduling for sequential 3D printing. Unlike the standard 3D printing, where all objects are printed slice by slice at once, in se…