Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Artificial-intelligence-based heuristic searching tools and knowledge representation to solve cryptography problems, puzzles, vehicle detection and path finding

Artificial-intelligence-based heuristic searching tools and knowledge representation to solve... The objective of this paper is to present different artificial-intelligence-based heuristic searching algorithms, such as the ones in this paper: the breadth-first search (BFS), depth-first search (DFS), Best-First Search, and A* and AO* searching techniques. The BFS and DFS help solve puzzles and simple Caesar cipher substitution problems. In this paper, plain text is obtained from the given cipher text using the BFS and DFS. The A* approach is used to solve puzzles and find the best path between a start city and a destination city. Finally, the AO* algorithm graph is drawn to find a vehicle in heavy traffic in cities. It is justified that the artificial intelligence tools discussed in this paper are successfully used to solve cryptographic problems, puzzles, path finding and vehicle detection. Keywords: A*; AO*; best first; BFS; DFS; knowledge representation. Reference to this paper should be made as follows: Raja, S.P. Diliphan Rajkumar, T. and Sowndariya, K. (2017) `Artificial-intelligence-based heuristic searching tools and knowledge representation to solve cryptography problems, puzzles, vehicle detection and path finding', Int. J. Signal and Imaging Systems Engineering, Vol. 10, Nos. 1/2, pp.1­7. Biographical notes: S.P. Raja completed his BTech in Information Technology in the year 2007 from http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Signal and Imaging Systems Engineering Inderscience Publishers

Artificial-intelligence-based heuristic searching tools and knowledge representation to solve cryptography problems, puzzles, vehicle detection and path finding

Download PDF
7 pages

Loading next page...
 
/lp/inderscience-publishers/artificial-intelligence-based-heuristic-searching-tools-and-knowledge-4w4UUb5Z5R

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © 2017 Inderscience Enterprises Ltd.
ISSN
1748-0698
eISSN
1748-0701
DOI
10.1504/IJSISE.2017.084563
Publisher site
See Article on Publisher Site

Abstract

The objective of this paper is to present different artificial-intelligence-based heuristic searching algorithms, such as the ones in this paper: the breadth-first search (BFS), depth-first search (DFS), Best-First Search, and A* and AO* searching techniques. The BFS and DFS help solve puzzles and simple Caesar cipher substitution problems. In this paper, plain text is obtained from the given cipher text using the BFS and DFS. The A* approach is used to solve puzzles and find the best path between a start city and a destination city. Finally, the AO* algorithm graph is drawn to find a vehicle in heavy traffic in cities. It is justified that the artificial intelligence tools discussed in this paper are successfully used to solve cryptographic problems, puzzles, path finding and vehicle detection. Keywords: A*; AO*; best first; BFS; DFS; knowledge representation. Reference to this paper should be made as follows: Raja, S.P. Diliphan Rajkumar, T. and Sowndariya, K. (2017) `Artificial-intelligence-based heuristic searching tools and knowledge representation to solve cryptography problems, puzzles, vehicle detection and path finding', Int. J. Signal and Imaging Systems Engineering, Vol. 10, Nos. 1/2, pp.1­7. Biographical notes: S.P. Raja completed his BTech in Information Technology in the year 2007 from

Journal

International Journal of Signal and Imaging Systems Engineering – Inderscience Publishers

Published: Jan 1, 2017

There are no references for this article.