{"id":"https://openalex.org/W2293971034","doi":"https://doi.org/10.1109/tkde.2002.1047763","title":"Differential A*","display_name":"Differential A*","publication_year":2002,"publication_date":"2002-11-01","ids":{"openalex":"https://openalex.org/W2293971034","doi":"https://doi.org/10.1109/tkde.2002.1047763","mag":"2293971034"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2002.1047763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2002.1047763","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"type":"article","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/A5014781481","display_name":"Karen Trovato","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131230","display_name":"Philips (United States)","ror":"https://ror.org/03kw6wr76","country_code":"US","type":"company","lineage":["https://openalex.org/I4210122849","https://openalex.org/I4210131230"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K.I. Trovato","raw_affiliation_strings":["Philips Research, Briarcliff Manor, NY, USA"],"affiliations":[{"raw_affiliation_string":"Philips Research, Briarcliff Manor, NY, USA","institution_ids":["https://openalex.org/I4210131230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036491534","display_name":"Leo Dorst","orcid":"https://orcid.org/0000-0003-3680-2745"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"L. Dorst","raw_affiliation_strings":["University of Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014781481"],"corresponding_institution_ids":["https://openalex.org/I4210131230"],"apc_list":null,"apc_paid":null,"fwci":0.4662,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.66976029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":"6","first_page":"1218","last_page":"1229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9944999814033508,"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.7337551116943359},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.7313477993011475},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.5941424369812012},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.571186900138855},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.5188847184181213},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4734344482421875},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4482555091381073},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43806880712509155},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42941510677337646},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3655471205711365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36427873373031616},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3135029077529907},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.23248758912086487},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20257827639579773},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.1801614761352539},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17262333631515503},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15422675013542175},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.08030351996421814}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7337551116943359},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.7313477993011475},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.5941424369812012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.571186900138855},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.5188847184181213},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4734344482421875},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4482555091381073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43806880712509155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42941510677337646},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3655471205711365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36427873373031616},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3135029077529907},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.23248758912086487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20257827639579773},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.1801614761352539},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17262333631515503},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15422675013542175},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.08030351996421814}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tkde.2002.1047763","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2002.1047763","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/6c5c9324-93c6-4e90-a361-c6f8f9b38de9","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/differential-a(6c5c9324-93c6-4e90-a361-c6f8f9b38de9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Trovato, K I & Dorst, L 2002, 'Differential A', IEEE Transactions on Knowledge & Data Engineering, vol. 14, no. 6, pp. 1218-1229. https://doi.org/10.1109/TKDE.2002.1047763","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/6c5c9324-93c6-4e90-a361-c6f8f9b38de9","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/differential-a(6c5c9324-93c6-4e90-a361-c6f8f9b38de9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Trovato, K I & Dorst, L 2002, 'Differential A', IEEE Transactions on Knowledge & Data Engineering, vol. 14, no. 6, pp. 1218-1229. https://doi.org/10.1109/TKDE.2002.1047763","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/6c5c9324-93c6-4e90-a361-c6f8f9b38de9","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/differential-a(6c5c9324-93c6-4e90-a361-c6f8f9b38de9).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Knowledge & Data Engineering, 14(6), 1218 - 1229. IEEE Computer Society","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1524617210","https://openalex.org/W1975638108","https://openalex.org/W2009796613","https://openalex.org/W2029706450","https://openalex.org/W2061441699","https://openalex.org/W2119930191","https://openalex.org/W2121846340","https://openalex.org/W2145089737","https://openalex.org/W2152475379","https://openalex.org/W2155925204","https://openalex.org/W2158712450","https://openalex.org/W2160645305","https://openalex.org/W2163178194","https://openalex.org/W2277511305","https://openalex.org/W2319958627","https://openalex.org/W3021035068","https://openalex.org/W6681425221","https://openalex.org/W6694703167"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W3139139461","https://openalex.org/W2904203243","https://openalex.org/W2106119116","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W2293971034"],"abstract_inverted_index":{"A*":[0,62],"graph":[1,26,89,127],"search":[2],"effectively":[3],"computes":[4],"the":[5,25,31,37,47,55,60,64,69,75,88,100],"optimal":[6],"solution":[7,38,49,77],"path":[8,39,120],"from":[9,54,73],"start":[10],"nodes":[11,14,72],"to":[12,42,118],"goal":[13],"in":[15,30,122],"a":[16,19],"graph,":[17,66],"using":[18],"heuristic":[20],"function.":[21],"In":[22,83],"some":[23],"applications,":[24],"may":[27,95],"change":[28,96],"slightly":[29,53],"course":[32],"of":[33],"its":[34],"use":[35],"and":[36,102],"then":[40],"needs":[41],"be":[43,79],"updated.":[44],"Very":[45],"often,":[46],"new":[48,65],"will":[50],"differ":[51],"only":[52],"old.":[56],"Rather":[57],"than":[58],"perform":[59],"full":[61],"on":[63],"we":[67],"compute":[68],"necessary":[70],"OPEN":[71],"which":[74],"revised":[76],"can":[78],"obtained":[80],"by":[81],"A*.":[82,112],"this":[84],"\"Differential":[85],"A*\"":[86],"algorithm,":[87],"topology,":[90],"transition":[91],"costs,":[92],"or":[93],"start/goals":[94],"simultaneously.":[97],"We":[98,113],"develop":[99],"algorithm":[101],"discuss":[103,115],"when":[104],"it":[105],"gives":[106],"an":[107,116],"improvement":[108],"over":[109],"simply":[110],"reapplying":[111],"briefly":[114],"application":[117],"robot":[119],"planning":[121],"configuration":[123],"space,":[124],"where":[125],"such":[126],"changes":[128],"naturally":[129],"arise.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2016-06-24T00:00:00"}