Online algorithms for searching and exploration in the plane (Q465662): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cosrev.2010.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033124907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Solutions for Linear Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet more on the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find a point on a line within a fixed distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ultimate strategy to search on \(m\) rays? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online searching with turn cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star search -- a different show / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Constructions of Hybrid Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel searching on \(m\) rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line parallel heuristics, processor scheduling and robot searching under the competitive framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4929404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic path planning for a mobile automaton with limited information on the environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Navigating in Unfamiliar Geometric Terrain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Online Algorithm for Improving Performance in Navigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Navigation in a Room / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line path planning in an unknown polygonal environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmische Geometrie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walking an unknown street with bounded detour / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going home through an unknown street / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walking streets faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Competitive Strategy for Walking in Streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive searching in a generalized street / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized streets revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for walking with minimum number of turns in unknown streets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight analysis of a self-approaching strategy for the online kernel-search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and on-line recognition of star-shaped polygons. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to learn an unknown environment. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive exploration of rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon exploration with time-discrete vision / rank
 
Normal rank

Latest revision as of 05:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Online algorithms for searching and exploration in the plane
scientific article

    Statements

    Online algorithms for searching and exploration in the plane (English)
    0 references
    0 references
    0 references
    24 October 2014
    0 references
    online algorithms
    0 references
    motion planning
    0 references
    competitive ratio
    0 references
    target searching
    0 references
    exploration
    0 references
    approximation algorithms
    0 references
    randomized algorithm
    0 references
    computational geometry
    0 references
    shortest path
    0 references
    minimum link path
    0 references
    visibility polygons
    0 references
    watchman route
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references