{"id":"https://openalex.org/W16748696","doi":null,"title":"Using classical planners to solve nondeterministic planning problems","display_name":"Using classical planners to solve nondeterministic planning problems","publication_year":2008,"publication_date":"2008-09-14","ids":{"openalex":"https://openalex.org/W16748696","mag":"16748696"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.3625","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.3625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~nau/papers/kuter08using.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":"https://openalex.org/A5045174880","display_name":"Ugur Kuter","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ugur Kuter","raw_affiliation_strings":["Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084686808","display_name":"Dana S. Nau","orcid":"https://orcid.org/0000-0001-6940-6293","observed_orcids":["https://orcid.org/0000-0001-6940-6293"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dana S. Nau","raw_affiliation_strings":["Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-6940-6293","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085294928","display_name":"Elnatan Reisner","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elnatan Reisner","raw_affiliation_strings":["Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Institute for Systems Research, and Institute for Advanced Computer Studies, University of Maryland, College Park, MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018879019","display_name":"Robert P. Goldman","orcid":"https://orcid.org/0000-0002-5851-4851","observed_orcids":["https://orcid.org/0000-0002-5851-4851"]},"institutions":[{"id":"https://openalex.org/I4210103432","display_name":"Smart Information Flow Technologies (United States)","ror":"https://ror.org/01hnzmd62","country_code":"US","type":"company","lineage":["https://openalex.org/I4210103432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert P. Goldman","raw_affiliation_strings":["Smart Information Flow Technologies, (d/b/a SIFT, LLC), Minneapolis, MN#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5851-4851","affiliations":[{"raw_affiliation_string":"Smart Information Flow Technologies, (d/b/a SIFT, LLC), Minneapolis, MN#TAB#","institution_ids":["https://openalex.org/I4210103432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7284,"has_fulltext":true,"cited_by_count":49,"citation_normalized_percentile":{"value":0.92548882,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"190","last_page":"197"},"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/T10462","display_name":"Reinforcement Learning in Robotics","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/non-deterministic-planning","display_name":"non-deterministic planning","score":0.9670000076293945}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.9523648023605347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6574196815490723},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.4523162245750427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4341869354248047},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4010666012763977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38490042090415955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20271897315979004},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.3625","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.3625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~nau/papers/kuter08using.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.580.6927","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.580.6927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aiconferences.org/ICAPS/2008/Papers/ICAPS08-024.pdf","raw_type":"text"},{"id":"mag:16748696","doi":null,"is_oa":false,"landing_page_url":"http://rpgoldman.goldman-tribe.org/papers/icaps08-shop.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419157","display_name":"International Conference on Automated Planning and Scheduling","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":"International Conference on Automated Planning and Scheduling","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":29,"referenced_works":["https://openalex.org/W3564832","https://openalex.org/W4789806","https://openalex.org/W12671722","https://openalex.org/W56175857","https://openalex.org/W127341816","https://openalex.org/W148059143","https://openalex.org/W164068750","https://openalex.org/W185076788","https://openalex.org/W198382039","https://openalex.org/W1482748162","https://openalex.org/W1501554968","https://openalex.org/W1511123881","https://openalex.org/W1529693658","https://openalex.org/W1532972988","https://openalex.org/W1545688112","https://openalex.org/W1548517304","https://openalex.org/W1550351837","https://openalex.org/W1555519929","https://openalex.org/W1563292958","https://openalex.org/W1584733007","https://openalex.org/W1827139443","https://openalex.org/W1984139896","https://openalex.org/W1994451575","https://openalex.org/W2086026622","https://openalex.org/W2105757562","https://openalex.org/W2111204599","https://openalex.org/W2121898615","https://openalex.org/W2143912197","https://openalex.org/W2166971042"],"related_works":["https://openalex.org/W2128534877","https://openalex.org/W116329753","https://openalex.org/W3200855987","https://openalex.org/W7097856952","https://openalex.org/W2466048576","https://openalex.org/W1994451575","https://openalex.org/W3006438598","https://openalex.org/W101790149","https://openalex.org/W1502433320","https://openalex.org/W7099091564"],"abstract_inverted_index":{"Researchers":[0],"have":[1],"developed":[2],"a":[3,15],"huge":[4],"number":[5],"of":[6,54,57],"algorithms":[7],"to":[8,17,22,52],"solve":[9],"classical":[10,45],"planning":[11,29,63],"problems.":[12,64],"We":[13],"provide":[14],"way":[16],"use":[18],"these":[19],"algorithms,":[20],"unmodified,":[21],"generate":[23],"strong-cyclic":[24],"solu-tions":[25],"in":[26],"fully-observable":[27],"nondeterministic":[28,62],"domains.":[30],"Our":[31],"experiments":[32],"show":[33],"that":[34,53],"when":[35],"using":[36],"our":[37],"technique":[38],"with":[39],"FF":[40],"and":[41],"SGPlan":[42],"(two":[43],"well-known":[44],"planners),":[46],"its":[47],"perfor-mance":[48],"compares":[49],"quite":[50],"favorably":[51],"MBP,":[55],"one":[56],"the":[58],"best-known":[59],"planners":[60],"for":[61]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}