Mapping and Navigation from Permutations of Landmarks
暂无分享,去创建一个
[1] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[2] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[3] Richard Pollack,et al. Multidimensional Sorting , 1983, SIAM J. Comput..
[4] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[5] Matthew T. Mason,et al. An exploration of sensorless manipulation , 1986, IEEE J. Robotics Autom..
[6] Bernd Sturmfels,et al. Coordinate representation of order types requires exponential storage , 1989, STOC '89.
[7] Peter W. Shor,et al. Stretchability of Pseudolines is NP-Hard , 1990, Applied Geometry And Discrete Mathematics.
[8] Tod S. Levitt,et al. Qualitative Navigation for Mobile Robots , 1990, Artif. Intell..
[9] R. A. Brooks,et al. Intelligence without Representation , 1991, Artif. Intell..
[10] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[11] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[12] Wolfram Burgard,et al. A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots , 1998, Auton. Robots.
[13] Sebastian Thrun,et al. Probabilistic robotics , 2002, CACM.
[14] Sebastian Thrun,et al. FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.
[15] J. Koenderink,et al. The singularities of the visual mapping , 1976, Biological Cybernetics.
[16] Kenneth Y. Goldberg,et al. Orienting polygonal parts without sensors , 1993, Algorithmica.
[17] Steven M. LaValle,et al. Planning algorithms , 2006 .
[18] Gaurav S. Sukhatme,et al. Surrounding Nodes in Coordinate-Free Networks , 2006, WAFR.