{"id":"https://openalex.org/W2024820244","doi":"https://doi.org/10.1109/iros.2012.6386147","title":"Finding graph topologies for feasible multirobot motion planning","display_name":"Finding graph topologies for feasible multirobot motion planning","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2024820244","doi":"https://doi.org/10.1109/iros.2012.6386147","mag":"2024820244"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2012.6386147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6386147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5010208377","display_name":"Pushkar Kolhe","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pushkar Kolhe","raw_affiliation_strings":["Center for Robotics and Intelligent Machines, School of Interactive Computing at the Georgia Institute of Technology, Atlanta, GA, USA","Center for Robotics and Intelligent Machines & School of Interactive Computing at the Georgia Institute of Technology, Atlanta, 30332, USA"],"affiliations":[{"raw_affiliation_string":"Center for Robotics and Intelligent Machines, School of Interactive Computing at the Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Center for Robotics and Intelligent Machines & School of Interactive Computing at the Georgia Institute of Technology, Atlanta, 30332, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066237365","display_name":"Henrik I. Christensen","orcid":"https://orcid.org/0000-0002-7465-7502"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Henrik I. Christensen","raw_affiliation_strings":["Center for Robotics and Intelligent Machines, School of Interactive Computing at the Georgia Institute of Technology, Atlanta, GA, USA","Center for Robotics and Intelligent Machines & School of Interactive Computing at the Georgia Institute of Technology, Atlanta, 30332, USA"],"affiliations":[{"raw_affiliation_string":"Center for Robotics and Intelligent Machines, School of Interactive Computing at the Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Center for Robotics and Intelligent Machines & School of Interactive Computing at the Georgia Institute of Technology, Atlanta, 30332, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010208377"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09979935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"3754","last_page":"3759"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9983000159263611,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7947327494621277},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6063741445541382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5887166261672974},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5794633626937866},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5589392781257629},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5539560914039612},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5097326636314392},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5087621808052063},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.42752790451049805},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42369717359542847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31302815675735474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2642144560813904},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23608046770095825},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10093027353286743},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0725986659526825}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7947327494621277},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6063741445541382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5887166261672974},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5794633626937866},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5589392781257629},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5539560914039612},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5097326636314392},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5087621808052063},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.42752790451049805},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42369717359542847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31302815675735474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2642144560813904},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23608046770095825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10093027353286743},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0725986659526825}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2012.6386147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6386147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W92902385","https://openalex.org/W101508493","https://openalex.org/W119150805","https://openalex.org/W125001008","https://openalex.org/W1424654272","https://openalex.org/W1521785144","https://openalex.org/W1762430620","https://openalex.org/W1777366632","https://openalex.org/W1930659875","https://openalex.org/W1965454152","https://openalex.org/W1980056593","https://openalex.org/W1986164452","https://openalex.org/W2034604437","https://openalex.org/W2083721544","https://openalex.org/W2095757353","https://openalex.org/W2103838069","https://openalex.org/W2124295613","https://openalex.org/W2128990851","https://openalex.org/W2129799459","https://openalex.org/W2135939055","https://openalex.org/W2149951504","https://openalex.org/W2158883244","https://openalex.org/W2160386431","https://openalex.org/W2404844938","https://openalex.org/W2519453022","https://openalex.org/W2611243847","https://openalex.org/W4235314371","https://openalex.org/W6603757628","https://openalex.org/W6604858078","https://openalex.org/W6637859625","https://openalex.org/W6679300373"],"related_works":["https://openalex.org/W3211557223","https://openalex.org/W2007036916","https://openalex.org/W2120266540","https://openalex.org/W3015807911","https://openalex.org/W872563264","https://openalex.org/W2164087676","https://openalex.org/W4240867999","https://openalex.org/W2416728927","https://openalex.org/W4206528302","https://openalex.org/W2118356379"],"abstract_inverted_index":{"In":[0,30],"this":[1],"paper":[2],"we":[3,42],"present":[4],"a":[5,17,22,66],"design":[6],"methodology":[7],"for":[8],"mapping":[9],"the":[10,31,49],"configuration":[11],"space":[12],"of":[13],"multirobot":[14,35],"systems":[15],"in":[16,48],"warehouse.":[18],"The":[19],"method":[20,57],"generates":[21],"tree":[23,51],"topology":[24,52],"with":[25],"robot":[26],"and":[27],"terminal":[28],"nodes.":[29],"most":[32],"general":[33],"case":[34],"motion":[36,46],"planning":[37],"problems":[38,47],"are":[39,53],"NP-complete.":[40],"But,":[41],"show":[43],"that":[44],"pebble":[45],"resultant":[50],"always":[54],"feasible.":[55],"Our":[56],"uses":[58],"an":[59],"integer":[60],"programming":[61],"formulation":[62],"to":[63],"find":[64],"such":[65],"solution.":[67]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}