{"id":"https://openalex.org/W2015034115","doi":"https://doi.org/10.1109/70.88018","title":"A hierarchical strategy for path planning among moving obstacles (mobile robot)","display_name":"A hierarchical strategy for path planning among moving obstacles (mobile robot)","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W2015034115","doi":"https://doi.org/10.1109/70.88018","mag":"2015034115"},"language":"en","primary_location":{"id":"doi:10.1109/70.88018","doi":"https://doi.org/10.1109/70.88018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/70.88018","pdf_url":null,"source":{"id":"https://openalex.org/S116420536","display_name":"IEEE Transactions on Robotics and Automation","issn_l":"1042-296X","issn":["1042-296X","2374-958X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics and Automation","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5112249344","display_name":"Kikuo Fujimura","orcid":"https://orcid.org/0009-0008-8945-7889","observed_orcids":["https://orcid.org/0009-0008-8945-7889"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Fujimura","raw_affiliation_strings":["Center for Automation Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Automation Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087437068","display_name":"Hanan Samet","orcid":"https://orcid.org/0000-0001-8230-0653","observed_orcids":["https://orcid.org/0000-0001-8230-0653"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Samet","raw_affiliation_strings":["Center for Automation Research, the Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Automation Research, the Computer Science Department and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":14.9451,"has_fulltext":false,"cited_by_count":227,"citation_normalized_percentile":{"value":0.99215165,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"5","issue":"1","first_page":"61","last_page":"69"},"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/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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.0,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.8999999761581421},{"id":"https://openalex.org/keywords/dynamic-obstacles","display_name":"dynamic obstacles","score":0.972000002861023},{"id":"https://openalex.org/keywords/mobile-robots","display_name":"mobile robots","score":0.890999972820282},{"id":"https://openalex.org/keywords/hierarchical-planning","display_name":"hierarchical planning","score":0.7910000085830688},{"id":"https://openalex.org/keywords/time-optimal-paths","display_name":"time-optimal paths","score":0.6650000214576721},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"collision avoidance","score":0.8949999809265137},{"id":"https://openalex.org/keywords/velocity-and-acceleration-constraints","display_name":"velocity and acceleration constraints","score":0.8479999899864197},{"id":"https://openalex.org/keywords/polygonal-obstacles","display_name":"polygonal obstacles","score":0.7269999980926514}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6787405014038086},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6409315466880798},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6128847599029541},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.6061089634895325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.600502073764801},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5453571081161499},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5289571285247803},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5112524032592773},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4991130828857422},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4590020179748535},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4510483145713806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3606959581375122},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.3213110864162445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2604061961174011},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2089080512523651},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.062429457902908325},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/70.88018","doi":"https://doi.org/10.1109/70.88018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/70.88018","pdf_url":null,"source":{"id":"https://openalex.org/S116420536","display_name":"IEEE Transactions on Robotics and Automation","issn_l":"1042-296X","issn":["1042-296X","2374-958X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics and Automation","raw_type":"journal-article"},{"id":"mag:2115416448","doi":null,"is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/abstract/document/88018","pdf_url":null,"source":{"id":"https://openalex.org/S105799543","display_name":"IEEE Journal on Robotics and Automation","issn_l":"0882-4967","issn":["0882-4967","2374-8710"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"IEEE Journal on Robotics and Automation","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":34,"referenced_works":["https://openalex.org/W857723314","https://openalex.org/W972117246","https://openalex.org/W1502820991","https://openalex.org/W1520481592","https://openalex.org/W1602132814","https://openalex.org/W1620863146","https://openalex.org/W1861436941","https://openalex.org/W2004815408","https://openalex.org/W2009796613","https://openalex.org/W2022563976","https://openalex.org/W2024175716","https://openalex.org/W2024403195","https://openalex.org/W2029243826","https://openalex.org/W2040857694","https://openalex.org/W2055891854","https://openalex.org/W2065283065","https://openalex.org/W2075495470","https://openalex.org/W2088630449","https://openalex.org/W2090170700","https://openalex.org/W2090544108","https://openalex.org/W2097856935","https://openalex.org/W2099034771","https://openalex.org/W2108420409","https://openalex.org/W2135368250","https://openalex.org/W2139390199","https://openalex.org/W2141825555","https://openalex.org/W2152475379","https://openalex.org/W2163178194","https://openalex.org/W2166462345","https://openalex.org/W2170220350","https://openalex.org/W2312064194","https://openalex.org/W2763160685","https://openalex.org/W4237026528","https://openalex.org/W6623441187"],"related_works":["https://openalex.org/W2115416448","https://openalex.org/W2098698107","https://openalex.org/W2080738436","https://openalex.org/W44174512","https://openalex.org/W2124480034","https://openalex.org/W2164059521","https://openalex.org/W2155974215","https://openalex.org/W2141692355","https://openalex.org/W1589443075","https://openalex.org/W1947701491"],"abstract_inverted_index":{"A":[0],"method":[1],"is":[2,40],"presented":[3],"for":[4,28,112],"planning":[5],"a":[6,15,26,29,70,118],"path":[7,27],"in":[8,34,65],"the":[9,21,35,47,50,55,59,66,75,92,109,113],"presence":[10],"of":[11,17,46,49,95],"moving":[12,19,60,83],"obstacles.":[13],"Given":[14],"set":[16],"polygonal":[18],"obstacles,":[20,84],"authors":[22,56,102],"focus":[23],"on":[24],"generating":[25],"mobile":[30],"robot":[31,76],"that":[32],"navigates":[33],"two-dimensional":[36],"plane.":[37],"Their":[38],"methodology":[39],"to":[41,57,72,107],"include":[42],"time":[43],"as":[44,62],"one":[45],"dimensions":[48],"model":[51,106],"world.":[52,68],"This":[53],"enables":[54],"regard":[58],"obstacles":[61],"being":[63],"stationary":[64],"extended":[67],"For":[69],"solution":[71,120],"be":[73],"feasible,":[74],"must":[77,88],"not":[78],"collide":[79],"with":[80],"any":[81],"other":[82],"and,":[85],"also,":[86],"it":[87],"navigate":[89],"without":[90],"exceeding":[91],"predetermined":[93],"range":[94],"velocity,":[96],"acceleration,":[97],"and":[98,116],"centrifugal":[99],"force.":[100],"The":[101],"investigate":[103],"an":[104],"appropriate":[105],"represent":[108],"extend":[110],"world":[111],"path-planning":[114],"task,":[115],"give":[117],"time-optimal":[119],"using":[121],"this":[122],"model.>":[123]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}