Abstract
An Area Partitioning and Allocation (APA) approach was presented in[1]. The approach focused on optimizing the coverage performance of Autonomous Industrial Robots (AIRs) using multiple conflicting objectives and Voronoi partitioning. However, questions related to the optimality, convergence, and consistency of the Pareto solutions were not studied in details. In this paper, Inverted Generational Distance (IGD) metric is used to verify the convergence of the Pareto front towards Pareto optimal front (PF*). The consistency in obtaining similar Pareto fronts for independent optimization runs is studied. The computational complexity of the approach with respect to the size of the coverage area and the number of AIRs is also discussed. Two application scenarios are used in this research.
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.
