{"id":"https://openalex.org/W2571420106","doi":"https://doi.org/10.1109/lra.2017.2651381","title":"A Framework for Optimal Grasp Contact Planning","display_name":"A Framework for Optimal Grasp Contact Planning","publication_year":2017,"publication_date":"2017-01-10","ids":{"openalex":"https://openalex.org/W2571420106","doi":"https://doi.org/10.1109/lra.2017.2651381","mag":"2571420106"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2017.2651381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2651381","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-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/A5011451275","display_name":"Kaiyu Hang","orcid":"https://orcid.org/0000-0003-4132-1217"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Kaiyu Hang","raw_affiliation_strings":["Robotics, Perception, and Learning Lab, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Robotics, Perception, and Learning Lab, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023785357","display_name":"Johannes A. Stork","orcid":"https://orcid.org/0000-0003-3958-6179"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johannes A. Stork","raw_affiliation_strings":["Robotics, Perception, and Learning Lab, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Robotics, Perception, and Learning Lab, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011046225","display_name":"Nancy S. Pollard","orcid":"https://orcid.org/0000-0001-6464-839X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nancy S. Pollard","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023792180","display_name":"Danica Kragi\u0107","orcid":"https://orcid.org/0000-0003-2965-2953"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Danica Kragic","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011451275"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":3.822,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.93387772,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":"2","first_page":"704","last_page":"711"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9804999828338623,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.8784196972846985},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6698713898658752},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6567364931106567},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6553088426589966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5097960829734802},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5078573822975159},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4900597333908081},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4733079671859741},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4684866666793823},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.45454972982406616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.431893527507782},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4128357172012329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39407411217689514},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3388400673866272},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3037945628166199},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.27552151679992676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2697451114654541},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.24022603034973145},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1777552366256714}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.8784196972846985},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6698713898658752},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6567364931106567},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6553088426589966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5097960829734802},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5078573822975159},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4900597333908081},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4733079671859741},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4684866666793823},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.45454972982406616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.431893527507782},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4128357172012329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39407411217689514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3388400673866272},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3037945628166199},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.27552151679992676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2697451114654541},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.24022603034973145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1777552366256714},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2017.2651381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2651381","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7037791941","display_name":null,"funder_award_id":"IIS-1637853","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1510186039","https://openalex.org/W1597861020","https://openalex.org/W1646038686","https://openalex.org/W1776592063","https://openalex.org/W1794703952","https://openalex.org/W1820657498","https://openalex.org/W1925324831","https://openalex.org/W1969483458","https://openalex.org/W1977556410","https://openalex.org/W2005314985","https://openalex.org/W2005824379","https://openalex.org/W2016820997","https://openalex.org/W2020335597","https://openalex.org/W2021672660","https://openalex.org/W2035601288","https://openalex.org/W2036637075","https://openalex.org/W2047085460","https://openalex.org/W2080279876","https://openalex.org/W2084224084","https://openalex.org/W2088317162","https://openalex.org/W2106215490","https://openalex.org/W2106628124","https://openalex.org/W2109163007","https://openalex.org/W2125483852","https://openalex.org/W2134634502","https://openalex.org/W2140173255","https://openalex.org/W2143043303","https://openalex.org/W2153096930","https://openalex.org/W2153504150","https://openalex.org/W2156886697","https://openalex.org/W2157439141","https://openalex.org/W2395412339","https://openalex.org/W2415202143","https://openalex.org/W3021035068","https://openalex.org/W3112422759","https://openalex.org/W6638275700","https://openalex.org/W6683073854","https://openalex.org/W6712424792"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2064794194","https://openalex.org/W2358427436","https://openalex.org/W2402589461","https://openalex.org/W1589124115","https://openalex.org/W1622225657","https://openalex.org/W4200104947","https://openalex.org/W2376959332","https://openalex.org/W2808808802","https://openalex.org/W1994919150"],"abstract_inverted_index":{"We":[0,93,116,164],"consider":[1],"the":[2,34,106,153],"problem":[3,32],"of":[4,36,91,172],"finding":[5,31],"grasp":[6,14,42,158],"contacts":[7],"that":[8],"are":[9,54],"optimal":[10,76],"under":[11,69],"a":[12,23,29,51],"given":[13],"quality":[15],"function":[16],"on":[17,144],"arbitrary":[18],"objects.":[19,146],"Our":[20,78],"approach":[21],"formulates":[22],"framework":[24],"for":[25,113,123,160],"contact-level":[26],"grasping":[27,122],"as":[28],"path":[30,52],"in":[33,47,170],"space":[35,64],"supercontact":[37,41],"grasps.":[38,77,115],"The":[39],"initial":[40],"contains":[43],"all":[44],"grasps":[45,53],"and":[46,60,66,84,98,130,133,140,174,178],"each":[48],"step":[49],"along":[50],"removed.":[55],"For":[56],"this,":[57],"we":[58,125,148],"introduce":[59],"formally":[61],"characterize":[62],"search":[63,83,102,143,154,176],"structure":[65],"cost":[67,72,87,108,142],"functions":[68,97],"which":[70,124],"minimal":[71],"paths":[73],"correspond":[74],"to":[75,103,151,156],"formulation":[79,119],"avoids":[80],"expensive":[81],"exhaustive":[82,139],"reduces":[85],"computational":[86,107],"by":[88,136],"several":[89],"orders":[90],"magnitude.":[92],"present":[94],"admissible":[95],"heuristic":[96,101],"exploit":[99],"approximate":[100],"further":[104],"reduce":[105],"while":[109],"maintaining":[110],"bounded":[111,134],"suboptimality":[112,135],"resulting":[114],"exemplify":[117],"our":[118,167],"with":[120],"point-contact":[121],"define":[126],"domain":[127],"specific":[128],"heuristics":[129],"demonstrate":[131],"optimality":[132],"comparing":[137],"against":[138],"uniform":[141],"example":[145],"Furthermore,":[147],"explain":[149],"how":[150],"restrict":[152],"graph":[155],"satisfy":[157],"constraints":[159],"modeling":[161],"hand":[162],"kinematics.":[163],"also":[165],"analyze":[166],"algorithm":[168],"empirically":[169],"terms":[171],"created":[173],"visited":[175],"states":[177],"resultant":[179],"effective":[180],"branching":[181],"factor.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}