Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model
暂无分享,去创建一个
[1] Sridhar Mahadevan,et al. Automatic Programming of Behavior-Based Robots Using Reinforcement Learning , 1991, Artif. Intell..
[2] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[3] Pierre Tournassoud. A strategy for obstacle avoidance and its application to mullti-robot systems , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[4] 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 .
[5] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[6] Tomás Lozano-Pérez,et al. On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[7] Vladimir J. Lumelsky,et al. Proximity sensing in robot manipulator motion planning: system and implementation issues , 1989, IEEE Trans. Robotics Autom..
[8] Paul G. Spirakis,et al. Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..
[9] Stephen J. Buckley,et al. Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[10] R. J. Schilling,et al. Decoupling of a Two-Axis Robotic Manipulator Using Nonlinear State Feedback: A Case Study , 1984 .
[11] Harold Abelson,et al. Turtle geometry : the computer as a medium for exploring mathematics , 1983 .
[12] Victor Scheinman. Robotworld: a multiple robot vision guided assembly system , 1988 .
[13] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[14] Maja J. Mataric,et al. Interaction and intelligent behavior , 1994 .
[15] Patricia C. Goldberg,et al. Automatic Programming , 1974, Programming Methodology.
[16] Jerome A. Feldman. Automatic programming. , 1972 .
[17] E. J.,et al. ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .
[18] S. Zucker,et al. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .