Abstract
Abstract A new parallel processing algorithm for “on-line” computation of dynamic robot models is presented. Given a searching radius, we modified the standard “branch-bound” method combining it with LPF (Largest Processing Time First) algorithm. A special attention is paid to the stop-condition based on the estimated minimal execution time of a given task. Further, a boundary of the execution time of a suboptimal solution is determined. The searching process stops when the execution time of current solution is shorther than this boundary time. We applied the developed parallel processing algorithm to the computation of dynamic robot equations in analytical form. These equations can be automatically obtained by the use of computer, as described in our previous papers (1983, 1985a, 1985b). The algorithm is illustrated on PUMA and STANFORD manipulators
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.
