Visiting convex regions in a polygonal map

Authors:
Jan Faigl;Vojtch Vonásek;Libor Přeučil
Affiliations:
-;-;-
Venue:
Robotics and Autonomous Systems
Year:
2013

Citing 28
Cited 0

Optimum watchman routes

SCG '86 Proceedings of the second annual symposium on Computational geometry
New methods for computing visibility graphs

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
Watchman routes under limited visibility

Computational Geometry: Theory and Applications
The zookeeper route problem

Information Sciences: an International Journal
On recognizing unions of two convex polygons and related problems

Pattern Recognition Letters - Special issue on computational geometry
Covering polygons is hard

Journal of Algorithms
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
A randomized art-gallery algorithm for sensor placement

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
An O(n log n) algorithm for the zoo-keeper's problem

Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Touring a sequence of polygons

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Finding shortest safari routes in simple polygons

Information Processing Letters
Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing
Approximation algorithms for TSP with neighborhoods in the plane

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Planning Tours of Robotic Arms among Partitioned Goals

International Journal of Robotics Research
On the complexity of approximating tsp with neighborhoods and related problems

Computational Complexity
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem

SIBGRAPI '07 Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing
Finding the Optimal Path in 3D Spaces Using EDAs --- The Wireless Sensor Networks Scenario

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
An IP solution to the art gallery problem

Proceedings of the twenty-fifth annual symposium on Computational geometry
Robust geometric computing and optimal visibility coverage

Robust geometric computing and optimal visibility coverage
TSP with neighborhoods of varying size

Journal of Algorithms
An approximate algorithm for solving the watchman route problem

RobVis'08 Proceedings of the 2nd international conference on Robot vision
Approximate solution of the multiple watchman routes problem with restricted visibility range

IEEE Transactions on Neural Networks
An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Neurocomputing
A practical guide for using statistical tests to assess randomized algorithms in software engineering

Proceedings of the 33rd International Conference on Software Engineering
Approximate shortest paths in simple polyhedra

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning

Journal of Intelligent and Robotic Systems
On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with a variant of the multi-goal path planning in which goals are represented as convex polygons. The problem is to find a closed shortest path in a polygonal map such that all goals are visited. The proposed solution is based on a self-organizing map (SOM) algorithm for the traveling salesman problem. Neurons' weights are considered as nodes inside the polygonal domain and connected nodes represent a path that evolves according to the proposed adaptation rules. In addition, a reference algorithm based on the solution of the traveling salesman problem and the consecutive touring polygons problem is provided to find high quality solutions of the created set of problems. The problems are designed to represent various inspection and patrolling tasks and can form a kind of benchmark set for multi-goal path planning algorithms. The performance of the algorithms is examined in this problem set, which includes an instance of the watchman route problem with restricted visibility range. The proposed SOM based algorithms provide a unified approach to solve various visibility based routing problems in polygonal maps while they provide a competitive quality of solutions to the reference algorithm with significantly lower computational requirements.