A competitive analysis of algorithms for searching unknown scenes (Q685600): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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/0925-7721(93)90032-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002652389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive analysis of nearest neighbor based algorithms for searching unknown scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing competitive tours from local information / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3479508 / rank
 
Normal rank

Latest revision as of 09:46, 22 May 2024

scientific article
Language Label Description Also known as
English
A competitive analysis of algorithms for searching unknown scenes
scientific article

    Statements

    A competitive analysis of algorithms for searching unknown scenes (English)
    0 references
    0 references
    0 references
    24 October 1993
    0 references
    lower bounds
    0 references
    robot motion planning
    0 references
    mapping
    0 references
    searching
    0 references
    nearest neighbor neuristic
    0 references

    Identifiers