A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
We present an algorithm for complete path planning for translating polyhedral robots in three dimensions. We compute a roadmap of the free space that captures its connectivity. The roadmap is constructed without computing an explicit representation of the free space. It encodes the complete connecti...
Gespeichert in:
| Veröffentlicht in: | The International journal of robotics research 2005-11, Vol.24 (11), p.983-995 |
|---|---|
| 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 | 995 |
|---|---|
| container_issue | 11 |
| container_start_page | 983 |
| container_title | The International journal of robotics research |
| container_volume | 24 |
| creator | Varadhan, Gokul Krishnan, Shankar Sriram, T. V.N. Manocha, Dinesh |
| description | We present an algorithm for complete path planning for translating polyhedral robots in three dimensions. We compute a roadmap of the free space that captures its connectivity. The roadmap is constructed without computing an explicit representation of the free space. It encodes the complete connectivity of free space and allows us to perform exact path planning. We construct a roadmap by performing a sampling of the free space in a deterministic fashion. We obtain a set of deterministic samples by generating an adaptive volumetric grid. Our algorithm is simple to implement and uses two tests: a complex cell test and a star-shaped test during sample generation. These tests can be efficiently performed on polyhedral objects using max-norm distance computation and linear programming. We demonstrate the performance of our algorithm on environments with very small narrow passages or no collision-free paths. |
| doi_str_mv | 10.1177/0278364905059061 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_28620992</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A140995876</galeid><sage_id>10.1177_0278364905059061</sage_id><sourcerecordid>A140995876</sourcerecordid><originalsourceid>FETCH-LOGICAL-c378t-598f1079fd46b06274a5104d5092078b8e89a7078c6ffff06fa57fe5ca05811d3</originalsourceid><addsrcrecordid>eNp1kU1LAzEQhoMoWKt3j8GDt62T3c3XsRS_oGLRel7S3aRNyW5qsj3035ulglAwc0hm5nknLwxCtwQmhHD-ADkXBSslUKASGDlDI8JLkhWEs3M0GtrZ0L9EVzFuAaBgIEdoMcWftt05jadu7YPtNy02PuCZH4q9xm--t77DC6e6znZr7A1eBtVFp_ohXXh32OgmKIc__Mr38RpdGOWivvm9x-jr6XE5e8nm78-vs-k8qwsu-oxKYQhwaZqSrYDlvFSUQNlQkDlwsRJaSMXTq2YmHWBGUW40rRVQQUhTjNH9ce4u-O-9jn3V2lhrl3xqv49VLlgOUuYJvDsBt34fuuStyguA9BuFBE2O0Fo5XdnO-D6oOkWjW1v7Thub6lNSppFUcJYEcBTUwccYtKl2wbYqHCoC1bCQ6nQhSZIdJVGt9Z-Jf_kfFGuIlw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>230020750</pqid></control><display><type>article</type><title>A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots</title><source>SAGE Complete</source><creator>Varadhan, Gokul ; Krishnan, Shankar ; Sriram, T. V.N. ; Manocha, Dinesh</creator><creatorcontrib>Varadhan, Gokul ; Krishnan, Shankar ; Sriram, T. V.N. ; Manocha, Dinesh</creatorcontrib><description>We present an algorithm for complete path planning for translating polyhedral robots in three dimensions. We compute a roadmap of the free space that captures its connectivity. The roadmap is constructed without computing an explicit representation of the free space. It encodes the complete connectivity of free space and allows us to perform exact path planning. We construct a roadmap by performing a sampling of the free space in a deterministic fashion. We obtain a set of deterministic samples by generating an adaptive volumetric grid. Our algorithm is simple to implement and uses two tests: a complex cell test and a star-shaped test during sample generation. These tests can be efficiently performed on polyhedral objects using max-norm distance computation and linear programming. We demonstrate the performance of our algorithm on environments with very small narrow passages or no collision-free paths.</description><identifier>ISSN: 0278-3649</identifier><identifier>EISSN: 1741-3176</identifier><identifier>DOI: 10.1177/0278364905059061</identifier><identifier>CODEN: IJRREL</identifier><language>eng</language><publisher>London: SAGE Publications</publisher><subject>Algorithms ; Motion control ; Polyhedra ; Robotics ; Robots</subject><ispartof>The International journal of robotics research, 2005-11, Vol.24 (11), p.983-995</ispartof><rights>COPYRIGHT 2005 Sage Publications Ltd. (UK)</rights><rights>Copyright SAGE PUBLICATIONS, INC. Nov 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c378t-598f1079fd46b06274a5104d5092078b8e89a7078c6ffff06fa57fe5ca05811d3</citedby><cites>FETCH-LOGICAL-c378t-598f1079fd46b06274a5104d5092078b8e89a7078c6ffff06fa57fe5ca05811d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://journals.sagepub.com/doi/pdf/10.1177/0278364905059061$$EPDF$$P50$$Gsage$$H</linktopdf><linktohtml>$$Uhttps://journals.sagepub.com/doi/10.1177/0278364905059061$$EHTML$$P50$$Gsage$$H</linktohtml><link.rule.ids>314,776,780,21798,27901,27902,43597,43598</link.rule.ids></links><search><creatorcontrib>Varadhan, Gokul</creatorcontrib><creatorcontrib>Krishnan, Shankar</creatorcontrib><creatorcontrib>Sriram, T. V.N.</creatorcontrib><creatorcontrib>Manocha, Dinesh</creatorcontrib><title>A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots</title><title>The International journal of robotics research</title><description>We present an algorithm for complete path planning for translating polyhedral robots in three dimensions. We compute a roadmap of the free space that captures its connectivity. The roadmap is constructed without computing an explicit representation of the free space. It encodes the complete connectivity of free space and allows us to perform exact path planning. We construct a roadmap by performing a sampling of the free space in a deterministic fashion. We obtain a set of deterministic samples by generating an adaptive volumetric grid. Our algorithm is simple to implement and uses two tests: a complex cell test and a star-shaped test during sample generation. These tests can be efficiently performed on polyhedral objects using max-norm distance computation and linear programming. We demonstrate the performance of our algorithm on environments with very small narrow passages or no collision-free paths.</description><subject>Algorithms</subject><subject>Motion control</subject><subject>Polyhedra</subject><subject>Robotics</subject><subject>Robots</subject><issn>0278-3649</issn><issn>1741-3176</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp1kU1LAzEQhoMoWKt3j8GDt62T3c3XsRS_oGLRel7S3aRNyW5qsj3035ulglAwc0hm5nknLwxCtwQmhHD-ADkXBSslUKASGDlDI8JLkhWEs3M0GtrZ0L9EVzFuAaBgIEdoMcWftt05jadu7YPtNy02PuCZH4q9xm--t77DC6e6znZr7A1eBtVFp_ohXXh32OgmKIc__Mr38RpdGOWivvm9x-jr6XE5e8nm78-vs-k8qwsu-oxKYQhwaZqSrYDlvFSUQNlQkDlwsRJaSMXTq2YmHWBGUW40rRVQQUhTjNH9ce4u-O-9jn3V2lhrl3xqv49VLlgOUuYJvDsBt34fuuStyguA9BuFBE2O0Fo5XdnO-D6oOkWjW1v7Thub6lNSppFUcJYEcBTUwccYtKl2wbYqHCoC1bCQ6nQhSZIdJVGt9Z-Jf_kfFGuIlw</recordid><startdate>200511</startdate><enddate>200511</enddate><creator>Varadhan, Gokul</creator><creator>Krishnan, Shankar</creator><creator>Sriram, T. V.N.</creator><creator>Manocha, Dinesh</creator><general>SAGE Publications</general><general>Sage Publications Ltd. (UK)</general><general>SAGE PUBLICATIONS, INC</general><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>F28</scope></search><sort><creationdate>200511</creationdate><title>A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots</title><author>Varadhan, Gokul ; Krishnan, Shankar ; Sriram, T. V.N. ; Manocha, Dinesh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c378t-598f1079fd46b06274a5104d5092078b8e89a7078c6ffff06fa57fe5ca05811d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Motion control</topic><topic>Polyhedra</topic><topic>Robotics</topic><topic>Robots</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Varadhan, Gokul</creatorcontrib><creatorcontrib>Krishnan, Shankar</creatorcontrib><creatorcontrib>Sriram, T. V.N.</creatorcontrib><creatorcontrib>Manocha, Dinesh</creatorcontrib><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>ANTE: Abstracts in New Technology & Engineering</collection><jtitle>The International journal of robotics research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Varadhan, Gokul</au><au>Krishnan, Shankar</au><au>Sriram, T. V.N.</au><au>Manocha, Dinesh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots</atitle><jtitle>The International journal of robotics research</jtitle><date>2005-11</date><risdate>2005</risdate><volume>24</volume><issue>11</issue><spage>983</spage><epage>995</epage><pages>983-995</pages><issn>0278-3649</issn><eissn>1741-3176</eissn><coden>IJRREL</coden><abstract>We present an algorithm for complete path planning for translating polyhedral robots in three dimensions. We compute a roadmap of the free space that captures its connectivity. The roadmap is constructed without computing an explicit representation of the free space. It encodes the complete connectivity of free space and allows us to perform exact path planning. We construct a roadmap by performing a sampling of the free space in a deterministic fashion. We obtain a set of deterministic samples by generating an adaptive volumetric grid. Our algorithm is simple to implement and uses two tests: a complex cell test and a star-shaped test during sample generation. These tests can be efficiently performed on polyhedral objects using max-norm distance computation and linear programming. We demonstrate the performance of our algorithm on environments with very small narrow passages or no collision-free paths.</abstract><cop>London</cop><pub>SAGE Publications</pub><doi>10.1177/0278364905059061</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0278-3649 |
| ispartof | The International journal of robotics research, 2005-11, Vol.24 (11), p.983-995 |
| issn | 0278-3649 1741-3176 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28620992 |
| source | SAGE Complete |
| subjects | Algorithms Motion control Polyhedra Robotics Robots |
| title | A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T10%3A49%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Simple%20Algorithm%20for%20Complete%20Motion%20Planning%20of%20Translating%20Polyhedral%20Robots&rft.jtitle=The%20International%20journal%20of%20robotics%20research&rft.au=Varadhan,%20Gokul&rft.date=2005-11&rft.volume=24&rft.issue=11&rft.spage=983&rft.epage=995&rft.pages=983-995&rft.issn=0278-3649&rft.eissn=1741-3176&rft.coden=IJRREL&rft_id=info:doi/10.1177/0278364905059061&rft_dat=%3Cgale_proqu%3EA140995876%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=230020750&rft_id=info:pmid/&rft_galeid=A140995876&rft_sage_id=10.1177_0278364905059061&rfr_iscdi=true |