Abstract
The localisation problem arises from the need of the elements of a swarm of robots, or of a wireless sensor network WSN, to determine its position without the use of external references, such as the global positioning system GPS, for example. In this problem, the location is based on calculations that use distance measurements to anchor nodes that have known positions. In the search for efficient algorithms to calculate the location, some algorithms inspired by nature, such as genetic algorithm GA and particle swarm optimisation PSO algorithm, have been used. Accordingly, in order to obtain better solutions to the localisation problem, this paper presents the results obtained with the backtracking search optimisation algorithm BSA and compares them with those obtained with the GA.
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 callMore From: International Journal of Innovative Computing and Applications
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.
