The reviewed record of science sign in
Pith

arxiv: 2008.03826 · v1 · pith:O4SVSUMG · submitted 2020-08-09 · cs.RO

Contact-Rich Trajectory Generation in Confined Environments Using Iterative Convex Optimization

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:O4SVSUMGrecord.jsonopen to challenge →

classification cs.RO
keywords constraintsrobottrajectorygenerationplanningenvironmentsrealarms
0
0 comments X
read the original abstract

Applying intelligent robot arms in dynamic uncertain environments (i.e., flexible production lines) remains challenging, which requires efficient algorithms for real time trajectory generation. The motion planning problem for robot trajectory generation is highly nonlinear and nonconvex, which usually comes with collision avoidance constraints, robot kinematics and dynamics constraints, and task constraints (e.g., following a Cartesian trajectory defined on a surface and maintain the contact). The nonlinear and nonconvex planning problem is computationally expensive to solve, which limits the application of robot arms in the real world. In this paper, for redundant robot arm planning problems with complex constraints, we present a motion planning method using iterative convex optimization that can efficiently handle the constraints and generate optimal trajectories in real time. The proposed planner guarantees the satisfaction of the contact-rich task constraints and avoids collision in confined environments. Extensive experiments on trajectory generation for weld grinding are performed to demonstrate the effectiveness of the proposed method and its applicability in advanced robotic manufacturing.

This paper has not been read by Pith yet.

discussion (0)

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