Exploring and triangulating a region by a swarm of robots

DOI10.1007/978-3-642-22935-0_18zbMATH Open1343.68248OpenAlexW1889182533MaRDI QIDQ3088095FDOQ3088095

Authors: Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt 

Publication date: 17 August 2011

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_18

Recommendations

• Online exploration and triangulation in orthogonal polygonal regions
• Why Robots Need Maps
• Optimality and Competitiveness of Exploring Polygons by Mobile Robots
• Optimality and competitiveness of exploring polygons by mobile robots
• Spanning-tree based coverage of continuous areas by a mobile robot

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Cites Work

• Distributed algorithms for dispersion in indoor environments using a swarm of autonomous mobile robots
• A short proof of Chvatal's Watchman Theorem
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The Problem of Compatible Representatives
• The polygon exploration problem
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• A combinatorial theorem in plane geometry
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Polygon exploration with time-discrete vision
• Minimum covering with travel cost
• A survey on relay placement with runtime and approximation guarantees
• Computing and Combinatorics

Cited In (6)

• Title not available (Why is that?)
• Static and expanding grid coverage with ant robots: complexity results
• Guarding a Polygon Without Losing Touch
• Coordinating Swarms of Objects at Extreme Dimensions
• Grid exploration by a swarm of autonomous robots with minimum repetitions
• Online exploration and triangulation in orthogonal polygonal regions

This page was built for publication: Exploring and triangulating a region by a swarm of robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088095)