{"id":"https://openalex.org/W146503032","doi":null,"title":"Extracting Effective and Admissible State Space Heuristics from the Planning Graph","display_name":"Extracting Effective and Admissible State Space Heuristics from the Planning Graph","publication_year":2000,"publication_date":"2000-07-30","ids":{"openalex":"https://openalex.org/W146503032","mag":"146503032"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.9749","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rakaposhi.eas.asu.edu/XNguyen.ps","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":"https://openalex.org/A5111598410","display_name":"XuanLong Nguyen","orcid":"https://orcid.org/0009-0007-5199-5553","observed_orcids":["https://orcid.org/0009-0007-5199-5553"]},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"XuanLong Nguyen","raw_affiliation_strings":["Arizona State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023323170","display_name":"Subbarao Kambhampati B","orcid":"https://orcid.org/0000-0002-9069-0265","observed_orcids":["https://orcid.org/0000-0002-9069-0265"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subbarao Kambhampati","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9069-0265","affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7838,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.9470242,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"798","last_page":"805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":9.999999747378752e-05,"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/planning-graph","display_name":"planning graph","score":0.9089999794960022},{"id":"https://openalex.org/keywords/graphplan","display_name":"Graphplan","score":0.8209999799728394},{"id":"https://openalex.org/keywords/classical-planning","display_name":"classical planning","score":0.8529999852180481},{"id":"https://openalex.org/keywords/search-speed","display_name":"search speed","score":0.527999997138977}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9491708278656006},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6070502400398254},{"id":"https://openalex.org/C95203288","wikidata":"https://www.wikidata.org/wiki/Q221682","display_name":"Semaphore","level":2,"score":0.5702649354934692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5696340799331665},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5468525290489197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5281826257705688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47661057114601135},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.467180073261261},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43962281942367554},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4236454665660858},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31898611783981323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2976040840148926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2146923840045929},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.9749","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.9749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rakaposhi.eas.asu.edu/XNguyen.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.6879","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rakaposhi.eas.asu.edu/XNguyen.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.551.4189","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.551.4189","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/AAAI/2000/AAAI00-123.pdf","raw_type":"text"},{"id":"mag:146503032","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/2000/AAAI00-123.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W69255106","https://openalex.org/W1232317052","https://openalex.org/W1481195904","https://openalex.org/W1491696635","https://openalex.org/W1499973835","https://openalex.org/W1514296638","https://openalex.org/W1558620469","https://openalex.org/W1570679913","https://openalex.org/W1656881631","https://openalex.org/W1781384914","https://openalex.org/W1913901177","https://openalex.org/W2009833344","https://openalex.org/W2025460523","https://openalex.org/W2110927808","https://openalex.org/W2136169366","https://openalex.org/W2152475379","https://openalex.org/W2169157871","https://openalex.org/W2170408876"],"related_works":["https://openalex.org/W2169964236","https://openalex.org/W2320864980","https://openalex.org/W7098702050","https://openalex.org/W1481195904","https://openalex.org/W2106482840","https://openalex.org/W1489657515","https://openalex.org/W2737470465","https://openalex.org/W7096384490","https://openalex.org/W1731763842","https://openalex.org/W1232317052"],"abstract_inverted_index":{"Graphplan":[0,44],"and":[1,9,74,91,116],"heuristic":[2],"state":[3,59,133],"space":[4,60,134],"planners":[5,70],"such":[6,71],"as":[7,30,72],"HSP-R":[8,73],"UNPOP":[10,75],"are":[11],"currently":[12],"two":[13],"of":[14,109,120,146],"the":[15,39,66,87,93,97,131],"most":[16],"effective":[17,56],"approaches":[18,25],"for":[19,53,58],"solving":[20],"classical":[21],"planning":[22,40,98],"problems.":[23],"These":[24],"have":[26,142],"hither-to":[27],"been":[28],"seen":[29,143],"largely":[31],"orthogonal.":[32],"In":[33],"this":[34,102],"paper,":[35],"we":[36,63],"show":[37,64,125],"that":[38,43,65,92,126],"graph":[41,99],"structure":[42],"builds":[45],"in":[46,78,96],"polynomial":[47],"time,":[48],"provides":[49],"a":[50,144],"rich":[51],"substrate":[52],"deriving":[54],"more":[55],"heuristics":[57,67,128],"planners.":[61],"Specifically,":[62],"used":[68],"by":[69],"do":[76],"badly":[77],"several":[79,107],"domains":[80],"due":[81],"to":[82,85],"their":[83],"failure":[84],"consider":[86],"interactions":[88],"between":[89],"subgoals,":[90],"mutex":[94],"information":[95],"captures":[100],"exactly":[101],"interaction":[103],"information.":[104],"We":[105],"develop":[106],"families":[108],"heuristics,":[110],"some":[111],"aimed":[112],"at":[113,118],"search":[114],"speed":[115],"others":[117],"optimality":[119],"solutions.":[121],"Our":[122],"empirical":[123],"studies":[124],"our":[127],"significantly":[129],"out-perform":[130],"existing":[132],"heuristics.":[135],"1":[136],"Introduction":[137],"The":[138],"last":[139],"few":[140],"years":[141],"number":[145],"attractive":[147],"a...":[148]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}