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.RO2025
Safe Interval Randomized Path Planning For Manipulators
Nuraddin Kerimov, Aleksandr Onegin, Konstantin Yakovlev
Planning safe paths in 3D workspace for high DoF robotic systems, such as manipulators, is a challenging problem, especially when the environment is populated with the dynamic obst…
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…