Abstract | ||
---|---|---|
An approach for designing compliance matrices using linear programming is presented. Compliance is treated as a linear mapping from a force to a corrected motion and is constructed on the basis of geometric information. The four conditions required of an appropriate compliance matrix (stability, feasibility, velocity dependency and error correctivity) are discussed. These conditions are formulated as a set of linear inequalities, and the compliance matrix design problem is reduced to a linear programming problem, with this set of inequalities as constraints. The usefulness of this method is shown by simulation and some experimental assembly tasks |
Year | DOI | Venue |
---|---|---|
1992 | 10.1109/ROBOT.1992.220079 | Nice |
Keywords | Field | DocType |
assembling,compliance control,control system synthesis,industrial robots,linear programming,matrix algebra,assembly,compliance matrices,compliance matrix design,error correctivity,feasibility,linear inequalities,linear mapping,linear programming,stability,velocity dependency | Linear-fractional programming,Mathematical optimization,Matrix algebra,Matrix (mathematics),Computer science,Control theory,Design methods,Control engineering,Linear map,Linear programming,Robot,Linear inequality | Conference |
Volume | Issue | ISBN |
1992 | 1 | 0-8186-2720-4 |
Citations | PageRank | References |
5 | 0.57 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Satoru Matsuo | 1 | 11 | 2.45 |
Satoshi Iwaki | 2 | 45 | 12.51 |