Bi-Level Belief Space Search for Compliant Part Mating Under Uncertainty
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914955866931200 |
|---|---|
| author | Chintalapudi, Sahit Kaelbling, Leslie Lozano-Perez, Tomas |
| author_facet | Chintalapudi, Sahit Kaelbling, Leslie Lozano-Perez, Tomas |
| contents | The problem of mating two parts with low clearance remains difficult for autonomous robots. We present bi-level belief assembly (BILBA), a model-based planner that computes a sequence of compliant motions which can leverage contact with the environment to reduce uncertainty and perform challenging assembly tasks with low clearance. Our approach is based on first deriving candidate contact schedules from the structure of the configuration space obstacle of the parts and then finding compliant motions that achieve the desired contacts. We demonstrate that BILBA can efficiently compute robust plans on multiple simulated tasks as well as a real robot rectangular peg-in-hole insertion task. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_15774 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Bi-Level Belief Space Search for Compliant Part Mating Under Uncertainty Chintalapudi, Sahit Kaelbling, Leslie Lozano-Perez, Tomas Robotics The problem of mating two parts with low clearance remains difficult for autonomous robots. We present bi-level belief assembly (BILBA), a model-based planner that computes a sequence of compliant motions which can leverage contact with the environment to reduce uncertainty and perform challenging assembly tasks with low clearance. Our approach is based on first deriving candidate contact schedules from the structure of the configuration space obstacle of the parts and then finding compliant motions that achieve the desired contacts. We demonstrate that BILBA can efficiently compute robust plans on multiple simulated tasks as well as a real robot rectangular peg-in-hole insertion task. |
| title | Bi-Level Belief Space Search for Compliant Part Mating Under Uncertainty |
| topic | Robotics |
| url | https://arxiv.org/abs/2409.15774 |