12.21.5 H.5. Path planning

Chapter Contents (Back)

Bajaj, C., Kin, M.S.,
Compliant Motion Planning With Geometric Models,
CG(87), pp. 171-180. BibRef

Clarkson, K.L., Kapoor, S., Vaidya, P.M.,
Rectilinear Shortest Paths Through Polygonal Obstacles In O(Nlog2n) Time,
CG(87), pp. 251-257. BibRef

Slack, M.G., Miller, D.P.,
Path Planning Through Time And Space In Dynamic Domains,
IJCAI(87), pp. 1067-1070. BibRef

Chubb, D.W.J.,
An Introduction And Analysis Of A Straight Line Path Algorithm For Use In Binary Domains,
SRMSF(87), pp. 220-229. BibRef

Miller, D.P., Slack, M.G.,
Efficient Navigation Through Dynamic Domains,
SRMSF(87), pp. 230-239. BibRef

Sifrony, S., Sharir, M.,
A New Efficient Motion-Planning Algorithm For A Rod In Two-Dimensional Polygonal Space,
ALGORITHMICA(2), 1987, pp. 367-402. BibRef

Lumelsky, V.J., Stepanov, A.A.,
Path-Planning Strategies For A Point Mobile Automaton Moving Amidst Unknown Obstacles Of Arbitrary Shape,
ALGORITHMICA(2), 1987, pp. 403-430. BibRef

O'Dunlaing, C.,
Motion Planning With Inertial Constraints,
ALGORITHMICA(2), 1987, pp. 431-475. BibRef

Erdmann, M., Lozano-Perez, T.,
On Multiple Moving Objects,
ALGORITHMICA(2), 1987, pp. 477-521. BibRef

Papadimitriou, C.H., Silverberg, E.B.,
Optimal Piecewise Linear Motion Of An Object Among Obstacles,
ALGORITHMICA(2), 1987, pp. 523-539. BibRef

Schwartz, J.T., Sharir, M.,
On The ``Piano Movers'' Problem .1. The Case Of A Two-Dimensional Rigid Polygonal Body Moving Amidst Polygonal Barriers,
COMM. PURE APPL. MATH.(36), 1983, pp. 345-398. BibRef

Leven, D., Sharir, M.,
Planning A Purely Translational Motion For A Convex Object In A Two Dimensional Space Using Generalized Voronoi Diagrams,
DCG(2), 1987, pp. 9-31. BibRef

Leven, D., Sharir, M.,
On The Number Of Critical Free Contacts Of A Convex Polygonal Object Moving In Two-Dimensional Polygonal Space,
DCG(2), 1987, pp. 255-270. BibRef

Leven, D., Sharir, M.,
An Efficient And Simple Motion Planning Algorithm For A Ladder Amidst Polygonal Barriers,
J. ALGORITHMS(8), 1987, pp. 192-215. BibRef

Lumelsky, V.J.,
Algorithmic And Complexity Issues Of Robot Motion In An Uncertain Environment,
J. COMPLEXITY(3), 1987, pp. 146-182. BibRef

Kantabutra, V., Kosaraju, S.R.,
New Algorithms For Multilink Robot Arms,
J. COMPUTER & SYSTEM SCIENCES(32), 1986, pp. 136-153. BibRef

Singh, J.S., Wagh, M.D.,
Robot Path Planning Using Intersecting Convex Shapes: Analysis And Simulation,
J-RA(3), 1987, pp. 101-108. BibRef

Yap, C.K.,
How To Move A Chair Through A Door,
J-RA(3), 1987, pp. 172-181. BibRef

Reif, J.H., Storer, J.H.,
Minimizing Turns For Discrete Movement In The Interior Of A Polygon,
J-RA(3), 1987, pp. 182-193. BibRef

Lumelsky, V.J.,
Effect Of Kinematics On Motion Planning For Planar Robot Arms Moving Amidst Unknown Obstacles,
J-RA(3), 1987, pp. 207-223. BibRef

Sharir, M.,
On Shortest Paths Amidst Convex Polyhedra,
SIAM JC(16), 1987, pp. 561-572. BibRef

Rueb, K.D., Wong, A.K.C.,
Structuring Free Space As A Hypergraph For Roving Robot Path Planning And Navigation,
T-PAMI(9), 1987, pp. 263-273. BibRef

Lee, B.H., Lee, C.S.G.,
Collision-Free Motion Planning Of Two Robots,
T-SMC(17), 1987, pp. 21-32. BibRef

Reynolds, C.W.,
Flocks, Herds, And Schools: A Distributed Behavioral Model,
SIGGRAPH(87), pp. 25-34. BibRef

Chapter on Rosenfeld Bibliography for 1987 continues in
I. Color and texture .

Last update:Jun 7, 2018 at 10:14:50