Abstract
In order to solve the difficult problem of assembly path planning of complex structures,an obstacle and greedy rule based rapidly-exploring random tree(OG-RRT) algorithm is proposed.The algorithm is based on basic RRT algorithm,adopts the combination of random sampling,goal sampling and local sampling,guides the extended direction of the random tree with the collision information(collision normal vector and collision point) of the target part and obstacles,extends nodes by greedy rule along each direction with translation-after-rotation expansion strategy.The piecewise linear approximation method is utilized to optimize the original assembly path.An assembly path planning prototype system is developed and some examples are tested to verify feasibility of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
