Using state dominance for path planning in dynamic environments with moving obstacles
暂无分享,去创建一个
[1] Maxim Likhachev,et al. Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles , 2008, Int. J. Robotics Res..
[2] Mark H. Overmars,et al. Roadmap-based motion planning in dynamic environments , 2004, IEEE Transactions on Robotics.
[3] Anthony Stentz,et al. DD* Lite: Efficient Incremental Search with State Dominance , 2006, AAAI.
[4] Maxim Likhachev,et al. SIPP: Safe interval path planning for dynamic environments , 2011, 2011 IEEE International Conference on Robotics and Automation.
[5] Hideo Fujiwara,et al. An efficient test generation algorithm based on search state dominance , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.
[6] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .
[7] Anthony Stentz,et al. Planning with uncertainty in position an optimal and efficient planner , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[8] Wolfram Burgard,et al. The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..
[9] Jur P. van den Berg,et al. Anytime path planning and replanning in dynamic environments , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..
[10] Anthony Stentz,et al. Using linear landmarks for path planning with uncertainty in outdoor environments , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[11] Anthony Stentz,et al. Mission-level path planning and re-planning for rover exploration , 2006, Robotics Auton. Syst..
[12] Mark H. Overmars,et al. Roadmap-based motion planning in dynamic environments , 2005, IEEE Trans. Robotics.