Spline-based robot navigation

IEEE International Conference on Intelligent Robots and Systems

Volumn , Issue , 2006, Pages 2296-2301

  Magid, Evgeni ^a   Keren, Daniel ^b   Rivlin, Ehud ^a   Yavneh, Irad ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INDUSTRIAL ROBOTS; INTELLIGENT ROBOTS; MOTION ESTIMATION; MOTION PLANNING; OPTIMIZATION;

PATH PLANNING ALGORITHMS; ROBOT NAVIGATION;

ROBOT APPLICATIONS;

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

References (19)

1. S. Aydin and H. Temeltas. A novel approach to smooth trajectory planning of a mobile robot. IEEE AMC, 472-477, 2002.
2. M. Berg, M. Kreveld, M. Overmars and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2000.
3. L. E. Dubins. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. Amer. J. Math.,79:497-516, 1957.
4. S. Fleury, P. Soueres, J.-P. Laumond and R. Chatila, Primitives for smoothing mobile robot trajectories. IEEE Trans. of Robotics and Automation, 11:441-448, 1995.
5. S. Fortune, A Sweeping Algorithm for Voronoi diagrams. ACM Symposium on computational geometry, 313-322, 1986.
6. G. Dudek and M. Jenkin. Computational principles of mobile robotics. Cambridge University Press, 2000.
7. Y. K. Hwang and N. Ahuja. Path Planning Using a Potential Field Representation. IEEE ICRA, 648-649, 1988.
8. D. Keren and M. Werman. Probabilistic Analysis of Regularization. IEEE PAMI, 15(10):982-995, 1993.
9. O. Khatib. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots. International Journal of Robotics Research, 5(1):90-98, 1986.
10. T. Kito, J. Ota, R. Katsuki, T. Mizuta, T. Arai, T. Ueyama and T. Nishiyama. Smooth path planning by using visibility graph-like method. IEEE ICRA, 3770-3775, 2003.
11. Y. Koren and J. Borenstein. Potential field methods and their inherent limitations for Mobile Robot Navigation. IEEE ICRA, 1398-1404, 1991.
12. J. C. Lagarias, J. A. Reeds, M. H. Wright and P. E. Wright. Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. SIAM Journal of Optimization, 9(1):112-147, 1998.
13. F. Lamiraux and J.-P. Laumond. Smooth Motion Planning for Car-Like Vehicles. IEEE Trans. of Robotics and Automation, 17(4):498-502, 2001.
14. J. C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, USA, 1991.
15. V. J. Lumelsky and A. A. Stepanov. Path Planning Strategies for a Point Mobile Automaton Moving Amidst Unknown Obstacles of Arbitrary Shape. Algorithmica, 2:403-430, 1987.
16. E. Magid, D. Keren and E. Rivlin. Autonomous Robot Navigation. Master thesis, Technion, Israel, 2006.
17. K. Nagatani, Y. Iwai and Y. Tanaka. Sensor based navigation for carlike mobile robots using Generalized Voronoi Graph. IEEE/RSJ IROS, 1017-1022, 2001.
18. S. Wolff. A local and global, constrained and simple bounded Nelder-Mead Method. Tech.report,Weimar University, Germany, 2004
19. A. Zelinsky and I. Dowson. Continuous smooth path execution for an autonomous guided vehicle (AGV). IEEE Region 10 Conference, Tencon 92, 871-875, 1992.