Name
Abstract | ||
|---|---|---|
In this paper, we study the performance of various algorithms for fast online identification of environment impedance during robotic contact tasks. In particular, we evaluate and compare algorithms with regard to their convergence rate, computational complexity and sensitivity to noise for different environments using a single degree-of-freedom experimental setup. The results provide some guidelines for choosing an appropriate identification algorithm for a specific application. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/IROS.2008.4650572 | Nice |
Keywords | Field | DocType |
computational complexity,robots,computational complexity,fast online identification,online contact impedance identification,robotic contact tasks,robotic systems | Convergence (routing),Robotic systems,Computer science,Control engineering,Electrical impedance,Rate of convergence,Artificial intelligence,Covariance matrix,Robot,Robotics,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
978-1-4244-2057-5 | 9 | 0.63 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir Haddadi | 1 | 85 | 7.26 |
| Keyvan Hashtrudi-Zaad | 2 | 577 | 50.93 |
| Hashtrudi-Zaad, K. | 3 | 9 | 0.63 |