Inspecting a Set of Strips Optimally (Q3183473): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding Popular Places / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zookeeper route problem / 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: Touring a sequence of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692936 / rank
 
Normal rank

Latest revision as of 02:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Inspecting a Set of Strips Optimally
scientific article

    Statements

    Inspecting a Set of Strips Optimally (English)
    0 references
    0 references
    0 references
    20 October 2009
    0 references
    0 references
    computational geometry
    0 references
    motion planning
    0 references
    watchman routes
    0 references
    optimal inspection path
    0 references
    optimal algorithm
    0 references
    0 references