A COMBINED UNIFORM AND HEURISTIC SEARCH ALGORITHM FOR MAINTAINING SHORTEST PATHS ON FULLY DYNAMIC GRAPHS

Sandro Castronovo, Björn Kunz, Christian Müller

Abstract

Shortest-path problems on graphs have been studied in depth in Artificial Intelligence and Computer Science. Search on dynamic graphs, i.e. graphs that can change their layout while searching, receives plenty of attention today – mostly in the planning domain. Approaches often assume global knowledge on the dynamic graph, i.e. that topology and dynamic operations are known to the algorithm. There exist use-cases however, where this assumption cannot be made. In vehicular ad-hoc networks, for example, a vehicle is only able to recognize the topology of the graph within wireless network transmission range. In this paper, we propose a combined uniform and heuristic search algorithm, which maintains shortest paths in highly dynamic graphs under the premise that graph operations are not globally known.

References

  1. Barr, R., Haas, Z. J., and van Renesse, R. (2005). Jist: An efficient approach to simulation using virtual machines. Software Practice & Experience, 35(6):539- 576.
  2. Cicerone, S., Stefano, G. D., Frigioni, D., and Nanni, U. (2003). A fully dynamic algorithm for distributed shortest paths. Theoretical Computer Science, 297:1- 3.
  3. Demetrescu, C. and Italiano, G. F. (2003). A new approach to dynamic all pairs shortest paths. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, STOC 7803, pages 159-166, New York, NY, USA. ACM.
  4. Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerische Mathematik, 1:269- 271.
  5. Frigioni, D., Spaccamela, A. M., and Nanni, U. (2000). Fully dynamic algorithms for maintaining shortest path trees. Algorithms, 34(2):251-281.
  6. Granelli, F., Boato, G., Kliazovich, D., and Vernazza, G. (2007). Enhanced gpsr routing in multi-hop vehicular communications through movement awareness. IEEE COMMUNICATIONS LETTERS, 11(10):781-783.
  7. Koenig, S., Likhachev, M., and Furcy, D. (2004). Lifelong planning A*. Artif. Intell., 155:93-146.
  8. Krajzewicz, D., Hertkorn, G., Rössel, C., and Wagner, P. (2002). Sumo (simulation of urban mobility); an open-source traffic simulation. In Proceedings of the 4th Middle East Symposium on Simulation and Modelling.
  9. Misra, S. and Oommen, B. J. (2004). Stochastic learning automata-based dynamic algorithms for the single source shortest path problem. In Proceedings of the 17th international conference on Innovations in applied artificial intelligence, IEA/AIE'2004, pages 239-248. Springer Springer Verlag Inc.
  10. N. Naumann, B. Schuenemann, I. R. (2009). Vsimrti - simulation runtime infrastructure for v2x communication scenarios. In Proceedings of the 16th World Congress and Exhibition on Intelligent Transport Systems and Services.
  11. Nannicini, G. and Liberti, L. (2008). Shortest paths on dynamic graphs.
  12. Seet, B., Liu, G., Lee, B., Foh, C., and Wong, K.-J. (2004). A-star: A mobile ad hoc routing strategy for metropolis vehicular communications. In Lecture Notes in Computer Science Vol. 3042: IFIP-TC6 Networking Conference.
Download


Paper Citation


in Harvard Style

Castronovo S., Kunz B. and Müller C. (2012). A COMBINED UNIFORM AND HEURISTIC SEARCH ALGORITHM FOR MAINTAINING SHORTEST PATHS ON FULLY DYNAMIC GRAPHS . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 119-126. DOI: 10.5220/0003743401190126


in Bibtex Style

@conference{icaart12,
author={Sandro Castronovo and Björn Kunz and Christian Müller},
title={A COMBINED UNIFORM AND HEURISTIC SEARCH ALGORITHM FOR MAINTAINING SHORTEST PATHS ON FULLY DYNAMIC GRAPHS},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={119-126},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003743401190126},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - A COMBINED UNIFORM AND HEURISTIC SEARCH ALGORITHM FOR MAINTAINING SHORTEST PATHS ON FULLY DYNAMIC GRAPHS
SN - 978-989-8425-95-9
AU - Castronovo S.
AU - Kunz B.
AU - Müller C.
PY - 2012
SP - 119
EP - 126
DO - 10.5220/0003743401190126