Most robots we see today can carry out specific tasks with little human intervention. For example, there exists a robotic arm that can harvest tomatoes. The robot interacts with its environment to perform the task of plucking tomatoes, called robotic manipulation. However, the machine often faces geometrical and physical constraints, such as stability and lack of collision.
To avoid these constraints, researchers at the Massachusetts Institute of Technology (MIT) combined different models, with each addressing a different type of constraint, to develop a new model that can find solutions collectively.
Yang and her team hope to test their model in more complicated situations without needing to be trained on new data.
The study was published in Arxiv.
Study abstract:
This paper introduces an approach for learning to solve continuous constraint satisfaction problems (CCSP) in robotic reasoning and planning. Previous methods primarily rely on hand-engineering or learning generators for specific constraint types and then rejecting the value assignments when other constraints are violated. By contrast, our model, the compositional diffusion continuous constraint solver (Diffusion-CCSP) derives global solutions to CCSPs by representing them as factor graphs and combining the energies of diffusion models trained to sample for individual constraint types. Diffusion-CCSP exhibits strong generalization to novel combinations of known constraints, and it can be integrated into a task and motion planner to devise long-horizon plans that include actions with both discrete and continuous parameters.