Self-localization of Mobile Agents in the Plane
This paper considers initially the problem of localizing three agents moving in the plane when the inter-agent distances are known, and in addition, the angle subtended at each agent by lines drawn from two landmarks at known positions is also known. In addition, it is shown that there are in general a finite number greater than one of possible sets of positions for the three agents. Later, generalization of the result for more than three agents is presented.
|Collections||ANU Research Publications|
|Source:||Proceedings of International Symposium on Wireless Pervasive Computing (ISWPC 2008)|
|01_Shames_Self-localization_of_Mobile_2008.pdf||242.09 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.