s462072/Trashmaster
s462072/Trashmaster
5
1
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

integrate_a_star_and_movement #22

Merged
s462072 merged 6 commits from integrate_a_star_and_movement into master 2022-05-06 13:10:06 +02:00
Conversation 0 Commits 6 Files Changed 8 +5 -5
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit 29a11547f4 - Show all commits

4
path_search_algorthms/a_star.py
View File

@ -1,7 +1,7 @@
from data_structures.heap import Heap from data_structures.heap import Heap
from path_search_algorthms import a_star_utils as utils from path_search_algorthms import a_star_utils as utils
def search_path(start_x: int, start_y: int, agent_rotation: utils.Rotation, target_x: int, target_y: int, array: list[list[int]]) -> list[str]: def search_path(start_x: int, start_y: int, agent_rotation: utils.Rotation, target_x: int, target_y: int, array):
start_node = utils.Node(start_x, start_y, agent_rotation) start_node = utils.Node(start_x, start_y, agent_rotation)
target_node = utils.Node(target_x, target_y, utils.Rotation.NONE) target_node = utils.Node(target_x, target_y, utils.Rotation.NONE)
@ -84,7 +84,7 @@ def search_path(start_x: int, start_y: int, agent_rotation: utils.Rotation, targ
# if(neighbour not in search_list): # if(neighbour not in search_list):
# search_list.append(neighbour) # search_list.append(neighbour)
def trace_path(end_node: utils.Node) -> list[str]: def trace_path(end_node: utils.Node):
path = [] path = []
node = end_node node = end_node

6
path_search_algorthms/a_star_utils.py
View File

@ -26,7 +26,7 @@ class Node:
def f_cost(self): def f_cost(self):
return self.g_cost + self.h_cost return self.g_cost + self.h_cost
def get_neighbours(node: 'Node', searched_list: list['Node'], array: list[list[int]]) -> list['Node']: def get_neighbours(node, searched_list, array):
neighbours = [] neighbours = []
for offset_x in range (-1, 2): for offset_x in range (-1, 2):
for offset_y in range (-1, 2): for offset_y in range (-1, 2):
@ -45,7 +45,7 @@ def get_neighbours(node: 'Node', searched_list: list['Node'], array: list[list[i
# move cost schema: # move cost schema:
# - move from tile to tile: 10 # - move from tile to tile: 10
# - add extra 10 (1 rotation) if it exists # - add extra 10 (1 rotation) if it exists
def get_h_cost(start_node: Node, target_node: Node) -> int: def get_h_cost(start_node: Node, target_node: Node):
distance_x = abs(start_node.x - target_node.x) distance_x = abs(start_node.x - target_node.x)
distance_y = abs(start_node.y - target_node.y) distance_y = abs(start_node.y - target_node.y)
cost = (distance_x + distance_y) * 10 cost = (distance_x + distance_y) * 10
@ -69,7 +69,7 @@ def get_neighbour_cost(start_node: Node, target_node: Node) -> int:
return 30 return 30
# translate rotation change to move # translate rotation change to move
def get_move(start_node: Node, target_node: Node) -> list[str]: def get_move(start_node: Node, target_node: Node):
rotate_change = get_rotate_change(start_node.rotation, target_node.rotation) rotate_change = get_rotate_change(start_node.rotation, target_node.rotation)
if (rotate_change == 0): if (rotate_change == 0):
return ["forward"] return ["forward"]