A unified solution to coverage and search in explored and unexplored terrains using indirect control
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. c 18, 2113-2119
- https://doi.org/10.1109/robot.1990.126317
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Least cost paths with algebraic cost functions. Part 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A probabilistic approach to collision-free robot path planningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Multiresolution path planning for mobile robotsIEEE Journal on Robotics and Automation, 1986
- Some Heuristics for the Navigation of a RobotThe International Journal of Robotics Research, 1985
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Content-Addressable Read/Write Memories for Image AnalysisIEEE Transactions on Computers, 1982
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- A Method for Solving Arbitrary-Wall Mazes by ComputerIEEE Transactions on Computers, 1969