Exploring and triangulating a region by a swarm of robots

DOI10.1007/978-3-642-22935-0_18MaRDI QIDQ3088095zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(6)

• scientific article; zbMATH DE number 6496655 (Why is no real title available?)
• 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)