Replanning: A powerful planning strategy for hard kinodynamic problems

2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS

Volumn , Issue , 2008, Pages 1667-1672

  Tsianos, Konstantinos I ^a   Kavraki, Lydia E ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED MEMORIES; HIGH-DIMENSIONAL PROBLEMS; KNOWN ENVIRONMENTS; LOW DIMENSIONAL; MOTION CONSTRAINTS; NAVIGATION FUNCTIONS; OFFLINE; PLANNING STRATEGIES; RE-PLANNING; REPLANNING ALGORITHM; SAMPLING-BASED; SOLUTION PATH; UNBOUNDED MEMORY;

INTELLIGENT ROBOTS; PLANNING;

ROBOT PROGRAMMING;

EID: 69549101703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2008.4650965     Document Type: Conference Paper

References (17)

1. Kostas E. Bekris and Lydia E. Kavraki. Greedy but safe replanning under kinodynamic constraints. In IEEE International Conference on Robotics and Automation, pages 704-710, Rome, Italy, April 2007. IEEE press.
2. Dave Ferguson, Nidhi Kalra, and Anthony Stentz. Replanning with RRTs. In IEEE International Conference on Robotics and Automation, pages 1243- 1248, 2006.
3. Emilio Frazzoli, Munther A. Dahleh, and Eric Feron. Real-time motion planning for agile autonomous vehicles. In American Control Conference, volume 1, pages 43-49, 2001.
4. David Hsu, Roben Kindel, Jean-Claude Latombe, and Stephen Rock. Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research, 21(3):233-255, 2002.
5. Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, and Mark H. Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):566-580, August 1996.
6. Sven Koenig and Maxim Likhachev. Improved fast replanning for robot navigation in unknown terrain. In IEEE International Conference on Robotics and Automation, volume 1, pages 968- 975, 2002.
7. Prashanth Konkimalla and Steven M. LaValle. Efficient computation of optimal navigation functions for nonholonomic planning. In Proceedings of the First Workshop on Robot Motion and Control, pages 187-192, 1999.
8. Andrew M. Ladd. Direct Motion Planning over Simulation of Rigid Body Dynamics with Contact. PhD thesis, Rice University, Houston, Texas, December 2006.
9. Andrew. M. Ladd and Lydia. E. Kavraki. Fast tree-based exploration of state space for robots with dynamics. In M. Erdmann, D. Hsu, M. Overmars, and A. F. van der Stappen, editors, Algorithmic Foundations of Robotics VI, pages 297-312. Springer, STAR 17, 2005.
10. Andrew M. Ladd and Lydia E. Kavraki. Motion planning in the presence of drift, underactuation and discrete system changes. In Robotics: Science and Systems, pages 233-241, Boston, MA, June 2005. MIT Press.
11. Steven M. LaValle and James J. Kuffner. Randomized kinodynamic planning. International Journal of Robotics Research, 20(5):378-400, May 2001.
12. Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz, and Sebastian Thrun. Anytime dynamic a*: An anytime, replanning algorithm. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), June 2005.
13. Kuaustubb Pathak, Jaume Franch, and Sunil K. Agrawal. Velocity and position control of a wheeled inverted pendulum by partial feedback linearization. In IEEE Transactions on Robotics, 2005.
14. John H. Reif. Complexity of the mover's problem and generalizations. In IEEE Symposium on Foundations of Computer Science, pages 421-427, 1979. (Pubitemid 10434085)
15. Elon Rimon and Daniel E. Koditschek. Exact robot navigation using artificial potential functions. IEEE Transactions onRobotics and Automation, 8:501-518, 1992.
16. Russell Smith. Open dynamics engine. http://www.ode.org. seen September 7, 2007.
17. Konstantinos I. Tsianos, Ioan A. Şucan, and Lydia E. Kavraki. Sampling-based robot motion planning: Towards realistic applications. Computer Science Review, 1(1):2-11, August 2007.