Approximation algorithms for lawn mowing and milling

Optimal covering tours with turn costs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Competitive on-line coverage of grid environments by a mobile robot

Computational Geometry: Theory and Applications

Minimum-cost coverage of point sets by disks

Proceedings of the twenty-second annual symposium on Computational geometry

Traversing the machining graph

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

A framework for multi-robot node coverage in sensor networks

Annals of Mathematics and Artificial Intelligence

Not being (super)thin or solid is hard: A study of grid Hamiltonicity

Computational Geometry: Theory and Applications

Polygon exploration with time-discrete vision

Computational Geometry: Theory and Applications

An Information Roadmap Method for Robotic Sensor Path Planning

Journal of Intelligent and Robotic Systems

Reduction rules deliver efficient FPT-algorithms for covering points with lines

Journal of Experimental Algorithmics (JEA)

Information-driven sensor path planning by approximate cell decomposition

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Minimum Covering with Travel Cost

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Energy constrained multi-robot sensor-based coverage path planning using capacitated arc routing approach

Robotics and Autonomous Systems

Determination of cutting direction for minimization of tool retraction length in zigzag pocket machining

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Review: Recent development in CNC machining of freeform surfaces: A state-of-the-art review

Computer-Aided Design

Optimality and competitiveness of exploring polygons by mobile robots

Information and Computation

The snowblower problem

Computational Geometry: Theory and Applications

Multi-robot exploration and terrain coverage in an unknown environment

Robotics and Autonomous Systems

Capacitated arc routing problem with deadheading demands

Computers and Operations Research

Watchman tours for polygons with holes

Computational Geometry: Theory and Applications

An improved strategy for exploring a grid polygon

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity

Minimum covering with travel cost

Journal of Combinatorial Optimization

A survey on coverage path planning for robotics

Robotics and Autonomous Systems