The visit problem: visibility graph-based solution

This publication has 8 references indexed in Scilit:

• On terrain acquisition by a point robot amidst polyhedral obstacles
  IEEE Journal on Robotics and Automation, 1988
• Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case
  IEEE Journal on Robotics and Automation, 1987
• Dynamic path planning for a mobile automaton with limited information on the environment
  IEEE Transactions on Automatic Control, 1986
• Robot navigation algorithms using learned spatial graphs
  Robotica, 1986
• A “retraction” method for planning the motion of a disc
  Journal of Algorithms, 1985
• On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
  Communications on Pure and Applied Mathematics, 1983
• An algorithm for planning collision-free paths among polyhedral obstacles
  Communications of the ACM, 1979
• Complexity of the mover's problem and generalizations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979