Competitive on-line coverage of grid environments by a mobile robot (Q1869751): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for lawn mowing and milling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning-tree based coverage of continuous areas by a mobile robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and Planning for Sensor Based Intelligent Robot Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing competitive tours from local information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman routes under limited visibility / rank
 
Normal rank

Latest revision as of 15:35, 5 June 2024

scientific article
Language Label Description Also known as
English
Competitive on-line coverage of grid environments by a mobile robot
scientific article

    Statements

    Competitive on-line coverage of grid environments by a mobile robot (English)
    0 references
    0 references
    0 references
    28 April 2003
    0 references
    0 references
    mobile robot covering
    0 references
    competitive covering
    0 references
    sensor based covering
    0 references
    on-line spanning tree construction
    0 references