Moving Obstacle Avoidance Via Time-Varying Cost Map
暂无分享,去创建一个
[1] Sebastian Thrun,et al. Towards fully autonomous driving: Systems and algorithms , 2011, 2011 IEEE Intelligent Vehicles Symposium (IV).
[2] N. Roy,et al. Probabilistically Safe Avoidance of Dynamic Obstacles with Uncertain Motion Patterns , 2011 .
[3] Paolo Fiorini,et al. Motion Planning in Dynamic Environments Using Velocity Obstacles , 1998, Int. J. Robotics Res..
[4] Emilio Frazzoli,et al. Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..
[5] Emilio Frazzoli,et al. Autonomy for mobility on demand , 2012, IROS.
[6] Joel W. Burdick,et al. Robotic motion planning in dynamic, cluttered, uncertain environments , 2010, 2010 IEEE International Conference on Robotics and Automation.
[7] James J. Kuffner,et al. Multipartite RRTs for Rapid Replanning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.
[8] Emilio Frazzoli,et al. Probabilistically-sound and asymptotically-optimal algorithm for stochastic control with trajectory constraints , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).
[9] Masahiro Ono,et al. Chance-Constrained Optimal Path Planning With Obstacles , 2011, IEEE Transactions on Robotics.
[10] Mark H. Overmars,et al. Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles , 2008, Int. J. Robotics Res..
[11] P. Abbeel,et al. LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information , 2011 .