2000 character limit reached
Minkowski Operations of Sets with Application to Robot Localization
Published 11 Apr 2017 in cs.RO, cs.AI, cs.CG, and cs.SY | (1704.03103v1)
Abstract: This papers shows that using separators, which is a pair of two complementary contractors, we can easily and efficiently solve the localization problem of a robot with sonar measurements in an unstructured environment. We introduce separators associated with the Minkowski sum and the Minkowski difference in order to facilitate the resolution. A test-case is given in order to illustrate the principle of the approach.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.