{"id":"https://openalex.org/W7097270963","doi":null,"title":"Stefan Edelkamp 1 and Shahid Jabbar 2\u2217","display_name":"Stefan Edelkamp 1 and Shahid Jabbar 2\u2217","publication_year":2008,"publication_date":"2008-02-06","ids":{"openalex":"https://openalex.org/W7097270963"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.23","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.23","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.albertolluch.com/papers/dmc-aaai.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fachbereich Informatik","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fachbereich Informatik","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":0,"citation_normalized_percentile":{"value":0.49509632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.6294000148773193,"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"}},"topics":[{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.6294000148773193,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.09860000014305115,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.07800000160932541,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/weighted-graphs","display_name":"weighted graphs","score":0.6269999742507935},{"id":"https://openalex.org/keywords/heuristic-search","display_name":"heuristic search","score":0.7799999713897705},{"id":"https://openalex.org/keywords/a-algorithm","display_name":"A* algorithm","score":0.8370000123977661},{"id":"https://openalex.org/keywords/algebraic-formalism","display_name":"algebraic formalism","score":0.7850000262260437},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"quality of service","score":0.8040000200271606},{"id":"https://openalex.org/keywords/cost-function","display_name":"cost function","score":0.625},{"id":"https://openalex.org/keywords/correctness-proofs","display_name":"correctness proofs","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6614000201225281},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6222000122070312},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5127000212669373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5120999813079834},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.4830000102519989},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4081000089645386},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35830000042915344},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.3434999883174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32749998569488525},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31189998984336853},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.302700012922287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29409998655319214},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2824000120162964},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.28139999508857727},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.23","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.23","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.albertolluch.com/papers/dmc-aaai.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7098931809","https://openalex.org/W1514478159","https://openalex.org/W7097298028","https://openalex.org/W1969483458","https://openalex.org/W18644332","https://openalex.org/W2904805225","https://openalex.org/W2188198880","https://openalex.org/W2602133494","https://openalex.org/W2556411342","https://openalex.org/W7097517620"],"abstract_inverted_index":{"Heuristic":[0],"search":[1,61,87],"is":[2,19],"used":[3],"to":[4,33,72,80],"efficiently":[5],"solve":[6],"the":[7,58,95,103,106],"single-node":[8],"shortest":[9],"path":[10],"problem":[11],"in":[12,23],"weighted":[13],"graphs.":[14],"In":[15],"practice,":[16],"however,":[17],"one":[18],"not":[20],"only":[21],"interested":[22],"finding":[24],"a":[25,34,73],"short":[26],"path,":[27,31],"but":[28],"an":[29,40,70],"optimal":[30],"according":[32],"certain":[35],"cost":[36,46],"notion.":[37],"We":[38,54],"propose":[39],"algebraic":[41],"formalism":[42],"that":[43,101],"captures":[44],"many":[45],"notions,":[47],"like":[48],"typical":[49],"Quality":[50],"of":[51,84,94,105],"Service":[52],"attributes.":[53],"thus":[55],"generalize":[56],"A*,":[57],"popular":[59],"heuristic":[60,86],"algorithm,":[62],"for":[63,76],"solving":[64],"optimal-path":[65],"problem.":[66],"The":[67],"paper":[68],"provides":[69],"answer":[71],"fundamental":[74],"question":[75],"AI":[77],"search,":[78],"namely":[79],"which":[81],"general":[82],"notion":[83],"cost,":[85],"algorithms":[88,96],"can":[89],"be":[90],"applied.We":[91],"proof":[92],"correctness":[93],"and":[97],"provide":[98],"experimental":[99],"results":[100],"validate":[102],"feasibility":[104],"approach.":[107]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-27T00:00:00"}