Path planning algorithm for bending robots

An algorithm for bending robots is presented in this paper. The algorithm makes use of the features of bending process to solve three problems: procedure generating, targets calculating and obstacle avoidance. It generates procedure with two state machines and a knowledge library, calculates targets with heuristic rules, and avoids obstacles in joint space. The algorithm has been applied to manufacture and improves the work efficiency of programming a bending robot.

[1]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[2]  Xuesong Yan,et al.  A Fast Evolutionary Algorithm for Robot Path Planning , 2007, 2007 IEEE International Conference on Control and Automation.

[3]  Liang Lu,et al.  Folding cartons with fixtures: a motion planning approach , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[4]  Satyandra K. Gupta,et al.  Automated process planning for sheet metal bending operations , 1998 .

[5]  Xiaoyun Liao,et al.  Evolutionary path planning for robot assisted part handling in sheet metal bending , 2003 .

[6]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration space for path planning: articulated robots , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[7]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .

[8]  José António Tenreiro Machado,et al.  Manipulator trajectory planning using a MOEA , 2007, Appl. Soft Comput..

[9]  Jiong Tang,et al.  Development of a configuration space motion planner for robot in dynamic environment , 2009 .