{"id":"https://openalex.org/W2169708080","doi":"https://doi.org/10.1017/s0263574700018646","title":"Comparing two algorithms for automatic planning by robots in stochastic environments","display_name":"Comparing two algorithms for automatic planning by robots in stochastic environments","publication_year":1995,"publication_date":"1995-11-01","ids":{"openalex":"https://openalex.org/W2169708080","doi":"https://doi.org/10.1017/s0263574700018646","mag":"2169708080"},"language":"en","primary_location":{"id":"doi:10.1017/s0263574700018646","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574700018646","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","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/A5058295016","display_name":"Alan D. Christiansen","orcid":null},"institutions":[{"id":"https://openalex.org/I1311060795","display_name":"U.S. National Science Foundation","ror":"https://ror.org/021nxhr62","country_code":"US","type":"government","lineage":["https://openalex.org/I1311060795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan D. Christiansen","raw_affiliation_strings":["Computer Science Department, Tulane University, New Orleans, LA 70118-5674 (USA). Supported at CMU by an AT&T Bell Laboratories Ph.D. Scholarship and by the National Science Foundation under grant DMC-8520475. A portion of this work was completed during a visit to the Laboratoire d'Informatique Fondamentale et d'ntelligence Artificielle (LIF1A) in Grenoble. France. supported by INRIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Tulane University, New Orleans, LA 70118-5674 (USA). Supported at CMU by an AT&T Bell Laboratories Ph.D. Scholarship and by the National Science Foundation under grant DMC-8520475. A portion of this work was completed during a visit to the Laboratoire d'Informatique Fondamentale et d'ntelligence Artificielle (LIF1A) in Grenoble. France. supported by INRIA","institution_ids":["https://openalex.org/I1311060795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010019244","display_name":"Ken Goldberg","orcid":"https://orcid.org/0000-0001-6747-9499"},"institutions":[{"id":"https://openalex.org/I1311060795","display_name":"U.S. National Science Foundation","ror":"https://ror.org/021nxhr62","country_code":"US","type":"government","lineage":["https://openalex.org/I1311060795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kenneth Y. Goldberg","raw_affiliation_strings":["Institute for Robotics and Intelligent Systems, University of Southern California. Los Angeles. CA 90089-0273 (USA).Supported by the National Science Foundation under Awards No. IRl-9123747. and DDM-9215362 (Strategic Manufacturing Initiative","Institute for Robotics and Intelligent Systems, University of Southern California. Los Angeles. CA 90089-0273 (USA).Supported by the National Science Foundation under Awards No. IRl-9123747. and DDM-9215362 (Strategic Manufacturing Initiative)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Robotics and Intelligent Systems, University of Southern California. Los Angeles. CA 90089-0273 (USA).Supported by the National Science Foundation under Awards No. IRl-9123747. and DDM-9215362 (Strategic Manufacturing Initiative","institution_ids":["https://openalex.org/I1311060795"]},{"raw_affiliation_string":"Institute for Robotics and Intelligent Systems, University of Southern California. Los Angeles. CA 90089-0273 (USA).Supported by the National Science Foundation under Awards No. IRl-9123747. and DDM-9215362 (Strategic Manufacturing Initiative)","institution_ids":["https://openalex.org/I1311060795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1311060795"],"apc_list":null,"apc_paid":null,"fwci":0.5894,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7782194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"13","issue":"6","first_page":"565","last_page":"573"},"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.9987999796867371,"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.9987999796867371,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.6325390934944153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6179245114326477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5868098139762878},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5655738711357117},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5450094938278198},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5052638649940491},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4971146881580353},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4954274892807007},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4631046652793884},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.45230913162231445},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.4303801953792572},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4256126880645752},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4205428957939148},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4171808362007141},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.33644580841064453},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29435479640960693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23848643898963928},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2023797631263733}],"concepts":[{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.6325390934944153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179245114326477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5868098139762878},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5655738711357117},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5450094938278198},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5052638649940491},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4971146881580353},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4954274892807007},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4631046652793884},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.45230913162231445},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.4303801953792572},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4256126880645752},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4205428957939148},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4171808362007141},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.33644580841064453},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29435479640960693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23848643898963928},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2023797631263733},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0263574700018646","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574700018646","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7200000286102295}],"awards":[],"funders":[{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W13520770","https://openalex.org/W23603061","https://openalex.org/W36459598","https://openalex.org/W70332635","https://openalex.org/W79302034","https://openalex.org/W113957971","https://openalex.org/W193077568","https://openalex.org/W284629942","https://openalex.org/W1503397486","https://openalex.org/W1507197744","https://openalex.org/W1530045430","https://openalex.org/W1538558539","https://openalex.org/W1545148916","https://openalex.org/W1555761015","https://openalex.org/W1646038686","https://openalex.org/W1984482772","https://openalex.org/W1988520084","https://openalex.org/W1994049796","https://openalex.org/W2015779132","https://openalex.org/W2020350911","https://openalex.org/W2027154457","https://openalex.org/W2032100464","https://openalex.org/W2033661039","https://openalex.org/W2046577860","https://openalex.org/W2050708324","https://openalex.org/W2076425954","https://openalex.org/W2098572589","https://openalex.org/W2102713886","https://openalex.org/W2130527101","https://openalex.org/W2134072104","https://openalex.org/W2142061393","https://openalex.org/W2148962857","https://openalex.org/W2275216783","https://openalex.org/W2317531417","https://openalex.org/W2797328151","https://openalex.org/W3140571750","https://openalex.org/W4250143236"],"related_works":["https://openalex.org/W1660242800","https://openalex.org/W2077211377","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532"],"abstract_inverted_index":{"Summary":[0],"Planning":[1],"a":[2,48,52,76,81,102],"sequence":[3],"of":[4,13,33,116],"robot":[5],"actions":[6,14,40,118],"is":[7,15,18,58],"especially":[8],"difficult":[9],"when":[10,20],"the":[11,23,31,85],"outcome":[12],"uncertain,":[16],"as":[17,44],"inevitable":[19],"interacting":[21],"with":[22,55],"physical":[24],"environment.":[25],"In":[26],"this":[27],"paper":[28],"we":[29,97],"consider":[30,66],"case":[32],"finite":[34],"state":[35,54],"and":[36,75],"action":[37],"spaces":[38],"where":[39],"can":[41,120],"be":[42,61,121],"modeled":[43],"Markov":[45],"transitions.":[46],"Finding":[47],"plan":[49,92,95],"that":[50,72,79,119],"achieves":[51],"desired":[53],"maximum":[56],"probability":[57],"known":[59],"to":[60,112,123],"an":[62,69],"NP-Complete":[63],"problem.":[64],"We":[65],"two":[67,114],"algorithms:":[68],"exponential-time":[70],"algorithm":[71,78],"maximizes":[73,80],"probability,":[74],"polynomial-time":[77],"lower":[82],"bound":[83],"on":[84,101],"probability.":[86],"As":[87],"these":[88,126],"algorithms":[89,128],"trade":[90],"off":[91],"time":[93],"for":[94,105,129],"quality,":[96],"compare":[98],"their":[99],"performance":[100],"mechanical":[103],"system":[104],"orienting":[106],"parts.":[107],"Our":[108],"results":[109],"lead":[110],"us":[111],"identify":[113],"properties":[115],"stochastic":[117],"used":[122],"choose":[124],"between":[125],"planning":[127],"other":[130],"applications.":[131]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}