Abstract
This paper presents an algorithm A* for obtaining the “best” assembly plan for a product in a multirobot system. The algorithm takes into account, in addition to the assembly times, the times needed to change tools in the robots. The objective of the plan is the minimization of the makespan. To meet this objective, the algorithm starts from the And/Or graph (compressed representation of all feasible assembly plans) and the information of each assembly task (robot and tool needed and assembly time).
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.
