A fast path-planning algorithm by synchronizing modification and search of its path graph (mobile robots)
暂无分享,去创建一个
[1] Hanan Samet,et al. An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Azriel Rosenfeld,et al. Region representation: boundary codes from quadtrees , 1980, CACM.
[3] Larry S. Davis,et al. Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..
[4] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[5] Hanan Samet,et al. Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..
[6] Dana H. Ballard,et al. Computer Vision , 1982 .
[7] Charles R. Dyer,et al. Experiments on Picture Representation Using Regular Decomposition , 1976 .
[8] Hanan Samet,et al. Region representation: quadtrees from boundary codes , 1980, CACM.
[9] Theodosios Pavlidis,et al. A hierarchical data structure for picture processing , 1975 .
[10] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.