Planning under topological constraints using beam-graphs
暂无分享,去创建一个
[1] Jack Snoeyink,et al. Testing Homotopy for Paths in the Plane , 2002, SCG '02.
[2] James R. Munkres,et al. Topology; a first course , 1974 .
[3] Takeo Igarashi,et al. Homotopic Path Planning on Manifolds for Cabled Mobile Robots , 2010, WAFR.
[4] Pere Ridao,et al. A topologically guided path planner for an AUV using homotopy classes , 2011, 2011 IEEE International Conference on Robotics and Automation.
[5] R. Ho. Algebraic Topology , 2022 .
[6] Stephen G. Kobourov,et al. Computing homotopic shortest paths efficiently , 2006, Comput. Geom..
[7] Fred Cohen,et al. Sensor Beams, Obstacles, and Possible Paths , 2008, WAFR.
[8] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[9] Jean-Daniel Boissonnat,et al. Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2002, Nice, France, December 15-17, 2002 , 2004, WAFR.
[10] Steven M. LaValle,et al. Planning algorithms , 2006 .
[11] Nicholas Roy,et al. Efficiently Finding Optimal Winding-Constrained Loops in the Plane , 2013 .
[12] Jianbo Shi,et al. Multi-hypothesis motion planning for visual object tracking , 2011, 2011 International Conference on Computer Vision.
[13] Vijay Kumar,et al. Topological constraints in search-based robot path planning , 2012, Auton. Robots.
[14] Manuel Blum,et al. On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).