Solving findpath by combination of goal-directed and randomized search
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[2] Klaus Hoermann. A Cartesian approach to findpath for industrial robots , 1987 .
[3] Bruce Randall Donald,et al. A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..
[4] Bernard Faverjon,et al. Hierarchical object models for efficient anti-collision algorithms , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[5] R. Brooks. Planning Collision- Free Motions for Pick-and-Place Operations , 1983 .
[6] E. Freund,et al. Real-Time Pathfinding in Multirobot Systems Including Obstacle Avoidance , 1988, Int. J. Robotics Res..
[7] T. Naniwa,et al. A feasible motion-planning algorithm for a mobile robot based on a quadtree representation , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[8] Jean-Claude Latombe,et al. Robot motion planning with many degrees of freedom and dynamic constraints , 1991 .
[9] Tomás Lozano-Pérez,et al. Task-level planning of pick-and-place robot motions , 1989, Computer.
[10] Chee Yap,et al. Algorithmic motion planning , 1987 .
[11] Tsutomu Hasegawa. Collision Avoidance Using Characterized Description of Free Space , 1986 .
[12] Jürg Nievergelt,et al. Wie wachsen Quad-Bäume? Overflow , 1989, Inform. Spektrum.