1 / 1

On the solvability of the localization problem in robot networks

On the solvability of the localization problem in robot networks. Yoann Dieudonné and Ouiddad Labbani-Igbida and Franck Petit CREA - LaRIA/CNRS Université de Picardie Jules Verne 5-7 rue du Moulin Neuf, 80000 Amiens, France.

chalondra-naiser
Download Presentation

On the solvability of the localization problem in robot networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. On the solvability of the localization problem in robot networks Yoann Dieudonné and Ouiddad Labbani-Igbida and Franck Petit CREA - LaRIA/CNRS Université de Picardie Jules Verne 5-7 rue du Moulin Neuf, 80000 Amiens, France • The question: Robot network localization problem (RNLP) using relative observations (distance, bearing) only • Deterministic and non ambiguous solvability of RNLP problem is NP-hard • Proof construction based on polynomial reductions from a known NP-hard problem • What are the consequences on the robot group localization? An instance of RNLP

More Related