Pith. sign in

REVIEW

Assembly Sequence Planning for Motion Planning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1609.03108 v1 pith:JK5YXMI2 submitted 2016-09-11 cs.RO

Assembly Sequence Planning for Motion Planning

classification cs.RO
keywords assemblyobjectsmotionoptimalplannerplanningsequenceassemble
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper develops a planner to find an optimal assembly sequence to assemble several objects. The input to the planner is the mesh models of the objects, the relative poses between the objects in the assembly, and the final pose of the assembly. The output is an optimal assembly sequence, namely (1) in which order should one assemble the objects, (2) from which directions should the objects be dropped, and (3) candidate grasps of each object. The proposed planner finds the optimal solution by automatically permuting, evaluating, and searching the possible assembly sequences considering stability, graspability, and assemblability qualities. It is expected to guide robots to do assembly using translational motion. The output provides initial and goal configurations to motion planning algorithms. It is ready to be used by robots and is demonstrated using several simulations and real-world executions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.