{"id":"https://openalex.org/W2472522594","doi":"https://doi.org/10.1007/978-4-431-55879-8_24","title":"Decentralized Multi-agent Path Selection Using Minimal Information","display_name":"Decentralized Multi-agent Path Selection Using Minimal Information","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2472522594","doi":"https://doi.org/10.1007/978-4-431-55879-8_24","mag":"2472522594"},"language":"en","primary_location":{"id":"doi:10.1007/978-4-431-55879-8_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-4-431-55879-8_24","pdf_url":null,"source":{"id":"https://openalex.org/S4210185684","display_name":"Springer tracts in advanced robotics","issn_l":"1610-742X","issn":["1610-742X","1610-7438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Tracts in Advanced Robotics","raw_type":"book-chapter"},"type":"book-chapter","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/A5041631345","display_name":"Andrew Kimmel","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Kimmel","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"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/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas Bekris","raw_affiliation_strings":["Rutgers University, Piscataway, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.3363,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71808765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9908999800682068,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9811000227928162,"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/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.7396632432937622},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.6278843879699707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6033874154090881},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6023021340370178},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5635287761688232},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5598881840705872},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5152628421783447},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.4713774621486664},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4425967335700989},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34740567207336426},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.29693806171417236},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29488635063171387},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.25783571600914},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22891181707382202},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16928863525390625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16732612252235413},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08574211597442627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06652259826660156}],"concepts":[{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.7396632432937622},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.6278843879699707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6033874154090881},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6023021340370178},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5635287761688232},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5598881840705872},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5152628421783447},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.4713774621486664},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4425967335700989},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34740567207336426},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.29693806171417236},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29488635063171387},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.25783571600914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22891181707382202},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16928863525390625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16732612252235413},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08574211597442627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06652259826660156}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-4-431-55879-8_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-4-431-55879-8_24","pdf_url":null,"source":{"id":"https://openalex.org/S4210185684","display_name":"Springer tracts in advanced robotics","issn_l":"1610-742X","issn":["1610-742X","1610-7438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Tracts in Advanced Robotics","raw_type":"book-chapter"},{"id":"pmh:oai:alma.01RUT_INST:11665007580004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/bookChapter/Decentralized-Multi-agent-Path-Selection-Using-Minimal/991031665867304646","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":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W87278644","https://openalex.org/W196216913","https://openalex.org/W1515762908","https://openalex.org/W1531355326","https://openalex.org/W1777783943","https://openalex.org/W1900710004","https://openalex.org/W1929719476","https://openalex.org/W1963649406","https://openalex.org/W1971086298","https://openalex.org/W1982696738","https://openalex.org/W1992787855","https://openalex.org/W1998716564","https://openalex.org/W2000790002","https://openalex.org/W2002440441","https://openalex.org/W2004094485","https://openalex.org/W2046213647","https://openalex.org/W2053246317","https://openalex.org/W2093825590","https://openalex.org/W2097045101","https://openalex.org/W2097639646","https://openalex.org/W2101821104","https://openalex.org/W2105891745","https://openalex.org/W2111438581","https://openalex.org/W2142943472","https://openalex.org/W2149484953","https://openalex.org/W2158400962","https://openalex.org/W2170345640","https://openalex.org/W2171940562","https://openalex.org/W2199385070","https://openalex.org/W2214385781","https://openalex.org/W2216069195","https://openalex.org/W2294997557","https://openalex.org/W2295237948","https://openalex.org/W2295417718","https://openalex.org/W2508573783","https://openalex.org/W3040586665","https://openalex.org/W4312769317"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W2001478969","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2166954426","https://openalex.org/W2117224408","https://openalex.org/W3137070212","https://openalex.org/W2379911191"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}