Utilizing Path Finding Algorithm for Secured Path Identification in Situational Crime Prevention

Authors

  • Masita Abdul Jalil School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia.
  • Fatihah Mohd School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia.
  • Wan Mohd Farhan Wan Nawawi School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia.
  • Noor Maizura Mohamad Noor School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia.

Keywords:

Analytical Hierarchy Process, Chess Game, Path-Finding, Situational Crime Prevention,

Abstract

Crimes could happen anywhere and at any time. Most crimes happen when there exist opportunity for crimes to take place. Such crimes are categorized as situational crime. In this study, we are interested in this type of crimes because it focuses on the settings and pattern of crime, rather than upon those committing criminal acts. Crime prevention can be referred to as attempts made to reduce and deter crime and criminals. It is applied specifically to efforts made by government authorities and agencies to reduce crime, enforce the law, and maintain criminal justice. In this research, we propose a hybrid model, known as PCAHP that combine path finding algorithm, chess strategy and Analytical Hierarchical Process (AHP) to handle uncertain situations when approaching crime prone areas. In this tactical path finder, considerations need to be given to various factors affecting the best decision on alternative paths in order to avoid the risks of becoming the victims of crime. A support system adopting the PCAHP model will be developed to calculate the weights of the criteria for evaluating each crime factors and suggesting the safest possible path. The expected result of this research is to come out with a support tool that could help the public especially the pedestrian in choosing the safest alternative path either when passing through a crime hotspot or faced with uncertain situations to prevent crimes. The tool should also help to create awareness to the public on the status of crimes in their neighborhood.

References

R. V. Clarke, “Situational crime prevention,” Crime and Justice, vol. 19. pp. 91-150, 1995.

S. Campbell, W. Naeem, and G. W. Irwin, “A review on improving the autonomy of unmanned surface vehicles through intelligent collision avoidance manoeuvres,” Annual Reviews in Control, vol. 36. no. 2, pp. 267-283, 2012.

S. M. Kumari, and N. Geethanjali, “A survey on shortest path routing algorithms for public transport travel,” Global Journal of Computer Science and Technology, vol. 9. no. 5, pp. 73-76, 2010.

X. Cui, and H. Shi, “A*-based pathfinding in modern computer games,” Int. Journal of Computer Science and Network Security, vol. 11. no. 1, pp. 125-130, 2011.

Y. J. Joo, and S. H. Kim, “A new route guidance method considering pedestrian level of service using multi-criteria decision making technique,” Journal of Korea Spatial Information Society, vol. 19. no. 1, pp. 83-91, 2011.

S. Handy, “Methodology for exploring the link between urban form and travel behavior,” Transportation Research Part D, vol. 1. no. 2, pp. 151-165, 1996.

A. V. Moudon, and C. Lee, “Walking and bicycling: an evaluation of environmental audit instruments,” American Journal of Health Promotion, vol. 18. no. 1, pp. 21-37, 2003.

C. Lee, and A. V. Moudon, “The 3Ds + R: Quantifying land use and urban form correlates of walking,” Transportation Research Part D: Transport and Environment, vol. 11. no. 3, pp. 204-215, 2006.

S. H. Park, Y. M. Choi, and H. L. Seo, “Measuring walkability in urban residential neighborhoods: development of walkability indicators, Seoul, Korea,” Journal of The Architectural Institute of Korea Planning & Design, vol. 24. no. 1, pp. 161-172, 2008.

H. C. Borst, S. I. de Vries, J. M. Graham, J. E. van Dongen, I. Bakker, and H. M. Miedema, “Influence of environmental street characteristics on walking route choice of elderly people,” Journal of Environmental Psychology, vol. 29. no. 4, pp. 477-484, 2009.

J. E. Lee, B. S. Son, and H. J. Kim, “Development of transportation algorithm for pedestrian in shopping area,” Journal of The Korean Society of Civil, vol. 28. no. 2D, pp. 147-154, 2008.

T. C. H. John, E. C. Prakash, and N. S. Chaudhari, “Strategic team AI path plans: probabilistic pathfinding,” Int. Journal of Computer Games Technology, vol. 2008. no. pp. 1-6, 2008.

B. T. Zhang, and S. H. Kim, “An evolutionary method for active learning of mobile robot path planning,” in Proc. Computational Intelligence in Robotics and Automation, 1997, pp. 312-317.

C. T. Tan, and H. L. Cheng, “A combined tactical and strategic hierarchical learning framework in multi-agent games,” in Proc. The 2008 ACM SIGGRAPH symposium on Video Games, 2008, pp. 115- 122.

J. Stamford, A. S. Khuman, J. Carter, and S. Ahmadi, “Pathfinding in partially explored games environments: The application of the A∗ Algorithm with occupancy grids in Unity3D,” in Proc. the 14th UK Workshop on Computational Intelligence (UKCI), 2014, pp. 1-6.

N. H. Barnouti, S. S. M. Al-Dabbagh, and M. A. S. Naser, “Pathfinding in strategy games and maze solving using A search algorithm,” Journal of Computer and Communications, vol. 4. no. 11, pp. 15, 2016.

Y. Deng, Y. Chen, Y. Zhang, and S. Mahadevan, “Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment,” Applied Soft Computing, vol. 12. no. 3, pp. 1231-1237, 2012.

Z. A. Algfoor, M. S. Sunar, and H. Kolivand, “A comprehensive study on pathfinding techniques for robotics and video games,” Int. Journal of Computer Games Technology, vol. 2015. no. pp. 7, 2015.

R. Graham, H. McCabe, and S. Sheridan, “Pathfinding in computer games,” The ITB Journal, vol. 4. no. 2, pp. 6, 2015.

W. M. F. B. Wan, N. M. M. Nor, and M. A. Jalil, “Identification of potential crime tactical path-finding using Analytical Hierarchy Process (AHP) in situational crime prevention,” in Proc. The 7th Int. Conf. on Information Technology, Jordan, 2015, pp. 1-7.

Downloads

Published

2017-10-20

How to Cite

Abdul Jalil, M., Mohd, F., Wan Nawawi, W. M. F., & Mohamad Noor, N. M. (2017). Utilizing Path Finding Algorithm for Secured Path Identification in Situational Crime Prevention. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(3-3), 51–55. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2871

Issue

Vol. 9 No. 3-3: Special Issue on Software Engineering I

Section

Articles

License

TRANSFER OF COPYRIGHT AGREEMENT

The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):

  1. All proprietary right other than copyright, such as patent rights
  2. The right to make further copies of all or part of the published article for my use in classroom teaching
  3. The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
  4. The right to make copies of the published work for internal distribution within the institution that employs me

I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.