Mapping in unknown graph-like worlds

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-4563(199608)13:8<539::AID-ROB5>3.0.CO;2-O" /><539::AID-ROB5>3.0.CO;2-O 10.1002/(SICI)1097-4563(199608)13:8<539::AID-ROB5>3.0.CO;2-OzbMath0879.68113OpenAlexW2061869173MaRDI QIDQ4346513

S. Hadjres, Gregory Dudek, Paul Freedman

Publication date: 3 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-4563(199608)13:8<539::aid-rob5>3.0.co;2-o

zbMATH Keywords

mobile robotgraph-like worlds

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99) Artificial intelligence (68T99)

Related Items (3)

Reconstructing visibility graphs with simple robots ⋮ Graph exploration with robot swarms ⋮ Reconstructing Visibility Graphs with Simple Robots

Cites Work

• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Mapping in unknown graph-like worlds