A trajectory planning of redundant manipulators based on bilevel optimization
In this paper, a novel trajectory planning approach is proposed for redundant manipulators in the case of several obstacles. The trajectory is discretized and at each step, we search for a new position of the end effector in the Cartesian space to reach the final position. Because of the redundancy,...
Gespeichert in:
| Veröffentlicht in: | Applied mathematics and computation 2015-01, Vol.250, p.934-947 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 947 |
|---|---|
| container_issue | |
| container_start_page | 934 |
| container_title | Applied mathematics and computation |
| container_volume | 250 |
| creator | Menasri, R. Nakib, A. Daachi, B. Oulhadj, H. Siarry, P. |
| description | In this paper, a novel trajectory planning approach is proposed for redundant manipulators in the case of several obstacles. The trajectory is discretized and at each step, we search for a new position of the end effector in the Cartesian space to reach the final position. Because of the redundancy, this position can be achieved by an infinity of configurations in the joint space. Thus, we use this property to find the best configuration that allows to avoid obstacles and singularities of the robot. The proposed method is based on a bilevel optimization formulation of the problem and bi-genetic algorithm to solve it. In order to avoid obstacles, we also proposed to manage constraints of the problem dynamically. This technique adapts the number of constraints in the formulation of the problem with the position of the obstacles. Simulation results showed the effectiveness of the proposed method. |
| doi_str_mv | 10.1016/j.amc.2014.10.101 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_01538502v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0096300314014763</els_id><sourcerecordid>1669847082</sourcerecordid><originalsourceid>FETCH-LOGICAL-c364t-e882dff5494d411611e67b60d40a13fa295f1b0cdc20ed7063fd06cdaf4531043</originalsourceid><addsrcrecordid>eNp9kEFr3DAQhUVpoNs0P6A3HduDtzOWLNv0tISmKWzIpTkLrTRqtdiSK3kXkl9fLw499jTw-N6D-Rj7iLBFQPXluDWj3daAcrtGb9gGu1ZUjZL9W7YB6FUlAMQ79r6UIwC0CuWGPez4nM2R7JzyM58GE2OIv3jyPJM7RWfizEcTw3QazIIUfjCFHE-RH8JAZxp4muYwhhczhxQ_sCtvhkI3r_eaPd19-3l7X-0fv_-43e0rK5ScK-q62nnfyF46iagQSbUHBU6CQeFN3TceD2CdrYFcC0p4B8o642UjEKS4Zp_X3d9m0FMOo8nPOpmg73d7fckAG9E1UJ9xYT-t7JTTnxOVWY-hWBqWVymdikal-k620NULiitqcyolk_-3jaAvmvVRL5r1RfNrtHS-rh1a_j0HyrrYQNGSC3mxql0K_2n_BTDxhMI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1669847082</pqid></control><display><type>article</type><title>A trajectory planning of redundant manipulators based on bilevel optimization</title><source>Access via ScienceDirect (Elsevier)</source><creator>Menasri, R. ; Nakib, A. ; Daachi, B. ; Oulhadj, H. ; Siarry, P.</creator><creatorcontrib>Menasri, R. ; Nakib, A. ; Daachi, B. ; Oulhadj, H. ; Siarry, P.</creatorcontrib><description>In this paper, a novel trajectory planning approach is proposed for redundant manipulators in the case of several obstacles. The trajectory is discretized and at each step, we search for a new position of the end effector in the Cartesian space to reach the final position. Because of the redundancy, this position can be achieved by an infinity of configurations in the joint space. Thus, we use this property to find the best configuration that allows to avoid obstacles and singularities of the robot. The proposed method is based on a bilevel optimization formulation of the problem and bi-genetic algorithm to solve it. In order to avoid obstacles, we also proposed to manage constraints of the problem dynamically. This technique adapts the number of constraints in the formulation of the problem with the position of the obstacles. Simulation results showed the effectiveness of the proposed method.</description><identifier>ISSN: 0096-3003</identifier><identifier>EISSN: 1873-5649</identifier><identifier>DOI: 10.1016/j.amc.2014.10.101</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Automatic Control Engineering ; Bi-genetic algorithm ; Bilevel optimization ; Computer Science ; Manipulators ; Mathematical analysis ; Obstacles ; Optimization ; Redundant ; Redundant manipulators ; Robot arms ; Robotics ; Robots ; Searching ; Trajectory planning</subject><ispartof>Applied mathematics and computation, 2015-01, Vol.250, p.934-947</ispartof><rights>2014 Elsevier Inc.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c364t-e882dff5494d411611e67b60d40a13fa295f1b0cdc20ed7063fd06cdaf4531043</citedby><cites>FETCH-LOGICAL-c364t-e882dff5494d411611e67b60d40a13fa295f1b0cdc20ed7063fd06cdaf4531043</cites><orcidid>0000-0001-9620-9324</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.amc.2014.10.101$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,780,784,885,3550,4024,27923,27924,27925,45995</link.rule.ids><backlink>$$Uhttps://hal.science/hal-01538502$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Menasri, R.</creatorcontrib><creatorcontrib>Nakib, A.</creatorcontrib><creatorcontrib>Daachi, B.</creatorcontrib><creatorcontrib>Oulhadj, H.</creatorcontrib><creatorcontrib>Siarry, P.</creatorcontrib><title>A trajectory planning of redundant manipulators based on bilevel optimization</title><title>Applied mathematics and computation</title><description>In this paper, a novel trajectory planning approach is proposed for redundant manipulators in the case of several obstacles. The trajectory is discretized and at each step, we search for a new position of the end effector in the Cartesian space to reach the final position. Because of the redundancy, this position can be achieved by an infinity of configurations in the joint space. Thus, we use this property to find the best configuration that allows to avoid obstacles and singularities of the robot. The proposed method is based on a bilevel optimization formulation of the problem and bi-genetic algorithm to solve it. In order to avoid obstacles, we also proposed to manage constraints of the problem dynamically. This technique adapts the number of constraints in the formulation of the problem with the position of the obstacles. Simulation results showed the effectiveness of the proposed method.</description><subject>Automatic Control Engineering</subject><subject>Bi-genetic algorithm</subject><subject>Bilevel optimization</subject><subject>Computer Science</subject><subject>Manipulators</subject><subject>Mathematical analysis</subject><subject>Obstacles</subject><subject>Optimization</subject><subject>Redundant</subject><subject>Redundant manipulators</subject><subject>Robot arms</subject><subject>Robotics</subject><subject>Robots</subject><subject>Searching</subject><subject>Trajectory planning</subject><issn>0096-3003</issn><issn>1873-5649</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNp9kEFr3DAQhUVpoNs0P6A3HduDtzOWLNv0tISmKWzIpTkLrTRqtdiSK3kXkl9fLw499jTw-N6D-Rj7iLBFQPXluDWj3daAcrtGb9gGu1ZUjZL9W7YB6FUlAMQ79r6UIwC0CuWGPez4nM2R7JzyM58GE2OIv3jyPJM7RWfizEcTw3QazIIUfjCFHE-RH8JAZxp4muYwhhczhxQ_sCtvhkI3r_eaPd19-3l7X-0fv_-43e0rK5ScK-q62nnfyF46iagQSbUHBU6CQeFN3TceD2CdrYFcC0p4B8o642UjEKS4Zp_X3d9m0FMOo8nPOpmg73d7fckAG9E1UJ9xYT-t7JTTnxOVWY-hWBqWVymdikal-k620NULiitqcyolk_-3jaAvmvVRL5r1RfNrtHS-rh1a_j0HyrrYQNGSC3mxql0K_2n_BTDxhMI</recordid><startdate>20150101</startdate><enddate>20150101</enddate><creator>Menasri, R.</creator><creator>Nakib, A.</creator><creator>Daachi, B.</creator><creator>Oulhadj, H.</creator><creator>Siarry, P.</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-9620-9324</orcidid></search><sort><creationdate>20150101</creationdate><title>A trajectory planning of redundant manipulators based on bilevel optimization</title><author>Menasri, R. ; Nakib, A. ; Daachi, B. ; Oulhadj, H. ; Siarry, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c364t-e882dff5494d411611e67b60d40a13fa295f1b0cdc20ed7063fd06cdaf4531043</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Automatic Control Engineering</topic><topic>Bi-genetic algorithm</topic><topic>Bilevel optimization</topic><topic>Computer Science</topic><topic>Manipulators</topic><topic>Mathematical analysis</topic><topic>Obstacles</topic><topic>Optimization</topic><topic>Redundant</topic><topic>Redundant manipulators</topic><topic>Robot arms</topic><topic>Robotics</topic><topic>Robots</topic><topic>Searching</topic><topic>Trajectory planning</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Menasri, R.</creatorcontrib><creatorcontrib>Nakib, A.</creatorcontrib><creatorcontrib>Daachi, B.</creatorcontrib><creatorcontrib>Oulhadj, H.</creatorcontrib><creatorcontrib>Siarry, P.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems 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>Civil Engineering Abstracts</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><jtitle>Applied mathematics and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Menasri, R.</au><au>Nakib, A.</au><au>Daachi, B.</au><au>Oulhadj, H.</au><au>Siarry, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A trajectory planning of redundant manipulators based on bilevel optimization</atitle><jtitle>Applied mathematics and computation</jtitle><date>2015-01-01</date><risdate>2015</risdate><volume>250</volume><spage>934</spage><epage>947</epage><pages>934-947</pages><issn>0096-3003</issn><eissn>1873-5649</eissn><abstract>In this paper, a novel trajectory planning approach is proposed for redundant manipulators in the case of several obstacles. The trajectory is discretized and at each step, we search for a new position of the end effector in the Cartesian space to reach the final position. Because of the redundancy, this position can be achieved by an infinity of configurations in the joint space. Thus, we use this property to find the best configuration that allows to avoid obstacles and singularities of the robot. The proposed method is based on a bilevel optimization formulation of the problem and bi-genetic algorithm to solve it. In order to avoid obstacles, we also proposed to manage constraints of the problem dynamically. This technique adapts the number of constraints in the formulation of the problem with the position of the obstacles. Simulation results showed the effectiveness of the proposed method.</abstract><pub>Elsevier Inc</pub><doi>10.1016/j.amc.2014.10.101</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0001-9620-9324</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0096-3003 |
| ispartof | Applied mathematics and computation, 2015-01, Vol.250, p.934-947 |
| issn | 0096-3003 1873-5649 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_01538502v1 |
| source | Access via ScienceDirect (Elsevier) |
| subjects | Automatic Control Engineering Bi-genetic algorithm Bilevel optimization Computer Science Manipulators Mathematical analysis Obstacles Optimization Redundant Redundant manipulators Robot arms Robotics Robots Searching Trajectory planning |
| title | A trajectory planning of redundant manipulators based on bilevel optimization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T17%3A50%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20trajectory%20planning%20of%20redundant%20manipulators%20based%20on%20bilevel%20optimization&rft.jtitle=Applied%20mathematics%20and%20computation&rft.au=Menasri,%20R.&rft.date=2015-01-01&rft.volume=250&rft.spage=934&rft.epage=947&rft.pages=934-947&rft.issn=0096-3003&rft.eissn=1873-5649&rft_id=info:doi/10.1016/j.amc.2014.10.101&rft_dat=%3Cproquest_hal_p%3E1669847082%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1669847082&rft_id=info:pmid/&rft_els_id=S0096300314014763&rfr_iscdi=true |