Free

A* Search algorithm - Artificial Intellegence - Discussion - Assignment Example

Comments (0) Cite this document
Summary
Heuristic is a rule of thumb that can be of help in order to solve a given problem. It considers the knowledge of the problem to aid the search process. (Jones, 2008) and aims at minimizing the number…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER96.4% of users find it useful
A* Search algorithm - Artificial Intellegence - Discussion
Read TextPreview

Extract of sample "A* Search algorithm - Artificial Intellegence - Discussion"

Running Head: A* Search algorithm - Artificial Intelligence A* Search algorithm - Artificial Intelligence [Institute’s A* Search algorithm - Artificial Intelligence
A heuristic resembles an algorithm except that it has a difference of a key. Heuristic is a rule of thumb that can be of help in order to solve a given problem. It considers the knowledge of the problem to aid the search process. (Jones, 2008) and aims at minimizing the number of nodes.
A* Search is an uninformed search method which in similarity with the best-search method uses a heuristic function. The major type of heuristic involved in A * search is the admissible heuristic. The A* search uses a heuristic function that is a distance-plus-cost which in turn is a sum of a path-cost function (g(x)) which may not necessarily be heuristic and an admissible heuristic (h(x)).
An admissible function is a function that is lowest-cost path to the target or in other words, a heuristic is admissible if it does not overestimate the cost (Russell & Norvig, 2002). It is the path evaluation function that A* uses to choose suitable paths through the search space (Copin, 2004). The other functions are consistent heuristic function and the incremental heuristic search. While former, solve problems without taking any step back, the later approaches solution by reusing previous searches’ information to pace.
Some conditions that guarantee an optimal minimum-cost path are; (Kaufman. 1998) firstly, each node of the graph has finite number of successors, if any. Secondly, all the arcs’ costs are greater than some positive amount and lastly, h function called optimistic estimator, for all nodes n in the search graph, never overestimates the actual value. Moreover, since these conditions are most likely met in real-world situations, A* search is optimal and complete (Copin, 2004).
References
Coppin, Ben. (2004). Artificial intelligence illuminated. Jones & Bartlett Publishers.
Jones, M. Tim. (2008). Artificial Intelligence: A Systems Approach. Jones & Bartlett Publishers.
Nilsson, Nils J. (1998). Artificial intelligence: a new synthesis. Morgan Kaufman.
Russell, S. J and Norvig, P. (2002). Artificial Intelligence: A Modern Approach. Prentice Hall. Read More
Cite this document
  • APA
  • MLA
  • CHICAGO
(“A* Search algorithm - Artificial Intellegence - Discussion Assignment”, n.d.)
A* Search algorithm - Artificial Intellegence - Discussion Assignment. Retrieved from https://studentshare.org/miscellaneous/1557728-a-search-algorithm-artificial-intellegence-discussion
(A* Search Algorithm - Artificial Intellegence - Discussion Assignment)
A* Search Algorithm - Artificial Intellegence - Discussion Assignment. https://studentshare.org/miscellaneous/1557728-a-search-algorithm-artificial-intellegence-discussion.
“A* Search Algorithm - Artificial Intellegence - Discussion Assignment”, n.d. https://studentshare.org/miscellaneous/1557728-a-search-algorithm-artificial-intellegence-discussion.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF A* Search algorithm - Artificial Intellegence - Discussion

Artificial Intelligence

...Teacher Artificial Intelligence Introduction Artificial Intelligence (AI) is considered as an important field of science that is concernedwith making machines that discover solutions to complicated problems in a human-like approach. This usually engages using characteristics from people intelligence, as well as implementing them like algorithms inside a computer affable manner. In this scenario, a lot of supple or efficient tactics can be adopted relying on the requirements recognized; those proficiently control how artificial the intellectual actions come out. Additionally, artificial intelligence is usually connected to computer science however it has...
20 Pages(5000 words)Research Paper

Artificial lung

...?The Artificial Lung Lungs are one of the most vital organs in the body. Unlike the kidneys, nobody can function with only one lung. Its mechanics are amazing to behold, they work in great harmony with the other body organs. The lungs chief purpose is to move oxygen from the atmosphere into the blood and move carbon dioxide from the blood to the atmosphere. Once the oxygen gets into the blood, it is quickly carried to the organs and tissues that are in need of it. In the current day and age that we live, diseases have plagued the human body, and the respiratory system has not been exempted. Many people have had to battle diseases that have affected their lungs and other parts of their respiratory system, and even with their donors... . These...
5 Pages(1250 words)Research Paper

Artificial Intelligence

.... Although AI research does not aim at wholly imitating human intelligence, evidence exists that suggests human intelligence is a key tacit heuristic to AI researchers and strongly affects AI studies (Prudkov, 2010). In this regard, intelligence is described as a set of properties of mind, which include the ability to plan, solve problems and reason out depending on the presented stimuli. The replication of intelligence based on human and animal behaviour produces intelligent agents, which have the capacity to respond to the environment in natural way. For instance, artificial intelligence in machines coupled with algorithms, enables them to solve complex problems in humanistic fashion. In essence, AI...
6 Pages(1500 words)Research Paper

Hashing Algorithm

...threats were as well propose (Sobti, Geetha, & Anand, 2012; Algredo-Badillo, Morales-Sandoval, Feregrino-Uribe, & Cumplido, 2012). This paper presents a detailed analysis of hashing algorithms. This paper will discuss the uses and applications of hashing algorithms. This paper will focus on some of the important hashing algorithms such as digital signatures algorithms, cryptography algorithms and various other techniques. Hashing Algorithms Basically, the process of hashing simplifies the search process by making use of computationally a few operations as compared to any other sequential basic...
10 Pages(2500 words)Research Paper

Algorithm Visualization

.... These data banks contained huge collections gathered through the submission of members of the computer science society. These collections didn't turn out to be useful. (line 23-27, 2nd column of page 153) 7.0 Relevance to Practitioners IS/SE educators could benefit from the effort of the authors to establish a wiki or a repository containing animated algorithms that can provide value to the community. This can help overcome the major impediment that most educators have of knowing what makes a significant difference in learning outcomes and facilitate their synthesis of course material. The students can also benefit from the availability of a site where they can access course material without having to conduct an...
12 Pages(3000 words)Book Report/Review

Artificial Intelligence Research Paper and Proposal

...to the collaborating agents. One simple example is - proposing additional search parameters to the collaborators that may be trying to search for some information. Kaminka and Pynadath used their work to develop the over-hearing system with performance evaluation YOYO algorithm using the Plan Recognition Bayesian Networks developed by Charnaik and Goldman et al. (1993. p.60-61) which recognizes the probability of a plan as "1" if at least one of the plans in the plan hierarchy network is true. Becerra-Fernandez (2000. p.315-320) presented a research on application of artificial intelligence in finding experts in a large organization that can contribute to a purpose -...
17 Pages(4250 words)Research Paper

Hash Algorithm and Secure Hash Algorithm

...Your first and sur Your Due Hash Algorithm and Secure Hash Algorithm ""A hash function is a reproducible method of turning some kind of data into a (relatively) small number that may serve as a digital "fingerprint" of the data. The algorithm "chops and mixes" (i.e., substitutes or transposes) the data to create such fingerprints. The fingerprints are called hash sums, hash values, hash codes or simply hashes. (Note that hashes can also mean the hash functions.) Hash sums are commonly used as indices into hash tables or hash files. Cryptographic hash functions are used for various purposes in information security applications.""1 "Hash functions are designed to be fast and to yield few...
12 Pages(3000 words)Essay

Evolution intellegence design

... Evolution and Intelligent Design Ever since Darwin proposed his theory for the origin of the species, a debate has raged in the scientific and religious communities about the authenticity of the origins of human beings from the biological processes of evolution and natural selection or the presence of an outside influence which guides the path of biological development. In recent times, the idea of an ‘invisible hand’ (which has religious and spiritual connotations) guiding the development of human beings and other animals has surfaced under the label of Intelligent Design (Wikipedia, 2006). Fundamentally, the concept of intelligent design has to do with the premise that certain aspects of the world and the biological creations... Evolution...
2 Pages(500 words)Essay

Algorithm

...Algorithm Design, Analysis and Implementation Assignment 3 To find the longest palindrome in the sequence x n Using LCS (Longest Common Subsequence) Definition: Palindromes are sequences 1...n that remain unchanged even if we reverse the order to n...1 and, hence, palindromic subsequence in the given sequence would be a common subsequence between the original array and the reversed array. Solution: The longest palindrome can be found by first finding the longest common subsequence of the given array, and then checking if it satisfies the conditions for palindrome. If not satisfied, the process is repeated with the longest common subsequence as the new array. The algorithm can be summed up as: Algorithm: Complexity Analysis: LCS... ...
7 Pages(1750 words)Assignment

Artificial sweeteners

...Jamie Kehl 06/22 Table of contents Introduction 2 Brand of sweeteners 2 Acesulfame potassium 2 Aspartame 2 Cyclamate 3 Neotame 3 Saccharin 3 Sucralose 3 Side effects 3 Safety precautions 5 Conclusion 5 Works Cited 6 ARTIFICIAL SWEETENERS Introduction An Artificial sweetener is considered as a substitute of sugar that is processed from a synthesized compound, or is the sweetness that is not natural (Weimblatt 1). The sweetener provides a sugar sweetness that is without calories. The Artificial sweeteners give the food humans eat a sweet taste, but they have a small amount of energy if it has any at all. Most of the...
3 Pages(750 words)Research Paper
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Assignment on topic A* Search algorithm - Artificial Intellegence - Discussion for FREE!

Contact Us