Motion Planners for Path or Waypoint Following and End-Effector Sway Damping With Dynamic Programming
Notice bibliographique
Résumé
We propose two novel motion planners for a robotic manipulator with a passive end-effector that is free to sway during and after the robot’s motion. The planners utilize Dynamic Programming to generate trajectories that damp the end-effector’s residual sway while ensuring that the boom tip—the point to which the end-effector is attached—follows a collision-free path or time-dependent waypoints. Our use case is a crane of a forwarder machine, a log-loading machine in the forestry industry, with a passive grapple. In the cluttered forest environment, accurate path following and grapple sway damping are critical to increase the operation efficiency and avoid harming the machine and environment. The results of the simulation in a high-fidelity multibody-dynamics simulator showcase the effectiveness of our methodology in achieving exact path following or timed waypoints following and the residual sway damping. In particular, the average of the maximum residual sway is only 1.9°, showing an average reduction of 75%, as compared to fifth, sixth, and tenth order polynomial trajectories, in six test cases, including common paths used by operators to pick and place logs. Monte-Carlo simulations also showed that our planners have very good robustness against payload mass uncertainty. Other merits of our Dynamic Programming trajectories are that they are smooth, computationally inexpensive, and result in reduced residual sway even for nonzero initial sway conditions. Moreover, the generality of our methodology opens a new way to design anti-sway motion planners for construction cranes or quadrotors with a slung payload, in addition to serial manipulators with passive end-effectors.Note to Practitioners—This work was motivated by the problems arising in the operation of log-loading cranes in the forestry industry: the problems of the end-effector’s large sway during crane reconfiguration and the collision between the crane and obstacles, which are detrimental to the efficiency of the operation. Similar issues arise, for example, in construction cranes transporting large hanging objects. We propose a novel methodology to address both problems by generating smooth and computationally inexpensive trajectories for the crane joint motion. The approach begins with the model of the sway motion and the definition of the collision-free path. Then, our Dynamic Programming algorithm generates anti-sway trajectories that satisfy the joint constraints. The results in a high-fidelity simulator show that our motion planners lead to precise path following and significant sway damping, and also confirm its superiority compared to polynomial trajectories, commonly used in industries. Monte-Carlo simulation also confirms our planners’ robustness. Our methodology is also applicable to other dynamic systems with freely hanging objects, such as multi-degree-of-freedom robotic manipulators, construction cranes, and quadrotors carrying a slung payload. A possible limitation is that the methodology is model-based and necessitates finding the sway dynamics model and estimating payload properties.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».