private Node getNextNode() {
		Node[] possibleNode = getPossibleNode();
		Node bestNode = new Node(9999, 9999);
		for (int i = 0; i < possibleNode.length; i++) {
			if (possibleNode[i].getStatus() == 5) {
				if(bestNode.getStatus()==0){
					bestNode = possibleNode[i];
				}
				else if (distance(bestNode, current) > distance(possibleNode[i],
						current)) {
					bestNode = possibleNode[i];
				}
			} else if (distance(bestNode, current) > distance(possibleNode[i],
					current)) {
				if (bestNode.getStatus() != 5) {
					bestNode = possibleNode[i];
				}
			}
		}
		this.destination = bestNode;
		Node[] nextNodes = AStar(bestNode);
		path = nextNodes;
		if (path == null) {
			return null;
		}
		return nextNodes[nextNodes.length - 1];
	}