{"id":"https://openalex.org/W2910440137","doi":"https://doi.org/10.1109/iros.2018.8594124","title":"Minimal Construct: Efficient Shortest Path Finding for Mobile Robots in Polygonal Maps","display_name":"Minimal Construct: Efficient Shortest Path Finding for Mobile Robots in Polygonal Maps","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2910440137","doi":"https://doi.org/10.1109/iros.2018.8594124","mag":"2910440137"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2018.8594124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2018.8594124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5028760340","display_name":"Marcell Missura","orcid":"https://orcid.org/0000-0002-7964-9608"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marcell Missura","raw_affiliation_strings":["Humanoid Robots Lab, University of Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Humanoid Robots Lab, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007905483","display_name":"Daniel D. Lee","orcid":"https://orcid.org/0000-0002-2163-2686"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel D. Lee","raw_affiliation_strings":["GRASP Laboratory, University of Pennsylvania, USA"],"affiliations":[{"raw_affiliation_string":"GRASP Laboratory, University of Pennsylvania, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103231515","display_name":"Maren Bennewitz","orcid":"https://orcid.org/0000-0003-4343-3028"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maren Bennewitz","raw_affiliation_strings":["Humanoid Robots Lab, University of Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Humanoid Robots Lab, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028760340"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.79597838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"7918","last_page":"7923"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922000169754028,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/visibility-graph","display_name":"Visibility graph","score":0.8909081220626831},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7586817741394043},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7391678094863892},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6849061250686646},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.669570803642273},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5703953504562378},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.547889769077301},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5249428749084473},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4875931143760681},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.45604944229125977},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4391440749168396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41853514313697815},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.41792115569114685},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39076006412506104},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.36877572536468506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32035019993782043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23590132594108582},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.09618270397186279}],"concepts":[{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.8909081220626831},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7586817741394043},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7391678094863892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6849061250686646},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.669570803642273},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5703953504562378},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.547889769077301},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5249428749084473},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4875931143760681},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.45604944229125977},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4391440749168396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41853514313697815},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.41792115569114685},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39076006412506104},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.36877572536468506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32035019993782043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23590132594108582},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.09618270397186279},{"id":"https://openalex.org/C153294291","wikidata":"https://www.wikidata.org/wiki/Q25261","display_name":"Meteorology","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2018.8594124","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2018.8594124","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1482503584","https://openalex.org/W1562669166","https://openalex.org/W1585104299","https://openalex.org/W1969483458","https://openalex.org/W1972267259","https://openalex.org/W1986014106","https://openalex.org/W2014320134","https://openalex.org/W2016584965","https://openalex.org/W2028945152","https://openalex.org/W2030021468","https://openalex.org/W2039204626","https://openalex.org/W2125865439","https://openalex.org/W2144717132","https://openalex.org/W2161754147","https://openalex.org/W2163178194","https://openalex.org/W2163852435","https://openalex.org/W2186669126","https://openalex.org/W2294319407","https://openalex.org/W2295752869","https://openalex.org/W2754478322","https://openalex.org/W2901136733","https://openalex.org/W2963872397","https://openalex.org/W6633601543","https://openalex.org/W6684051851","https://openalex.org/W6696955428","https://openalex.org/W6756486208"],"related_works":["https://openalex.org/W2903317761","https://openalex.org/W2163318972","https://openalex.org/W2614449343","https://openalex.org/W4313288967","https://openalex.org/W2377950158","https://openalex.org/W2910440137","https://openalex.org/W2377984516","https://openalex.org/W2758202899","https://openalex.org/W3212010864","https://openalex.org/W2277626332"],"abstract_inverted_index":{"With":[0,94],"the":[1,10,16,25,32,42,53,71,74,95,99,122,126,132,176],"advent":[2],"of":[3,13,31,61,97,121,179],"polygonal":[4],"maps":[5],"finding":[6,113],"their":[7],"way":[8],"into":[9],"navigational":[11],"software":[12],"mobile":[14],"robots,":[15],"Visibility":[17,33,123,158],"Graph":[18,124,159],"can":[19,55,149],"be":[20,56,150],"used":[21],"to":[22,87],"search":[23],"for":[24,63,84,90,139],"shortest":[26,35,100,147],"collision-free":[27],"path.":[28],"The":[29],"nature":[30],"Graph-based":[34],"path":[36,101,112],"algorithms":[37],"is":[38,45],"such":[39],"that":[40,128,141],"first":[41],"entire":[43],"graph":[44,54],"computed":[46,137],"in":[47,103,131,172],"a":[48,85,91,110,118,156],"relatively":[49],"time-consuming":[50],"manner.":[51],"Then,":[52],"searched":[57],"efficiently":[58],"any":[59],"number":[60],"times":[62],"varying":[64],"start":[65],"and":[66,161,181],"target":[67],"state":[68],"combinations":[69],"with":[70,155,175],"A*":[72,168],"or":[73],"Dijkstra":[75],"algorithm.":[76],"However,":[77],"real-world":[78],"environments":[79],"are":[80,136,170],"typically":[81],"too":[82],"dynamic":[83],"map":[86],"remain":[88],"valid":[89],"long":[92],"time.":[93],"goal":[96],"obtaining":[98],"quickly":[102],"an":[104],"ever":[105],"changing":[106],"environment,":[107],"we":[108],"introduce":[109],"rapid":[111],"algorithm-Minimal":[114],"Construct-that":[115],"discovers":[116],"only":[117,138],"necessary":[119],"portion":[120],"around":[125],"obstacles":[127],"actually":[129],"get":[130],"way.":[133],"Collision":[134],"tests":[135],"lines":[140],"seem":[142],"heuristically":[143],"promising.":[144],"This":[145],"way,":[146],"paths":[148],"found":[151],"much":[152],"faster":[153],"than":[154],"state-of-the-art":[157],"algorithm":[160],"as":[162],"our":[163],"experiments":[164],"show,":[165],"even":[166],"grid-based":[167],"searches":[169],"outperformed":[171],"most":[173],"cases":[174],"added":[177],"benefit":[178],"smoother":[180],"shorter":[182],"paths.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}