By Topic

Trajectory planning of robots with dynamics and inequalities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Faiz, N. ; Dept. of Mech. Eng., Delaware Univ., Newark, DE, USA ; Agrawal, S.K.

Proposes a trajectory planning scheme for open-chain systems to steer in joint space between a start and a goal, while explicitly satisfying the dynamic equations and inequality constraints prescribed in terms of joint torques, joint angles, and their higher derivatives. The algorithm consists of four steps: (i) the structure of the dynamic equations is exploited to embed the dynamic equations explicitly into the constraints; (ii) the inequalities in the space of joint angles and their derivatives are inner approximated by a set of linear inequalities, i.e., a polytope; (iii) a feasible trajectory is then sought within a class of basis functions by using a discrete collocation grid in time where the inequalities are satisfied; and (iv) the feasible trajectories are characterized in terms of a convex set of the coefficients associated with the basis functions. The approach is illustrated in theory and experiments with a master-slave dual-arm manipulation system

Published in:

Robotics and Automation, 2000. Proceedings. ICRA '00. IEEE International Conference on  (Volume:4 )

Date of Conference: