Abstract
Searching for intelligent escaping agents constitutes an interesting and hard problem. The use of multiple agents in the search involves decentralized coordination. This paper presents a novel solution for the problem of distributed search proposing SERs, a variant for the mechanism of Scheduling by Edge Reversal. The mechanism was applied to search for agents with four different types of behavior. Experimental results are presented for the evaluation of efficiency and scalability of the mechanism according to the studied types of behavior and sensor range, among other parameters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alves, D.S.F., Soares, E.E., de, M., Strachan, G.C., Carvalho, G.P.S., Xaud, M.F.S., Couto, M.V.B., Mendona, R.M., Freitas, R.S., Santos, T.M., Gonçalves, V.C.F., Mourelle, L.M., Nedjah, N., Maculan, N., Lima, P.M.V., França, F.M.G.: Mobile Ad Hoc Robots and Wireless Robotic Systems: Design and Implementation. IGI Global, Pensylvania (to appear, 2012)
Arantes Jr., G.M., França, F.M.G., Martinhon, C.A.: Randomized generation of acyclic orientations upon anonymous distributed systems. J. of Par. and Dist. Comp. 69(3), 239–246 (2009)
Barbosa, V.C., Gafni, E.: Concurrency in heavily loaded neighborhood-constrained systems. ACM Trans. Prog. Lang. Syst. 11, 562–584 (1989)
Carvalho, D., Protti, F., De Gregorio, M., França, F.M.G.: A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 431–442. Springer, Heidelberg (2005)
Cassia, R.F., Alves, V.C., Besnard, F.G.-D., França, F.M.G.: Synchronous-to-asynchronous conversion of cryptographic circuits. J. of Cir., Sys., and Comp. 18(2), 271–282 (2009)
Flocchini, P.: Contamination and decontamination in majority-based systems. J. Cell. Auto. 4(3), 183–200 (2009)
Flocchini, P., Nayak, A., Schulz, A.: Cleaning an Arbitrary Regular Network with Mobile Agents. In: Chakraborty, G. (ed.) ICDCIT 2005. LNCS, vol. 3816, pp. 132–142. Springer, Heidelberg (2005)
Gonçalves, V.C.F., Lima, P.M.V., Maculan, N., França, F.M.G.: A Distributed Dynamics for WebGraph Decontamination. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 462–472. Springer, Heidelberg (2010)
Lengerke, O., Carvalho, D., Lima, P.M.V., Dutra, M.S., Mora-Camino, F., França, F.M.G.: Controle distribuído de sistemas job shop usando escalonamento por reversão de arestas. In: Procs. of The XIV Latin Ibero-American Congress on Operations Research, pp. 1–3. CLAIO (2008)
Luccio, F., Pagli, L.: Web Marshals Fighting Curly Link Farms. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 240–248. Springer, Heidelberg (2007)
Moscarini, M., Petreschi, R., Szwarcfiter, J.L.: On node searching and starlike graphs. Congressus Numerantium 131, 5–84 (1998)
Wilensky. U.: Netlogo. Netlogo. Center for Connected Learning and Computer-Based Modeling. Northwestern University, Illinois (1999), http://ccl.northwestern.edu/netlogo/
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
Alves, D.S.F., França, F.M.G., de Macedo Mourelle, L., Nedjah, N., Lima, P.M.V. (2012). The Effect of Intelligent Escape on Distributed SER-Based Search. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2012. ICCSA 2012. Lecture Notes in Computer Science, vol 7333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31125-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31125-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31124-6
Online ISBN: 978-3-642-31125-3
eBook Packages: Computer ScienceComputer Science (R0)