Robotic Mobility Diversity Algorithm with Continuous Search Space
Daniel Bonilla Licea, Des McLernon, Mounir Ghogho, Edmond Nurellari,, and Syed Ali Raza Zaidiz

TL;DR
This paper introduces an optimized continuous path algorithm for mobile robot wireless communication, leveraging mobility diversity to enhance channel gain while reducing energy consumption.
Contribution
It proposes a novel method to optimize continuous search paths in mobility diversity algorithms, improving channel gain and energy efficiency.
Findings
Optimized paths increase channel gain performance.
Reduced mechanical energy consumption in robot movement.
Enhanced wireless communication quality.
Abstract
Small scale fading makes the wireless channel gain vary significantly over small distances and in the context of classical communication systems it can be detrimental to performance. But in the context of mobile robot (MR) wireless communications, we can take advantage of the fading using a mobility diversity algorithm (MDA) to deliberately locate the MR at a point where the channel gain is high. There are two classes of MDAs. In the first class, the MR explores various points, stops at each one to collect channel measurements and then locates the best position to establish communications. In the second class the MR moves, without stopping, along a continuous path while collecting channel measurements and then stops at the end of the path. It determines the best point to establish communications. Until now, the shape of the continuous path for such MDAs has been arbitrarily selected and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
