Path tracking through uncharted moving obstacles
暂无分享,去创建一个
[1] Richard M. Salter. Planning in a Continuous Domain - An Introduction , 1983, Robotica.
[2] J. Schwartz,et al. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .
[3] B. Lee,et al. Time-varying obstacle avoidance for robot manipulators: Approaches and difficulties , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[4] Tomás Lozano-Pérez,et al. Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.
[5] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[6] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.
[7] Jean-Claude Latombe,et al. Robot motion planning with many degrees of freedom and dynamic constraints , 1991 .
[8] V. Lumelsky,et al. Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .
[9] S. Zucker,et al. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .
[10] John Canny,et al. Exact solution of some robot motion planning problems , 1988 .
[11] Boris Aronov,et al. Minimum-Speed Motions , 1991, Int. J. Robotics Res..
[12] S. Sitharama Iyengar,et al. Robot Navigation in Unknown Terrains of Convex Polygonal Obstacles Using Learned Visibility Graphs , 1986, AAAI.
[13] James Gil de Lamadrid. Avoidance System for Moving Obstacles , 1987 .
[14] V. Lumelsky,et al. Simulating sensor-based robot motion amongst unknown obstacles , 1987 .
[15] Dit-Yan Yeung,et al. A decentralized approach to the motion planning problem for multiple mobile robots , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[16] Rodney A. Brooks,et al. A Robust Layered Control Syste For A Mobile Robot , 2022 .
[17] Micha Sharir,et al. Planning, geometry, and complexity of robot motion , 1986 .
[18] Hans P. Moravec. Sensor Fusion in Certainty Grids for Mobile Robots , 1988, AI Mag..
[19] Chee Yap,et al. Algorithmic motion planning , 1987 .
[20] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[21] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[22] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[23] Robert Evans,et al. A Maneuvering-Board Approach to Path Planning with Moving Obstacles , 1989, IJCAI.
[24] Vangalur S. Alagar,et al. Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[25] Micha Sharir,et al. Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[26] James Francis Gil De Lamadrid. Obstacle avoidance for a mobile robot among moving obstacles. (volumes i and ii) , 1990 .
[27] Bruce Randall Donald,et al. On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[28] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .
[29] Steven W. Zucker,et al. Planning collision-free trajectories in time-varying environments: a two-level hierarchy , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[30] David P. Miller,et al. Path Planning Through Time and Space in Dynamic Domains , 1987, IJCAI.