Multivalue coding: application to autonomous robot path planning with rotations
暂无分享,去创建一个
[1] Hannan Samet,et al. Region representation: Quadtrees from binary arrays , 1980 .
[2] Chee-Keng Yap,et al. Moving a polygon around the corner in a corridor , 1986, SCG '86.
[3] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[4] Jean-Daniel Boissonnat,et al. A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.
[5] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[6] Rodney A. Brooks,et al. A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[7] Carme Torras,et al. The Classical 2D Find-Path Problem : Improving Search Efficiency By Using Orientation Heuristics , 1987, Other Conferences.
[8] A. Pruski. Multi-robot path planning among moving obstacles using multivalue codes , 1990, [1990] Proceedings. Rensselaer's Second International Conference on Computer Integrated Manufacturing.
[9] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .