{"id":"https://openalex.org/W4413925256","doi":"https://doi.org/10.1109/icra55743.2025.11128289","title":"Polyhedral Collision Detection via Vertex Enumeration","display_name":"Polyhedral Collision Detection via Vertex Enumeration","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W4413925256","doi":"https://doi.org/10.1109/icra55743.2025.11128289"},"language":"en","primary_location":{"id":"doi:10.1109/icra55743.2025.11128289","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra55743.2025.11128289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111131368","display_name":"Andrew Cinar","orcid":null},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Cinar","raw_affiliation_strings":["Vanderbilt University,Department of Mechanical Engineering,Nashville,TN,USA,37235"],"affiliations":[{"raw_affiliation_string":"Vanderbilt University,Department of Mechanical Engineering,Nashville,TN,USA,37235","institution_ids":["https://openalex.org/I200719446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006162919","display_name":"Yue Zhao","orcid":"https://orcid.org/0000-0002-4896-2247"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yue Zhao","raw_affiliation_strings":["Vanderbilt University,Department of Computer Science,Nashville,TN,USA,37235"],"affiliations":[{"raw_affiliation_string":"Vanderbilt University,Department of Computer Science,Nashville,TN,USA,37235","institution_ids":["https://openalex.org/I200719446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061876552","display_name":"Forrest Laine","orcid":"https://orcid.org/0000-0003-3982-3920"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Forrest Laine","raw_affiliation_strings":["Vanderbilt University,Department of Computer Science,Nashville,TN,USA,37235"],"affiliations":[{"raw_affiliation_string":"Vanderbilt University,Department of Computer Science,Nashville,TN,USA,37235","institution_ids":["https://openalex.org/I200719446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111131368"],"corresponding_institution_ids":["https://openalex.org/I200719446"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28542621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"15408","last_page":"15414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9746000170707703,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.8476335406303406},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6213822960853577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6125052571296692},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.6007980704307556},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.5466658473014832},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34492361545562744},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2954140901565552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2743929624557495},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24167898297309875},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.1370716691017151}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8476335406303406},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6213822960853577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6125052571296692},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.6007980704307556},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.5466658473014832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34492361545562744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2954140901565552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2743929624557495},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24167898297309875},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.1370716691017151}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra55743.2025.11128289","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra55743.2025.11128289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W192919555","https://openalex.org/W1505930614","https://openalex.org/W2123871098","https://openalex.org/W2142224528","https://openalex.org/W2498849926","https://openalex.org/W2858289757","https://openalex.org/W3011435875","https://openalex.org/W3035045431","https://openalex.org/W3199113962","https://openalex.org/W4250589301","https://openalex.org/W4312253354","https://openalex.org/W4314946902","https://openalex.org/W4315471893","https://openalex.org/W4383108947","https://openalex.org/W4385430532","https://openalex.org/W4392008753"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W108845024","https://openalex.org/W3138645172","https://openalex.org/W2148917807","https://openalex.org/W3215492696","https://openalex.org/W2028510469","https://openalex.org/W913501818","https://openalex.org/W4379525781","https://openalex.org/W2021628292","https://openalex.org/W3111310291"],"abstract_inverted_index":{"Collision":[0],"detection":[1,36,151],"is":[2,84,160],"a":[3,18,31,54,64,89],"critical":[4],"functionality":[5],"for":[6,22,33],"robotics.":[7],"The":[8],"degree":[9],"to":[10,93,123],"which":[11],"objects":[12],"collide":[13],"cannot":[14],"be":[15],"represented":[16],"as":[17,49,113],"continuously":[19],"differentiable":[20],"function":[21],"any":[23],"shapes":[24],"other":[25,157],"than":[26,156,162],"spheres.":[27],"This":[28],"paper":[29],"proposes":[30],"framework":[32],"handling":[34],"collision":[35,150],"between":[37,45],"polyhedral":[38,47],"shapes.":[39],"We":[40,119,141],"frame":[41],"the":[42,50,60,78,81,85,94,100,116,135],"signed":[43,61,82],"distance":[44,62,83],"two":[46,95],"bodies":[48],"optimal":[51],"value":[52],"of":[53,88,107,128],"convex":[55,90],"optimization,":[56],"and":[57,110,130,159],"consider":[58],"constraining":[59],"in":[63,115,126,165],"bilevel":[65,73],"optimization":[66],"problem.":[67,118],"To":[68],"avoid":[69],"relying":[70],"on":[71],"specialized":[72],"solvers,":[74],"our":[75,121,144],"method":[76,98],"exploits":[77],"fact":[79],"that":[80,143],"minimal":[86],"point":[87],"region":[91,109],"related":[92],"bodies.":[96],"Our":[97],"enumerates":[99],"values":[101],"obtained":[102],"at":[103],"all":[104],"extreme":[105],"points":[106],"this":[108],"lists":[111],"them":[112],"constraints":[114],"higher-level":[117],"compare":[120],"formulation":[122],"existing":[124,163],"methods":[125,164],"terms":[127],"reliability":[129],"speed":[131],"when":[132],"solved":[133],"using":[134],"same":[136],"mixed":[137],"complementarity":[138],"problem":[139],"solver.":[140],"demonstrate":[142],"approach":[145],"more":[146],"reliably":[147],"solves":[148],"difficult":[149],"problems":[152],"with":[153],"multiple":[154],"obstacles":[155],"methods,":[158],"faster":[161],"some":[166],"cases.":[167]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}