Abstract
Multi-goal pathfinding (MGPF) is a problem of searching for a path between an origin and a destination, which allows a set of goals to be satisfied. We are interested in MGPF in ubiquitous environments that are composed of cyber, physical and social (CPS) entities from connected objects, to sensors and to people. Our approach aims at exploiting data from various resources such as CPS entities and the Web to solve MGPF. However, accessing resources creates overheads – specifically latency affecting the efficiency of the approach. In this paper, we present a collaborative multi-agent search model that addresses the latency problem. The model handles the process of accessing resources such that agents are not blocked while data from resources are being processed and transferred. Agents search concurrently and collaboratively on different parts of the search space. The model exploits the knowledge and structure of the search space to distribute the work among agents and to create an agent network facilitating agent communications as well as separating the search from the communications. To evaluate our model, we apply it in uniform cost search, creating a collaborative uniform cost algorithm. We compare it to the original algorithm. Experiments are conducted on search spaces of various sizes and structures. In most cases, collaborative uniform cost is shown to run significantly faster and scale better in function of latency as well as graph size.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Algfoor, Z.A., Sunar, M.S., Kolivand, H.: A comprehensive study on pathfinding techniques for robotics and video games. Int. J. Comput. Games Technol. 2015, 7 (2015)
Botea, A., Bouzy, B., Buro, M., Bauckhage, C., Nau, D.: Pathfinding in games. In: Dagstuhl Follow-Ups, vol. 6. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)
Botea, A., Müller, M., Schaeffer, J.: Near optimal hierarchical path-finding. J. Game Dev. 1(1), 7–28 (2004)
Ciortea, A., Zimmermann, A., Boissier, O., Florea, A.M.: Towards a social and ubiquitous web: a model for socio-technical networks. In: 2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), vol. 1, pp. 461–468, December 2015
Codognet, P.: Multi-goal path-finding for autonomous agents in virtual worlds. In: Nakatsu, R., Hoshino, J. (eds.) Entertainment Computing. ITIFIP, vol. 112, pp. 23–30. Springer, Boston (2003). doi:10.1007/978-0-387-35660-0_3
Denzinger, J.: Conflict handling in collaborative search. In: Tessier, C., Chaudron, L., Müller, H.-J. (eds.) Conflicting Agents: Conflict Management in Multi-Agent Systems, pp. 251–278. Springer, Boston (2002)
Ghallab, M., Nau, D., Traverso, P.: Automated Planning and Acting. Cambridge University Press, Cambridge (2016)
Graham, R., McCabe, H., Sheridan, S.: Pathfinding in computer games. ITB J. 4(2), 6 (2015)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Kishimoto, A., Fukunaga, A.S., Botea, A., et al.: Scalable, parallel best-first search for optimal sequential planning. In: ICAPS (2009)
Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. 155(1–2), 93–146 (2004)
Lim, K.L., Yeong, L.S., Ch’ng, S.I., Seng, K.P., Ang, L.M.: Uninformed multigoal pathfinding on grid maps. In: 2014 International Conference on Information Science, Electronics and Electrical Engineering, vol. 3, pp. 1552–1556, April 2014
Matai, R., Singh, S.P., Mittal, M.L.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Traveling Salesman Problem, Theory and Applications, pp. 1–24 (2010)
Nissim, R., Brafman, R.I.: Multi-agent A* for parallel and distributed systems. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, vol. 3. pp. 1265–1266 (2012)
Rabin, S.: A* speed optimizations. Game Program. Gems 1, 272–287 (2000)
Standley, T., Korf, R.: Complete algorithms for cooperative pathfinding problems. In: IJCAI, pp. 668–673. Citeseer (2011)
Standley, T.S.: Finding optimal solutions to cooperative pathfinding problems. In: AAAI, vol. 1, pp. 28–29 (2010)
Stentz, A.: Optimal and efficient path planning for partially-known environments. In: Proceedings of 1994 IEEE International Conference on Robotics and Automation, pp. 3310–3317. IEEE (1994)
Vrakas, D., Refanidis, I., Vlahavas, I.: Parallel planning via the distribution of operators. J. Exp. Theoret. Artif. Intell. 13(3), 211–226 (2001)
Wang, K.H.C., Botea, A.: Fast and memory-efficient multi-agent pathfinding. In: ICAPS, pp. 380–387 (2008)
Werner, M.: Selection and ordering of points-of-interest in large-scale indoor navigation systems. In: 2011 IEEE 35th Annual Computer Software and Applications Conference, pp. 504–509, July 2011
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kem, O., Balbo, F., Zimmermann, A. (2017). Collaborative Search for Multi-goal Pathfinding in Ubiquitous Environments. In: Berndt, J., Petta, P., Unland, R. (eds) Multiagent System Technologies. MATES 2017. Lecture Notes in Computer Science(), vol 10413. Springer, Cham. https://doi.org/10.1007/978-3-319-64798-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-64798-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64797-5
Online ISBN: 978-3-319-64798-2
eBook Packages: Computer ScienceComputer Science (R0)