{"id":"https://openalex.org/W2101421095","doi":"https://doi.org/10.1109/robot.2004.1307420","title":"A point-based POMDP algorithm for robot planning","display_name":"A point-based POMDP algorithm for robot planning","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2101421095","doi":"https://doi.org/10.1109/robot.2004.1307420","mag":"2101421095"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2004.1307420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1307420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbilu.uni.lu/handle/10993/11057","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075395956","display_name":"Matthijs T. J. Spaan","orcid":"https://orcid.org/0009-0002-2858-8611"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"M.T.J. Spaan","raw_affiliation_strings":["Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands","Universiteit van Amsterdam, Amsterdam, Noord-Holland, NL"],"affiliations":[{"raw_affiliation_string":"Informatics Institute, University of Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"Universiteit van Amsterdam, Amsterdam, Noord-Holland, NL","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048855509","display_name":"N. Spaan","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"N. Spaan","raw_affiliation_strings":["Informatics Inst., Amsterdam Univ., Netherlands"],"affiliations":[{"raw_affiliation_string":"Informatics Inst., Amsterdam Univ., Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075395956"],"corresponding_institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":7.1726,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.97528445,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2399","last_page":"2404 Vol.3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.9411859512329102},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.729518473148346},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.667548418045044},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6060030460357666},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5851365327835083},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5175396800041199},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5166023969650269},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.46130138635635376},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42672935128211975},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3461328148841858},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22680053114891052},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13887572288513184},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.0963592529296875},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07990053296089172},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.07877027988433838}],"concepts":[{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.9411859512329102},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.729518473148346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.667548418045044},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6060030460357666},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5851365327835083},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5175396800041199},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5166023969650269},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.46130138635635376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42672935128211975},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3461328148841858},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22680053114891052},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13887572288513184},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.0963592529296875},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07990053296089172},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.07877027988433838},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/robot.2004.1307420","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2004.1307420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/f130fad3-72f3-47ad-8768-eacef9538db0","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/a-pointbased-pomdp-algorithm-for-robot-planning(f130fad3-72f3-47ad-8768-eacef9538db0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Spaan, M T J & Vlassis, N 2004, A point-based POMDP algorithm for robot planning. in Proceedings IEEE International Conference on Robotics and Automation. New Orleans, pp. 2399-2404.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.9723","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9723","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.science.uva.nl/pub/computer-systems/aut-sys/reports/Spaan04icra.pdf","raw_type":"text"},{"id":"pmh:oai:orbilu.uni.lu:10993/11057","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/11057","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc. IEEE Int. Conf. on Robotics and Automation, New Orleans, Louisiana, 2399-2404 (2004); IEEE Int. Conf. on Robotics and Automation, New Orleans, Louisiana, 2004","raw_type":"peer reviewed"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/f130fad3-72f3-47ad-8768-eacef9538db0","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/a-pointbased-pomdp-algorithm-for-robot-planning(f130fad3-72f3-47ad-8768-eacef9538db0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings IEEE International Conference on Robotics and Automation, 2399 - 2404","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/11057","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/11057","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc. IEEE Int. Conf. on Robotics and Automation, New Orleans, Louisiana, 2399-2404 (2004); IEEE Int. Conf. on Robotics and Automation, New Orleans, Louisiana, 2004","raw_type":"peer reviewed"},"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W73143588","https://openalex.org/W90673796","https://openalex.org/W101508493","https://openalex.org/W1532688806","https://openalex.org/W1539216098","https://openalex.org/W1563317173","https://openalex.org/W1563965851","https://openalex.org/W1592813209","https://openalex.org/W1831612509","https://openalex.org/W1864896197","https://openalex.org/W2032100464","https://openalex.org/W2113889826","https://openalex.org/W2115356364","https://openalex.org/W2119757950","https://openalex.org/W2121863487","https://openalex.org/W2127669771","https://openalex.org/W2140405352","https://openalex.org/W2144283793","https://openalex.org/W2154727088","https://openalex.org/W2168359464","https://openalex.org/W2169294731","https://openalex.org/W4214717370","https://openalex.org/W6603031904","https://openalex.org/W6631864160","https://openalex.org/W6633696232","https://openalex.org/W6633937657","https://openalex.org/W6635545125","https://openalex.org/W6638467925","https://openalex.org/W6639035346","https://openalex.org/W6677279966","https://openalex.org/W6681633084","https://openalex.org/W6682864419"],"related_works":["https://openalex.org/W2123651102","https://openalex.org/W2953027552","https://openalex.org/W2287992105","https://openalex.org/W2117555338","https://openalex.org/W2392831491","https://openalex.org/W2570299561","https://openalex.org/W1512585804","https://openalex.org/W2130339357","https://openalex.org/W3213722473","https://openalex.org/W2110944602"],"abstract_inverted_index":{"We":[0,42,65],"present":[1],"an":[2,75],"approximate":[3],"POMDP":[4],"solution":[5,24,102],"method":[6],"for":[7,26,83],"robot":[8],"planning":[9,30],"in":[10,28,62,74,97],"partially":[11],"observable":[12],"environments.":[13],"Our":[14],"algorithm":[15,68],"belongs":[16],"to":[17,92],"the":[18,56],"family":[19],"of":[20,38,58,94,99],"point-based":[21],"value":[22,50,57],"iteration":[23],"techniques":[25],"POMDP,":[27],"which":[29,84],"is":[31],"performed":[32],"only":[33],"on":[34,69,79],"a":[35,44,70],"sampled":[36],"set":[37],"reachable":[39],"belief":[40,60],"points.":[41],"describe":[43],"simple,":[45],"randomized":[46],"procedure":[47],"that":[48,53,88],"performs":[49],"update":[51],"steps":[52],"strictly":[54],"improve":[55],"all":[59],"points":[61],"each":[63],"step.":[64],"demonstrate":[66],"our":[67],"robotic":[71],"delivery":[72],"task":[73],"office":[76],"environment":[77],"and":[78,101],"several":[80],"benchmark":[81],"problems,":[82],"we":[85],"compute":[86],"solutions":[87],"are":[89],"very":[90],"competitive":[91],"those":[93],"state-of-the-art":[95],"methods":[96],"terms":[98],"speed":[100],"quality.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}