Towards an Efficient Use of Memory in Evaluation of Configuration Space of a Robot
暂无分享,去创建一个
[1] P. Vega,et al. Fast Procedure to Obstacle Representation in the Configuration Space for Mobile Robots , 1998 .
[2] Barry Brumitt,et al. Framed-quadtree path planning for mobile robots operating in sparse environments , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[3] Kamal Gupta,et al. Octree‐based hierarchical distance maps for collision detection , 1997 .
[4] Micha Sharir,et al. Efficient algorithms for planning purely translational collision-free motion in two and three dimensions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[5] Wyatt S. Newman,et al. High speed robot control and obstacle avoidance using dynamic potential functions , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[6] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[7] Irene Gargantini,et al. An effective way to represent quadtrees , 1982, CACM.
[8] Lydia E. Kavraki. Computation of configuration-space obstacles using the fast Fourier transform , 1995, IEEE Trans. Robotics Autom..