A competitive analysis of nearest neighbor based algorithms for searching unknown scenes

DOI10.1007/3-540-55210-3_180zbMath1493.68341OpenAlexW1499097949MaRDI QIDQ5096778

Bala Kalyanasundaram, Kirk R. Pruhs

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55210-3_180

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Related Items (1)

A competitive analysis of algorithms for searching unknown scenes

Cites Work

• Unnamed Item
• Unnamed Item
• A competitive analysis of algorithms for searching unknown scenes
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
• Navigating in Unfamiliar Geometric Terrain

This page was built for publication: A competitive analysis of nearest neighbor based algorithms for searching unknown scenes