Abstract

The increase in computer numerical control machine efficiency highly contributes to environmental emission reduction and energy-savings. Path and trajectory optimizations are used to improve machine efficiency in a coverage motion such as pocket milling, polishing, inspection, gluing, and additive manufacturing. Several studies have proposed coverage motion optimization in improving machine efficiency for time and energy consumption. Ensuring the smoothness and satisfaction of the machine constraints in coverage motion is necessary. This paper proposes a multi-objective path and trajectory optimization to obtain a trade-off between time and energy consumption for coverage motion. Jerk limited acceleration profiles describe the trajectory where velocity profiles generated for each linear segment attain desirable velocities. The energy model of an industrial two-axis feed drive system is used in finding solutions to the optimization problem. The non-dominated sorting genetic algorithm II generates a Pareto front for trade-off time and energy consumption solutions. Simulation results of the proposed method are validated through experiments using the industrial two-axis feed drive system. Experimental results show the effectiveness of the proposed approach where time reduction and energy savings are 10.05% and 2.10%, respectively. In addition, the optimized path has a lower maximum error of 76.6% compared to the constantly commanded velocity optimized path.

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

Disclaimer: 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.