{"id":"https://openalex.org/W2808589448","doi":"https://doi.org/10.24963/ijcai.2018/74","title":"Extended Increasing Cost Tree Search for Non-Unit Cost Domains","display_name":"Extended Increasing Cost Tree Search for Non-Unit Cost Domains","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2808589448","doi":"https://doi.org/10.24963/ijcai.2018/74","mag":"2808589448"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2018/74","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2018/74","pdf_url":"https://www.ijcai.org/proceedings/2018/0074.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2018/0074.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035272943","display_name":"Thayne T. Walker","orcid":null},"institutions":[{"id":"https://openalex.org/I131651094","display_name":"University of Denver","ror":"https://ror.org/04w7skc03","country_code":"US","type":"education","lineage":["https://openalex.org/I131651094"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thayne T. Walker","raw_affiliation_strings":["University of Denver, Denver CO, USA","University of Denver, Denver, CO, USA"],"affiliations":[{"raw_affiliation_string":"University of Denver, Denver CO, USA","institution_ids":["https://openalex.org/I131651094"]},{"raw_affiliation_string":"University of Denver, Denver, CO, USA","institution_ids":["https://openalex.org/I131651094"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041415709","display_name":"Nathan Sturtevant","orcid":"https://orcid.org/0000-0003-4318-2791"},"institutions":[{"id":"https://openalex.org/I131651094","display_name":"University of Denver","ror":"https://ror.org/04w7skc03","country_code":"US","type":"education","lineage":["https://openalex.org/I131651094"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan R. Sturtevant","raw_affiliation_strings":["University of Denver, Denver CO, USA","University of Denver, Denver, CO, USA"],"affiliations":[{"raw_affiliation_string":"University of Denver, Denver CO, USA","institution_ids":["https://openalex.org/I131651094"]},{"raw_affiliation_string":"University of Denver, Denver, CO, USA","institution_ids":["https://openalex.org/I131651094"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011195666","display_name":"Ariel Felner","orcid":"https://orcid.org/0000-0003-0065-2757"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Felner","raw_affiliation_strings":["Ben-Gurion University, Be`er-Sheva, Israel","Ben-Gurion University, Be'er-Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University, Be`er-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Ben-Gurion University, Be'er-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035272943"],"corresponding_institution_ids":["https://openalex.org/I131651094"],"apc_list":null,"apc_paid":null,"fwci":2.6562,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.92896439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"534","last_page":"540"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9926000237464905,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9871000051498413,"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/discretization","display_name":"Discretization","score":0.7131320238113403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6696199178695679},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.6239646077156067},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.6092247366905212},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6059176921844482},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5710047483444214},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5543708205223083},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.5283808708190918},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5275149941444397},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49528899788856506},{"id":"https://openalex.org/keywords/unit-cost","display_name":"Unit cost","score":0.450467973947525},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3989565372467041},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33468714356422424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2748728394508362},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22659441828727722},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09541478753089905}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7131320238113403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6696199178695679},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.6239646077156067},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.6092247366905212},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6059176921844482},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5710047483444214},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5543708205223083},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.5283808708190918},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5275149941444397},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49528899788856506},{"id":"https://openalex.org/C87864170","wikidata":"https://www.wikidata.org/wiki/Q16897780","display_name":"Unit cost","level":2,"score":0.450467973947525},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3989565372467041},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33468714356422424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2748728394508362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22659441828727722},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09541478753089905},{"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/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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":"doi:10.24963/ijcai.2018/74","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2018/74","pdf_url":"https://www.ijcai.org/proceedings/2018/0074.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2018/74","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2018/74","pdf_url":"https://www.ijcai.org/proceedings/2018/0074.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808589448.pdf","grobid_xml":"https://content.openalex.org/works/W2808589448.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W92902385","https://openalex.org/W571872900","https://openalex.org/W964554611","https://openalex.org/W1497695555","https://openalex.org/W1551562380","https://openalex.org/W1942218548","https://openalex.org/W1969483458","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2005102720","https://openalex.org/W2100695938","https://openalex.org/W2124015815","https://openalex.org/W2136014417","https://openalex.org/W2137108108","https://openalex.org/W2155992093","https://openalex.org/W2191404279","https://openalex.org/W2238914755","https://openalex.org/W2404271123","https://openalex.org/W2575733488","https://openalex.org/W2604884537","https://openalex.org/W2605824764","https://openalex.org/W2730530972","https://openalex.org/W2760187218","https://openalex.org/W2914296650"],"related_works":["https://openalex.org/W2473542051","https://openalex.org/W2370269451","https://openalex.org/W4229950834","https://openalex.org/W3107197685","https://openalex.org/W2908418870","https://openalex.org/W48124421","https://openalex.org/W272774291","https://openalex.org/W2604902477","https://openalex.org/W3202117991","https://openalex.org/W1972574144"],"abstract_inverted_index":{"Multi-agent":[0],"pathfinding":[1],"(MAPF)":[2],"has":[3,19],"applications":[4],"in":[5,120,127,135],"navigation,":[6],"robotics,":[7],"games":[8],"and":[9,28,67,108],"planning.":[10],"Most":[11],"work":[12],"on":[13,21],"search-based":[14],"optimal":[15,133],"algorithms":[16,40],"for":[17,64,80,97],"MAPF":[18,62],"focused":[20],"simple":[22],"domains":[23,47,71,121,136],"with":[24,73,100,122,137],"unit":[25,29],"cost":[26,66,92],"actions":[27],"time":[30,69,130],"steps.":[31],"Although":[32],"these":[33,81],"constraints":[34],"keep":[35],"many":[36],"aspects":[37],"of":[38,60,89,105],"the":[39,46,61,90],"simple,":[41],"they":[42],"also":[43],"severely":[44],"limit":[45],"that":[48,113],"can":[49],"be":[50],"used.":[51],"In":[52],"this":[53],"paper":[54],"we":[55,84],"introduce":[56],"a":[57],"new":[58,74,102],"definition":[59],"problem":[63],"non-unit":[65,68,98],"step":[70],"along":[72],"multiagent":[75],"state":[76],"successor":[77],"generation":[78],"schemes":[79],"domains.":[82],"Finally,":[83],"define":[85],"an":[86],"extended":[87],"version":[88],"increasing":[91],"tree":[93],"search":[94],"algorithm":[95],"(ICTS)":[96],"costs,":[99],"two":[101],"sub-optimal":[103,116],"variants":[104],"ICTS:":[106],"epsilon-ICTS":[107],"w-ICTS.":[109],"Our":[110],"experiments":[111],"show":[112],"higher":[114],"quality":[115],"solutions":[117,134],"are":[118],"achievable":[119],"finely":[123],"discretized":[124,139],"movement":[125,140],"models":[126],"no":[128],"more":[129],"than":[131],"lower-quality,":[132],"coarsely":[138],"models.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":4}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}