{"id":"https://openalex.org/W2408675864","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-117","title":"The increasing cost tree search for optimal multi-agent pathfinding","display_name":"The increasing cost tree search for optimal multi-agent pathfinding","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W2408675864","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-117","mag":"2408675864"},"language":"en","primary_location":{"id":"mag:2408675864","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/ijcai/ijcai2011.html#SharonSGF11","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"type":"article","indexed_in":[],"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/A5088017068","display_name":"Guni Sharon","orcid":"https://orcid.org/0000-0001-9306-369X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guni Sharon","raw_affiliation_strings":["Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085970582","display_name":"Roni Stern","orcid":"https://orcid.org/0000-0003-0043-8179"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roni Stern","raw_affiliation_strings":["Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-0043-8179","affiliations":[{"raw_affiliation_string":"Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040207485","display_name":"Meir Goldenberg","orcid":"https://orcid.org/0009-0006-2792-5603"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Meir Goldenberg","raw_affiliation_strings":["Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#"],"raw_orcid":"https://orcid.org/0009-0006-2792-5603","affiliations":[{"raw_affiliation_string":"Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-0065-2757","affiliations":[{"raw_affiliation_string":"Information Systems Engineering Departement, Deutsche Telekom Laboratories, Ben-Gurion University, Be'er-Sheva, Israel#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0896,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.93368762,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"662","last_page":"667"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9661999940872192,"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/pathfinding","display_name":"Pathfinding","score":0.8917702436447144},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7224413156509399},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.698521077632904},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6716251373291016},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5688401460647583},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5521293878555298},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5432624816894531},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.47364532947540283},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.46128883957862854},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.43768948316574097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3365578055381775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30792760848999023},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.24810466170310974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20109951496124268},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09654742479324341}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8917702436447144},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7224413156509399},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.698521077632904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6716251373291016},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5688401460647583},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5521293878555298},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5432624816894531},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.47364532947540283},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.46128883957862854},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.43768948316574097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3365578055381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30792760848999023},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.24810466170310974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20109951496124268},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09654742479324341},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2408675864","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/ijcai/ijcai2011.html#SharonSGF11","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W117902095","https://openalex.org/W1551562380","https://openalex.org/W2109802566","https://openalex.org/W2135939055","https://openalex.org/W2137108108","https://openalex.org/W2137514195","https://openalex.org/W2137651302","https://openalex.org/W2149951504","https://openalex.org/W2914296650"],"related_works":["https://openalex.org/W1551562380","https://openalex.org/W2914296650","https://openalex.org/W1659382545","https://openalex.org/W2399153727","https://openalex.org/W2137651302","https://openalex.org/W93645818","https://openalex.org/W2149951504","https://openalex.org/W2137514195","https://openalex.org/W2135125135","https://openalex.org/W2135939055","https://openalex.org/W2100695938","https://openalex.org/W117902095","https://openalex.org/W2293119400","https://openalex.org/W1973396716","https://openalex.org/W3359552","https://openalex.org/W1969483458","https://openalex.org/W2159047109","https://openalex.org/W92902385","https://openalex.org/W1986164452","https://openalex.org/W1777366632"],"abstract_inverted_index":{"We":[0,35,63],"address":[1],"the":[2,32,49,72,83],"problem":[3,42],"of":[4,31,87,92,97,104],"optimal":[5,61],"path":[6],"finding":[7],"for":[8,40],"multiple":[9],"agents":[10,12],"where":[11],"must":[13],"not":[14],"collide":[15],"and":[16,54,68,85],"their":[17],"total":[18],"travel":[19],"cost":[20,51],"should":[21],"be":[22],"minimized.":[23],"Previous":[24],"work":[25],"used":[26],"traditional":[27],"single-agent":[28],"search":[29,46,57],"variants":[30],"A*":[33],"algorithm.":[34],"present":[36],"a":[37,45,55,102],"novel":[38],"formalization":[39,67],"this":[41,65,88],"which":[43],"includes":[44],"tree":[47,52],"called":[48],"increasing":[50],"(ICT)":[53],"corresponding":[56],"algorithm":[58],"that":[59],"finds":[60],"solutions.":[62],"analyze":[64],"new":[66],"compare":[69],"it":[70],"to":[71,94],"previous":[73],"state-of-the-art":[74],"A*-based":[75],"approach.":[76,89],"Experimental":[77],"results":[78],"on":[79],"various":[80],"domains":[81],"show":[82],"benefits":[84],"drawbacks":[86],"A":[90],"speedup":[91],"up":[93],"3":[95],"orders":[96],"magnitude":[98],"was":[99],"obtained":[100],"in":[101],"number":[103],"cases.":[105]},"counts_by_year":[{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}