{"id":"https://openalex.org/W2083907923","doi":"https://doi.org/10.1002/rob.4620070404","title":"A quadtree\u2010based path\u2010planning algorithm for a mobile robot","display_name":"A quadtree\u2010based path\u2010planning algorithm for a mobile robot","publication_year":1990,"publication_date":"1990-08-01","ids":{"openalex":"https://openalex.org/W2083907923","doi":"https://doi.org/10.1002/rob.4620070404","mag":"2083907923"},"language":"en","primary_location":{"id":"doi:10.1002/rob.4620070404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rob.4620070404","pdf_url":null,"source":{"id":"https://openalex.org/S6068926","display_name":"Journal of Robotic Systems","issn_l":"0741-2223","issn":["0741-2223","1097-4563"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Robotic Systems","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/A5113820090","display_name":"Hiroshi Noborio","orcid":null},"institutions":[{"id":"https://openalex.org/I189513530","display_name":"Osaka Electro-Communication University","ror":"https://ror.org/056bksm23","country_code":"JP","type":"education","lineage":["https://openalex.org/I189513530"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroshi Noborio","raw_affiliation_strings":["Department of Precision Engineering Osaka Electro-Communication University Neyagawa, Osaka 572, Japan","Department of Precision Engineering, Osaka Electro-Communication University, Neyagawa, Osaka, 572 Japan"],"affiliations":[{"raw_affiliation_string":"Department of Precision Engineering Osaka Electro-Communication University Neyagawa, Osaka 572, Japan","institution_ids":["https://openalex.org/I189513530"]},{"raw_affiliation_string":"Department of Precision Engineering, Osaka Electro-Communication University, Neyagawa, Osaka, 572 Japan","institution_ids":["https://openalex.org/I189513530"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088598964","display_name":"T. Naniwa","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomohide Naniwa","raw_affiliation_strings":["Department of Mechanical Engineering Osaka University Toyonaka, Osaka 560, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering Osaka University Toyonaka, Osaka 560, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110792492","display_name":"Suguru Arimoto","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Suguru Arimoto","raw_affiliation_strings":["Department of Mathematical Engineering and Information Physics University of Tokyo Bunkyo-ku, Tokyo 113, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Engineering and Information Physics University of Tokyo Bunkyo-ku, Tokyo 113, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113820090"],"corresponding_institution_ids":["https://openalex.org/I189513530"],"apc_list":null,"apc_paid":null,"fwci":1.1896,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.8157558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"7","issue":"4","first_page":"555","last_page":"574"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9948999881744385,"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"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9828000068664551,"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/quadtree","display_name":"Quadtree","score":0.7876260280609131},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.7677634954452515},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7504032850265503},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6996622085571289},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6414166688919067},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6209051609039307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6133577823638916},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6074045896530151},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5242310166358948},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.507942259311676},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.463388055562973},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.45278167724609375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4262647032737732},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4242924749851227},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.4196256697177887},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3990786671638489},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3476244807243347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23874425888061523},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22305363416671753}],"concepts":[{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.7876260280609131},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.7677634954452515},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7504032850265503},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6996622085571289},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6414166688919067},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6209051609039307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6133577823638916},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6074045896530151},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5242310166358948},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.507942259311676},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.463388055562973},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.45278167724609375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4262647032737732},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4242924749851227},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.4196256697177887},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3990786671638489},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3476244807243347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23874425888061523},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22305363416671753},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/rob.4620070404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/rob.4620070404","pdf_url":null,"source":{"id":"https://openalex.org/S6068926","display_name":"Journal of Robotic Systems","issn_l":"0741-2223","issn":["0741-2223","1097-4563"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Robotic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1602132814","https://openalex.org/W1970608706","https://openalex.org/W2000288754","https://openalex.org/W2024403195","https://openalex.org/W2029243826","https://openalex.org/W2033266778","https://openalex.org/W2049113041","https://openalex.org/W2077092884","https://openalex.org/W2090170700","https://openalex.org/W2132114646","https://openalex.org/W2163178194","https://openalex.org/W2319958627","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W2163318972","https://openalex.org/W4313288967","https://openalex.org/W2274301385","https://openalex.org/W2614449343","https://openalex.org/W3111684308","https://openalex.org/W3021321022","https://openalex.org/W2758202899","https://openalex.org/W2377984516","https://openalex.org/W2277626332","https://openalex.org/W3092234278"],"abstract_inverted_index":{"Abstract":[0],"To":[1,139],"enable":[2],"a":[3,9,13,18,32,37,48,63,68,93,119,148,180,193,197,226],"mobile":[4],"robot":[5,53,229],"to":[6,91],"select":[7],"automatically":[8],"collision\u2010free":[10,39,94,172,182,228],"path":[11,40,95,133,149,158,173,177,230],"in":[12,25,79,82,143,192],"given":[14],"workspace,":[15],"design":[16],"of":[17,47,51,62,100,112,122,135,152,175,199],"path\u2010planning":[19,33,209],"algorithm":[20,34,88,106,124,129,146,186,223],"which":[21],"must":[22],"work":[23],"efficiently":[24],"real\u2010time":[26],"is":[27,57,89,107,215],"crucial.":[28],"This":[29],"article":[30],"proposes":[31],"that":[35,195,220],"selects":[36,130,168,224],"reasonable":[38,181,227],"tying":[41],"start":[42],"and":[43,76,85,102,167],"goal":[44],"points":[45],"out":[46,134,174],"quadtree":[49,56,154,162],"representation":[50],"the":[52,71,80,87,98,110,117,123,126,128,131,136,141,145,153,157,161,170,176,185,221],"workspace.":[54],"The":[55,105],"obtained":[58],"from":[59,217],"fast":[60,169,190],"conversion":[61],"real":[64],"image":[65],"taken":[66],"through":[67],"camera":[69],"on":[70,109,160],"ceiling.":[72],"It":[73],"represents":[74],"obstacles":[75,101,200],"their":[77,103],"allocation":[78],"workspace":[81,194],"good":[83],"time":[84],"hence":[86],"able":[90],"find":[92],"while":[96,155],"following":[97],"change":[99],"allocation.":[104],"designed":[108],"basis":[111],"\u201csmall\u2010is\u2010quick\u201d":[113],"principle.":[114],"That":[115],"is,":[116,125],"smaller":[118],"search":[120,137],"space":[121],"faster":[127,225],"shortest":[132,171],"space.":[138],"put":[140],"principle":[142],"practice,":[144],"investigates":[147],"graph":[150,159,178],"instead":[151],"spreading":[156],"as":[163,165,179],"small":[164],"possible,":[166],"path.":[183],"Thus":[184],"fulfils":[187],"its":[188],"function":[189],"even":[191],"has":[196],"number":[198],"with":[201,206],"complicated":[202],"shape.":[203],"In":[204],"comparison":[205],"several":[207],"conventional":[208],"algorithms":[210],"presented":[211],"so":[212],"far,":[213],"it":[214],"shown":[216],"experimental":[218],"results":[219],"proposed":[222],"than":[231],"others.":[232]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}