A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path

A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path

A time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In thi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mansouri, Saeed, Sadigh, Mohammad Jafar, Fazeli, Masoud
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Optimization and Control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Mansouri, Saeed
Sadigh, Mohammad Jafar
Fazeli, Masoud
description A time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In this paper, we explore the characteristics of the maximum velocity curve (MVC) and propose an efficient algorithm to establish the solution curve. Then we propose a straightforward method to calculate the maximum or minimum possible acceleration on the path based on the pattern of saturated actuators, which substantially reduces the computational cost. Two numerical examples are provided to illustrate the issues and the solutions.
doi_str_mv 10.48550/arxiv.1703.00151
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1703_00151</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1703_00151</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-f952760b6a805fd1045b77c6f5ec39ccaeeceb7cbfe1fd517854074468317fb13</originalsourceid><addsrcrecordid>eNotkL1OwzAURr0woMIDMHFfIMEmcZyOUdQCUlFRyR5d_7VGiR2lTkUmXp3SMn3DJx3pHEIeGE3zknP6hOO3O6VM0CyllHF2S34qqEM_TBGjCx67boaVtU454yNU3T6MLh56iAHWzmtoXG-S7RBdjx00I34ZFcM4Q7CwM3ryGn08IyoVJ4xGwy7IEI_wHk7O7yF4QPgcjHLWnc8PjIc7cmOxO5r7_12QZr1q6tdks315q6tNgoVgiV3yZ1FQWWBJudWM5lwKoQrLjcqWSqExykihpDXMas5EyXMq8rwoMyasZNmCPF6xlwLtMJ4Fxrn9K9FeSmS_0dNa9w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path</title><source>arXiv.org</source><creator>Mansouri, Saeed ; Sadigh, Mohammad Jafar ; Fazeli, Masoud</creator><creatorcontrib>Mansouri, Saeed ; Sadigh, Mohammad Jafar ; Fazeli, Masoud</creatorcontrib><description>A time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In this paper, we explore the characteristics of the maximum velocity curve (MVC) and propose an efficient algorithm to establish the solution curve. Then we propose a straightforward method to calculate the maximum or minimum possible acceleration on the path based on the pattern of saturated actuators, which substantially reduces the computational cost. Two numerical examples are provided to illustrate the issues and the solutions.</description><identifier>DOI: 10.48550/arxiv.1703.00151</identifier><language>eng</language><subject>Mathematics - Optimization and Control</subject><creationdate>2017-03</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1703.00151$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1703.00151$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Mansouri, Saeed</creatorcontrib><creatorcontrib>Sadigh, Mohammad Jafar</creatorcontrib><creatorcontrib>Fazeli, Masoud</creatorcontrib><title>A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path</title><description>A time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In this paper, we explore the characteristics of the maximum velocity curve (MVC) and propose an efficient algorithm to establish the solution curve. Then we propose a straightforward method to calculate the maximum or minimum possible acceleration on the path based on the pattern of saturated actuators, which substantially reduces the computational cost. Two numerical examples are provided to illustrate the issues and the solutions.</description><subject>Mathematics - Optimization and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotkL1OwzAURr0woMIDMHFfIMEmcZyOUdQCUlFRyR5d_7VGiR2lTkUmXp3SMn3DJx3pHEIeGE3zknP6hOO3O6VM0CyllHF2S34qqEM_TBGjCx67boaVtU454yNU3T6MLh56iAHWzmtoXG-S7RBdjx00I34ZFcM4Q7CwM3ryGn08IyoVJ4xGwy7IEI_wHk7O7yF4QPgcjHLWnc8PjIc7cmOxO5r7_12QZr1q6tdks315q6tNgoVgiV3yZ1FQWWBJudWM5lwKoQrLjcqWSqExykihpDXMas5EyXMq8rwoMyasZNmCPF6xlwLtMJ4Fxrn9K9FeSmS_0dNa9w</recordid><startdate>20170301</startdate><enddate>20170301</enddate><creator>Mansouri, Saeed</creator><creator>Sadigh, Mohammad Jafar</creator><creator>Fazeli, Masoud</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20170301</creationdate><title>A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path</title><author>Mansouri, Saeed ; Sadigh, Mohammad Jafar ; Fazeli, Masoud</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-f952760b6a805fd1045b77c6f5ec39ccaeeceb7cbfe1fd517854074468317fb13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Mansouri, Saeed</creatorcontrib><creatorcontrib>Sadigh, Mohammad Jafar</creatorcontrib><creatorcontrib>Fazeli, Masoud</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mansouri, Saeed</au><au>Sadigh, Mohammad Jafar</au><au>Fazeli, Masoud</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path</atitle><date>2017-03-01</date><risdate>2017</risdate><abstract>A time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In this paper, we explore the characteristics of the maximum velocity curve (MVC) and propose an efficient algorithm to establish the solution curve. Then we propose a straightforward method to calculate the maximum or minimum possible acceleration on the path based on the pattern of saturated actuators, which substantially reduces the computational cost. Two numerical examples are provided to illustrate the issues and the solutions.</abstract><doi>10.48550/arxiv.1703.00151</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1703.00151
ispartof
issn
language eng
recordid cdi_arxiv_primary_1703_00151
source arXiv.org
subjects Mathematics - Optimization and Control
title A Computationally Efficient Algorithm to Find Time-Optimal Trajectory of Redundantly Actuated Robots Moving on a Specified Path
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T08%3A01%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Computationally%20Efficient%20Algorithm%20to%20Find%20Time-Optimal%20Trajectory%20of%20Redundantly%20Actuated%20Robots%20Moving%20on%20a%20Specified%20Path&rft.au=Mansouri,%20Saeed&rft.date=2017-03-01&rft_id=info:doi/10.48550/arxiv.1703.00151&rft_dat=%3Carxiv_GOX%3E1703_00151%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true