This paper presents a framework designed to tackle a range of planning problems arise in manipulation, which typically involve complex geometric-physical reasoning related to contact and dynamic constraints. We introduce the Contact Factor Graph (CFG) to graphically model these diverse factors, enabling us to perform inference on the graphs to approximate the distribution and sample appropriate solutions. We propose a novel approach that can incorporate various phenomena of contact manipulation as differentiable factors, and develop an efficient inference algorithm for CFG that leverages this differentiability along with the conditional probabilities arising from the structured nature of contact. Our results demonstrate the capability of our framework in generating viable samples and approximating posterior distributions for various manipulation scenarios.
View on arXiv@article{lee2025_2503.06300,
title={ Efficient Gradient-Based Inference for Manipulation Planning in Contact Factor Graphs },
author={ Jeongmin Lee and Sunkyung Park and Minji Lee and Dongjun Lee },
journal={arXiv preprint arXiv:2503.06300},
year={ 2025 }
}