Abstract
An important problem in robotics is to determine and maintain the position of a robot that moves through a known environment with indistinguishable landmarks. This problem is made difficult due to the inherent noise in robot movement and sensor readings. Monte Carlo Localization (MCL) is a frequently used technique to solve this problem, and its performance intuitively depends on how the robot explores the environment and the position of the landmarks. In this paper, we propose a navigation policy to reduce the number of steps required by the robot to find its location together with the optimal landmark placement for this policy. This proposal is evaluated and compared against other policies using two specific metrics that indicate its superiority.
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: Revista Eletrônica de Iniciação Científica em Computação
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.
