A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
暂无分享,去创建一个
[1] Micha Sharir,et al. An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space , 1990, Discret. Comput. Geom..
[2] Ellis L. Johnson. On shortest paths and sorting , 1972, ACM Annual Conference.
[3] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .
[4] Jean-Daniel Boissonnat,et al. Polygon Placement Under Translation and Rotation , 1988, RAIRO Theor. Informatics Appl..
[5] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[6] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] Micha Sharir,et al. Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..
[9] Jean-Daniel Boissonnat,et al. Simultaneous containment of several polygons , 1987, SCG '87.
[10] Rodney A. Brooks,et al. A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.