Learning Combinatorial Map Information from Permutations of Landmarks
暂无分享,去创建一个
[1] Steven M. LaValle,et al. Mapping and Navigation from Permutations of Landmarks , 2006 .
[2] Peter W. Shor,et al. Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.
[3] Sridhar Mahadevan,et al. Robot Learning , 1993 .
[4] Donald E. Knuth,et al. Axioms and Hulls , 1992, Lecture Notes in Computer Science.
[5] Wolfram Burgard,et al. A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998, Auton. Robots.
[6] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[7] B. Sturmfels. Oriented Matroids , 1993 .
[8] Leslie Pack Kaelbling,et al. Learning Topological Maps with Weak Local Odometric Information , 1997, IJCAI.
[9] Jean-Claude Latombe,et al. Landmark-Based Robot Navigation , 1992, Algorithmica.
[10] Frédéric Lerasle,et al. Qualitative modeling of indoor environments from visual landmarks and range data , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.
[11] Charles F. Miller,et al. Combinatorial Group Theory , 2002 .
[12] Benjamin Kuipers,et al. Towards a general theory of topological maps , 2004, Artif. Intell..
[13] Dongbing Gu,et al. Landmark‐based navigation of industrial mobile robots , 2000 .
[14] Benjamin Kuipers,et al. The Spatial Semantic Hierarchy , 2000, Artif. Intell..
[15] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[16] J. Koenderink,et al. The singularities of the visual mapping , 1976, Biological Cybernetics.
[17] Sebastian Thrun,et al. FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.
[18] Reid G. Simmons,et al. Probabilistic Robot Navigation in Partially Observable Environments , 1995, IJCAI.
[19] Randy C. Brost,et al. Analysis and planning of planar manipulation tasks , 1992 .
[20] Wolfram Burgard,et al. Probabilistic Robotics (Intelligent Robotics and Autonomous Agents) , 2005 .
[21] Ilan Shimshoni. On mobile robot localization from landmark bearings , 2002, IEEE Trans. Robotics Autom..
[22] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[23] Jim Lawrence,et al. Oriented matroids , 1978, J. Comb. Theory B.
[24] Peter Cheeseman,et al. On the Representation and Estimation of Spatial Uncertainty , 1986 .
[25] Richard Pollack,et al. Multidimensional Sorting , 1983, SIAM J. Comput..
[26] Jun Ota,et al. Design of the Optimal Arrangement of Artificial Landmarks , 1996 .
[27] David G. Lowe,et al. Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.
[28] Liqiang Feng,et al. Navigating Mobile Robots: Systems and Techniques , 1996 .
[29] Alan C. Schultz,et al. Mobile robot exploration and map-building with continuous localization , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[30] Günter M. Ziegler,et al. Oriented Matroids , 2017, Handbook of Discrete and Computational Geometry, 2nd Ed..
[31] Steven M. LaValle,et al. Learning Combinatorial Information from Alignments of Landmarks , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.
[32] Margrit Betke,et al. Mobile robot localization using landmarks , 1997, IEEE Trans. Robotics Autom..
[33] Matthew T. Mason,et al. An exploration of sensorless manipulation , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[34] Bernd Sturmfels,et al. Coordinate representation of order types requires exponential storage , 1989, STOC '89.
[35] Leslie Pack Kaelbling,et al. Uncertainty in Graph-Based Map Learning , 1993 .
[36] Matthijs C. Dorst. Distinctive Image Features from Scale-Invariant Keypoints , 2011 .
[37] Ronald Parr,et al. DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks , 2003, IJCAI.
[38] W. Magnus,et al. Combinatorial Group Theory: COMBINATORIAL GROUP THEORY , 1967 .
[39] Hanspeter A. Mallot,et al. The Role of Global and Local Landmarks in Virtual Environment Navigation , 2000, Presence Teleoperators Virtual Environ..
[40] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[41] B. Kuipers,et al. The Semantic Hierarchy in Robot Learning , 1992 .
[42] J. Boissonnat,et al. Algorithmic Geometry: Frontmatter , 1998 .
[43] Tod S. Levitt,et al. Qualitative Navigation for Mobile Robots , 1990, Artif. Intell..
[44] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[45] Gaurav S. Sukhatme,et al. Surrounding Nodes in Coordinate-Free Networks , 2006, WAFR.
[46] Kenneth Y. Goldberg,et al. Orienting polygonal parts without sensors , 1993, Algorithmica.
[47] Michael A. Erdmann,et al. Using Backprojections for Fine Motion Planning with Uncertainty , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[48] Gregory Dudek,et al. Using Local Information in a Non-Local Way for Mapping Graph-Like Worlds , 1993, IJCAI.
[49] Michel Devy,et al. Incremental construction of a landmark-based and topological model of indoor environments by a mobile robot , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[50] Bernd Sturmfels,et al. Oriented Matroids: Notation , 1999 .
[51] J. Boissonnat,et al. Algorithmic Geometry: Incremental convex hulls , 1998 .