{"id":"https://openalex.org/W1486957317","doi":"https://doi.org/10.1007/978-1-4613-8997-2_27","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":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W1486957317","doi":"https://doi.org/10.1007/978-1-4613-8997-2_27","mag":"1486957317"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4613-8997-2_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4613-8997-2_27","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Robot Vehicles","raw_type":"book-chapter"},"type":"book-chapter","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, New Haven, CT, 06520, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, 06520, USA","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander A. Stepanov","raw_affiliation_strings":["Polytechnic University, Brooklyn, NY, 11201, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Polytechnic University, Brooklyn, NY, 11201, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5761,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.64659271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"363","last_page":"390"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.995199978351593,"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.9944999814033508,"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.7441673278808594},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.708163857460022},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6950705051422119},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.630888819694519},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6032308340072632},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5775807499885559},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5474361777305603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5352794528007507},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5193834900856018},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5167664289474487},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49507036805152893},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4813195466995239},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4603251516819},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.41522693634033203},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4105852544307709},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.40001168847084045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3525265157222748},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2917943000793457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20033162832260132},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.198564350605011},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.14672550559043884},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09061628580093384},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07515594363212585}],"concepts":[{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.7441673278808594},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.708163857460022},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6950705051422119},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.630888819694519},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6032308340072632},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5775807499885559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5474361777305603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5352794528007507},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5193834900856018},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5167664289474487},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49507036805152893},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4813195466995239},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4603251516819},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.41522693634033203},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4105852544307709},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.40001168847084045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3525265157222748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2917943000793457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20033162832260132},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.198564350605011},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.14672550559043884},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09061628580093384},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07515594363212585},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-1-4613-8997-2_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4613-8997-2_27","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Autonomous Robot Vehicles","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.156.7780","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.7780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.owlnet.rice.edu/~comp450/papers/bug.algorithmica1987.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"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/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/W2408583837","https://openalex.org/W1482505495","https://openalex.org/W1990283467","https://openalex.org/W2404099564","https://openalex.org/W2321527407","https://openalex.org/W186350370","https://openalex.org/W3135656023","https://openalex.org/W2042728676","https://openalex.org/W2091988401","https://openalex.org/W2522171317"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
