the objective of this work is to utilize an embedded system to automate the control of a Brushless DC (BLDC) motor via numeric control. The design will be implemented to demonstrate, with precision, how to control multiple BLDC motors simultaneously and with accuracy. The design will be operated with precisely programed commands called G-Codes that will be encoded in LabVIEW. This research can be used to design a machine that can print custom printed circuit boards (PCB). However, in order to demonstrate proof of concept a plotter was constructed as a visual representation of the capabilities in which a machine can operate autonomously to print a PCB. The plotter will feature a myRIO, a fully functional FPGA, and a Seeeduino to control all operations of the system. The system also features a custom communication protocol developed specifically for interaction between the FPGA and microcontroller. The plotter has a Graphical User Interface (GUI); custom designed and built in LabVIEW that allows a user to interact with the operations of the plotter. The user is able to monitor system status and fault conditions and correct them in a timely fashion.
The purpose of this study to analyze genetic algorithm (GA) and simulated an-nealing (SA) based approaches applied to well-known Traveling Salesman Prob-lem (TSP). As a NP-Hard problem, the goal of TSP is to find the shortest route possible to travel all the cities, given a set of cities and distances between cities. In order to solve the problem and achieve the optimal solution, all permutations need to be checked, which gets exponentially large as more cities are added. Our aim in this study is to provide comprehensive analysis of TSP solutions based on two methods, GA and SA, in order to find a near optimal solution for TSP. The re-sults of the simulations show that although the SA executed with faster comple-tion times comparing to GA, it took more iterations to find a solution. Additional-ly, GA solutions are significantly more accurate than SA solutions, where GA found a solution in relatively less iterations. The original contribution of this study is that GA based solution as well as SA based solution are developed to perform comprehensive parameter analysis. Further, a quantifiable comparison is provided for the results from each parameter analysis of GA and SA in terms of performance of solving TSP.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.