Abstract
This paper introduces the kissing problem: given a rectangular room with n people in it, what is the most efficient way for each pair of people to kiss each other goodbye? The room is viewed as a set of pixels that form a subset of the integer grid. At most one person can stand on a pixel at once, and people move horizontally or vertically. In order to move into a pixel in time step t, the pixel must be empty in time step t − 1.
The paper gives one algorithm for kissing everyone goodbye.
(1) This algorithm is a 4 + o(1)-approximation algorithm in a crowded room (e.g., only one unoccupied pixel).
(2) It is a 10 + o(1)-approximation algorithm for kissing in a comfortable room (e.g., at most half the pixels are empty).
(3) It is a 25+o(1)-approximation for kissing in a sparse room.
Keywords
- Approximation Algorithm
- Mobile Robot
- Approximation Ratio
- Travel Salesman Problem
- Travel Salesman Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alpern, S.: Rendezvous search on labeled networks. Naval Research Logistics 49(3), 256–274 (2002)
Alpern, S., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability 36(1), 223–231 (1999)
Arkin, E., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55(3), 197–218 (1994)
Arkin, R.: Motor schema-based mobile robot navigation. In: Proc. IEEE Conference on Robotics and Automation, pp. 264–271 (1987)
Balch, T., Arkin, R.: Behavior-based formation control for multirobot teams. IEEE Transactions on Robotics and Automation 14(6), 926–939 (1998)
Balch, T., Hybinette, M.: Behavior-based coordination of large-scale robot formations. In: Proc. 4th International Conference on MultiAgent Systems, pp. 363–364 (2000)
Batalin, M., Sukhatme, G.: Spreading out: A local approach to multi-robot coverage. In: Proc. 6th International Symposium on Distributed Autonomous Robotic Systems, pp. 373–382 (2002)
Burgard, W., Moors, M., Fox, D., Simmons, R., Thrun, S.: Collaborative multi-robot exploration. In: Proc. IEEE International Conference on Robotics and Automation (ICRA), vol. 1, pp. 476–481 (2000)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1181–1196. Springer, Heidelberg (2003)
Culberson, J., Schaeffer, J.: Efficiently searching the 15-puzzle. Technical report, Department of Computing Science, University of Alberta (1994)
Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the computational power of oblivious robots: forming a series of geometric patterns. In: Proc. 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 267–276 (2010)
Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic Rendezvous in Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 184–195. Springer, Heidelberg (2003)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Distributed coordination of a set of autonomous mobile robots. In: Proc. IEEE Intelligent Vehicles Symposium (IV), pp. 480–485 (2000)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of Asynchronous Oblivious Robots with Limited Visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 247–258. Springer, Heidelberg (2001)
Garey, M., Graham, R., Johnson, D.: Some NP-complete geometric problems. In: Proc. 8th Annual ACM Symposium on Theory of Computing (STOC), pp. 10–22 (1976)
Gervasi, V., Prencipe, G.: Need a fleet? Use the force! In: Proc. 2nd International Conference on Fun With Algorithms (FUN), pp. 149–164 (2001)
Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing 6(4), 469 (1999)
Hearn, R., Demaine, E.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343(1-2), 72–96 (2005)
Hearn, R.A., Demaine, E.D.: The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 401–413. Springer, Heidelberg (2002)
Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters, Ltd. (2009)
Hopcroft, J., Schwartz, J., Sharir, M.: On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the “warehouseman’s problem”. The International Journal of Robotics Research 3(4), 76–88 (1984)
Hordern, E.: Sliding Piece Puzzles. Oxford University Press (1986)
Howard, A., Matarić, M., Sukhatme, G.: An incremental self-deployment algorithm for mobile sensor networks. Autonomous Robots 13(2), 113–126 (2002)
Howard, A., Matarić, M., Sukhatme, G.: Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In: Proc. 6th International Symposium on Distributed Autonomous Robotics Systems (DARS), pp. 299–308 (2002)
Hsiang, T., Arkin, E., Bender, M., Fekete, S., Mitchell, J.: Algorithms for rapidly dispersing robot swarms in unknown environments. In: Proc. 5th Workshop on Algorithmic Foundations of Robotics (WAFR), pp. 77–94 (2004)
Hwang, Y., Ahuja, N.: Gross motion planning a survey. ACM Computing Surveys (CSUR) 24(3), 219–291 (1992)
Karlemo, F., Östergård, P.: On sliding block puzzles. Journal of Combinatorial Mathematics and Combinatorial Computing (2000)
Kowalski, D.R., Malinowski, A.: How to Meet in Anonymous Network. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 44–58. Springer, Heidelberg (2006)
Kurazume, R., Nagata, S.: Cooperative positioning with multiple robots. In: Proceedings of 1994 IEEE International Conference on Robotics and Automation, pp. 1250–1257. IEEE (1994)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann Publishers (1992)
Nassimi, D., Sahni, S.: Bitonic sort on a mesh-connected parallel computer. IEEE Transactions on Computers 100(1), 2–7 (1979)
Rater, D., Warmuth, M.: Finding a shortest solution for the nxn extension of the 15-puzzle is intractable. Journal of Symbolic Computation 10, 111–137 (1990)
Ratliff, H., Rosenthal, A.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Operations Research, 507–521 (1983)
Rekleitis, I.M., Dudek, G., Milios, E.E.: Graph-based exploration using multiple robots. In: 5th International Symposium on Distributed and Autonomous Robotic Systems, pp. 241–250. Springer (2000)
Scherson, I., Sen, S.: Parallel sorting in two-dimensional VLSI models of computation. IEEE Transactions on Computers 38(2), 238–249 (1989)
Simmons, R., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., Younes, H.: Coordination for multi-robot exploration and mapping. In: Proceedings National Conference on Artificial Intelligence, pp. 852–858. AAAI Press, MIT Press, Menlo Park, Cambridge (1999, 2000)
Singh, K., Fujimura, K.: Map making by cooperating mobile robots. In: Proceedings of 1993 IEEE International Conference on Robotics and Automation (ICRA), pp. 254–259 (1993)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)
Wagner, I., Lindenbaum, M., Bruckstein, A.: Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation 15(5), 918–933 (1999)
Wang, J.: On sign-board based inter-robot communication in distributed robotic systems. In: Proc. 1994 IEEE International Conference on Robotics and Automation, pp. 1045–1050 (1994)
Wilson, R.M.: Graph puzzles, homotopy, and the alternating group. Journal of Combinatorial Theory, Series B 16(1), 86–96 (1974)
Yamauchi, B.: Frontier-based exploration using multiple robots. In: Proc. 2nd International Conference on Autonomous Agents, pp. 47–53 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bender, M.A., Bose, R., Chowdhury, R., McCauley, S. (2012). The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-30347-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30346-3
Online ISBN: 978-3-642-30347-0
eBook Packages: Computer ScienceComputer Science (R0)
