Reference Page

Website/ PowerPoint:

References:

Birch, C., 2010. Understanding Pac-Man Ghost Behavior. [Online]
Available at: http://gameinternals.com/post/2072558330/understanding-pac-man-ghost-behavior
[Accessed 2 October 2017].

Sikder, F., 2010. Difference Between Algorithm and Heuristic. [Online]
Available at: https://faisalsikder.wordpress.com/2010/02/15/difference-between-algorithm-and-heuristic/
[Accessed 2 October 2017].

Wikipedia, 2016. Boids Flocking. [Online]
Available at: https://en.wikipedia.org/wiki/Boids
[Accessed 2 October 2017].

Artificial Intelligence, 2010. Learning Decision Trees. [Online]
Available at: http://artint.info/html/ArtInt_177.html
[Accessed 9 October 2017].

Gallear, W., 2017. Bsc Creative Computing. [Online]
Available at: https://prezi.com/view/GsEiZBJDMchJZzfCNaHx/
[Accessed 9 October 2017].

tutorialspoint.com, 2017. Artificial Intelligence - Neural Networks. [Online]
Available at: https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_neural_networks.htm
[Accessed 16 October 2017].

Artificial Intelligence , 2010. Q-learning. [Online]
Available at: http://artint.info/html/ArtInt_265.html
[Accessed 16 October 2017].

Hamel, G., 2017. Advantages & Disadvantages of Decision Trees. [Online]
Available at: https://www.techwalla.com/articles/advantages-disadvantages-of-decision-trees
[Accessed 23 October 2017].

Rooij, S. d., 2017. What are the advantages and disadvantages of A* search and Dijkstra's algorithm? When should each be used?. [Online]
Available at: What are the advantages and disadvantages of A* search and Dijkstra's algorithm? When should each be used?
[Accessed 23 October 2017].
mnemstudio, 2012. Q-Learning Step-By-Step Tutorial. [Online]
Available at: http://mnemstudio.org/path-finding-q-learning-tutorial.htm
[Accessed 23 October 2017].



Wiki sources:

 References

 Reynolds, Craig (1987). "Flocks, herds and schools: A distributed behavioral model.". SIGGRAPH '87: Proceedings of the 14th annual conference on Computer graphics and interactive techniques.

Banks, Alec; Vincent, Jonathan; Anyakoha, Chukwudi (July 2007). "A review of particle swarm optimization. Part I: background and development". Natural Computing.

Hartman, Christopher; Benes̆, Bedr̆ich (July 2006). "Autonomous boids". Computer Animation and Virtual Worlds. 17 (3–4): 199–206. 

Lebar Bajec, Iztok; Heppner, Frank H. (2009). "Organized flight in birds (PDF). Animal Behaviour. pp. 777–789. 

Min, Hongkyu; Wang, Zhidong (2011). Design and analysis of Group Escape Behavior for distributed autonomous mobile robots

IEEE International Conference on Robotics and Automation (ICRA).

Pictures:

References

Ahamed, N., 2015. The Heuristic Method of Learning. s.l.:s.n.

California Institute of Technology., 2011. CS11 Java Lab 3: I'm A Star!. s.l.:California Institute of Technology..

flylib.com, 2013. State Machines. s.l.:flylib.com.

fullofstars, 2007. temperature. s.l.:fullofstars.

nicksainz.com, 2017. Boid Simulation. s.l.:nicksainz.com.

phaser, 2016.. How to simulate flocking behavior with Boids. s.l.:@photonstorm.

pngmart.com, 2016. Pac-Man Ghost PNG Photos. s.l.:pngmart.com.

study.com, 2017. What Is a Decision Tree? - Examples, Advantages & Role in Management. s.l.:study.com.

Computer Science Dept. University of Mayland, 2017. Dijkstra's algorithm slideshow. s.l.:www.cs.umd.edu.
mnemstudio, 2012. Q-Learning Step-By-Step Tutorial. s.l.:mnemstudio.


Comments

Post a Comment

Popular posts from this blog

Assignment 1 Decision making concepts,State machines and Fuzzy logic

Image
          Decision making concepts The first thing that I will talk about in this section of the assignment, under the topic of AI in games, is decision making concepts i.e. the decision tree or the classification tree.  Every AI character makes a decision to do something such as the decision to attack the player character if they are seen (Artificial Intelligence, 2010) . Each decision is put in to a tree like graph which is called the decision tree and the decision itself is made up of child and parent nodes. To make sure that the tree works properly the child nodes are under the parent nodes and have to represent all the possible decisions that are in play. These may be yes, no, maybe or an action like pick up, store or drop (Gallear, 2017) . So with a decision tree it starts off at the root where the decision is made such as yes to take cover, then another decision is made and another until it get to the leaf which is the end n...
Read more

Assignment 1 Pathfinding concepts and Algorithms

Image
Path-finding concepts The first thing I will be talking about in this section of the assignment, under the topic of AI in games, is the concepts of path-finding. This aspect is all to do with AI which in very simple terms is the route that the AI takes to get from point A to B. It will consider all of the options that are at hand. Also it considers things such as time, cost and effectiveness to find the best path. The classic example of path-finding is sat nav as it finds the best route for you to get to your destinations. The points are called nodes and there are many different types of path-finding algorithms such as A*, Dijkstra Algorithm and Cost Driven.           A* Algorithm  The second thing I will be talking about in this section of the assignment under the topic of AI in games is A*, which is a path finding algorithm. It is one of the most popular and...
Read more

Assignment 1 Hardware constraints AI Engines and Boids flocking

Image
    Hardware Constraints AI Engines  The first point on this second section of this assignment that I will talk about is hardware constraints about the developers and what they have to think about, such as the time it will take to create the game and player experience.  I will also be talking about the player and looking at this from a developer’s point of view. They keep in mind the player experience and try to push this to the limits to make the game as much fun as possible, but they also have to keep in mind the time aspect. They can delay the release of a games if they think it is necessary to get the best level of player experience. An example of pushing player experience to the limit is AC Black Flag when developers tried to get the best player experience on PS3, but certain things didn't work out as it had limitations. They, therefore, decided to make a version of it on the new console the PS4, as it could cope much bet...
Read more