{"id":"https://openalex.org/W2041486081","doi":"https://doi.org/10.1109/iros.2010.5649064","title":"Network-guided multi-robot path planning in discrete representations","display_name":"Network-guided multi-robot path planning in discrete representations","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2041486081","doi":"https://doi.org/10.1109/iros.2010.5649064","mag":"2041486081"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2010.5649064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2010.5649064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5113579058","display_name":"R Luna","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R Luna","raw_affiliation_strings":["Computer Science and Engineering Department, University of Nevada, Reno, NV, USA","Computer Science and Engineering Department at the University of Nevada, Reno, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University of Nevada, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"Computer Science and Engineering Department at the University of Nevada, Reno, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010667333","display_name":"Kostas E. Bekris","orcid":"https://orcid.org/0000-0002-0675-3324"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K E Bekris","raw_affiliation_strings":["Computer Science and Engineering Department, University of Nevada, Reno, NV, USA","Computer Science and Engineering Department at the University of Nevada, Reno, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, University of Nevada, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"Computer Science and Engineering Department at the University of Nevada, Reno, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4596","last_page":"4602"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9968000054359436,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/robot","display_name":"Robot","score":0.7546601295471191},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7313387989997864},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7305502891540527},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6527065634727478},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6493910551071167},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.58649742603302},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5702584385871887},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.523593544960022},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.48859769105911255},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.4643099308013916},{"id":"https://openalex.org/keywords/robot-kinematics","display_name":"Robot kinematics","score":0.4284174144268036},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4266932010650635},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4121336340904236},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.40952515602111816},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.37151578068733215},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35857564210891724},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.32732027769088745},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22626012563705444},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12164181470870972},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09353768825531006}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7546601295471191},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7313387989997864},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7305502891540527},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6527065634727478},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6493910551071167},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.58649742603302},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5702584385871887},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.523593544960022},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.48859769105911255},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4643099308013916},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.4284174144268036},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4266932010650635},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4121336340904236},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.40952515602111816},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37151578068733215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35857564210891724},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.32732027769088745},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22626012563705444},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12164181470870972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09353768825531006},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2010.5649064","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2010.5649064","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11665125210004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/Network-guided-multi-robot-path-planning-in-discrete/991031665793704646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W125001008","https://openalex.org/W178535771","https://openalex.org/W1483286533","https://openalex.org/W1549280300","https://openalex.org/W1550117520","https://openalex.org/W1594489547","https://openalex.org/W2056017162","https://openalex.org/W2070224057","https://openalex.org/W2110116921","https://openalex.org/W2110906765","https://openalex.org/W2126366668","https://openalex.org/W2130774864","https://openalex.org/W2133067819","https://openalex.org/W2133422082","https://openalex.org/W2134779831","https://openalex.org/W2136644454","https://openalex.org/W2137952598","https://openalex.org/W2146417222","https://openalex.org/W2158883244","https://openalex.org/W2166462345","https://openalex.org/W2166644802","https://openalex.org/W2169620233","https://openalex.org/W2223243935","https://openalex.org/W3139174429","https://openalex.org/W4244044799","https://openalex.org/W6632662516","https://openalex.org/W6632850809","https://openalex.org/W6635519480","https://openalex.org/W6676769901","https://openalex.org/W6679060112","https://openalex.org/W6680096503","https://openalex.org/W6685015332"],"related_works":["https://openalex.org/W1819938260","https://openalex.org/W2340892746","https://openalex.org/W3005999311","https://openalex.org/W3042530408","https://openalex.org/W4381746183","https://openalex.org/W2165574943","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W2161428574","https://openalex.org/W2077416514"],"abstract_inverted_index":{"This":[0,71,82],"work":[1],"deals":[2],"with":[3,43,111],"problems":[4],"where":[5],"multiple":[6],"robots":[7,27,35],"move":[8],"on":[9,105],"a":[10,18,77,87],"roadmap":[11],"guided":[12],"by":[13,100],"wireless":[14],"nodes":[15,22],"that":[16,51,90,107],"form":[17],"communication":[19,30],"network.":[20],"The":[21,45],"compute":[23,49],"paths":[24,50],"for":[25],"the":[26,55,62,68,98,101,124,132],"within":[28],"their":[29,38],"range":[31],"given":[32],"information":[33],"about":[34],"only":[36,42,94],"in":[37],"vicinity":[39],"and":[40,122,128],"communicating":[41],"neighbors.":[44],"objective":[46],"is":[47],"to":[48,66,86,119],"are":[52,117],"collision-free,":[53],"minimize":[54],"occurrence":[56],"of":[57,97,131],"deadlocks,":[58],"as":[59,61,76],"well":[60],"time":[63],"it":[64],"takes":[65],"reach":[67],"robots'":[69],"goals.":[70],"paper":[72],"formulates":[73],"this":[74],"challenge":[75],"distributed":[78],"constraint":[79],"optimization":[80],"problem.":[81],"formulation":[83],"lends":[84],"itself":[85],"message-passing":[88],"solution":[89],"guarantees":[91],"collision-avoidance":[92],"despite":[93],"local":[95],"knowledge":[96],"world":[99],"network":[102],"nodes.":[103],"Simulations":[104],"benchmarks":[106],"cannot":[108],"be":[109],"solved":[110],"coupled":[112],"or":[113],"simple":[114],"decoupled":[115],"schemes":[116],"used":[118],"evaluate":[120],"parameters":[121],"study":[123],"scalability,":[125],"path":[126],"quality":[127],"computational":[129],"overhead":[130],"approach.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}