Multifrequency computational optimization of robot path planning algorithms
The computational burden of robot trajectory planning algorithms may be significant, namely when the inverse kinematics is required. Nevertheless, the variables involved have distinct bandwidths. Therefore, they have different effects upon the final result and we can adopt a multifrequency strategy...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.22/13616 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/13616 |
| Resumo: | The computational burden of robot trajectory planning algorithms may be significant, namely when the inverse kinematics is required. Nevertheless, the variables involved have distinct bandwidths. Therefore, they have different effects upon the final result and we can adopt a multifrequency strategy for the calculations, namely using different frequencies for the robot joint positions, velocities and accelarations. In the line of thought, this paper compares a multirate trajectory planning scheme in the cartesin space in contrast with the classical monofrequency claculation strategy. |
|---|