An approximate path finding algorithm for bridging special obstacles

DOI10.1260/174830108788251809MaRDI QIDQ3092070zbMATH OpenOpenAlexFDO

Authors Qiaoyu Sun, Yinrong Pan

Publication date 15 September 2011

Published in Journal of Algorithms & Computational Technology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1260/174830108788251809

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• An algorithm for finding shortest paths in a maze
• An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
• Shortest paths in the plane with convex polygonal obstacles
• Shortest paths in the plane with polygonal obstacles
• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane

This page was built for publication: An approximate path finding algorithm for bridging special obstacles

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