Exploration of polygonal environments using range data
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[2] Athanasios Papoulis,et al. Probability, Random Variables and Stochastic Processes , 1965 .
[3] Osamu Takahashi,et al. Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..
[4] E. Parzen. 1. Random Variables and Stochastic Processes , 1999 .
[5] M. Omizo,et al. Modeling , 1983, Encyclopedic Dictionary of Archaeology.
[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[7] O. Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[8] Bruce Randall Donald,et al. Simplified Voronoi diagrams , 1987, SCG '87.
[9] S. Sitharama Iyengar,et al. Autonomous robot navigation in unknown terrains: incidental learning and environmental exploration , 1990, IEEE Trans. Syst. Man Cybern..
[10] Jean-Paul Laumond,et al. Position referencing and consistent world modeling for mobile robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[11] Michael Jenkin,et al. Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..
[12] P. Klöör,et al. Incremental Map-making in Indoor Environments , 1993 .
[13] Benjamin Kuipers,et al. A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..
[14] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[15] S. Sitharama Iyengar,et al. Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.
[16] Vladimir J. Lumelsky,et al. Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..
[17] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[18] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[19] Bruno O. Shubert,et al. Random variables and stochastic processes , 1979 .
[20] Ingemar J. Cox,et al. Blanche: Position Estimation For An Autonomous Robot Vehicle , 1989, Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications.
[21] T. Shermer. Recent Results in Art Galleries , 1992 .
[22] Micha Sharir,et al. An automatic motion planning system for a convex polygonal mobile robot in 2-dimensional polygonal space , 1988, SCG '88.
[23] Vladimir J. Lumelsky,et al. Incorporating range sensing in the robot navigation function , 1990, IEEE Trans. Syst. Man Cybern..
[24] T. C. Shermer,et al. Recent results in art galleries (geometry) , 1992, Proc. IEEE.
[25] Vladimir J. Lumelsky,et al. A comparative study on the path length performance of maze-searching and robot motion planning algorithms , 1991, IEEE Trans. Robotics Autom..
[26] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[27] Ingemar J. Cox,et al. Autonomous Robot Vehicles , 1990, Springer New York.