{"id":"https://openalex.org/W204092060","doi":null,"title":"Lazy approximation for solving continuous finite-horizon MDPs","display_name":"Lazy approximation for solving continuous finite-horizon MDPs","publication_year":2005,"publication_date":"2005-07-09","ids":{"openalex":"https://openalex.org/W204092060","mag":"204092060"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.545.8484","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.8484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aaai.org/Papers/AAAI/2005/AAAI05-186.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":"Lihong Li","orcid":"https://orcid.org/0000-0002-0561-2079","observed_orcids":["https://orcid.org/0000-0002-0561-2079"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lihong Li","raw_affiliation_strings":["RL3Laboratory, Dept. of Computer Science, Rutgers University, Piscataway, NJ#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-0561-2079","affiliations":[{"raw_affiliation_string":"RL3Laboratory, Dept. of Computer Science, Rutgers University, Piscataway, NJ#TAB#","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009722403","display_name":"Michael L. Littman","orcid":"https://orcid.org/0000-0002-5596-1840","observed_orcids":["https://orcid.org/0000-0002-5596-1840"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael L. Littman","raw_affiliation_strings":["RL3Laboratory, Dept. of Computer Science, Rutgers University, Piscataway, NJ#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5596-1840","affiliations":[{"raw_affiliation_string":"RL3Laboratory, Dept. of Computer Science, Rutgers University, Piscataway, NJ#TAB#","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":6.0142,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.96077871,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1175","last_page":"1180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9609000086784363,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9609000086784363,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.03150000050663948,"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":0.0017999999690800905,"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/finite-horizon-mdps","display_name":"finite-horizon MDPs","score":0.9430000185966492},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"curse of dimensionality","score":0.949999988079071},{"id":"https://openalex.org/keywords/transportation-planning","display_name":"transportation planning","score":0.6700000166893005}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.8631719350814819},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7473067045211792},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.742151141166687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6296667456626892},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6151002645492554},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49692729115486145},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.446468323469162},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4408329129219055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21175602078437805},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15407845377922058},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.545.8484","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.8484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aaai.org/Papers/AAAI/2005/AAAI05-186.pdf","raw_type":"text"},{"id":"mag:204092060","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/2005/AAAI05-186.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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1515851193","https://openalex.org/W1552830313","https://openalex.org/W1576452626","https://openalex.org/W1589991875","https://openalex.org/W1646707810","https://openalex.org/W2024668293","https://openalex.org/W2039439610","https://openalex.org/W2119567691","https://openalex.org/W2121863487","https://openalex.org/W2133429202","https://openalex.org/W2168945108","https://openalex.org/W2337392266","https://openalex.org/W2341171179"],"related_works":["https://openalex.org/W7095395081","https://openalex.org/W169124852","https://openalex.org/W2495109134","https://openalex.org/W7097081394","https://openalex.org/W3005767492","https://openalex.org/W190855689","https://openalex.org/W134185113","https://openalex.org/W7099298687","https://openalex.org/W7100748510","https://openalex.org/W1953015992"],"abstract_inverted_index":{"Solving":[0],"Markov":[1],"decision":[2],"processes":[3],"(MDPs)":[4],"with":[5],"con-tinuous":[6],"state":[7],"spaces":[8],"is":[9],"a":[10,35,85],"challenge":[11],"due":[12],"to,":[13],"among":[14],"other":[15],"problems,":[16],"the":[17],"well-known":[18],"curse":[19],"of":[20],"dimensionality.":[21],"Nevertheless,":[22],"numerous":[23],"real-world":[24],"applications":[25],"such":[26],"as":[27],"transportation":[28],"planning":[29,90],"and":[30,56,77],"telescope":[31],"observation":[32],"scheduling":[33],"exhibit":[34],"critical":[36],"dependence":[37],"on":[38],"continuous":[39],"states.":[40],"Current":[41],"approaches":[42],"to":[43,84],"continuous-state":[44],"MDPs":[45],"include":[46],"discretizing":[47],"their":[48],"transition":[49],"models.":[50],"In":[51],"this":[52,81],"pa-per,":[53],"we":[54,62,78],"propose":[55],"study":[57,67],"an":[58],"alternative,":[59],"discretization-free":[60],"approach":[61],"call":[63],"lazy":[64,70],"approximation.":[65],"Empirical":[66],"shows":[68],"that":[69],"approximation":[71],"performs":[72],"much":[73],"better":[74],"than":[75],"discretization,":[76],"successfully":[79],"applied":[80],"new":[82],"technique":[83],"more":[86],"realistic":[87],"planetary":[88],"rover":[89],"problem.":[91]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}