Title
Path planning algorithm for bending robots
Abstract
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.
Year
DOI
Venue
2009
10.1109/ROBIO.2009.5420678
ROBIO
Keywords
Field
DocType
procedure generating,bending machines,heuristic rule,path planning algorithm,state machine,bending robots,targets calculating,two state machines,bending process,path planning,industrial robots,obstacle avoidance,joint space,heuristic rules,avoids obstacle,work efficiency,collision avoidance,knowledge library,robots,tracking
Motion planning,Obstacle avoidance,Heuristic,Algorithm,Control engineering,Finite-state machine,Bending,Engineering,Robot
Conference
ISBN
Citations 
PageRank 
978-1-4244-4775-6
0
0.34
References 
Authors
4
3
Name
Order
Citations
PageRank
Xingguo Yin131.45
Haipeng Wang200.34
Gang Wu34213.30