3 papers
math.CO2026
The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem
Tamás Csernák, Lajos Soukup
We study two graph pebbling parameters, the stacking number and the clearing number, through the Almost Stacked Hypothesis (ASH). This hypothesis asserts that these thresholds can…
cs.RO2026
Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices
Marat Agranovskiy
Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While tradi…
cs.RO2024
MeshA*: Efficient Path Planning With Motion Primitives
Marat Agranovskiy, Konstantin Yakovlev
We study a path planning problem where the possible move actions are represented as a finite set of motion primitives aligned with the grid representation of the environment. That…