An efficient algorithm for real time collision detection involving a continuum manipulator with multiple uniform-curvature sections
A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave shapes. While such a robot is promising for manipulating a wide range of objects in less-structured and cluttered environments, it poses a greater challe...
Saved in:
| Published in | Robotica Vol. 34; no. 7; pp. 1566 - 1586 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Cambridge, UK
Cambridge University Press
01.07.2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0263-5747 1469-8668 |
| DOI | 10.1017/S0263574714002458 |
Cover
| Abstract | A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave shapes. While such a robot is promising for manipulating a wide range of objects in less-structured and cluttered environments, it poses a greater challenge to collision detection than conventional, articulated manipulators. Existing collision detection algorithms are built upon intersection checking between convex primitives, such as between two convex polygons or polyhedra, with the assumption that both the manipulator and the objects in the environment are modeled in terms of those primitives, for example, as polygonal meshes. However, to approximate a continuum manipulator with a polygonal mesh requires a fine mesh because of its concavity, and each time the manipulator changes its configuration by deforming its shape, the mesh has to be updated for the new configuration. This makes mesh-based collision detection involving such a robot much more computationally expensive than that involving an articulated manipulator with rigid links. Hence, we introduce an efficient algorithm for Collision Detection between a Continuum Manipulator (CD-CoM) and its environment based on analytical intersection checking with nonconvex primitives. Our algorithm applies to the exact model of any continuum manipulator consisting of multiple uniform-curvature sections of toroidal and (sometimes) cylindrical shapes as well as more general continuum manipulators whose sections can be approximated by toroidal and cylindrical primitives. Our test results show that using this algorithm is both more accurate and efficient in time and space to detect collisions than approximating a continuum manipulator as a polygonal mesh. Moreover, the CD-CoM algorithm also provides the minimum distance information between the continuum manipulator and objects when there is no collision. Such an efficient algorithm is essential for path/trajectory planning of continuum manipulators in real-time. |
|---|---|
| AbstractList | A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave shapes. While such a robot is promising for manipulating a wide range of objects in less-structured and cluttered environments, it poses a greater challenge to collision detection than conventional, articulated manipulators. Existing collision detection algorithms are built upon intersection checking between convex primitives, such as between two convex polygons or polyhedra, with the assumption that both the manipulator and the objects in the environment are modeled in terms of those primitives, for example, as polygonal meshes. However, to approximate a continuum manipulator with a polygonal mesh requires a fine mesh because of its concavity, and each time the manipulator changes its configuration by deforming its shape, the mesh has to be updated for the new configuration. This makes mesh-based collision detection involving such a robot much more computationally expensive than that involving an articulated manipulator with rigid links. Hence, we introduce an efficient algorithm for Collision Detection between a Continuum Manipulator (CD-CoM) and its environment based on analytical intersection checking with nonconvex primitives. Our algorithm applies to the exact model of any continuum manipulator consisting of multiple uniform-curvature sections of toroidal and (sometimes) cylindrical shapes as well as more general continuum manipulators whose sections can be approximated by toroidal and cylindrical primitives. Our test results show that using this algorithm is both more accurate and efficient in time and space to detect collisions than approximating a continuum manipulator as a polygonal mesh. Moreover, the CD-CoM algorithm also provides the minimum distance information between the continuum manipulator and objects when there is no collision. Such an efficient algorithm is essential for path/trajectory planning of continuum manipulators in real-time. A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave shapes. While such a robot is promising for manipulating a wide range of objects in less-structured and cluttered environments, it poses a greater challenge to collision detection than conventional, articulated manipulators. Existing collision detection algorithms are built upon intersection checking between convex primitives, such as between two convex polygons or polyhedra, with the assumption that both the manipulator and the objects in the environment are modeled in terms of those primitives, for example, as polygonal meshes. However, to approximate a continuum manipulator with a polygonal mesh requires a fine mesh because of its concavity, and each time the manipulator changes its configuration by deforming its shape, the mesh has to be updated for the new configuration. This makes mesh-based collision detection involving such a robot much more computationally expensive than that involving an articulated manipulator with rigid links. Hence, we introduce an efficient algorithm for Collision Detection between a Continuum Manipulator (CD-CoM) and its environment based on analytical intersection checking with nonconvex primitives. Our algorithm applies to the exact model of any continuum manipulator consisting of multiple uniform-curvature sections of toroidal and (sometimes) cylindrical shapes as well as more general continuum manipulators whose sections can be approximated by toroidal and cylindrical primitives. Our test results show that using this algorithm is both more accurate and efficient in time and space to detect collisions than approximating a continuum manipulator as a polygonal mesh. Moreover, the CD-CoM algorithm also provides the minimum distance information between the continuum manipulator and objects when there is no collision. Such an efficient algorithm is essential for path/trajectory planning of continuum manipulators in real-time. SUMMARY A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave shapes. While such a robot is promising for manipulating a wide range of objects in less-structured and cluttered environments, it poses a greater challenge to collision detection than conventional, articulated manipulators. Existing collision detection algorithms are built upon intersection checking between convex primitives, such as between two convex polygons or polyhedra, with the assumption that both the manipulator and the objects in the environment are modeled in terms of those primitives, for example, as polygonal meshes. However, to approximate a continuum manipulator with a polygonal mesh requires a fine mesh because of its concavity, and each time the manipulator changes its configuration by deforming its shape, the mesh has to be updated for the new configuration. This makes mesh-based collision detection involving such a robot much more computationally expensive than that involving an articulated manipulator with rigid links. Hence, we introduce an efficient algorithm for Collision Detection between a Continuum Manipulator (CD-CoM) and its environment based on analytical intersection checking with nonconvex primitives. Our algorithm applies to the exact model of any continuum manipulator consisting of multiple uniform-curvature sections of toroidal and (sometimes) cylindrical shapes as well as more general continuum manipulators whose sections can be approximated by toroidal and cylindrical primitives. Our test results show that using this algorithm is both more accurate and efficient in time and space to detect collisions than approximating a continuum manipulator as a polygonal mesh. Moreover, the CD-CoM algorithm also provides the minimum distance information between the continuum manipulator and objects when there is no collision. Such an efficient algorithm is essential for path/trajectory planning of continuum manipulators in real-time. |
| Author | Li, Jinglin Xiao, Jing |
| Author_xml | – sequence: 1 givenname: Jinglin surname: Li fullname: Li, Jinglin email: jli41@uncc.edu organization: Department of Computer Science, University of North Carolina at Charlotte, NC 28223USA E-mail: xiao@uncc.edu – sequence: 2 givenname: Jing surname: Xiao fullname: Xiao, Jing email: xiao@uncc.edu organization: Department of Computer Science, University of North Carolina at Charlotte, NC 28223USA E-mail: xiao@uncc.edu |
| BookMark | eNp9kctqHDEQRUVwIGMnH5CdIBtvOtGrWz1LY2wnYMgiybpRq0sTGT3GeozxOj8eNeNFsHE2VQX3nktRdYpOQgyA0EdKPlNC5ZcfhA28l0JSQQgT_fgGbagYtt04DOMJ2qxyt-rv0GnOd4RQToXcoD8XAYMxVlsIBSu3i8mW3x6bmHAC5XCxHrCOztlsY8ALFNBlnWw4RHewYYdV00OxoVaPvQp2X50qjX9oSdhXV-zeAa7BtlDf6ZoOqtQEOB-T8nv01iiX4cNTP0O_rq9-Xn7tbr_ffLu8uO0070np5LwwvagtLEIAW9ioueStmi1TjEluNLBxNlTzmSihmVgEkwRmahZhiFH8DJ0fc_cp3lfIZfI2a3BOBYg1T3RkvRhkz0SzfnpmvYs1hbbdROWW9UQyypqLHl06xZwTmGmfrFfpcaJkWt8yvXhLY-QzRtui1juUpKz7L8mfSOXnZJcd_LPUq9RfMKultQ |
| CitedBy_id | crossref_primary_10_1017_S026357472100093X crossref_primary_10_1115_1_4067229 crossref_primary_10_1177_1729881418820223 crossref_primary_10_1016_j_neucom_2022_05_006 crossref_primary_10_1109_LRA_2016_2516589 crossref_primary_10_1017_S0263574724000651 |
| Cites_doi | 10.1007/978-1-4615-4022-9 10.1109/ICRA.2014.6907160 10.1109/ROBOT.2002.1013462 10.1109/IEMBS.2005.1615801 10.1109/TRO.2005.861458 10.1145/237170.237244 10.1111/1467-8659.1330155 10.1109/TRO.2004.838012 10.1111/1467-8659.1420105 10.1017/S0263574799001009 10.1109/TRO.2008.2003277 10.1109/IROS.2009.5353962 10.1145/192161.192241 10.1109/70.56661 10.1109/TRO.2010.2062570 10.1109/ROBOT.1999.774029 10.1109/RT.2006.280213 10.1002/9781118136607 10.1080/10867651.1999.10487502 10.1016/S0097-8493(00)00130-8 10.1109/70.105397 10.1145/1128923.1128955 10.1137/0213031 10.1109/TRO.2008.2006868 10.1109/TRO.2011.2105410 10.1111/j.1467-8659.2004.00788.x 10.1155/2008/520417 10.1109/IROS.2013.6697012 10.1145/1364901.1364908 10.1109/IROS.1997.656591 10.1109/ICRA.2012.6225025 10.1016/j.cag.2006.02.011 10.1007/s00371-003-0226-y 10.1080/10867651.1997.10487480 |
| ContentType | Journal Article |
| Copyright | Copyright © Cambridge University Press 2014 |
| Copyright_xml | – notice: Copyright © Cambridge University Press 2014 |
| DBID | AAYXX CITATION 3V. 7SC 7SP 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO F28 FR3 GNUQQ HCIFZ JQ2 K7- L6V L7M L~C L~D M0N M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1017/S0263574714002458 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central Korea ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection ANTE: Abstracts in New Technology & Engineering Advanced Technologies & Aerospace Collection ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition Electronics & Communications Abstracts ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Computer Science Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| DocumentTitleAlternate | An efficient algorithm for real time |
| EISSN | 1469-8668 |
| EndPage | 1586 |
| ExternalDocumentID | 4072569511 10_1017_S0263574714002458 |
| GroupedDBID | -1D -1F -2P -2V -E. -~6 -~N -~X .DC .FH 09C 09E 0E1 0R~ 123 29P 3V. 4.4 5VS 6~7 74X 74Y 7~V 8FE 8FG 8R4 8R5 9M5 AAAZR AABES AABWE AACJH AAEED AAGFV AAKTX AAMNQ AANRG AARAB AASVR AAUIS AAUKB ABBXD ABBZL ABITZ ABJCF ABJNI ABKKG ABMWE ABMYL ABQTM ABQWD ABROB ABTCQ ABUWG ABVFV ABXAU ABZCX ACBMC ACCHT ACETC ACGFS ACIMK ACIWK ACMRT ACQFJ ACREK ACUIJ ACUYZ ACWGA ACYZP ACZBM ACZUX ACZWT ADCGK ADDNB ADFEC ADGEJ ADKIL ADOCW ADOVH ADOVT ADVJH AEBAK AEBPU AEHGV AEMTW AENCP AENEX AENGE AEYYC AFFNX AFFUJ AFKQG AFKRA AFKSM AFLOS AFLVW AFUTZ AGABE AGBYD AGJUD AGLWM AGOOT AHQXX AHRGI AIGNW AIHIV AIOIP AISIE AJ7 AJCYY AJPFC AJQAS AKZCZ ALMA_UNASSIGNED_HOLDINGS ALVPG ALWZO AQJOH ARABE ARAPS ARZZG ATUCA AUXHV AYIQA AZQEC BBLKV BCGOX BENPR BESQT BGHMG BGLVJ BJBOZ BLZWO BMAJL BPHCQ C0O CAG CBIIA CCPQU CCQAD CCUQV CDIZJ CFAFE CFBFF CGQII CHEAL CJCSC COF CS3 DC4 DOHLZ DU5 DWQXO EBS EGQIC EJD F5P GNUQQ HCIFZ HG- HST HZ~ I.6 I.7 I.9 IH6 IOEEP IOO IS6 I~P J36 J38 J3A JHPGK JQKCU K6V K7- KAFGG KC5 KCGVB KFECR L6V L98 LHUNA LW7 M-V M0N M7S M7~ M8. MVM NIKVX NMFBF NZEOI O9- OYBOY P2P P62 PQQKQ PROAC PTHSS PYCCK Q2X RAMDC RCA RNS ROL RR0 S6- S6U SAAAG T9M TN5 UT1 VOH WFFJZ WH7 WQ3 WXU WXY WYP ZDLDU ZJOSE ZMEZD ZYDXJ ~V1 AAKNA AAYXX ABGDZ ABVKB ABVZP ABXHF ACDLN ACEJA ADMLS AFZFC AKMAY ANOYL CITATION PHGZM PHGZT PQGLB PUEGO 7SC 7SP 7TB 7XB 8AL 8FD 8FK F28 FR3 JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c350t-7bd2cda9ed44e2d28c37328cf92a2273fce28bf1c3b0a4c24d4270eb1fd4f0fa3 |
| IEDL.DBID | BENPR |
| ISSN | 0263-5747 |
| IngestDate | Thu Oct 02 09:46:39 EDT 2025 Sat Aug 23 14:38:58 EDT 2025 Thu Apr 24 23:00:17 EDT 2025 Wed Oct 01 06:26:24 EDT 2025 Wed Mar 13 05:52:22 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Keywords | Path Planning Motion Planning Biomimetic Robots Surgical Robots Redundant Manipulators |
| Language | English |
| License | https://www.cambridge.org/core/terms |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c350t-7bd2cda9ed44e2d28c37328cf92a2273fce28bf1c3b0a4c24d4270eb1fd4f0fa3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| PQID | 1792507212 |
| PQPubID | 37292 |
| PageCount | 21 |
| ParticipantIDs | proquest_miscellaneous_1825467524 proquest_journals_1792507212 crossref_primary_10_1017_S0263574714002458 crossref_citationtrail_10_1017_S0263574714002458 cambridge_journals_10_1017_S0263574714002458 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20160700 2016-07-00 20160701 |
| PublicationDateYYYYMMDD | 2016-07-01 |
| PublicationDate_xml | – month: 07 year: 2016 text: 20160700 |
| PublicationDecade | 2010 |
| PublicationPlace | Cambridge, UK |
| PublicationPlace_xml | – name: Cambridge, UK – name: Cambridge |
| PublicationTitle | Robotica |
| PublicationTitleAlternate | Robotica |
| PublicationYear | 2016 |
| Publisher | Cambridge University Press |
| Publisher_xml | – name: Cambridge University Press |
| References | S0263574714002458_ref50 S0263574714002458_ref11 S0263574714002458_ref10 S0263574714002458_ref13 S0263574714002458_ref12 S0263574714002458_ref14 S0263574714002458_ref17 S0263574714002458_ref16 S0263574714002458_ref18 S0263574714002458_ref40 S0263574714002458_ref42 S0263574714002458_ref7 S0263574714002458_ref41 S0263574714002458_ref8 S0263574714002458_ref44 S0263574714002458_ref9 S0263574714002458_ref43 S0263574714002458_ref3 S0263574714002458_ref4 S0263574714002458_ref45 S0263574714002458_ref48 S0263574714002458_ref5 S0263574714002458_ref47 S0263574714002458_ref49 Furusho (S0263574714002458_ref6) 2006; 1 S0263574714002458_ref1 S0263574714002458_ref2 S0263574714002458_ref31 S0263574714002458_ref30 S0263574714002458_ref33 S0263574714002458_ref32 S0263574714002458_ref35 S0263574714002458_ref34 S0263574714002458_ref37 S0263574714002458_ref36 S0263574714002458_ref39 S0263574714002458_ref38 Gilbert (S0263574714002458_ref15) 1988; 4 Lewis (S0263574714002458_ref46) 1981 S0263574714002458_ref20 S0263574714002458_ref22 S0263574714002458_ref21 O'Rourke (S0263574714002458_ref19) 1991 S0263574714002458_ref24 S0263574714002458_ref23 S0263574714002458_ref26 S0263574714002458_ref25 S0263574714002458_ref28 S0263574714002458_ref27 S0263574714002458_ref29 |
| References_xml | – ident: S0263574714002458_ref10 doi: 10.1007/978-1-4615-4022-9 – ident: S0263574714002458_ref48 doi: 10.1109/ICRA.2014.6907160 – ident: S0263574714002458_ref34 doi: 10.1109/ROBOT.2002.1013462 – ident: S0263574714002458_ref35 doi: 10.1109/IEMBS.2005.1615801 – ident: S0263574714002458_ref38 doi: 10.1109/TRO.2005.861458 – ident: S0263574714002458_ref12 doi: 10.1145/237170.237244 – ident: S0263574714002458_ref29 doi: 10.1111/1467-8659.1330155 – ident: S0263574714002458_ref21 doi: 10.1109/TRO.2004.838012 – ident: S0263574714002458_ref17 doi: 10.1111/1467-8659.1420105 – volume: 1 start-page: 223 year: 2006 ident: S0263574714002458_ref6 article-title: Curved multi-tube systems for fetal blood sampling and treatments of organs like brain and breast publication-title: J. Comput. Assist. Radiol. Surg. – ident: S0263574714002458_ref3 doi: 10.1017/S0263574799001009 – ident: S0263574714002458_ref44 – ident: S0263574714002458_ref49 doi: 10.1109/TRO.2008.2003277 – ident: S0263574714002458_ref25 doi: 10.1109/IROS.2009.5353962 – ident: S0263574714002458_ref39 doi: 10.1145/192161.192241 – ident: S0263574714002458_ref22 doi: 10.1109/70.56661 – ident: S0263574714002458_ref9 doi: 10.1109/TRO.2010.2062570 – ident: S0263574714002458_ref40 – volume-title: Computational Geometry in C year: 1991 ident: S0263574714002458_ref19 – ident: S0263574714002458_ref1 doi: 10.1109/ROBOT.1999.774029 – ident: S0263574714002458_ref27 doi: 10.1109/RT.2006.280213 – ident: S0263574714002458_ref2 – ident: S0263574714002458_ref50 doi: 10.1002/9781118136607 – ident: S0263574714002458_ref45 doi: 10.1080/10867651.1999.10487502 – ident: S0263574714002458_ref36 – ident: S0263574714002458_ref14 doi: 10.1016/S0097-8493(00)00130-8 – ident: S0263574714002458_ref43 – ident: S0263574714002458_ref20 doi: 10.1109/70.105397 – ident: S0263574714002458_ref28 doi: 10.1145/1128923.1128955 – ident: S0263574714002458_ref18 doi: 10.1137/0213031 – ident: S0263574714002458_ref5 doi: 10.1109/TRO.2008.2006868 – ident: S0263574714002458_ref7 doi: 10.1109/TRO.2011.2105410 – ident: S0263574714002458_ref32 – ident: S0263574714002458_ref16 – ident: S0263574714002458_ref31 doi: 10.1111/j.1467-8659.2004.00788.x – ident: S0263574714002458_ref13 – ident: S0263574714002458_ref4 doi: 10.1155/2008/520417 – ident: S0263574714002458_ref47 doi: 10.1109/IROS.2013.6697012 – ident: S0263574714002458_ref30 doi: 10.1145/1364901.1364908 – ident: S0263574714002458_ref23 – volume: 4 start-page: 193 year: 1988 ident: S0263574714002458_ref15 article-title: A fast procedure for computing the distance between complex objects in three-dimensional space publication-title: Robot. Autom. – ident: S0263574714002458_ref42 – ident: S0263574714002458_ref24 doi: 10.1109/IROS.1997.656591 – ident: S0263574714002458_ref8 – volume-title: Elements of the Theory of Computation year: 1981 ident: S0263574714002458_ref46 – ident: S0263574714002458_ref37 doi: 10.1109/ICRA.2012.6225025 – ident: S0263574714002458_ref26 doi: 10.1016/j.cag.2006.02.011 – ident: S0263574714002458_ref33 doi: 10.1007/s00371-003-0226-y – ident: S0263574714002458_ref41 – ident: S0263574714002458_ref11 doi: 10.1080/10867651.1997.10487480 |
| SSID | ssj0013147 |
| Score | 2.1395664 |
| Snippet | A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave shapes.... SUMMARY A continuum manipulator, such as a multisection trunk/tentacle robot, performs manipulation tasks by continuously deforming into different concave... |
| SourceID | proquest crossref cambridge |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1566 |
| SubjectTerms | Algorithms Approximation Continuums Finite element method Manipulators Polyhedrons Robot arms Robots |
| Title | An efficient algorithm for real time collision detection involving a continuum manipulator with multiple uniform-curvature sections |
| URI | https://www.cambridge.org/core/product/identifier/S0263574714002458/type/journal_article https://www.proquest.com/docview/1792507212 https://www.proquest.com/docview/1825467524 |
| Volume | 34 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1469-8668 dateEnd: 20241105 omitProxy: false ssIdentifier: ssj0013147 issn: 0263-5747 databaseCode: ADMLS dateStart: 19830101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1469-8668 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0013147 issn: 0263-5747 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1469-8668 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0013147 issn: 0263-5747 databaseCode: 8FG dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3fT9swED5B-zIeJhibKLDKSHtCWEsdp0ke0NQBBU2jQmxIvFWO7UCl1mU0-Qv4x3fnJKUIqc-xrSRn3w_f3fcBfEv7NhEKI1UbZAmX0vY42pmc56FOVaqyuO_bx65H_as7-es-ut-AUdMLQ2WVjU70itrMNd2Rf8eNg9Ya4xXx4-kfJ9Yoyq42FBqqplYwpx5ibBPagpCxWtD-eTG6uX3NK_Q85RgGHiGP0JNu8pweRJpwWShGkz4fmayiLby1Wm-VtrdEw234WLuQbFDJfAc2rPsEWyvAgrvwMnDMenAItClMTR_wS4rHGUMPlaGXOGVEKc9oD_jWcmZs4UuyHJs41Fd0ycAUozL2iSvLGSOQDE_0hfPp5pY1dYisdNTaNeO6pMvd8tmyRbXS4jPcDS_-nl3xmm6B6zAKCh5nRmijUmtQZMKIRIeE5KPzVCiBXk6urUiyvKfDLFBSC2mkiAPU9bmReZCr8Au03NzZPWCWmtNjFUdGBLiWyLTWtqcjheGRyiLRgZPlrx3Xh2YxrgrO4vE7SXQgaP7-WNfQ5cSgMV035Xg55anC7Vg3-LAR6crbLDdcB46Wj_HwUUZFOTsvcYynE4gjIffXL3EAH9DT6ld1vofQKp5L-xW9mSLrwmYyvOxCe3B-_ftPt96w_wHRwPS3 |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwEB5ROLQcEH2J5dG6UnupajXrOJvkgBAU0FJgVVUgcUsd2wGkXS-wiVDP_V_9bZ1xkmVRpb1xTjyy7LFnxjPzfQAf055NhMJI1QZ5wqW0XY52puBFqFOVqjzu-fax00Gvfy6_X0QXC_C37YWhssr2TvQXtRlreiP_ioqD1hrjFbFzc8uJNYqyqy2FhmqoFcy2hxhrGjuO7e97DOEm20f7uN-fhDg8OPvW5w3LANdhFJQ8zo3QRqXW4EyFEYkOCcBGF6lQAo17oa1I8qKrwzxQUgtppIgDvOIKI4ugUCHKfQZLMpQpBn9LeweDHz8f8hhdT3GGgU7II_Tc27yqB60mHBiKCaXPfyaz6A6PreRjI-Et3-EqrDQuK9utdewlLFj3CpZngAxfw59dx6wHo0AbxtTwEleuvBox9IgZeqVDRhT2jHTOt7IzY0tfAubYtcP7kR41mGJUNn_tqmrECJTDE4vheHopZm3dI6sctZKNuK7oMbm6s2xSS5q8gfMnWfi3sOjGzq4Bs9QMH6s4MiJAWSLXWtuujhSGYyqPRAe-TJc2aw7pJKsL3OLsv53oQNCufqYbqHRi7BjOG_J5OuSmxgmZ9_Nmu6Uzs5kqeAc-TD_jYacMjnJ2XOE_nr4gjoRcny_iPTzvn52eZCdHg-MNeIFeXq-uMd6ExfKuslvoSZX5u0ZdGfx66hPyD68OMRQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+efficient+algorithm+for+real+time+collision+detection+involving+a+continuum+manipulator+with+multiple+uniform-curvature+sections&rft.jtitle=Robotica&rft.au=Li%2C+Jinglin&rft.au=Xiao%2C+Jing&rft.date=2016-07-01&rft.pub=Cambridge+University+Press&rft.issn=0263-5747&rft.eissn=1469-8668&rft.volume=34&rft.issue=7&rft.spage=1566&rft.epage=1586&rft_id=info:doi/10.1017%2FS0263574714002458&rft.externalDocID=10_1017_S0263574714002458 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0263-5747&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0263-5747&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0263-5747&client=summon |