{"id":"https://openalex.org/W2028838947","doi":"https://doi.org/10.1109/iros.2005.1545548","title":"Hierarchical dynamic programming for robot path planning","display_name":"Hierarchical dynamic programming for robot path planning","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2028838947","doi":"https://doi.org/10.1109/iros.2005.1545548","mag":"2028838947"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2005.1545548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2005.1545548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-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/A5047249695","display_name":"Boudewijn Bakker","orcid":"https://orcid.org/0000-0003-0229-1123"},"institutions":[{"id":"https://openalex.org/I4210105785","display_name":"Intelligent Systems Research (United States)","ror":"https://ror.org/01reevc91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210105785"]},{"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","US"],"is_corresponding":true,"raw_author_name":"B. Bakker","raw_affiliation_strings":["Intelligent Autonomous Systems group, Informatics Institute, University of Amsterdam, Amsterdam, Netherlands","[Informatics Inst., Amsterdam Univ., Netherlands]"],"affiliations":[{"raw_affiliation_string":"Intelligent Autonomous Systems group, Informatics Institute, University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I4210105785"]},{"raw_affiliation_string":"[Informatics Inst., Amsterdam Univ., Netherlands]","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067264401","display_name":"Zoran \u017divkovi\u0107","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"]},{"id":"https://openalex.org/I4210105785","display_name":"Intelligent Systems Research (United States)","ror":"https://ror.org/01reevc91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210105785"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Z. Zivkovic","raw_affiliation_strings":["Intelligent Autonomous Systems group, Informatics Institute, University of Amsterdam, Amsterdam, Netherlands","[Informatics Inst., Amsterdam Univ., Netherlands]"],"affiliations":[{"raw_affiliation_string":"Intelligent Autonomous Systems group, Informatics Institute, University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I4210105785"]},{"raw_affiliation_string":"[Informatics Inst., Amsterdam Univ., Netherlands]","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049349937","display_name":"Ben Kr\u00f6se","orcid":"https://orcid.org/0000-0003-1237-0618"},"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/I4210105785","display_name":"Intelligent Systems Research (United States)","ror":"https://ror.org/01reevc91","country_code":"US","type":"company","lineage":["https://openalex.org/I4210105785"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"B. Krose","raw_affiliation_strings":["Intelligent Autonomous Systems group, Informatics Institute, University of Amsterdam, Amsterdam, Netherlands","[Informatics Inst., Amsterdam Univ., Netherlands]"],"affiliations":[{"raw_affiliation_string":"Intelligent Autonomous Systems group, Informatics Institute, University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I4210105785"]},{"raw_affiliation_string":"[Informatics Inst., Amsterdam Univ., Netherlands]","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047249695"],"corresponding_institution_ids":["https://openalex.org/I4210105785","https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":4.1784,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.94568217,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2756","last_page":"2761"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9955999851226807,"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":0.9929999709129333,"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/computer-science","display_name":"Computer science","score":0.764053463935852},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7188482880592346},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6787431836128235},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6615872979164124},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6216346621513367},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5886780619621277},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5346701741218567},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5170201063156128},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48455849289894104},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4398718774318695},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3514273464679718},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.35064589977264404},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34396836161613464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16443979740142822},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11024948954582214},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09906005859375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08062994480133057}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.764053463935852},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7188482880592346},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6787431836128235},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6615872979164124},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6216346621513367},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5886780619621277},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5346701741218567},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5170201063156128},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48455849289894104},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4398718774318695},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3514273464679718},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.35064589977264404},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34396836161613464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16443979740142822},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11024948954582214},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09906005859375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08062994480133057},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/iros.2005.1545548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2005.1545548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/0ad83ec5-8bea-4c80-bf5f-bdb25efe2fbe","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/hierarchical-dynamic-programming-for-robot-path-planning(0ad83ec5-8bea-4c80-bf5f-bdb25efe2fbe).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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bakker, B, Zivkovic, Z & Kr\u00f6se, B J A 2005, Hierarchical dynamic programming for robot path planning. in Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems. pp. 3720-3725.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/0ad83ec5-8bea-4c80-bf5f-bdb25efe2fbe","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/hierarchical-dynamic-programming-for-robot-path-planning(0ad83ec5-8bea-4c80-bf5f-bdb25efe2fbe).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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bakker, B, Zivkovic, Z & Kr\u00f6se, B J A 2005, Hierarchical dynamic programming for robot path planning. in Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems. pp. 3720-3725.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/0ad83ec5-8bea-4c80-bf5f-bdb25efe2fbe","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/hierarchical-dynamic-programming-for-robot-path-planning(0ad83ec5-8bea-4c80-bf5f-bdb25efe2fbe).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/RSJ International Conference on Intelligent Robots and Systems, 3720 - 3725","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1578521162","https://openalex.org/W1783217918","https://openalex.org/W2030021468","https://openalex.org/W2090170700","https://openalex.org/W2098432798","https://openalex.org/W2104363892","https://openalex.org/W2107246263","https://openalex.org/W2121517924","https://openalex.org/W2121947440","https://openalex.org/W2131859829","https://openalex.org/W2133402530","https://openalex.org/W2151103935","https://openalex.org/W2160371091","https://openalex.org/W2197429696","https://openalex.org/W6634579893","https://openalex.org/W6638012933","https://openalex.org/W6683821272"],"related_works":["https://openalex.org/W4389475841","https://openalex.org/W4241327272","https://openalex.org/W2120406836","https://openalex.org/W1996214847","https://openalex.org/W2903299703","https://openalex.org/W4211224558","https://openalex.org/W4385342861","https://openalex.org/W1672382258","https://openalex.org/W2117282672","https://openalex.org/W2119790124"],"abstract_inverted_index":{"This":[0,69],"paper":[1],"addresses":[2],"the":[3,51,74,86,101],"question":[4],"how":[5],"robot":[6,111,116],"planning":[7,24],"(e.g.":[8],"for":[9,21,25,45,54],"navigation)":[10],"can":[11],"be":[12],"done":[13],"with":[14],"hierarchical":[15,22,87],"maps.":[16],"We":[17,99],"present":[18],"an":[19,119],"algorithm":[20],"path":[23],"stochastic":[26],"tasks,":[27],"based":[28],"on":[29,103,109],"Markov":[30],"decision":[31],"processes":[32],"(MDPs)":[33],"and":[34,60,80,84,89,108],"dynamic":[35,43],"programming.":[36],"It":[37],"is":[38],"more":[39],"efficient":[40],"than":[41],"standard":[42],"programming":[44],"\"flat\"":[46],"MDPs,":[47],"because":[48],"it":[49,61],"reduces":[50],"state":[52],"space":[53],"all":[55],"levels":[56],"in":[57,90,118],"its":[58],"hierarchy":[59],"allows":[62],"reuse":[63],"of":[64,76],"previously":[65],"computed":[66],"partial":[67],"policies.":[68],"computational":[70],"advantage":[71],"comes":[72],"at":[73],"cost":[75],"some":[77,91],"extra":[78],"memory":[79],"overhead":[81],"to":[82,96],"represent":[83],"coordinate":[85],"system,":[88],"cases":[92],"somewhat":[93],"longer":[94],"paths":[95],"target":[97],"locations.":[98],"demonstrate":[100],"method":[102],"artificially":[104],"generated":[105],"MDP":[106],"data,":[107],"real":[110],"data":[112],"from":[113],"our":[114],"vision-controlled":[115],"navigating":[117],"office":[120],"environment.":[121]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}