A morphological approach to shortest path planning for rotating objects
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[2] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[3] Vladimir J. Lumelsky,et al. Algorithmic and complexity issues of robot motion in an uncertain environment , 1987, J. Complex..
[4] Shyang Chang,et al. A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes , 1993, IEEE Trans. Syst. Man Cybern..
[5] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[6] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[7] Pijush K. Ghosh,et al. A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations , 1990, Comput. Vis. Graph. Image Process..
[8] Larry S. Davis,et al. Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..
[9] Richard M. Murray,et al. A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..
[10] Jim Piper,et al. Computing distance transformations in convex and non-convex domains , 1987, Pattern Recognit..
[11] L. Shepp,et al. OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .
[12] Jean Serra,et al. Image Analysis and Mathematical Morphology , 1983 .