{"id":"https://openalex.org/W2963309123","doi":"https://doi.org/10.1007/978-3-642-36279-8_10","title":"Multi-agent Path Planning and Network Flow","display_name":"Multi-agent Path Planning and Network Flow","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2963309123","doi":"https://doi.org/10.1007/978-3-642-36279-8_10","mag":"2963309123"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-36279-8_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36279-8_10","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/A5076210154","display_name":"Jingjin Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jingjin Yu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065104734","display_name":"Steven M. LaValle","orcid":"https://orcid.org/0000-0003-4841-2584"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven M. LaValle","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076210154"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":21.5916,"has_fulltext":false,"cited_by_count":155,"citation_normalized_percentile":{"value":0.99694444,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"157","last_page":"173"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955000281333923,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.989799976348877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6521568298339844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6091656684875488},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.582048237323761},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5362614393234253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5187342762947083},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5018134117126465},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48888200521469116},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4806065261363983},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4638526439666748},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4336811602115631},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4323154389858246},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4154003858566284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3749730587005615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31363940238952637},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13312175869941711}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6521568298339844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6091656684875488},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.582048237323761},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5362614393234253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5187342762947083},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5018134117126465},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48888200521469116},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4806065261363983},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4638526439666748},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4336811602115631},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4323154389858246},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4154003858566284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3749730587005615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31363940238952637},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13312175869941711},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-36279-8_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36279-8_10","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5600000023841858}],"awards":[],"funders":[{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W93645818","https://openalex.org/W101508493","https://openalex.org/W125001008","https://openalex.org/W131069610","https://openalex.org/W1424654272","https://openalex.org/W1516027685","https://openalex.org/W1521785144","https://openalex.org/W1530199463","https://openalex.org/W1588299616","https://openalex.org/W1753742327","https://openalex.org/W1777366632","https://openalex.org/W1964119857","https://openalex.org/W1965440866","https://openalex.org/W1991482882","https://openalex.org/W1997417333","https://openalex.org/W2002531683","https://openalex.org/W2004815408","https://openalex.org/W2007193228","https://openalex.org/W2045403423","https://openalex.org/W2050285203","https://openalex.org/W2075322358","https://openalex.org/W2076171427","https://openalex.org/W2086807633","https://openalex.org/W2091364465","https://openalex.org/W2097414563","https://openalex.org/W2105289524","https://openalex.org/W2105932936","https://openalex.org/W2117701425","https://openalex.org/W2119098384","https://openalex.org/W2119120935","https://openalex.org/W2120633474","https://openalex.org/W2123806189","https://openalex.org/W2128453677","https://openalex.org/W2128990851","https://openalex.org/W2138249013","https://openalex.org/W2139369541","https://openalex.org/W2149342630","https://openalex.org/W2149951504","https://openalex.org/W2150154671","https://openalex.org/W2152358681","https://openalex.org/W2152754876","https://openalex.org/W2153159477","https://openalex.org/W2153239294","https://openalex.org/W2155929731","https://openalex.org/W2157411165","https://openalex.org/W2158883244","https://openalex.org/W2163178194","https://openalex.org/W2166462345","https://openalex.org/W2169240708","https://openalex.org/W2170193147","https://openalex.org/W2611243847","https://openalex.org/W2753693129","https://openalex.org/W2987192631","https://openalex.org/W3044238769","https://openalex.org/W3145128584","https://openalex.org/W3217399827","https://openalex.org/W4229917934","https://openalex.org/W4242811155","https://openalex.org/W4244044799","https://openalex.org/W4244791920","https://openalex.org/W4300449797"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W775001140"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}