Abstract | ||
---|---|---|
We consider a new problem of robust trajectory planning for robots that have a physical destination and a communication constraint. Specifically, the robot or automatic vehicle must move from a given starting point to a target point while uploading/downloading a given amount of data within a given time, while accounting for the energy cost and the time taken to download. However, this trajectory is assumed to be planned in advance (e.g., because online computation cannot be performed). Due to wireless channel fluctuations, it is essential for the planned trajectory to be robust to packet losses and meet the communication target with a sufficiently high probability. This optimization problem contrasts with the classical mobile communications paradigm in which communication aspects are assumed to be independent from the motion aspects. This setup is formalized here and leads us to determining non-trivial trajectories for the mobile, which are highlighted in the numerical result. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-68179-5_39 | UBIQUITOUS NETWORKING, UNET 2017 |
DocType | Volume | ISSN |
Conference | 10542 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Daniel Bonilla Licea | 1 | 17 | 4.92 |
Vineeth S. Varma | 2 | 30 | 14.31 |
Samson Lasaulce | 3 | 868 | 74.24 |
Jamal Daafouz | 4 | 686 | 76.19 |
Mounir Ghogho | 5 | 1072 | 113.80 |
Desmond C. McLernon | 6 | 229 | 36.55 |