{"id":"https://openalex.org/W2735603972","doi":"https://doi.org/10.1515/amcs-2017-0020","title":"D* Extra Lite: A Dynamic A* With Search\u2013Tree Cutting and Frontier\u2013Gap Repairing","display_name":"D* Extra Lite: A Dynamic A* With Search\u2013Tree Cutting and Frontier\u2013Gap Repairing","publication_year":2017,"publication_date":"2017-06-27","ids":{"openalex":"https://openalex.org/W2735603972","doi":"https://doi.org/10.1515/amcs-2017-0020","mag":"2735603972"},"language":"en","primary_location":{"id":"doi:10.1515/amcs-2017-0020","is_oa":true,"landing_page_url":"https://doi.org/10.1515/amcs-2017-0020","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/27/2/article-p273.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://content.sciendo.com/downloadpdf/journals/amcs/27/2/article-p273.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031374413","display_name":"Maciej Przybylski","orcid":"https://orcid.org/0000-0002-8706-0676"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Maciej Przybylski","raw_affiliation_strings":["Institute of Automatic Control and Robotics Warsaw University of Technology, ul. \u015bw. A. Boboli 8, 02-525 Warsaw , Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Automatic Control and Robotics Warsaw University of Technology, ul. \u015bw. A. Boboli 8, 02-525 Warsaw , Poland","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088977039","display_name":"B. Putz","orcid":"https://orcid.org/0000-0002-6155-5670"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Barbara Putz","raw_affiliation_strings":["Institute of Automatic Control and Robotics Warsaw University of Technology, ul. \u015bw. A. Boboli 8, 02-525 Warsaw , Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Automatic Control and Robotics Warsaw University of Technology, ul. \u015bw. A. Boboli 8, 02-525 Warsaw , Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031374413"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":{"value":4080,"currency":"PLN","value_usd":1100},"apc_paid":{"value":4080,"currency":"PLN","value_usd":1100},"fwci":0.6469,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.78432378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"27","issue":"2","first_page":"273","last_page":"290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9954000115394592,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.989300012588501,"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/computer-science","display_name":"Computer science","score":0.6374567151069641},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.564335286617279},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5620164275169373},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5069387555122375},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47060900926589966},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4649924337863922},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.45939087867736816},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45770761370658875},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45065778493881226},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42195674777030945},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.414314866065979},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4093506336212158},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3483138680458069},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2943805456161499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24561280012130737},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.21534237265586853}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6374567151069641},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.564335286617279},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5620164275169373},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5069387555122375},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47060900926589966},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4649924337863922},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.45939087867736816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45770761370658875},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45065778493881226},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42195674777030945},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.414314866065979},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4093506336212158},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3483138680458069},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2943805456161499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24561280012130737},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.21534237265586853},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1515/amcs-2017-0020","is_oa":true,"landing_page_url":"https://doi.org/10.1515/amcs-2017-0020","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/27/2/article-p273.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d740997f60784747a2d47df3d22df8ae","is_oa":true,"landing_page_url":"https://doaj.org/article/d740997f60784747a2d47df3d22df8ae","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Applied Mathematics and Computer Science, Vol 27, Iss 2, Pp 273-290 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1515/amcs-2017-0020","is_oa":true,"landing_page_url":"https://doi.org/10.1515/amcs-2017-0020","pdf_url":"https://content.sciendo.com/downloadpdf/journals/amcs/27/2/article-p273.pdf","source":{"id":"https://openalex.org/S117679522","display_name":"International Journal of Applied Mathematics and Computer Science","issn_l":"1641-876X","issn":["1641-876X","2083-8492"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320322","host_organization_name":"De Gruyter Open","host_organization_lineage":["https://openalex.org/P4310320322","https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter Open","De Gruyter"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Mathematics and Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2735603972.pdf","grobid_xml":"https://content.openalex.org/works/W2735603972.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W73207962","https://openalex.org/W183780713","https://openalex.org/W198732646","https://openalex.org/W598381741","https://openalex.org/W1516784847","https://openalex.org/W1520097941","https://openalex.org/W1969483458","https://openalex.org/W1982809790","https://openalex.org/W2057694648","https://openalex.org/W2086251647","https://openalex.org/W2099144379","https://openalex.org/W2113256452","https://openalex.org/W2119930191","https://openalex.org/W2129969688","https://openalex.org/W2135125135","https://openalex.org/W2145089737","https://openalex.org/W2158137377","https://openalex.org/W2203513973","https://openalex.org/W2293971034","https://openalex.org/W2296248084","https://openalex.org/W2297711053","https://openalex.org/W2299136288","https://openalex.org/W2397694204","https://openalex.org/W2405193543"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4386269615","https://openalex.org/W2064794194","https://openalex.org/W1605835093","https://openalex.org/W2402589461","https://openalex.org/W4200104947","https://openalex.org/W58921990","https://openalex.org/W2204575588"],"abstract_inverted_index":{"Abstract":[0],"Searching":[1],"for":[2,173],"the":[3,57,66,75,79,102,127,158,178,194,199],"shortest-path":[4],"in":[5,15,20,31,56,133],"an":[6],"unknown":[7],"or":[8],"changeable":[9],"environment":[10],"is":[11,39,93,124,196],"a":[12,40,86,96,140],"common":[13],"problem":[14],"robotics":[16],"and":[17,27,74],"video":[18],"games,":[19],"which":[21],"agents":[22],"need":[23],"to":[24,28,33,71,95,130,153],"update":[25],"maps":[26],"perform":[29],"re-planning":[30],"order":[32],"complete":[34],"their":[35],"missions.":[36],"D*":[37,88,118,134,148,162,181],"Lite":[38,90,150],"popular":[41],"incremental":[42],"heuristic":[43],"search":[44],"algorithm":[45,91,195],"(i.e.,":[46],"it":[47,60,168],"utilizes":[48],"knowledge":[49],"from":[50],"previous":[51],"searches).":[52],"Its":[53],"efficiency":[54],"lies":[55],"fact":[58],"that":[59,68,92,117,167,187],"re-expands":[61],"only":[62],"those":[63],"parts":[64],"of":[65,78,101,122,143,161,188,193],"search-space":[67,104],"are":[69],"relevant":[70],"registered":[72],"changes":[73],"current":[76],"state":[77],"agent.":[80],"In":[81,136],"this":[82],"paper,":[83],"we":[84],"propose":[85],"new":[87],"Extra":[89,119,149,182],"close":[94],"regular":[97],"A*,":[98],"with":[99],"reinitialization":[100,123,131],"affected":[103],"achieved":[105],"by":[106],"search-tree":[107],"branch":[108],"cutting.":[109],"The":[110,190],"provided":[111],"worst-case":[112],"complexity":[113],"analysis":[114],"strongly":[115],"suggests":[116],"Lite\u2019s":[120,183],"method":[121],"faster":[125,156],"than":[126,157],"focused":[128],"approach":[129],"used":[132],"Lite.":[135,163],"comprehensive":[137],"tests":[138],"on":[139,198],"large":[141],"number":[142],"typical":[144],"two-dimensional":[145],"path-planning":[146],"problems,":[147,176],"was":[151],"1.08":[152],"1.94":[154],"times":[155],"optimized":[159],"version":[160],"Moreover,":[164],"while":[165],"demonstrating":[166],"can":[169],"be":[170],"particularly":[171],"suitable":[172],"difficult,":[174],"dynamic":[175],"as":[177],"problem-complexity":[179],"increased,":[180],"performance":[184],"further":[185],"surpassed":[186],"D*Lite.":[189],"source":[191],"code":[192],"available":[197],"open-source":[200],"basis.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}