Mathematical Model of Obstacle Avoidance Shortest Time Path for Robot

Article Preview

Abstract:

In this paper, we study the mathematical model of obstacle avoidance shortest time path for robot. From origin to specified point, the robot shortest time path is divided into three cases, then we establish three mathematical models , through mathematical software, we get three required times, by comparison, we can get results of optimal path.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

214-217

Citation:

Online since:

December 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Q.Y. Jiang, J.X. Xie, J. Ye: Mathematical Model (Higher Education Publications, Beijing 2003) (In Chinese).

Google Scholar

[2] L.L. Duan: Journal of Guangxi College of Education, Vol. 129 (2014) No. 1, pp.151-156. (In Chinese).

Google Scholar

[3] Z.M. Sun: Journal of Weifang engineering of Career Academy, Vol. 26 (2013) No. 1, pp.89-93. (In Chinese).

Google Scholar

[4] S.C. Liu: Research on obstacle avoidance algorithm for mobile robot(MS. Northeast Petroleum University, China 2011), p.15.

Google Scholar

[5] X. Ch. Wang. Journal of Wenzhou Vocational and Technical College, Vol. 14(2014) No. 1, pp.54-56.

Google Scholar

[6] J.X. Xie, Y. Xue: Optimization modeling with LINDO/LINGO software (Tsinghua University Press, Beijing 2005) (In Chinese).

Google Scholar