Abstract
A multiple component inspection path planning problem (MCIPP) can be formulated as an optimisation problem, referred to as a non-deterministic polynomial complete problem (NP). An MCIPP consists of testing points, which will be visited by a CMM probe only once, and dummy points which are set to avoid collision and may be visited by a CMM probe more than once. This paper considers the application of genetic algorithms (GAs) acting as optimisers for optimal inspection path planning systems. The paper explores the techniques used in the GA optimal inspection path planning system. The paper also discusses the comparison of integer programming models and genetic models.
Sign-in/Register to access full text options 
Free) 
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 call
