{"id":"https://openalex.org/W2119559506","doi":"https://doi.org/10.1007/bf01840369","title":"Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape","display_name":"Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape","publication_year":1987,"publication_date":"1987-11-01","ids":{"openalex":"https://openalex.org/W2119559506","doi":"https://doi.org/10.1007/bf01840369","mag":"2119559506"},"language":"en","primary_location":{"id":"doi:10.1007/bf01840369","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01840369","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5069398285","display_name":"V. Lumelsky","orcid":"https://orcid.org/0000-0002-3605-089X"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vladimir J. Lumelsky","raw_affiliation_strings":["Yale University, 06520, New Haven, CT, USA","Yale University, New Haven, USA 06520#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, 06520, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Yale University, New Haven, USA 06520#TAB#","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032603490","display_name":"Alexander A. Stepanov","orcid":"https://orcid.org/0000-0002-9113-9440"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I90965887","display_name":"SUNY Polytechnic Institute","ror":"https://ror.org/000fxgx19","country_code":"US","type":"education","lineage":["https://openalex.org/I90965887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander A. Stepanov","raw_affiliation_strings":["Polytechnic University, 11201, Brooklyn, NY, USA","Polytechnic University, Brooklyn, USA 11201#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Polytechnic University, 11201, Brooklyn, NY, USA","institution_ids":["https://openalex.org/I90965887"]},{"raw_affiliation_string":"Polytechnic University, Brooklyn, USA 11201#TAB#","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":14.758,"has_fulltext":false,"cited_by_count":698,"citation_normalized_percentile":{"value":0.9907437,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"2","issue":"1-4","first_page":"403","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9948999881744385,"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/timed-automaton","display_name":"Timed automaton","score":0.7744369506835938},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6928477883338928},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6520867347717285},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6472185850143433},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6172150373458862},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5810296535491943},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5434426069259644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5399316549301147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5229604840278625},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5179407000541687},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5017943382263184},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4975884258747101},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4796491265296936},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4575381278991699},{"id":"https://openalex.org/keywords/continuous-automaton","display_name":"Continuous automaton","score":0.44199591875076294},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4353005886077881},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39376673102378845},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3185209631919861},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19171014428138733},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.17866212129592896},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1560552716255188},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09370455145835876}],"concepts":[{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.7744369506835938},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6928477883338928},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6520867347717285},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6472185850143433},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6172150373458862},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5810296535491943},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5434426069259644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5399316549301147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5229604840278625},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5179407000541687},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5017943382263184},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4975884258747101},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4796491265296936},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4575381278991699},{"id":"https://openalex.org/C21720249","wikidata":"https://www.wikidata.org/wiki/Q5165460","display_name":"Continuous automaton","level":5,"score":0.44199591875076294},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4353005886077881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39376673102378845},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3185209631919861},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19171014428138733},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.17866212129592896},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1560552716255188},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09370455145835876},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01840369","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01840369","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W3795417","https://openalex.org/W343398956","https://openalex.org/W606533219","https://openalex.org/W1502820991","https://openalex.org/W1512267351","https://openalex.org/W1516493184","https://openalex.org/W1546437343","https://openalex.org/W1558446093","https://openalex.org/W1602132814","https://openalex.org/W1873987791","https://openalex.org/W1981578278","https://openalex.org/W1988557746","https://openalex.org/W1996235018","https://openalex.org/W2001804342","https://openalex.org/W2008699161","https://openalex.org/W2011774530","https://openalex.org/W2024403195","https://openalex.org/W2033013465","https://openalex.org/W2042106485","https://openalex.org/W2059056887","https://openalex.org/W2122068934","https://openalex.org/W2139390199","https://openalex.org/W2141074723","https://openalex.org/W2163178194","https://openalex.org/W2481560098","https://openalex.org/W2735847404","https://openalex.org/W2799049976","https://openalex.org/W3140424958","https://openalex.org/W6638062682"],"related_works":["https://openalex.org/W2155870982","https://openalex.org/W1482505495","https://openalex.org/W2321527407","https://openalex.org/W1645283535","https://openalex.org/W2109003011","https://openalex.org/W2040844343","https://openalex.org/W2127219675","https://openalex.org/W2120347230","https://openalex.org/W2587737670","https://openalex.org/W2119559506"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":21},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":26},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":25},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":18}],"updated_date":"2026-08-19T15:00:24.278416","created_date":"2025-10-10T00:00:00"}