Time-Optimal Pick-and-Throw S-Curve Trajectories for Fast Parallel Robots
In suitable robotic applications, throwing an object instead of placing it has the potential of improving the cycle time. In this context, a challenge is to generate time-optimal pick-and-throw (P&T) trajectories in order to further increase productivity. This article introduces a methodology to...
Gespeichert in:
Veröffentlicht in: | IEEE/ASME transactions on mechatronics 2022-12, Vol.27 (6), p.4707-4717 |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 4717 |
---|---|
container_issue | 6 |
container_start_page | 4707 |
container_title | IEEE/ASME transactions on mechatronics |
container_volume | 27 |
creator | Hassan, Ghina Gouttefarde, Marc Chemori, Ahmed Herve, Pierre-Elie Rafei, Maher El Francis, Clovis Salle, Damien |
description | In suitable robotic applications, throwing an object instead of placing it has the potential of improving the cycle time. In this context, a challenge is to generate time-optimal pick-and-throw (P&T) trajectories in order to further increase productivity. This article introduces a methodology to determine a minimum-time throwing motion. This methodology consists essentially in determining an optimal release configuration (i.e., position and velocity) allowing an object to be thrown toward a desired target, while minimizing the travel time of the throwing motion of the robot. To validate the potential of the proposed P&T approach, a comparison with the standard pick-and-place (P&P) process and an existing P&T method is made using the Delta-like parallel 3-translation kinematically redundant robot under different operating conditions. The obtained experimental results demonstrate the superiority and efficiency of the proposed P&T approach over the usual P&P and the existing P&T methods in terms of picking speed and cycle time. |
doi_str_mv | 10.1109/TMECH.2022.3164247 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_lirmm_03650958v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9761916</ieee_id><sourcerecordid>2754151333</sourcerecordid><originalsourceid>FETCH-LOGICAL-c375t-e3326285dd213fd1cba2fcb868f05b3d36739b007b3d0f8366b4115b6981ca633</originalsourceid><addsrcrecordid>eNo9kMFPwjAYxRejiYj-A3pZ4tEU-_Vru-1IFhASDERn4q3pti4MB8V2YPzvHUI4vXd47-XlFwT3QAcANHnOXkfpZMAoYwMEyRmPLoIeJBwIBf552XkaI-EcxXVw4_2KUsqBQi-YZvXakPm2rde6CRd18UX0piTZ0tmf8J2kO7c3Yeb0yhStdbXxYWVdONa-DRfa6aYxTfhmc9v62-Cq0o03dyftBx_jUZZOyGz-Mk2HM1JgJFpiEJlksShLBliVUOSaVUUey7iiIscSZYRJTmnUeVrFKGXOAUQukxgKLRH7wdNxd6kbtXXdb_errK7VZDhTTe3Wa0VRCpqIeA9d-vGY3jr7vTO-VSu7c5vuoGKR4CAA8bDJjqnCWe-dqc7DQNUBsPoHrA6A1QlwV3o4lmpjzLmQRBISkPgHn8x0tg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2754151333</pqid></control><display><type>article</type><title>Time-Optimal Pick-and-Throw S-Curve Trajectories for Fast Parallel Robots</title><source>IEEE Electronic Library (IEL)</source><creator>Hassan, Ghina ; Gouttefarde, Marc ; Chemori, Ahmed ; Herve, Pierre-Elie ; Rafei, Maher El ; Francis, Clovis ; Salle, Damien</creator><creatorcontrib>Hassan, Ghina ; Gouttefarde, Marc ; Chemori, Ahmed ; Herve, Pierre-Elie ; Rafei, Maher El ; Francis, Clovis ; Salle, Damien</creatorcontrib><description><![CDATA[In suitable robotic applications, throwing an object instead of placing it has the potential of improving the cycle time. In this context, a challenge is to generate time-optimal pick-and-throw (P&T) trajectories in order to further increase productivity. This article introduces a methodology to determine a minimum-time throwing motion. This methodology consists essentially in determining an optimal release configuration (i.e., position and velocity) allowing an object to be thrown toward a desired target, while minimizing the travel time of the throwing motion of the robot. To validate the potential of the proposed P&T approach, a comparison with the standard pick-and-place (P&P) process and an existing P&T method is made using the Delta-like parallel 3-translation kinematically redundant robot under different operating conditions. The obtained experimental results demonstrate the superiority and efficiency of the proposed P&T approach over the usual P&P and the existing P&T methods in terms of picking speed and cycle time.]]></description><identifier>ISSN: 1083-4435</identifier><identifier>EISSN: 1941-014X</identifier><identifier>DOI: 10.1109/TMECH.2022.3164247</identifier><identifier>CODEN: IATEFW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Automatic ; Cycle time ; Engineering Sciences ; Minimum-time trajectory ; Parallel robots ; pick-and-place (P&T) ; pick-and-throw (P&P) ; Pneumatic systems ; Robot dynamics ; Robotics ; Robots ; Service robots ; Sorting ; Throwing ; Trajectories ; Trajectory ; Travel time ; Zirconium</subject><ispartof>IEEE/ASME transactions on mechatronics, 2022-12, Vol.27 (6), p.4707-4717</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c375t-e3326285dd213fd1cba2fcb868f05b3d36739b007b3d0f8366b4115b6981ca633</citedby><cites>FETCH-LOGICAL-c375t-e3326285dd213fd1cba2fcb868f05b3d36739b007b3d0f8366b4115b6981ca633</cites><orcidid>0000-0002-4369-6867 ; 0000-0002-2527-9269 ; 0000-0002-5933-2419 ; 0000-0001-9739-9473</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9761916$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,315,782,786,798,887,27933,27934,54767</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9761916$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://hal-lirmm.ccsd.cnrs.fr/lirmm-03650958$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Hassan, Ghina</creatorcontrib><creatorcontrib>Gouttefarde, Marc</creatorcontrib><creatorcontrib>Chemori, Ahmed</creatorcontrib><creatorcontrib>Herve, Pierre-Elie</creatorcontrib><creatorcontrib>Rafei, Maher El</creatorcontrib><creatorcontrib>Francis, Clovis</creatorcontrib><creatorcontrib>Salle, Damien</creatorcontrib><title>Time-Optimal Pick-and-Throw S-Curve Trajectories for Fast Parallel Robots</title><title>IEEE/ASME transactions on mechatronics</title><addtitle>TMECH</addtitle><description><![CDATA[In suitable robotic applications, throwing an object instead of placing it has the potential of improving the cycle time. In this context, a challenge is to generate time-optimal pick-and-throw (P&T) trajectories in order to further increase productivity. This article introduces a methodology to determine a minimum-time throwing motion. This methodology consists essentially in determining an optimal release configuration (i.e., position and velocity) allowing an object to be thrown toward a desired target, while minimizing the travel time of the throwing motion of the robot. To validate the potential of the proposed P&T approach, a comparison with the standard pick-and-place (P&P) process and an existing P&T method is made using the Delta-like parallel 3-translation kinematically redundant robot under different operating conditions. The obtained experimental results demonstrate the superiority and efficiency of the proposed P&T approach over the usual P&P and the existing P&T methods in terms of picking speed and cycle time.]]></description><subject>Automatic</subject><subject>Cycle time</subject><subject>Engineering Sciences</subject><subject>Minimum-time trajectory</subject><subject>Parallel robots</subject><subject>pick-and-place (P&T)</subject><subject>pick-and-throw (P&P)</subject><subject>Pneumatic systems</subject><subject>Robot dynamics</subject><subject>Robotics</subject><subject>Robots</subject><subject>Service robots</subject><subject>Sorting</subject><subject>Throwing</subject><subject>Trajectories</subject><subject>Trajectory</subject><subject>Travel time</subject><subject>Zirconium</subject><issn>1083-4435</issn><issn>1941-014X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMFPwjAYxRejiYj-A3pZ4tEU-_Vru-1IFhASDERn4q3pti4MB8V2YPzvHUI4vXd47-XlFwT3QAcANHnOXkfpZMAoYwMEyRmPLoIeJBwIBf552XkaI-EcxXVw4_2KUsqBQi-YZvXakPm2rde6CRd18UX0piTZ0tmf8J2kO7c3Yeb0yhStdbXxYWVdONa-DRfa6aYxTfhmc9v62-Cq0o03dyftBx_jUZZOyGz-Mk2HM1JgJFpiEJlksShLBliVUOSaVUUey7iiIscSZYRJTmnUeVrFKGXOAUQukxgKLRH7wdNxd6kbtXXdb_errK7VZDhTTe3Wa0VRCpqIeA9d-vGY3jr7vTO-VSu7c5vuoGKR4CAA8bDJjqnCWe-dqc7DQNUBsPoHrA6A1QlwV3o4lmpjzLmQRBISkPgHn8x0tg</recordid><startdate>202212</startdate><enddate>202212</enddate><creator>Hassan, Ghina</creator><creator>Gouttefarde, Marc</creator><creator>Chemori, Ahmed</creator><creator>Herve, Pierre-Elie</creator><creator>Rafei, Maher El</creator><creator>Francis, Clovis</creator><creator>Salle, Damien</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><general>Institute of Electrical and Electronics Engineers</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-4369-6867</orcidid><orcidid>https://orcid.org/0000-0002-2527-9269</orcidid><orcidid>https://orcid.org/0000-0002-5933-2419</orcidid><orcidid>https://orcid.org/0000-0001-9739-9473</orcidid></search><sort><creationdate>202212</creationdate><title>Time-Optimal Pick-and-Throw S-Curve Trajectories for Fast Parallel Robots</title><author>Hassan, Ghina ; Gouttefarde, Marc ; Chemori, Ahmed ; Herve, Pierre-Elie ; Rafei, Maher El ; Francis, Clovis ; Salle, Damien</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c375t-e3326285dd213fd1cba2fcb868f05b3d36739b007b3d0f8366b4115b6981ca633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Automatic</topic><topic>Cycle time</topic><topic>Engineering Sciences</topic><topic>Minimum-time trajectory</topic><topic>Parallel robots</topic><topic>pick-and-place (P&T)</topic><topic>pick-and-throw (P&P)</topic><topic>Pneumatic systems</topic><topic>Robot dynamics</topic><topic>Robotics</topic><topic>Robots</topic><topic>Service robots</topic><topic>Sorting</topic><topic>Throwing</topic><topic>Trajectories</topic><topic>Trajectory</topic><topic>Travel time</topic><topic>Zirconium</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hassan, Ghina</creatorcontrib><creatorcontrib>Gouttefarde, Marc</creatorcontrib><creatorcontrib>Chemori, Ahmed</creatorcontrib><creatorcontrib>Herve, Pierre-Elie</creatorcontrib><creatorcontrib>Rafei, Maher El</creatorcontrib><creatorcontrib>Francis, Clovis</creatorcontrib><creatorcontrib>Salle, Damien</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>IEEE/ASME transactions on mechatronics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hassan, Ghina</au><au>Gouttefarde, Marc</au><au>Chemori, Ahmed</au><au>Herve, Pierre-Elie</au><au>Rafei, Maher El</au><au>Francis, Clovis</au><au>Salle, Damien</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Time-Optimal Pick-and-Throw S-Curve Trajectories for Fast Parallel Robots</atitle><jtitle>IEEE/ASME transactions on mechatronics</jtitle><stitle>TMECH</stitle><date>2022-12</date><risdate>2022</risdate><volume>27</volume><issue>6</issue><spage>4707</spage><epage>4717</epage><pages>4707-4717</pages><issn>1083-4435</issn><eissn>1941-014X</eissn><coden>IATEFW</coden><abstract><![CDATA[In suitable robotic applications, throwing an object instead of placing it has the potential of improving the cycle time. In this context, a challenge is to generate time-optimal pick-and-throw (P&T) trajectories in order to further increase productivity. This article introduces a methodology to determine a minimum-time throwing motion. This methodology consists essentially in determining an optimal release configuration (i.e., position and velocity) allowing an object to be thrown toward a desired target, while minimizing the travel time of the throwing motion of the robot. To validate the potential of the proposed P&T approach, a comparison with the standard pick-and-place (P&P) process and an existing P&T method is made using the Delta-like parallel 3-translation kinematically redundant robot under different operating conditions. The obtained experimental results demonstrate the superiority and efficiency of the proposed P&T approach over the usual P&P and the existing P&T methods in terms of picking speed and cycle time.]]></abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TMECH.2022.3164247</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-4369-6867</orcidid><orcidid>https://orcid.org/0000-0002-2527-9269</orcidid><orcidid>https://orcid.org/0000-0002-5933-2419</orcidid><orcidid>https://orcid.org/0000-0001-9739-9473</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1083-4435 |
ispartof | IEEE/ASME transactions on mechatronics, 2022-12, Vol.27 (6), p.4707-4717 |
issn | 1083-4435 1941-014X |
language | eng |
recordid | cdi_hal_primary_oai_HAL_lirmm_03650958v1 |
source | IEEE Electronic Library (IEL) |
subjects | Automatic Cycle time Engineering Sciences Minimum-time trajectory Parallel robots pick-and-place (P&T) pick-and-throw (P&P) Pneumatic systems Robot dynamics Robotics Robots Service robots Sorting Throwing Trajectories Trajectory Travel time Zirconium |
title | Time-Optimal Pick-and-Throw S-Curve Trajectories for Fast Parallel Robots |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-03T04%3A52%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Time-Optimal%20Pick-and-Throw%20S-Curve%20Trajectories%20for%20Fast%20Parallel%20Robots&rft.jtitle=IEEE/ASME%20transactions%20on%20mechatronics&rft.au=Hassan,%20Ghina&rft.date=2022-12&rft.volume=27&rft.issue=6&rft.spage=4707&rft.epage=4717&rft.pages=4707-4717&rft.issn=1083-4435&rft.eissn=1941-014X&rft.coden=IATEFW&rft_id=info:doi/10.1109/TMECH.2022.3164247&rft_dat=%3Cproquest_RIE%3E2754151333%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2754151333&rft_id=info:pmid/&rft_ieee_id=9761916&rfr_iscdi=true |