Home > Research > Publications & Outputs > Planar contour tracking in the presence of pose...

Electronic data

Links

Text available via DOI:

View graph of relations

Planar contour tracking in the presence of pose and model errors by Kalman filtering techniques

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date21/10/2001
Host publicationMultisensor Fusion and Integration for Intelligent Systems, 2001. MFI 2001. International Conference on
Pages329-334
Number of pages6
<mark>Original language</mark>English
EventInternational Conf. on Multisensor Fusion and Integration for Intelligent Systems, MFI' 2001, - Baden-Baden, Germany,
Duration: 20/08/200121/08/2001

Conference

ConferenceInternational Conf. on Multisensor Fusion and Integration for Intelligent Systems, MFI' 2001,
CityBaden-Baden, Germany,
Period20/08/0121/08/01

Conference

ConferenceInternational Conf. on Multisensor Fusion and Integration for Intelligent Systems, MFI' 2001,
CityBaden-Baden, Germany,
Period20/08/0121/08/01

Abstract

The paper presents a solution to the problem of planar contour tracking with a force-controlled robot. The contour shape is unknown and is characterized at each time step by the curvature together with the orientation angle and arc length. The unknown contour curvature, continuously changing, is supposed to be within a preliminary given interval. An Interacting Multiple Model (IMM) filter is implemented to cope with the uncertainties. The interval of possible curvature values is discretized, i.e., a grid is formed and several Extended Kalman filters (EKFs) are run in parallel. The curvature estimate represents a fusion of the values from the grid with the IMM probabilities. The orientation angle estimate is also a fusion of the estimates, obtained from the separate Kalman filters with the mode probabilities. A single-model EKF is implemented to localize the unknown initial robot end-effector position over the contour. The performance of both algorithms is investigated and results, based on real data, are presented.

Bibliographic note

pp. 329-334 doi:10.1109/MFI.2001.1013556