Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Bug algorithms are motion planning algorithms inspired by insect navigation, involving an agent equipped with only a localization sensor.
“we compare it with 'Bug algorithms' (Lumelsky & Stepanov, 1987), which are motion planning algorithms inspired by insect navigation, involving an agent equipped with only a localization sensor.”
From Emergence of Maps in the Memories of Blind Navigation Agents (2023) · cites this paper as Lumelsky & Stepanov, 1987
The primary challenge for Bug algorithms is determining whether to go left or right upon reaching a wall.
“The primary challenge for Bug algorithms is determining whether to go left or right upon reaching a wall.”
From Emergence of Maps in the Memories of Blind Navigation Agents (2023) · cites this paper as Lumelsky & Stepanov, 1987
In Bug algorithms, the agent first orients itself towards the goal and then travels directly towards it until it encounters a wall, in which case it follows along the wall along one of two directions of travel.
“In these algorithms, the agent first orients itself towards the goal and then travels directly towards it until it encounters a wall, in which case it follows along the wall along one of two directions of travel.”
From Emergence of Maps in the Memories of Blind Navigation Agents (2023) · cites this paper as Lumelsky & Stepanov, 1987
Cited by
Sorted by citations
Emergence of Maps in the Memories of Blind Navigation Agents
Wijmans, E., Savva, M., Essa, I., Lee, S., Morcos, A. S., & Batra, D. (2023) · AI Matters · doi:10.1145/3609468.3609471 · Cited by 17 · see citing works
Lunar Lander Landing Site Decision in Low-Fuel Case
Seo, M.-G., Hong, S.-M., & Tahk, M.-J. (2016) · MATEC Web of Conferences · doi:10.1051/matecconf/20165409003 · Cited by 3 · see citing works
- Authors
- Lumelsky, V. J., & Stepanov, A. A.
- Affiliations
- Yale University (US)
- Venue
- Algorithmica
- Published
- 1987-11
- Volume
- 2
- Issue
- 1-4
- Pages
- 403-430
- ISSN
- 0178-4617 (ISSN-L)
- 1432-0541
- OpenAlex
- W2119559506
- Cited by
- 699
- References
- 0
- Citations by year
- 2026: 20 · 2025: 11 · 2024: 17 · 2023: 20 · 2022: 14 · 2021: 21 · 2020: 16 · 2019: 18 · 2018: 26 · 2017: 16 · 2016: 20 · 2015: 17 · 2014: 27 · 2013: 22 · 2012: 18
- FWCI
- 16.06
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithmica (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotic Path Planning Algorithms
- Physical Sciences › Computer Science › Computer Networks and Communications › Optimization and Search Problems
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Keywords
- path planning, unknown obstacles, tactile sensors, target reachability, lower bounds, upper bounds, path length, two-dimensional motion
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
