• Computer Science
  • Published in ECMR 2011

A Multi-Goal Path Planning for Goal Regions in the Polygonal Domain

@inproceedings{Faigl2011AMP,
  title={A Multi-Goal Path Planning for Goal Regions in the Polygonal Domain},
  author={Jan Faigl and Vojtech Von{\'a}sek and Libor Preucil},
  booktitle={ECMR},
  year={2011}
}
This paper concerns a variant of the multi-goal path planning problem in which goals may be polygonal regions. 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 algorithm for the traveling salesman problem, which is extended to the polygonal goals. Neurons’ weights are considered as nodes inside the polygonal domain and connected nodes represent a path that evolves according to the proposed… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Multiple-goals path planning for coordinate measuring machines

  • Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)
  • 2000
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

An Application of Self - Organizing Map in the non - Euclidean Traveling Salesman Problem

Miroslav Kulich Jan Faigl, Vojtěch Vonásek, Libor Přeučil
  • Neurocomputing
  • 2011

Přeučil. A sensor placement algorithm for a mobile robot inspection planning

Jan Faigl, Miroslav Kulich, Libor
  • Journal of Intelligent & Robotic Systems,
  • 2011
VIEW 1 EXCERPT