Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

State and parameter estimation for robotic manipulators using force measurements

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
Blauer, M. ; Bell Northern Research, Verdun, Canada ; Belanger, P.

The need to equip robotic systems with a high degree of dexterity and adaptability to a wide range of precise manipulation tusks has given rise to increasing interest in the utilization of various sensing modalities, including force and tactile sensing. In this paper a general framework is proposed for incorporating both a priori task geometry information and on-line observations, including force measurements, into an optimal estimation algorithm. The output of the algorithm is state and parameter estimates that serve to disambiguate the task geometry and can be used to dynamically adapt subsequent motions. The problem is formulated us a nonlinear constrained dynamical system, including Coulomb friction between the system and the constraints. The constraint surface is described with respect to some unknown parameters representing the geometric uncertainty. The noisy on-line state and force observations are expressed as functions of the state and surface parameters. The extended Kalman filter is then used to produce optimal estimates of the state and surface parameters.

Published in:

Automatic Control, IEEE Transactions on  (Volume:32 ,  Issue: 12 )