Abstract
Many solutions came into limelight to explore the mobile robot navigation methods in a known environment with some constraints. Each and every such solution has its own merits and demerits in their simulation as well as implementation. By considering the issues in traveling salesman problem (TSP) which can be adopted in every differential field, we have been through classic implementation of branch and remove algorithm that considers every connected component in the known environment for implementation. With this paper, we came up with simulated results of branch and remove algorithm that exhibits minimum path journey by considering all edges connected among all the nodes in a complete graph. For the simulation in the Verilog HDL environment, the edge length is considered as distance metric or cost of travel between nodes as well as selection of initial node is considered to start the solution of minimum path finding. The results in this paper show that the initial point selection could be random and the implementation works well for any number of nodes and any edge length connecting them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Graham and B. Nelson, “A Hardware Genetic Algorithm for the Traveling Salesman Problem on Splash 2”, Brigham Young University.
Xiaojun Wang, Brent Nelson, “Tradeoffs of Designing Floating-Point Division and Square Root on Virtex FPGAs”, FCCM 2003.
L. Gueta, R. Chiba, J. Ota, T. Ueyama, and T. Arai, “Coordinated Motion Control of a Robot Arm and a Positioning Table With Arrangement of Multiple Goals,” in IEEE International Conference on Robotics and Automation, 2008 (ICRA 2008), 2008, pp. 2252–2258.
Z. Yan-cong, G. Jun-hua, D. Yong-feng and H. Huan-ping, “Implementation of genetic algorithm for TSP based on FPGA,” 2011 Chinese Control and Decision Conference (CCDC), Mianyang, 2011, pp. 2226–2231.
A. Varma and Jayadeva, “A novel digital neural network for the travelling salesman problem,” Neural Information Processing, 2002. ICONIP ‘02. Proceedings of the 9th International Conference on, 2002, pp. 1320–1324 vol.3.
J. Stastný, V. Skorpil and L. Cizek, “Traveling Salesman Problem optimization by means of graph-based algorithm,” 2016 39th International Conference on Telecommunications and Signal Processing (TSP), Vienna, 2016, pp. 207–210.
H. Fang, M. Liu, F. Li, W. Shen and F. Zhang, “A novel adaptive algorithm for location based on Distance-Loss model in complex environment,” 2016 IEEE 20th International Conference on Computer Supported Cooperative Work in Design (CSCWD), Nanchang, 2016, pp. 26–30.
Huakang Li, Satoshi Ishikawa, Qunfei Zhao, Michiko Ebana, Hiroyuki Yamamoto and Jie Huang, “Robot navigation and sound based position identification,” 2007 IEEE International Conference on Systems, Man and Cybernetics, Montreal, Que., 2007, pp. 2449–2454.
J. Zhao, Z. w. Zhou, G. Li, C. l. Li, H. Zhang and W. b. Xu, “The apposite way path planning algorithm based on local message,” 2012 IEEE International Conference on Mechatronics and Automation, Chengdu, 2012, pp. 1563–1568.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Vennela, K., Chinnaaiah, M.C., Dubey, S., Savithri, S. (2018). An FPGA-Based Classical Implementation of Branch and Remove Algorithm. In: Anguera, J., Satapathy, S., Bhateja, V., Sunitha, K. (eds) Microelectronics, Electromagnetics and Telecommunications. Lecture Notes in Electrical Engineering, vol 471. Springer, Singapore. https://doi.org/10.1007/978-981-10-7329-8_53
Download citation
DOI: https://doi.org/10.1007/978-981-10-7329-8_53
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7328-1
Online ISBN: 978-981-10-7329-8
eBook Packages: EngineeringEngineering (R0)