Parallel computation of symbolic robot models and control laws: theory and application on transputer networks

Parallel computation of symbolic robot models and control laws: theory and application on transputer networks

The authors present two novel parallel algorithms for computing robot inverse dynamics and control laws starting from the customized symbolic robot models. The first algorithm resolves the scheduling problem for an array of pipelined processors. The second algorithm is devoted to parallel processors...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kircanski, N., Petrovic, T., Vukobratovic, M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Communication system control
Concurrent computing
Costs
Delay effects
Multiprocessor interconnection networks
Parallel algorithms
Parallel robots
Processor scheduling
Robot control
Scheduling algorithm
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2093 vol.3
container_issue
container_start_page 2088
container_title
container_volume
creator Kircanski, N.
Petrovic, T.
Vukobratovic, M.
description The authors present two novel parallel algorithms for computing robot inverse dynamics and control laws starting from the customized symbolic robot models. The first algorithm resolves the scheduling problem for an array of pipelined processors. The second algorithm is devoted to parallel processors connected by a complete crossbar interconnection network. The main feature of the algorithms is that they take into account the communication delays between processors and minimize both the execution time and the communication cost. The algorithms were verified by experiments on an INMOS T800 transputer-based system. The experimental results showed that the most complicated dynamic control laws could be executed in a submillisecond range.< >
doi_str_mv 10.1109/ROBOT.1992.219973
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_219973</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>219973</ieee_id><sourcerecordid>219973</sourcerecordid><originalsourceid>FETCH-LOGICAL-i172t-fd24386f66c7d663d1b4487ecc6f7c76b2d3385b13ca226ad111bfe9f5a15f223</originalsourceid><addsrcrecordid>eNotkEtLxDAUhQMiKGN_gK7yB1rzaJPUnQ6-YKAi43rIE6tpUpLIMP_eMjN3cQ-Hc8-3uADcYtRgjPr7z-Fp2Da470lDls3pBah6LpDAghFOELoCVc4_aJlu8R2_BtOHTNJ766GO0_xXZBljgNHBfJhU9KOGKapY4BSN9RnKYJbDUFL00Mt9foDl28Z0OAZynpfCmRBgSTLkBWkTDLbsY_rNN-DSSZ9tddYV-Hp53q7f6s3w-r5-3NQj5qTUzpCWCuYY09wwRg1WbSu41Zo5rjlTxFAqOoWploQwaTDGytnedRJ3jhC6Ancn7mit3c1pnGQ67E4_of_NtVpQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Parallel computation of symbolic robot models and control laws: theory and application on transputer networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Kircanski, N. ; Petrovic, T. ; Vukobratovic, M.</creator><creatorcontrib>Kircanski, N. ; Petrovic, T. ; Vukobratovic, M.</creatorcontrib><description>The authors present two novel parallel algorithms for computing robot inverse dynamics and control laws starting from the customized symbolic robot models. The first algorithm resolves the scheduling problem for an array of pipelined processors. The second algorithm is devoted to parallel processors connected by a complete crossbar interconnection network. The main feature of the algorithms is that they take into account the communication delays between processors and minimize both the execution time and the communication cost. The algorithms were verified by experiments on an INMOS T800 transputer-based system. The experimental results showed that the most complicated dynamic control laws could be executed in a submillisecond range.&lt; &gt;</description><identifier>ISBN: 9780818627200</identifier><identifier>ISBN: 0818627204</identifier><identifier>DOI: 10.1109/ROBOT.1992.219973</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Communication system control ; Concurrent computing ; Costs ; Delay effects ; Multiprocessor interconnection networks ; Parallel algorithms ; Parallel robots ; Processor scheduling ; Robot control ; Scheduling algorithm</subject><ispartof>Proceedings 1992 IEEE International Conference on Robotics and Automation, 1992, p.2088-2093 vol.3</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/219973$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/219973$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kircanski, N.</creatorcontrib><creatorcontrib>Petrovic, T.</creatorcontrib><creatorcontrib>Vukobratovic, M.</creatorcontrib><title>Parallel computation of symbolic robot models and control laws: theory and application on transputer networks</title><title>Proceedings 1992 IEEE International Conference on Robotics and Automation</title><addtitle>ROBOT</addtitle><description>The authors present two novel parallel algorithms for computing robot inverse dynamics and control laws starting from the customized symbolic robot models. The first algorithm resolves the scheduling problem for an array of pipelined processors. The second algorithm is devoted to parallel processors connected by a complete crossbar interconnection network. The main feature of the algorithms is that they take into account the communication delays between processors and minimize both the execution time and the communication cost. The algorithms were verified by experiments on an INMOS T800 transputer-based system. The experimental results showed that the most complicated dynamic control laws could be executed in a submillisecond range.&lt; &gt;</description><subject>Communication system control</subject><subject>Concurrent computing</subject><subject>Costs</subject><subject>Delay effects</subject><subject>Multiprocessor interconnection networks</subject><subject>Parallel algorithms</subject><subject>Parallel robots</subject><subject>Processor scheduling</subject><subject>Robot control</subject><subject>Scheduling algorithm</subject><isbn>9780818627200</isbn><isbn>0818627204</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1992</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkEtLxDAUhQMiKGN_gK7yB1rzaJPUnQ6-YKAi43rIE6tpUpLIMP_eMjN3cQ-Hc8-3uADcYtRgjPr7z-Fp2Da470lDls3pBah6LpDAghFOELoCVc4_aJlu8R2_BtOHTNJ766GO0_xXZBljgNHBfJhU9KOGKapY4BSN9RnKYJbDUFL00Mt9foDl28Z0OAZynpfCmRBgSTLkBWkTDLbsY_rNN-DSSZ9tddYV-Hp53q7f6s3w-r5-3NQj5qTUzpCWCuYY09wwRg1WbSu41Zo5rjlTxFAqOoWploQwaTDGytnedRJ3jhC6Ancn7mit3c1pnGQ67E4_of_NtVpQ</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>Kircanski, N.</creator><creator>Petrovic, T.</creator><creator>Vukobratovic, M.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1992</creationdate><title>Parallel computation of symbolic robot models and control laws: theory and application on transputer networks</title><author>Kircanski, N. ; Petrovic, T. ; Vukobratovic, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i172t-fd24386f66c7d663d1b4487ecc6f7c76b2d3385b13ca226ad111bfe9f5a15f223</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Communication system control</topic><topic>Concurrent computing</topic><topic>Costs</topic><topic>Delay effects</topic><topic>Multiprocessor interconnection networks</topic><topic>Parallel algorithms</topic><topic>Parallel robots</topic><topic>Processor scheduling</topic><topic>Robot control</topic><topic>Scheduling algorithm</topic><toplevel>online_resources</toplevel><creatorcontrib>Kircanski, N.</creatorcontrib><creatorcontrib>Petrovic, T.</creatorcontrib><creatorcontrib>Vukobratovic, M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kircanski, N.</au><au>Petrovic, T.</au><au>Vukobratovic, M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Parallel computation of symbolic robot models and control laws: theory and application on transputer networks</atitle><btitle>Proceedings 1992 IEEE International Conference on Robotics and Automation</btitle><stitle>ROBOT</stitle><date>1992</date><risdate>1992</risdate><spage>2088</spage><epage>2093 vol.3</epage><pages>2088-2093 vol.3</pages><isbn>9780818627200</isbn><isbn>0818627204</isbn><abstract>The authors present two novel parallel algorithms for computing robot inverse dynamics and control laws starting from the customized symbolic robot models. The first algorithm resolves the scheduling problem for an array of pipelined processors. The second algorithm is devoted to parallel processors connected by a complete crossbar interconnection network. The main feature of the algorithms is that they take into account the communication delays between processors and minimize both the execution time and the communication cost. The algorithms were verified by experiments on an INMOS T800 transputer-based system. The experimental results showed that the most complicated dynamic control laws could be executed in a submillisecond range.&lt; &gt;</abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/ROBOT.1992.219973</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9780818627200
ispartof Proceedings 1992 IEEE International Conference on Robotics and Automation, 1992, p.2088-2093 vol.3
issn
language eng
recordid cdi_ieee_primary_219973
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Communication system control
Concurrent computing
Costs
Delay effects
Multiprocessor interconnection networks
Parallel algorithms
Parallel robots
Processor scheduling
Robot control
Scheduling algorithm
title Parallel computation of symbolic robot models and control laws: theory and application on transputer networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T21%3A30%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Parallel%20computation%20of%20symbolic%20robot%20models%20and%20control%20laws:%20theory%20and%20application%20on%20transputer%20networks&rft.btitle=Proceedings%201992%20IEEE%20International%20Conference%20on%20Robotics%20and%20Automation&rft.au=Kircanski,%20N.&rft.date=1992&rft.spage=2088&rft.epage=2093%20vol.3&rft.pages=2088-2093%20vol.3&rft.isbn=9780818627200&rft.isbn_list=0818627204&rft_id=info:doi/10.1109/ROBOT.1992.219973&rft_dat=%3Cieee_6IE%3E219973%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=219973&rfr_iscdi=true