The GJK Distance Algorithm: An Interval Version for Incremental Motions

The GJK Distance Algorithm: An Interval Version for Incremental Motions

The tracking of distance between two convex polyhedra is commonly used in the field of robotics, including collision detection or path planning. One of the well-known algorithms in this area is the distance algorithm developed by Gilbert, Johnson and Keerthi. Although this algorithm is widely-used i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Numerical algorithms 2004-12, Vol.37 (1-4), p.127-136
Hauptverfasser: Dyllong, Eva, Luther, Wolfram
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Polyhedra
Robotics
Tracking
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 136
container_issue 1-4
container_start_page 127
container_title Numerical algorithms
container_volume 37
creator Dyllong, Eva
Luther, Wolfram
description The tracking of distance between two convex polyhedra is commonly used in the field of robotics, including collision detection or path planning. One of the well-known algorithms in this area is the distance algorithm developed by Gilbert, Johnson and Keerthi. Although this algorithm is widely-used in robotics, up till now, there has been no verification of the computed results. This paper will present an interval version for tracking the distance between convex polyhedra using the C++ library PROFIL/BIAS.
doi_str_mv 10.1023/B:NUMA.0000049460.50984.b8
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918639624</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918639624</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-f8a57f14a0c04974b5607bc70d5f1c7224128349d63f5ae128e5afe7bb93463c3</originalsourceid><addsrcrecordid>eNpFkE9PAjEQxRujiYh-h0bPu_Z_t9wWRERBL-C16ZZWlsAutouJ394iJs5lZl5e5k1-ANxilGNE6P1w8Lqclzk6FlNMoJwjVbC8Ks5AD3NJMkUEP08zwjLDVBWX4CrGDUIYISJ7YLJYOzh5foEPdexMYx0stx9tqLv1bgDLBk6bzoUvs4XvLsS6baBvQxJtcDvXdEmft12S4zW48GYb3c1f74Pl43gxespmb5PpqJxllijcZb4wXHrMDLLpX8kqLpCsrEQr7rGVhDBMCsrUSlDPjUuL48Y7WVWKMkEt7YO70919aD8PLnZ60x5CkyJ1CigEVYKw5BqcXDa0MQbn9T7UOxO-NUb6CE4P9RGc_genf8HpqqA_PSFgjw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918639624</pqid></control><display><type>article</type><title>The GJK Distance Algorithm: An Interval Version for Incremental Motions</title><source>SpringerLink Journals - AutoHoldings</source><creator>Dyllong, Eva ; Luther, Wolfram</creator><creatorcontrib>Dyllong, Eva ; Luther, Wolfram</creatorcontrib><description>The tracking of distance between two convex polyhedra is commonly used in the field of robotics, including collision detection or path planning. One of the well-known algorithms in this area is the distance algorithm developed by Gilbert, Johnson and Keerthi. Although this algorithm is widely-used in robotics, up till now, there has been no verification of the computed results. This paper will present an interval version for tracking the distance between convex polyhedra using the C++ library PROFIL/BIAS.</description><identifier>ISSN: 1017-1398</identifier><identifier>EISSN: 1572-9265</identifier><identifier>DOI: 10.1023/B:NUMA.0000049460.50984.b8</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Algorithms ; Polyhedra ; Robotics ; Tracking</subject><ispartof>Numerical algorithms, 2004-12, Vol.37 (1-4), p.127-136</ispartof><rights>Kluwer Academic Publishers 2004.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-f8a57f14a0c04974b5607bc70d5f1c7224128349d63f5ae128e5afe7bb93463c3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Dyllong, Eva</creatorcontrib><creatorcontrib>Luther, Wolfram</creatorcontrib><title>The GJK Distance Algorithm: An Interval Version for Incremental Motions</title><title>Numerical algorithms</title><description>The tracking of distance between two convex polyhedra is commonly used in the field of robotics, including collision detection or path planning. One of the well-known algorithms in this area is the distance algorithm developed by Gilbert, Johnson and Keerthi. Although this algorithm is widely-used in robotics, up till now, there has been no verification of the computed results. This paper will present an interval version for tracking the distance between convex polyhedra using the C++ library PROFIL/BIAS.</description><subject>Algorithms</subject><subject>Polyhedra</subject><subject>Robotics</subject><subject>Tracking</subject><issn>1017-1398</issn><issn>1572-9265</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpFkE9PAjEQxRujiYh-h0bPu_Z_t9wWRERBL-C16ZZWlsAutouJ394iJs5lZl5e5k1-ANxilGNE6P1w8Lqclzk6FlNMoJwjVbC8Ks5AD3NJMkUEP08zwjLDVBWX4CrGDUIYISJ7YLJYOzh5foEPdexMYx0stx9tqLv1bgDLBk6bzoUvs4XvLsS6baBvQxJtcDvXdEmft12S4zW48GYb3c1f74Pl43gxespmb5PpqJxllijcZb4wXHrMDLLpX8kqLpCsrEQr7rGVhDBMCsrUSlDPjUuL48Y7WVWKMkEt7YO70919aD8PLnZ60x5CkyJ1CigEVYKw5BqcXDa0MQbn9T7UOxO-NUb6CE4P9RGc_genf8HpqqA_PSFgjw</recordid><startdate>200412</startdate><enddate>200412</enddate><creator>Dyllong, Eva</creator><creator>Luther, Wolfram</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope></search><sort><creationdate>200412</creationdate><title>The GJK Distance Algorithm: An Interval Version for Incremental Motions</title><author>Dyllong, Eva ; Luther, Wolfram</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-f8a57f14a0c04974b5607bc70d5f1c7224128349d63f5ae128e5afe7bb93463c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithms</topic><topic>Polyhedra</topic><topic>Robotics</topic><topic>Tracking</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dyllong, Eva</creatorcontrib><creatorcontrib>Luther, Wolfram</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><jtitle>Numerical algorithms</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dyllong, Eva</au><au>Luther, Wolfram</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The GJK Distance Algorithm: An Interval Version for Incremental Motions</atitle><jtitle>Numerical algorithms</jtitle><date>2004-12</date><risdate>2004</risdate><volume>37</volume><issue>1-4</issue><spage>127</spage><epage>136</epage><pages>127-136</pages><issn>1017-1398</issn><eissn>1572-9265</eissn><abstract>The tracking of distance between two convex polyhedra is commonly used in the field of robotics, including collision detection or path planning. One of the well-known algorithms in this area is the distance algorithm developed by Gilbert, Johnson and Keerthi. Although this algorithm is widely-used in robotics, up till now, there has been no verification of the computed results. This paper will present an interval version for tracking the distance between convex polyhedra using the C++ library PROFIL/BIAS.</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1023/B:NUMA.0000049460.50984.b8</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1017-1398
ispartof Numerical algorithms, 2004-12, Vol.37 (1-4), p.127-136
issn 1017-1398
1572-9265
language eng
recordid cdi_proquest_journals_2918639624
source SpringerLink Journals - AutoHoldings
subjects Algorithms
Polyhedra
Robotics
Tracking
title The GJK Distance Algorithm: An Interval Version for Incremental Motions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T18%3A40%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20GJK%20Distance%20Algorithm:%20An%20Interval%20Version%20for%20Incremental%20Motions&rft.jtitle=Numerical%20algorithms&rft.au=Dyllong,%20Eva&rft.date=2004-12&rft.volume=37&rft.issue=1-4&rft.spage=127&rft.epage=136&rft.pages=127-136&rft.issn=1017-1398&rft.eissn=1572-9265&rft_id=info:doi/10.1023/B:NUMA.0000049460.50984.b8&rft_dat=%3Cproquest_cross%3E2918639624%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918639624&rft_id=info:pmid/&rfr_iscdi=true