Industrial robot efficient trajectory generation without collision through the evolution of the optimal trajectory
[EN] An efficient algorithm is presented to obtain trajectories for industrial robots working in industrial environments. The procedure starts with the obtaining of an optimal time trajectory neglecting the presence of obstacles. When obstacles are considered, the initial trajectory (obtained by neg...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/107360 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/107360 |
| Access Level: | acceso abierto |
| Palavra-chave: | Robot dynamics Nonlinear optimization Trajectory planning Industrial robots Modelling robots INGENIERIA MECANICA |
| Resumo: | [EN] An efficient algorithm is presented to obtain trajectories for industrial robots working in industrial environments. The procedure starts with the obtaining of an optimal time trajectory neglecting the presence of obstacles. When obstacles are considered, the initial trajectory (obtained by neglecting obstacles) will not be feasible and will have to evolve so that it can become a solution. In this paper, the way that it evolves until a new feasible collision-free trajectory is obtained considering the possible obstacles is described. This is a direct algorithm that works in a discrete space of trajectories, approaching the global solution as the discretization is refined. The solutions obtained are efficient trajectories near to the minimum time one and they meet the physical limitations of the robot (the maximum values of torque, power and jerk are considered for each actuator), avoid collisions, and take into account the constraint of energy consumed. Examples already published and new examples in real industrial environments have been solved to verify the working of the algorithm. |
|---|