Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Spanning-tree based coverage of continuous areas by a mobile robot
Annals of Mathematics and Artificial Intelligence
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Competitive on-line coverage of grid environments by a mobile robot
Computational Geometry: Theory and Applications
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
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
Shortest paths in simple polygons with polygon-meet constraints
Information Processing Letters
Query-point visibility constrained shortest paths in simple polygons
Theoretical Computer Science
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Some problems related to good illumination
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
Approximate solution of the multiple watchman routes problem with restricted visibility range
IEEE Transactions on Neural Networks
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning
Journal of Intelligent and Robotic Systems
Self-organizing map for the multi-goal path planning with polygonal goals
ICANN'11 Proceedings of the 21th international conference on Artificial neural networks - Volume Part I
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal guard placement problem under l-visibility
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Worst-case optimal exploration of terrains with obstacles
Information and Computation
Optimal patrolling of fragmented boundaries
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
Hi-index | 0.00 |