Pages that link to "Item:Q1841242"
From MaRDI portal
The following pages link to Approximation algorithms for lawn mowing and milling (Q1841242):
Displaying 28 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- Multivehicle coverage control for a nonstationary spatiotemporal field (Q458754) (← links)
- An information roadmap method for robotic sensor path planning (Q614694) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- A local strategy for cleaning expanding cellular domains by simple robots (Q888433) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
- Competitive on-line coverage of grid environments by a mobile robot (Q1869751) (← links)
- Persistent coverage control for a team of agents with collision avoidance (Q2012005) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- Adaptive Action for Multi-Agent Persistent Coverage (Q2821191) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS (Q3575385) (← links)
- AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) (← links)
- TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING (Q4682152) (← links)
- Off-line exploration of rectangular cellular environments with a rectangular obstacle (Q5058395) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- The snowblower problem (Q5894212) (← links)
- Universal hinge patterns for folding strips efficiently into any grid polyhedron (Q5918984) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
- On-line exploration of rectangular cellular environments with a rectangular hole (Q6195347) (← links)
- What goes around comes around: covering tours and cycle covers with turn costs (Q6635695) (← links)
- Covering segments on a line with drones (Q6663533) (← links)
