Optimal on-line algorithms for walking with minimum number of turns in unknown streets
type: Item
instance of: scholarly article
title: Optimal on-line algorithms for walking with minimum number of turns in unknown streets
zbMATH Open document ID: 0889.68146
DOI: 10.1016/S0925-7721(97)00003-5
author: Subir Kumar Ghosh
author: Sanjeev Saluja
published in: Computational Geometry
publication date: 1997-10-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1080146
zbMATH Keywords: street
zbMATH Keywords: on-line algorithm
MaRDI profile type: Publication
cites work: Navigating in Unfamiliar Geometric Terrain
cites work: AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
cites work: -Algorithms for Minimum Link Path and Related Problems
cites work: An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
cites work: Q4886076
cites work: Computing the visibility polygon from a convex set and related problems
cites work: Q3140448
cites work: Walking an unknown street with bounded detour
cites work: Q4335188
cites work: Computing the link center of a simple polygon
cites work: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
cites work: Minimum-link paths among obstacles in the plane
cites work: Shortest paths without a map
cites work: On minimal-node-cost planar embeddings
cites work: A linear time algorithm for minimum link paths inside a simple polygon
cites work: Searching for a Mobile Intruder in a Polygonal Region
cites work: Q3775016
full work available at URL: s0925-7721(97)00003-5
OpenAlex ID: W2007762629
Recommended article: Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot
Recommended article: Linear-time online algorithm for inferring the shortest path graph from a walk label
Recommended article: An efficient algorithm for computing least cost paths with turn constraints
Recommended article: Q3326787
Recommended article: Optimal any-angle pathfinding in practice
Recommended article: On-line computation of minimal and maximal length paths
Recommended article: AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
Recommended article: Minimizing Walking Length in Map Matching
Recommended article: Optimal path finding in direction, location, and time dependent environments
Recommended article: Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
description: scientific article; zbMATH DE number 1080146