Polygon-Constrained Motion Planning Problems
We consider the following class of polygon-constrained motion planning problems: Given a set of \(k\) centrally controlled mobile agents (say pebbles) initially sitting on the vertices of an \(n\)-vertex simple polygon \(P\), we study how to plan their vertex-to-vertex motion in order to reach with a minimum (either maximum or total) movement (either in terms of number of hops or Euclidean distance) a final placement enjoying a given requirement. In particular, we focus on final configurations aiming at establishing some sort of visual connectivity among the pebbles, which in turn allows for wireless and optical intercommunication. Therefore, after analyzing the notable (and computationally tractable) case of gathering the pebbles at a single vertex (i.e., the so-called rendez-vous), we face the problems induced by the requirement that pebbles have eventually to be placed at: (i) a set of vertices that form a connected subgraph of the visibility graph induced by \(P\), say \(G(P)\) (connectivity), and (ii) a set of vertices that form a clique of \(G(P)\) (clique-connectivity). We will show that these two problems are actually hard to approximate, even for the seemingly simpler case in which the hop distance is considered.
The authors wish to thank an anonymous referee for her/his insightful comments, which helped us in improving the paper.
- 1.Ahmadian, S., Friggstad, Z., Swamy, C.: Local-search based approximation algorithms for mobile facility location problems. arXiv preprint:1301.4478 (2013)Google Scholar
- 3.Berman, P., Demaine, E.D., Zadimoghaddam, M.: O(1)-approximations for maximum movement problems. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol. 6845, pp. 62–74. Springer, Heidelberg (2011)Google Scholar
- 4.Bilò, D., Gualà, L., Leucci, S., Proietti, G.: Exact and approximate algorithms for movement problems on (special classes of) graphs. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 322–333. Springer, Heidelberg (2013)Google Scholar
- 6.Demaine, E.D., Hajiaghayi, M., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA’07), pp. 258–267 (2007)Google Scholar
- 7.Friggstad, Z., Salavatipour, M.R.: Minimizing movement in mobile facility location problems. ACM Trans. Algorithms 7(3), article 28, 1–22 (2011)Google Scholar
- 11.Prencipe, G., Santoro, N.: Distributed algorithms for autonomous mobile robots. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds.) TCS 2006. IFIP, vol. 206, pp. 47–62. Springer, Heidelberg (2006)Google Scholar