{"id":"https://openalex.org/W2155730884","doi":"https://doi.org/10.3217/jucs-008-08-0739","title":"An Architecture for a Three-Tier Path-Finder","display_name":"An Architecture for a Three-Tier Path-Finder","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2155730884","doi":"https://doi.org/10.3217/jucs-008-08-0739","mag":"2155730884"},"language":"en","primary_location":{"id":"pmh:oai:zenodo.org:6996209","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-008-08-0739","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science, 8((8)), 739-750, (2002-08-28)","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.3217/jucs-008-08-0739","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016737838","display_name":"Michael Barley","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Barley","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058596166","display_name":"Hans W. Guesgen","orcid":"https://orcid.org/0000-0002-8160-5946"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hans W. Guesgen","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8160-5946","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026930990","display_name":"Gareth Karl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gareth Karl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22598745,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"739","last_page":"750"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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.9987000226974487,"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.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.8659303784370422},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7953500151634216},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7027259469032288},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.5914117097854614},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5664785504341125},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5622532367706299},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5457926392555237},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47364699840545654},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.44834983348846436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30415308475494385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2986425757408142},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19427350163459778},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08993342518806458},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07237353920936584}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8659303784370422},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7953500151634216},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7027259469032288},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.5914117097854614},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5664785504341125},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5622532367706299},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5457926392555237},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47364699840545654},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.44834983348846436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30415308475494385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2986425757408142},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19427350163459778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08993342518806458},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07237353920936584},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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":2,"locations":[{"id":"pmh:oai:zenodo.org:6996209","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-008-08-0739","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science, 8((8)), 739-750, (2002-08-28)","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2155730884","is_oa":false,"landing_page_url":"https://www.jucs.org/jucs_8_8/an_architecture_for_a/Barley_M.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S58563349","display_name":"JUCS - Journal of Universal Computer Science","issn_l":"0948-695X","issn":["0948-695X","0948-6968"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317875","host_organization_name":"Verlag der Technischen Universit\u00e4t Graz","host_organization_lineage":["https://openalex.org/P4310317875"],"host_organization_lineage_names":["Verlag der Technischen Universit\u00e4t Graz"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"JUCS - Journal of Universal Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:zenodo.org:6996209","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-008-08-0739","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science, 8((8)), 739-750, (2002-08-28)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W168407115","https://openalex.org/W1512577763","https://openalex.org/W1646038686","https://openalex.org/W1659605498","https://openalex.org/W1969483458","https://openalex.org/W2032102882","https://openalex.org/W2075544683","https://openalex.org/W2106747917","https://openalex.org/W2127989417"],"related_works":["https://openalex.org/W2955338387","https://openalex.org/W2796795701","https://openalex.org/W3202758768","https://openalex.org/W2189137617","https://openalex.org/W2806207758","https://openalex.org/W855555195","https://openalex.org/W2269184848","https://openalex.org/W3212378323","https://openalex.org/W3042001398","https://openalex.org/W2590514300","https://openalex.org/W2745813641","https://openalex.org/W3210058234","https://openalex.org/W246531748","https://openalex.org/W2981564485","https://openalex.org/W3023901828","https://openalex.org/W2164178448","https://openalex.org/W2183081668","https://openalex.org/W1983411197","https://openalex.org/W1608015133","https://openalex.org/W2014482607"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"the":[3,31,42,47,52,56,72,97,103],"architecture":[4],"of":[5,30],"a":[6],"route":[7,14],"finding":[8],"system":[9,32],"that":[10,21,37],"computes":[11],"an":[12,34],"optimal":[13],"between":[15,55],"two":[16,57],"given":[17],"locations":[18],"efficiently":[19],"and":[20],"considers":[22],"user":[23,94],"preferences":[24,95],"when":[25],"doing":[26],"so.":[27],"The":[28],"basis":[29],"is":[33,61,68],"A*":[35,60],"algorithm":[36],"applies":[38],"heuristics":[39],"such":[40],"as":[41],"air":[43],"distance":[44],"heuristic":[45,49],"or":[46],"Manhattan":[48],"to":[50,70,85,92,99],"compute":[51],"shortest":[53],"path":[54],"locations.":[58],"Since":[59],"not":[62],"tractable":[63],"in":[64],"general,":[65],"island":[66],"search":[67,87],"used":[69],"divide":[71],"problem":[73],"into":[74],"smaller":[75],"problems,":[76],"which":[77],"can":[78],"be":[79,100],"solved":[80],"more":[81],"easily.":[82],"In":[83],"addition":[84],"that,":[86],"control":[88],"rules":[89],"are":[90],"introduced":[91],"express":[93],"about":[96],"routes":[98],"considered":[101],"during":[102],"search.":[104]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2025-10-10T00:00:00"}