Optimal on-line algorithms for walking with minimum number of turns in unknown streets
From MaRDI portal
Publication:1370934
DOI10.1016/S0925-7721(97)00003-5zbMath0889.68146OpenAlexW2007762629MaRDI QIDQ1370934
Sanjeev Saluja, Subir Kumar Ghosh
Publication date: 28 October 1997
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00003-5
Related Items (2)
Online algorithms for searching and exploration in the plane ⋮ Walking in streets with minimal sensing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest paths without a map
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Computing the link center of a simple polygon
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- Walking an unknown street with bounded detour
- Minimum-link paths among obstacles in the plane
- A linear time algorithm for minimum link paths inside a simple polygon
- On minimal-node-cost planar embeddings
- Searching for a Mobile Intruder in a Polygonal Region
- AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
- Navigating in Unfamiliar Geometric Terrain
- -Algorithms for Minimum Link Path and Related Problems
- Computing the visibility polygon from a convex set and related problems
This page was built for publication: Optimal on-line algorithms for walking with minimum number of turns in unknown streets
