Simple agents learn to find their way: an introduction on mapping polygons (Q2446308): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Piecemeal graph exploration by a mobile robot. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Polygons from Scanner Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing visibility graphs with simple robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibrations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping simple polygons: how robots benefit from looking back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for reconstructing a simple polygon from its visibility angles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISTANCE VISIBILITY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Maps with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping a Polygon with Holes Using a Compass / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polygon is determined by its angles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal polygon reconstruction from stabbing information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex-edge visibility graph of a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-ratios and angles determine a polygon / rank
 
Normal rank

Latest revision as of 10:43, 8 July 2024

scientific article
Language Label Description Also known as
English
Simple agents learn to find their way: an introduction on mapping polygons
scientific article

    Statements

    Simple agents learn to find their way: an introduction on mapping polygons (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2014
    0 references
    polygon mapping
    0 references
    map construction
    0 references
    autonomous agent
    0 references
    mobile robot
    0 references
    visibility graph reconstruction
    0 references

    Identifiers

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