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

DOI10.1016/0196-6774(88)90012-0MaRDI QIDQ3813337zbMATH OpenOpenAlexFDO

Authors Binay Bhattacharya, J. Zorbas

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

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

Recommendations

• A solution to the two-dimensional findpath problem
• scientific article; zbMATH DE number 4020522
• Two-dimensional path finding subject to geometric constraints
• scientific article; zbMATH DE number 1777524
• Robot Path Planning in Three-Dimensions Using the Direct Subspace
• Finding feasible paths for a two-point body

Cited in

(4)

• Obstacle growing in a nonpolygonal world
• 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
• scientific article; zbMATH DE number 5371059 (Why is no real title available?)

This page was built for publication: Solving the two-dimensional findpath problem using a line-triangle representation of the robot

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813337)