Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robust, Compliant Assembly via Optimal Belief Space Planning (1811.03904v1)

Published 9 Nov 2018 in cs.RO

Abstract: In automated manufacturing, robots must reliably assemble parts of various geometries and low tolerances. Ideally, they plan the required motions autonomously. This poses a substantial challenge due to high-dimensional state spaces and non-linear contact-dynamics. Furthermore, object poses and model parameters, such as friction, are not exactly known and a source of uncertainty. The method proposed in this paper models the task of parts assembly as a belief space planning problem over an underlying impedance-controlled, compliant system. To solve this planning problem we introduce an asymptotically optimal belief space planner by extending an optimal, randomized, kinodynamic motion planner to non-deterministic domains. Under an expansiveness assumption we establish probabilistic completeness and asymptotic optimality. We validate our approach in thorough, simulated and real-world experiments of multiple assembly tasks. The experiments demonstrate our planner's ability to reliably assemble objects, solely based on CAD models as input.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Florian Wirnshofer (1 paper)
  2. Philipp S. Schmitt (2 papers)
  3. Wendelin Feiten (2 papers)
  4. Georg v. Wichert (2 papers)
  5. Wolfram Burgard (149 papers)
Citations (22)

Summary

We haven't generated a summary for this paper yet.