Genetic and backtracking search optimisation algorithms applied to localisation problems
by Alan Oliveira de Sá; Nadia Nedjah; Luiza de Macedo Mourelle
International Journal of Innovative Computing and Applications (IJICA), Vol. 6, No. 3/4, 2015

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.

Online publication date: Wed, 11-Nov-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com