Solving the two-dimensional findpath problem using a line-triangle representation of the robot

DOI10.1016/0196-6774(88)90012-0zbMath0662.68119OpenAlexW1988387435MaRDI QIDQ3813337

J. Zorbas, Binay K. Bhattacharya

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90012-0

zbMATH Keywords

collision boundaryconvex robotfindpath

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Other problems of combinatorial convexity (52A37)

Related Items

On the general motion-planning problem with two degrees of freedom, An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space