mirror of
https://github.com/zhm-real/PathPlanning.git
synced 2026-08-29 16:40:46 +08:00
zhm-real
56 lines
2.1 KiB
Python
56 lines
2.1 KiB
Python
#!/usr/bin/env python3
|
|
# -*- coding: utf-8 -*-
|
|
"""
|
|
@author: huiming zhou
|
|
"""
|
|
|
|
import queue
|
|
import tools
|
|
import env
|
|
|
|
class BFS:
|
|
"""
|
|
BFS -> Breadth-first Searching
|
|
"""
|
|
|
|
def __init__(self, x_start, x_goal, x_range, y_range):
|
|
self.u_set = env.motions # feasible input set
|
|
self.xI, self.xG = x_start, x_goal
|
|
self.x_range, self.y_range = x_range, y_range
|
|
self.obs = env.obs_map(self.xI, self.xG, "breadth-first searching") # position of obstacles
|
|
|
|
def searching(self):
|
|
"""
|
|
Searching using BFS.
|
|
|
|
:return: planning path, action in each node, visited nodes in the planning process
|
|
"""
|
|
|
|
q_bfs = queue.QueueFIFO() # first-in-first-out queue
|
|
q_bfs.put(self.xI)
|
|
parent = {self.xI: self.xI} # record parents of nodes
|
|
action = {self.xI: (0, 0)} # record actions of nodes
|
|
|
|
while not q_bfs.empty():
|
|
x_current = q_bfs.get()
|
|
if x_current == self.xG:
|
|
break
|
|
if x_current != self.xI:
|
|
tools.plot_dots(x_current, len(parent))
|
|
for u_next in self.u_set: # explore neighborhoods of current node
|
|
x_next = tuple([x_current[i] + u_next[i] for i in range(len(x_current))])
|
|
if x_next not in parent and x_next not in self.obs: # node not visited and not in obstacles
|
|
q_bfs.put(x_next)
|
|
parent[x_next] = x_current
|
|
action[x_next] = u_next
|
|
[path_bfs, action_bfs] = tools.extract_path(self.xI, self.xG, parent, action) # extract path
|
|
return path_bfs, action_bfs
|
|
|
|
|
|
if __name__ == '__main__':
|
|
x_Start = (5, 5) # Starting node
|
|
x_Goal = (49, 5) # Goal node
|
|
bfs = BFS(x_Start, x_Goal, env.x_range, env.y_range)
|
|
[path_bf, actions_bf] = bfs.searching()
|
|
tools.showPath(x_Start, x_Goal, path_bf)
|