Planning with adaptive dimensionality for mobile manipulation
暂无分享,去创建一个
[1] Siddhartha S. Srinivasa,et al. Manipulation planning with Workspace Goal Regions , 2009, 2009 IEEE International Conference on Robotics and Automation.
[2] Emilio Frazzoli,et al. Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.
[3] Maxim Likhachev,et al. Search-based planning for manipulation with motion primitives , 2010, 2010 IEEE International Conference on Robotics and Automation.
[4] Steven M. LaValle,et al. Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .
[5] Maxim Likhachev,et al. Planning for autonomous door opening with a mobile manipulator , 2010, 2010 IEEE International Conference on Robotics and Automation.
[6] Sebastian Thrun,et al. Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments , 2010, Int. J. Robotics Res..
[7] Oliver Brock,et al. Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles , 2009 .
[8] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[9] Eric A. Hansen,et al. Beam-Stack Search: Integrating Backtracking with Beam Search , 2005, ICAPS.
[10] Maxim Likhachev,et al. Path Planning with Adaptive Dimensionality , 2011, SOCS.
[11] Norman I. Badler,et al. Real-Time Inverse Kinematics Techniques for Anthropomorphic Limbs , 2000, Graph. Model..
[12] Hendrik Van Brussel,et al. Behavior-based mobile manipulation inspired by the human example , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).
[13] Hendrik Van Brussel,et al. Behavior-based mobile manipulation : the opening of a door , 2003 .
[14] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[15] Siddhartha S. Srinivasa,et al. Task Space Regions , 2011, Int. J. Robotics Res..
[16] Julie D Thompson,et al. Multiple Sequence Alignment Using ClustalW and ClustalX , 2003, Current protocols in bioinformatics.
[17] Sebastian Thrun,et al. ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.
[18] Steven M. LaValle,et al. RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[19] Sven Koenig,et al. Incremental A* , 2001, NIPS.
[20] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .