Skip to main content
Have a personal or library account? Click to login
Optimization-based approach to path planning for closed chain robot systems Cover

Optimization-based approach to path planning for closed chain robot systems

International Journal of Applied Mathematics and Computer Science
Volume 21 (2011): Issue 4 (December 2011)
By:  and    
Open Access
|Dec 2011
References

References

  1. Abbasi-Yadkori, Y., Modayil, J. and Szepesvari, C. (2010). Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning,, pp. 127-132.
    Search in Google Scholar
  2. Asfour, T., Gyarfas, F., Azad, P. and Dillmann, R. (2006). Imitation learning of dual-arm manipulation tasks in humanoid robots,, pp. 40-47.
    Search in Google Scholar
  3. Bell, B. M. and Burke, J. V. (2008). Algorithmic differentiation of implicit functions and optimal values,C. H. Bischof, H. M. Bücker, P. D. Hovland, U. Naumann and J. Utke (Eds.),, Springer, Berlin/Heidelberg, pp. 67-77.
    Open DOISearch in Google Scholar
  4. Benson, H. Y., Shanno, D. F. and Vanderbei, R. J. (2001). Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions,, Operations Research and Financial Engineering, Princeton University, Princeton, NJ.
    Search in Google Scholar
  5. Benson, H. Y., Shanno, D. F. and Vanderbei, R. J. (2002). A comparative study of large-scale nonlinear optimization algorithms,, Operations Research and Financial Engineering, Princeton University, Princeton, NJ.
    Search in Google Scholar
  6. Błaszczyk, J., Karbowski, A. and Malinowski, K. (2007). Object library of algorithms for dynamic optimization problems: Benchmarking SQP and nonlinear interior point methods,(4): 515-537, DOI: 10.2478/v10006-007- 0043-y.
    Search in Google Scholar
  7. Błaszczyk, J. P. (2007)., Ph.D. thesis, Warsaw University of Technology, Warsaw, (in Polish).
    Search in Google Scholar
  8. Byrd, R. H., Gilbert, J. C. and Nocedal, J. (2000). A trust region method based on interior point techniques for nonlinear programming,(1): 149-185.
    Open DOISearch in Google Scholar
  9. Byrd, R. H., Hribar, M. E. and Nocedal, J. (1999). An interior point algorithm for large scale nonlinear programming,(4): 877-900.
    Open DOISearch in Google Scholar
  10. Canny, J. (1988)., MIT Press, Cambridge, MA.
    Search in Google Scholar
  11. Cortés, J., Siméon, T. and Laumond, J.-P. (2002). A random loop generator for planning the motions of closed kinematic chains using PRM methods,, pp. 2141-2146.
    Search in Google Scholar
  12. Daniel, J. (1971)., Prentice Hall, Englewood Cliffs, NJ.
    Search in Google Scholar
  13. de Boor, C. (1978)., Springer, New York, NY/Heidelberg.
    Open DOISearch in Google Scholar
  14. Dolan, E. D. and Moré, J. J. (2002). Benchmarking optimization software with performance profiles,(2): 201-213.
    Open DOISearch in Google Scholar
  15. Fiacco, A. V. and McCormick, G. P. (1968)., John Wiley and Sons, New York, NY/London.
    Search in Google Scholar
  16. Fiser, A., Do, R. and Sali, A. (2000). Modeling of loops in protein structure,(9): 1753-1773.
    Open DOISearch in Google Scholar
  17. Fletcher, R. and Leyffer, S. (2002). Nonlinear programming without a penalty function,(2): 239-269.
    Open DOISearch in Google Scholar
  18. Haegele, M., Nilsson, K. and Pires, J. N. (2008)., Springer, Berlin/Heidelberg.
    Search in Google Scholar
  19. Han, L. and Amato, N. (2000). A kinematics-based probabilistic roadmap method for closed chain systems,, pp. 233-245.
    Search in Google Scholar
  20. Han, L., Rudolph, L., Blumenthal, J. and Valodzin, I. (2006). Stratified deformation space and path planning for a planar closed chain with revolute joints,S. Akella, N. Amato, W. Huang and B. Mishra (Eds.),, Springer Tracts in Advanced Robotics, Vol. 47, Springer, New York, NY, pp. 235-250.
    Search in Google Scholar
  21. Kallmann, M., Aubel, A., Abaci, T. and Thalmann, D. (2003). Planning collision-free reaching motions for interactive object manipulation and grasping,(3): 313-322.
    Open DOISearch in Google Scholar
  22. Kanehiro, F., Lamiraux, F., Kanoun, O., Yoshida, E. and Laumond, J.-P. (2008). A local collision avoidance method for non-strictly convex polyhedra,, pp. 151-158.
    Search in Google Scholar
  23. Kavraki, L. E., Svestka, P., Latombe, J.-C. and Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces,(4): 566-580.
    Open DOISearch in Google Scholar
  24. Kuffner, J. J. and LaValle, S. M. (2000). RRT-connect: An efficient approach to single-query path planning,, pp. 995-1001.
    Search in Google Scholar
  25. Latombe, J.-C. (1991)., Kluwer, Boston, MA.
    Open DOISearch in Google Scholar
  26. LaValle, S. (2006)., Cambridge University Press, Cambridge.
    Open DOISearch in Google Scholar
  27. Liu, G. and Trinkle, J. (2005). Complete path planning for planar closed chains among point obstacles,, pp. 33-40.
    Search in Google Scholar
  28. Merlet, J. (2000)., Kluwer, Dordrecht.
    Open DOISearch in Google Scholar
  29. Morales, J. L., Nocedal, J., Waltz, R. A., Liu, G. and Goux, J.-P. (2001). Assessing the potential of interiormethods for nonlinear optimization,, Optimization Technology Center, Northwestern University, Evanston, IL.
    Search in Google Scholar
  30. Ratliff, N., Zucker, M., Bagnell, J. A. and Srinivasa, S. (2009). CHOMP: Gradient optimization techniques for efficient motion planning,, pp. 489-494.
    Search in Google Scholar
  31. Szynkiewicz, W. (2003). Motion planning for multi-robot systems with closed kinematic chains,, pp. 779-786.
    Search in Google Scholar
  32. Szynkiewicz, W. and Gosiewski, A. (1995). Motion space analysis and trajectory planning for dual-arm system,, pp. 503-510.
    Search in Google Scholar
  33. Tang, X., Thomas, S. and Amato, N. (2007). Planning with reachable distances: Fast enforcement of closure constraints,, pp. 2694-2699.
    Search in Google Scholar
  34. Tits, A. L.,Wächter, A., Bakhtiari, S., Urban, T. J. and Lawrence, C. (2002). A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties,, Institute for Systems Research, University of Maryland, College Park, MD.
    Search in Google Scholar
  35. Trinkle, J. and Milgram, R. (2002). Complete path planning for closed kinematic chains with spherical joints,(9): 773-789.
    Open DOISearch in Google Scholar
  36. Ulbrich, M., Ulbrich, S. and Vicente, L. N. (2004). A globally convergent primal-dual interior-point filter method for nonlinear programming,(2): 379-410.
    Open DOISearch in Google Scholar
  37. Vanderbei, R. J. and Shanno, D. F. (1997). An interior-point algorithm for non-convex nonlinear programming,, Statistics and Operations Research, Princeton University, Princeton, NJ.
    Search in Google Scholar
  38. Wächter, A. (2002)., Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA.
    Search in Google Scholar
  39. Wächter, A. and Biegler, L. T. (2000). Failure of global convergence for a class of interior point methods for nonlinear programming,(3): 565-574.
    Open DOISearch in Google Scholar
  40. Wächter, A. and Biegler, L. T. (2005). Line search filter methods for nonlinear programming: Motivation and global convergence,(1): 1-31.
    Open DOISearch in Google Scholar
  41. Wächter, A. and Biegler, L. T. (2006). On the implementation of a primal-dual interior-point filter line-search algorithm for large-scale nonlinear programming,(1): 25-57.
    Open DOISearch in Google Scholar
  42. Waltz, R. A. and Plantenga, T. (2006)., Ziena Optimization, Inc., http://www.ziena.com/docs/knitroman.pdf.
    Search in Google Scholar
  43. Yakey, J., LaValle, S. and Kavraki, L. (2001). Randomized path planning for linkages with closed kineamtic chains,(6): 951-958.
    Open DOISearch in Google Scholar
  44. Yershova, A. and LaValle, S. (2009). Motion planning for highly constrained spaces, in K. R. Kozłowski (Ed.), Springer, Berlin/Heidelberg, pp. 297-306.
    Open DOISearch in Google Scholar
  45. Zefran, M. and Kumar, V. (1997). A variational calculus framework for motion planning,, pp. 415-420.
    Search in Google Scholar
  46. Zhang, J. and Knoll, A. (1995). An enhanced optimization approach for generating smooth robot trajectories in the presence of obstacles,, pp. 263-268.
    Search in Google Scholar
  47. Zieliński, C. and Winiarski, T. (2010). Motion generation in the MRROC++ robot programming framework,(4): 386-413.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.2478/v10006-011-0052-8 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 659 - 670
Published on: Dec 21, 2011
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
closed chain,
path planning,
nonlinear optimization
Related subjects:
Mathematics,
Applied mathematics

© 2011 Wojciech Szynkiewicz, Jacek Błaszczyk, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 21 (2011): Issue 4 (December 2011)
Previous article
Next article