{"id":"https://openalex.org/W1584596462","doi":"https://doi.org/10.1109/icra.2015.7138999","title":"Multi-robot grasp planning for sequential assembly operations","display_name":"Multi-robot grasp planning for sequential assembly operations","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1584596462","doi":"https://doi.org/10.1109/icra.2015.7138999","mag":"1584596462"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2015.7138999","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7138999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5025603635","display_name":"Mehmet R. Do\u011far","orcid":"https://orcid.org/0000-0002-6896-5461"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mehmet Dogar","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006466898","display_name":"Andrew Spielberg","orcid":"https://orcid.org/0000-0002-6937-6204"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Spielberg","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072126562","display_name":"Stuart Baker","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stuart Baker","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066830185","display_name":"Daniela Rus","orcid":"https://orcid.org/0000-0001-5473-3566"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniela Rus","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science & Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5025603635"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.9854,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97443098,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"193","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9980000257492065,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.8022062182426453},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6684331893920898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6489355564117432},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5689809322357178},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5669820308685303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.554195761680603},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5533198118209839},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5326822400093079},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5255687832832336},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.48808324337005615},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4138585925102234},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2347852885723114},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21475347876548767},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14682304859161377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13857755064964294}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.8022062182426453},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6684331893920898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6489355564117432},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5689809322357178},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5669820308685303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.554195761680603},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5533198118209839},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5326822400093079},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5255687832832336},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.48808324337005615},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4138585925102234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2347852885723114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21475347876548767},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14682304859161377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13857755064964294},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2015.7138999","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7138999","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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":17,"referenced_works":["https://openalex.org/W46565623","https://openalex.org/W1969196471","https://openalex.org/W1994442991","https://openalex.org/W2010274050","https://openalex.org/W2013467411","https://openalex.org/W2031738727","https://openalex.org/W2044995998","https://openalex.org/W2111516378","https://openalex.org/W2116341587","https://openalex.org/W2121766240","https://openalex.org/W2121810265","https://openalex.org/W2122410182","https://openalex.org/W2141664020","https://openalex.org/W2148933384","https://openalex.org/W2295576045","https://openalex.org/W4247031047","https://openalex.org/W6697185647"],"related_works":["https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2102858635","https://openalex.org/W2012694101","https://openalex.org/W2470231588"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,22,44,54,79,85,117,122,126,131,136,142,145,167,180],"problem":[4,31],"of":[5,16,46,81,114,138,147,182],"finding":[6],"robot":[7,48,176],"configurations":[8,26],"to":[9,104,124,155,160,185],"grasp":[10,186],"assembly":[11,18,71,192],"parts":[12,189],"during":[13],"a":[14,28,68,110,161,174],"sequence":[15],"collaborative":[17],"operations.":[19,72],"We":[20,50,73,151,171],"formulate":[21],"search":[23,102],"for":[24,67],"such":[25],"as":[27],"constraint":[29,56,169],"satisfaction":[30],"(CSP).":[32],"Collision":[33],"constraints":[34,40],"in":[35,191],"an":[36,75],"operation":[37],"and":[38,129,187],"transfer":[39],"between":[41],"operations":[42],"determine":[43],"sets":[45],"feasible":[47,82],"configurations.":[49,193],"show":[51],"that":[52,91],"solving":[53],"connected":[55,168],"graph":[57],"with":[58],"off-the-shelf":[59],"CSP":[60,86],"algorithms":[61],"can":[62,92],"quickly":[63],"become":[64],"infeasible":[65],"even":[66],"few":[69],"sequential":[70],"present":[74,152,173],"algorithm":[76,98,120,163],"which,":[77],"through":[78],"assumption":[80],"regrasps,":[83],"divides":[84],"into":[87],"independent":[88],"smaller":[89],"problems":[90],"be":[93],"solved":[94],"exponentially":[95],"faster.":[96],"The":[97,119],"then":[99],"uses":[100,179],"local":[101],"techniques":[103],"improve":[105],"this":[106],"solution":[107],"by":[108],"removing":[109,139],"gradually":[111],"increasing":[112],"number":[113],"regrasps":[115,140],"from":[116,141],"plan.":[118],"enables":[121],"user":[123],"stop":[125],"planner":[127,184],"anytime":[128],"use":[130],"current":[132],"best":[133],"plan":[134,143],"if":[135],"cost":[137,146],"exceeds":[144],"executing":[148],"those":[149],"regrasps.":[150],"simulation":[153],"experiments":[154],"compare":[156],"our":[157,183],"algorithm's":[158],"performance":[159],"naive":[162],"which":[164,178],"directly":[165],"solves":[166],"graph.":[170],"also":[172],"real":[175],"system":[177],"output":[181],"bring":[188],"together":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}