Exploring and Triangulating a Region by a Swarm of Robots

DOI10.1007/978-3-642-22935-0_18zbMath1343.68248OpenAlexW1889182533MaRDI QIDQ3088095

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

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

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)

Related Items (2)

Coordinating Swarms of Objects at Extreme Dimensions ⋮ Guarding a Polygon Without Losing Touch

Cites Work

• A survey on relay placement with runtime and approximation guarantees
• Polygon exploration with time-discrete vision
• A short proof of Chvatal's Watchman Theorem
• A combinatorial theorem in plane geometry
• The Polygon Exploration Problem
• Distributed Algorithms for Dispersion in Indoor Environments Using a Swarm of Autonomous Mobile Robots
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Improved Approximation Algorithms for Relay Placement
• Minimum Covering with Travel Cost
• The Problem of Compatible Representatives
• 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
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Computing and Combinatorics

This page was built for publication: Exploring and Triangulating a Region by a Swarm of Robots