Abstract
In the process of climbing and sanding for our wall climbing robot, it is of great practical value and significance to find the optimal kinematic precept plan. Therefore, in this paper we base on the ant colony algorithm and set the minimum moving time of the sanding robot as the optimization goal. Apart from it, we also set the reducing of the no-load walking of the robot, the necessary sanding surface quality and the working safety of the robot as the constraint conditions. As a consequence of it, we finally solve the problem of path planning for the wall climbing and sanding robots effectively with consideration of the efficiency and automatic.
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.
