Optimal line-sweep-based decompositions for coverage algorithms
暂无分享,去创建一个
[1] Howie Choset,et al. Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .
[2] Vladimir J. Lumelsky,et al. A terrain-covering algorithm for an AUV , 1996, Auton. Robots.
[3] G. Schmidt,et al. An advanced planning and navigation approach for autonomous cleaning robot operations , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).
[4] Alexander Zelinsky,et al. Using Path Transforms to Guide the Search for Findpath in 2D , 1994, Int. J. Robotics Res..
[5] Howie Choset,et al. Exact cellular decompositions in terms of critical points of Morse functions , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[6] Elon Rimon,et al. Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[7] Eiichi Yoshida,et al. Cooperative sweeping by multiple mobile robots , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[8] Wesley H. Huang. The Minimal Sum of Altitudes Decomposition for Coverage Algorithms , 2000 .
[9] Ralph L. Hollis,et al. Complete distributed coverage of rectilinear environments , 2000 .