com.example.sulemaia.Thread

Class ResolverFirstBestThread

java.lang.Object

android.os.AsyncTask<Integer,HeuristicPathTree.Node,HeuristicPathTree>

com.example.sulemaia.Thread.ResolverFirstBestThread

public class ResolverFirstBestThread
extends android.os.AsyncTask<Integer,HeuristicPathTree.Node,HeuristicPathTree>

Resolver class for the thread and execution of First Best Algorithm.

Nested Class Summary

Nested classes/interfaces inherited from class android.os.AsyncTask

android.os.AsyncTask.Status

Field Summary

Fields

Modifier and Type	Field and Description
private int	actualStep
private static String	DOWN
private static int	EUCLIDIANA
private ArrayList<HeuristicPathTree.Node>	expandedNodes
private ArrayList<String>	expansionOrder
private iFirstTheBest	iMethods
private boolean	isPathFounded
private int	lastX
private int	lastY
private static String	LEFT
private static int	MANHATTAN
private int	measureMode
private HeuristicPathTree.Node[][]	nodes
private static String	RIGHT
private HeuristicPathTree	tree
private static String	UP
private long	updateTime
private HashSet<HeuristicPathTree.Node>	visitedNodes

Fields inherited from class android.os.AsyncTask

SERIAL_EXECUTOR, THREAD_POOL_EXECUTOR

Constructor Summary

Constructors

Constructor and Description
ResolverFirstBestThread(HeuristicPathTree.Node[][] nodes, ArrayList<String> expansionOrder, long updateTime, iFirstTheBest iMethods, int measureMode) First Best algorithm constructor.

Method Summary

Modifier and Type	Method and Description
protected HeuristicPathTree	doInBackground(Integer... values) In the background execution of the thread, we execute the actual algorithm.
private HeuristicPathTree.Node	expandInDirection(String direction, int y, int x, HashSet<HeuristicPathTree.Node> visitedNodes) Method to expand a node in all directions, following the expansion order set by the user, making sure the expansion is possible, rather for map access, or limitations by the user.
private void	getNodesNextStep(HeuristicPathTree.Node node, ArrayList<HeuristicPathTree.Node> expandedNodes, HashSet<HeuristicPathTree.Node> visitedNodes) Get the children of a node, if they are reachable (the is map available), and if the node is accessible by the options written by the user.
protected void	onPostExecute(HeuristicPathTree heuristicPathTree) Once the algorithm has finished, we actually need to end the thread and draw the path over the UI.
protected void	onProgressUpdate(HeuristicPathTree.Node... values) Every time the thread makes a step, we change the character's position.
private void	setFitness(HeuristicPathTree.Node response) With the fitness, we either use the Euclidean or Manhattan measurement, and set the remaining measures to the node.

Methods inherited from class android.os.AsyncTask

cancel, execute, execute, executeOnExecutor, get, get, getStatus, isCancelled, onCancelled, onCancelled, onPreExecute, publishProgress

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

MANHATTAN

private static final int MANHATTAN

See Also:

Constant Field Values

EUCLIDIANA

private static final int EUCLIDIANA

See Also:

Constant Field Values

DOWN

private static final String DOWN

See Also:

Constant Field Values

UP

private static final String UP

See Also:

Constant Field Values

LEFT

private static final String LEFT

See Also:

Constant Field Values

RIGHT

private static final String RIGHT

See Also:

Constant Field Values

expandedNodes

private ArrayList<HeuristicPathTree.Node> expandedNodes

visitedNodes

private HashSet<HeuristicPathTree.Node> visitedNodes

nodes

private HeuristicPathTree.Node[][] nodes

isPathFounded

private boolean isPathFounded

iMethods

private iFirstTheBest iMethods

updateTime

private long updateTime

expansionOrder

private ArrayList<String> expansionOrder

tree

private HeuristicPathTree tree

measureMode

private int measureMode

lastY

private int lastY

lastX

private int lastX

actualStep

private int actualStep

Constructor Detail

ResolverFirstBestThread

public ResolverFirstBestThread(HeuristicPathTree.Node[][] nodes,
                               ArrayList<String> expansionOrder,
                               long updateTime,
                               iFirstTheBest iMethods,
                               int measureMode)

First Best algorithm constructor.

Parameters:

nodes - Heuristic nodes.

expansionOrder - List for expanded nodes.

updateTime - Value for the thread refresh.

iMethods - Method (related to the algorithm).

measureMode - Measure mode, since First Best uses Manhattan or Euclidean to weight the nodes.

Method Detail

doInBackground

protected HeuristicPathTree doInBackground(Integer... values)

In the background execution of the thread, we execute the actual algorithm.

Specified by:

doInBackground in class android.os.AsyncTask<Integer,HeuristicPathTree.Node,HeuristicPathTree>

Parameters:

values - Values related to the coordinates for initial and final positions.

Returns:

final tree of null.

onProgressUpdate

protected void onProgressUpdate(HeuristicPathTree.Node... values)

Every time the thread makes a step, we change the character's position.

Overrides:

onProgressUpdate in class android.os.AsyncTask<Integer,HeuristicPathTree.Node,HeuristicPathTree>

Parameters:

values - Values of the positions.

onPostExecute

protected void onPostExecute(HeuristicPathTree heuristicPathTree)

Once the algorithm has finished, we actually need to end the thread and draw the path over the UI.

Overrides:

onPostExecute in class android.os.AsyncTask<Integer,HeuristicPathTree.Node,HeuristicPathTree>

Parameters:

heuristicPathTree - The tree whose path needs to be drawn.

getNodesNextStep

private void getNodesNextStep(HeuristicPathTree.Node node,
                              ArrayList<HeuristicPathTree.Node> expandedNodes,
                              HashSet<HeuristicPathTree.Node> visitedNodes)

Get the children of a node, if they are reachable (the is map available), and if the node is accessible by the options written by the user.

Parameters:

node - Node to be expanded.

expandedNodes - List of expanded nodes so we dont repeat.

visitedNodes - List of visited nodes so we dont repeat.

setFitness

private void setFitness(HeuristicPathTree.Node response)

With the fitness, we either use the Euclidean or Manhattan measurement, and set the remaining measures to the node.

Parameters:

response - the node to process.

expandInDirection

private HeuristicPathTree.Node expandInDirection(String direction,
                                                 int y,
                                                 int x,
                                                 HashSet<HeuristicPathTree.Node> visitedNodes)

Method to expand a node in all directions, following the expansion order set by the user, making sure the expansion is possible, rather for map access, or limitations by the user.

Parameters:

direction - Direction to check to be expanded.

y - Y actual coordinate.

x - X actual coordinate.

visitedNodes - List of visited nodes so we dont expand incorrectly.

Returns: