会议专题

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.

Xingguo Yin Haipeng Wang Gang Wu

ABB Corporate Research Center,Shanghai,P.R.China

国际会议

2009 IEEE International Conference on Robotics and Biomimetics(2009 IEEE 机器人与仿生技术国际会议 ROBIO 2009)

桂林

英文

392-395

2009-12-19(万方平台首次上网日期,不代表论文的发表时间)