python-motion-planning 1.1__tar.gz → 1.1.1__tar.gz

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/PKG-INFO

@@ -1,6 +1,6 @@
-Metadata-Version: 2.2
+Metadata-Version: 2.4
 Name: python-motion-planning
-Version: 1.1
+Version: 1.1.1
 Summary: Motion planning algorithms for Python
 Maintainer-email: Yang Haodong <913982779@qq.com>, Wu Maojia <2223942063@qq.com>
 License: GNU GENERAL PUBLIC LICENSE
@@ -690,7 +690,7 @@ Requires-Dist: matplotlib
 Requires-Dist: cvxopt
 Requires-Dist: osqp
 Requires-Dist: tqdm
-Requires-Dist: tensorboard==2.12.0
+Dynamic: license-file
 
 
 # Introduction
@@ -711,26 +711,22 @@ We also provide [ROS C++](https://github.com/ai-winter/ros_motion_planning) vers
 # Quick Start
 
 ## Overview
-The file structure is shown below
+The source file structure is shown below
 
 ```
 python_motion_planning
-├─assets
-├─docs
-├─examples
-└─python_motion_planning
-    ├─global_planner
-    |   ├─graph_search
-    |   ├─sample_search
-    |   └─evolutionary_search
-    ├─local_planner
-    ├─curve_generation
-    └─utils
-        ├─agent
-        ├─environment
-        ├─helper
-        ├─planner
-        └─plot
+├─global_planner
+|   ├─graph_search
+|   ├─sample_search
+|   └─evolutionary_search
+├─local_planner
+├─curve_generation
+└─utils
+    ├─agent
+    ├─environment
+    ├─helper
+    ├─planner
+    └─plot
 ```
 
 * The global planning algorithm implementation is in the folder `global_planner` with `graph_search`, `sample_search` and `evolutionary search`.
@@ -756,44 +752,58 @@ pip install python-motion-planning
 ## Run
 Below are some simple examples.
 
-1. Run planning and animation separately
+1. Run A* with discrete environment (Grid)
 ```python
 import python_motion_planning as pmp
-planner = pmp.AStar(start=(5, 5), goal=(45, 25), env=pmp.Grid(51, 31))
-cost, path, expand = planner.plan()
-planner.plot.animation(path, str(planner), cost, expand)  # animation
-```
 
-2. Run planning and animation in one step
-```python
-import python_motion_planning as pmp
-planner = pmp.AStar(start=(5, 5), goal=(45, 25), env=pmp.Grid(51, 31))
-planner.run()       # run both planning and animation
+# Create environment with custom obstacles
+env = pmp.Grid(51, 31)
+obstacles = env.obstacles
+for i in range(10, 21):
+    obstacles.add((i, 15))
+for i in range(15):
+    obstacles.add((20, i))
+for i in range(15, 30):
+    obstacles.add((30, i))
+for i in range(16):
+    obstacles.add((40, i))
+env.update(obstacles)
+
+planner = pmp.AStar(start=(5, 5), goal=(45, 25), env=env)   # create planner
+cost, path, expand = planner.plan()                         # plan
+planner.plot.animation(path, str(planner), cost, expand)    # animation
 ```
 
-3. Create planner in factory mode
+2. Run RRT with continuous environment (Map)
 ```python
 import python_motion_planning as pmp
-search_factory = pmp.SearchFactory()
-planner = search_factory("a_star", start=(5, 5), goal=(45, 25), env=pmp.Grid(51, 31))
-planner.run()       # run both planning and animation
+
+# Create environment with custom obstacles
+env = pmp.Map(51, 31)
+obs_rect = [
+    [14, 12, 8, 2],
+    [18, 22, 8, 3],
+    [26, 7, 2, 12],
+    [32, 14, 10, 2]
+]
+obs_circ = [
+    [7, 12, 3],
+    [46, 20, 2],
+    [15, 5, 2],
+    [37, 7, 3],
+    [37, 23, 3]
+]
+env.update(obs_rect=obs_rect, obs_circ=obs_circ)
+
+planner = pmp.RRT(start=(18, 8), goal=(37, 18), env=env)    # create planner
+cost, path, expand = planner.plan()                         # plan
+planner.plot.animation(path, str(planner), cost, expand)    # animation
 ```
 
 More examples can be found in the folder `examples` in the repository.
 
-## Documentation
-
 For more details, you can refer to [online documentation](https://ai-winter.github.io/python_motion_planning/).
 
-The documentation is auto-generated using mkdocs. To do this, enter the root directory and run
-
-```shell
-python generate_mkdocs.py
-mkdocs serve
-```
-
-Then open the browser and go to [http://127.0.0.1:8000](http://127.0.0.1:8000). That is the generated documentation.
-
 # Version
 ## Global Planner
 

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/README.md

@@ -17,26 +17,22 @@ We also provide [ROS C++](https://github.com/ai-winter/ros_motion_planning) vers
 # Quick Start
 
 ## Overview
-The file structure is shown below
+The source file structure is shown below
 
 ```
 python_motion_planning
-├─assets
-├─docs
-├─examples
-└─python_motion_planning
-    ├─global_planner
-    |   ├─graph_search
-    |   ├─sample_search
-    |   └─evolutionary_search
-    ├─local_planner
-    ├─curve_generation
-    └─utils
-        ├─agent
-        ├─environment
-        ├─helper
-        ├─planner
-        └─plot
+├─global_planner
+|   ├─graph_search
+|   ├─sample_search
+|   └─evolutionary_search
+├─local_planner
+├─curve_generation
+└─utils
+    ├─agent
+    ├─environment
+    ├─helper
+    ├─planner
+    └─plot
 ```
 
 * The global planning algorithm implementation is in the folder `global_planner` with `graph_search`, `sample_search` and `evolutionary search`.
@@ -62,44 +58,58 @@ pip install python-motion-planning
 ## Run
 Below are some simple examples.
 
-1. Run planning and animation separately
+1. Run A* with discrete environment (Grid)
 ```python
 import python_motion_planning as pmp
-planner = pmp.AStar(start=(5, 5), goal=(45, 25), env=pmp.Grid(51, 31))
-cost, path, expand = planner.plan()
-planner.plot.animation(path, str(planner), cost, expand)  # animation
-```
 
-2. Run planning and animation in one step
-```python
-import python_motion_planning as pmp
-planner = pmp.AStar(start=(5, 5), goal=(45, 25), env=pmp.Grid(51, 31))
-planner.run()       # run both planning and animation
+# Create environment with custom obstacles
+env = pmp.Grid(51, 31)
+obstacles = env.obstacles
+for i in range(10, 21):
+    obstacles.add((i, 15))
+for i in range(15):
+    obstacles.add((20, i))
+for i in range(15, 30):
+    obstacles.add((30, i))
+for i in range(16):
+    obstacles.add((40, i))
+env.update(obstacles)
+
+planner = pmp.AStar(start=(5, 5), goal=(45, 25), env=env)   # create planner
+cost, path, expand = planner.plan()                         # plan
+planner.plot.animation(path, str(planner), cost, expand)    # animation
 ```
 
-3. Create planner in factory mode
+2. Run RRT with continuous environment (Map)
 ```python
 import python_motion_planning as pmp
-search_factory = pmp.SearchFactory()
-planner = search_factory("a_star", start=(5, 5), goal=(45, 25), env=pmp.Grid(51, 31))
-planner.run()       # run both planning and animation
+
+# Create environment with custom obstacles
+env = pmp.Map(51, 31)
+obs_rect = [
+    [14, 12, 8, 2],
+    [18, 22, 8, 3],
+    [26, 7, 2, 12],
+    [32, 14, 10, 2]
+]
+obs_circ = [
+    [7, 12, 3],
+    [46, 20, 2],
+    [15, 5, 2],
+    [37, 7, 3],
+    [37, 23, 3]
+]
+env.update(obs_rect=obs_rect, obs_circ=obs_circ)
+
+planner = pmp.RRT(start=(18, 8), goal=(37, 18), env=env)    # create planner
+cost, path, expand = planner.plan()                         # plan
+planner.plot.animation(path, str(planner), cost, expand)    # animation
 ```
 
 More examples can be found in the folder `examples` in the repository.
 
-## Documentation
-
 For more details, you can refer to [online documentation](https://ai-winter.github.io/python_motion_planning/).
 
-The documentation is auto-generated using mkdocs. To do this, enter the root directory and run
-
-```shell
-python generate_mkdocs.py
-mkdocs serve
-```
-
-Then open the browser and go to [http://127.0.0.1:8000](http://127.0.0.1:8000). That is the generated documentation.
-
 # Version
 ## Global Planner
 

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "python-motion-planning"
-version = "1.1"
+version = "1.1.1"
 description = "Motion planning algorithms for Python"
 maintainers = [
     {name = "Yang Haodong", email = "913982779@qq.com"},
@@ -19,8 +19,7 @@ dependencies = [
     "matplotlib",
     "cvxopt",
     "osqp",
-    "tqdm",
-    "tensorboard==2.12.0"
+    "tqdm"
 ]
 classifiers = [
     "License :: OSI Approved :: GNU General Public License v3 (GPLv3)",

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/evolutionary_search/aco.py

@@ -8,7 +8,7 @@ import random
 from bisect import bisect_left
 
 from .evolutionary_search import EvolutionarySearcher
-from python_motion_planning.utils import Env, Node
+from python_motion_planning.utils import Env, Node, Grid
 
 
 class ACO(EvolutionarySearcher):
@@ -18,7 +18,7 @@ class ACO(EvolutionarySearcher):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type, default is euclidean
         n_ants (int): number of ants
         alpha (float): pheromone and heuristic factor weight coefficient
@@ -37,7 +37,7 @@ class ACO(EvolutionarySearcher):
     References:
         [1] Ant Colony Optimization: A New Meta-Heuristic
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean", 
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean", 
         n_ants: int = 50, alpha: float = 1.0, beta: float = 5.0, rho: float = 0.1, Q: float = 1.0,
         max_iter: int = 100) -> None:
         super().__init__(start, goal, env, heuristic_type)

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/evolutionary_search/evolutionary_search.py

@@ -6,7 +6,7 @@
 """
 import math
 
-from python_motion_planning.utils import Env, Node, Planner
+from python_motion_planning.utils import Env, Node, Planner, Grid
 
 class EvolutionarySearcher(Planner):
     """
@@ -15,10 +15,10 @@ class EvolutionarySearcher(Planner):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str="euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str="euclidean") -> None:
         super().__init__(start, goal, env)
         # heuristic type
         self.heuristic_type = heuristic_type

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/evolutionary_search/pso.py

@@ -8,7 +8,7 @@ import random, math
 from copy import deepcopy
 
 from .evolutionary_search import EvolutionarySearcher
-from python_motion_planning.utils import Env, MathHelper
+from python_motion_planning.utils import Env, MathHelper, Grid
 from python_motion_planning.curve_generation import BSpline
 
 GEN_MODE_CIRCLE = 0
@@ -22,7 +22,7 @@ class PSO(EvolutionarySearcher):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
         n_particles (int): number of particles
         w_inertial (float): inertial weight
@@ -41,7 +41,7 @@ class PSO(EvolutionarySearcher):
         >>> planner.plot.animation(path, str(planner), cost, cost_curve=cost_curve)  # animation
         >>> planner.run()       # run both planning and animation
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean", 
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean", 
         n_particles: int = 300, point_num: int = 5, w_inertial: float = 1.0,
         w_cognitive: float = 1.0, w_social: float = 1.0, max_speed: int = 6,
         max_iter: int = 200, init_mode: int = GEN_MODE_RANDOM) -> None:

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/a_star.py

@@ -7,7 +7,7 @@
 import heapq
 
 from .graph_search import GraphSearcher
-from python_motion_planning.utils import Env, Node
+from python_motion_planning.utils import Env, Grid, Node
 
 
 class AStar(GraphSearcher):
@@ -17,7 +17,7 @@ class AStar(GraphSearcher):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
 
     Examples:
@@ -30,7 +30,7 @@ class AStar(GraphSearcher):
     References:
         [1] A Formal Basis for the heuristic Determination of Minimum Cost Paths
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         super().__init__(start, goal, env, heuristic_type)
 
     def __str__(self) -> str:

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/d_star.py

@@ -5,7 +5,7 @@
 @update: 2024.6.23
 """
 from .graph_search import GraphSearcher
-from python_motion_planning.utils import Env, Node
+from python_motion_planning.utils import Env, Node, Grid
 
 
 class DNode(Node):
@@ -41,7 +41,7 @@ class DStar(GraphSearcher):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
 
     Examples:
         >>> import python_motion_planning as pmp
@@ -53,7 +53,7 @@ class DStar(GraphSearcher):
     References:
         [1]Optimal and Efficient Path Planning for Partially-Known Environments
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env) -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid) -> None:
         super().__init__(start, goal, env, None)
         self.start = DNode(start, None, 'NEW', float('inf'), float("inf"))
         self.goal = DNode(goal, None, 'NEW', 0, float('inf'))

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/d_star_lite.py

@@ -8,7 +8,7 @@ import heapq
 
 from .graph_search import GraphSearcher
 from .lpa_star import LPAStar, LNode
-from python_motion_planning.utils import Env
+from python_motion_planning.utils import Env, Grid
 
 
 class DStarLite(LPAStar):
@@ -18,7 +18,7 @@ class DStarLite(LPAStar):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
 
     Examples:
@@ -31,7 +31,7 @@ class DStarLite(LPAStar):
     References:
         [1] D* Lite
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         GraphSearcher.__init__(self, start, goal, env, heuristic_type)
         # start and goal
         self.start = LNode(start, float('inf'), float('inf'), None)

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/dijkstra.py

@@ -7,11 +7,27 @@
 import heapq
 
 from .a_star import AStar
-from python_motion_planning.utils import Env
+from python_motion_planning.utils import Env, Grid
 
 
 class Dijkstra(AStar):
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    """
+    Class for Dijkstra motion planning.
+
+    Parameters:
+        start (tuple): start point coordinate
+        goal (tuple): goal point coordinate
+        env (Grid): environment
+        heuristic_type (str): heuristic function type
+
+    Examples:
+        >>> import python_motion_planning as pmp
+        >>> planner = pmp.Dijkstra((5, 5), (45, 25), pmp.Grid(51, 31))
+        >>> cost, path, expand = planner.plan()     # planning results only
+        >>> planner.plot.animation(path, str(planner), cost, expand)  # animation
+        >>> planner.run()       # run both planning and animation
+    """
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         super().__init__(start, goal, env, heuristic_type)
     
     def __str__(self) -> str:
@@ -19,20 +35,12 @@ class Dijkstra(AStar):
 
     def plan(self) -> tuple:
         """
-        Class for Dijkstra motion planning.
-
-        Parameters:
-            start (tuple): start point coordinate
-            goal (tuple): goal point coordinate
-            env (Env): environment
-            heuristic_type (str): heuristic function type
+        Dijkstra motion plan function.
 
-        Examples:
-            >>> import python_motion_planning as pmp
-            >>> planner = pmp.Dijkstra((5, 5), (45, 25), pmp.Grid(51, 31))
-            >>> cost, path, expand = planner.plan()     # planning results only
-            >>> planner.plot.animation(path, str(planner), cost, expand)  # animation
-            >>> planner.run()       # run both planning and animation
+        Returns:
+            cost (float): path cost
+            path (list): planning path
+            expand (list): all nodes that planner has searched
         """
         # OPEN list (priority queue) and CLOSED list (hash table)
         OPEN = []

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/gbfs.py

@@ -7,11 +7,27 @@
 import heapq
 
 from .a_star import AStar
-from python_motion_planning.utils import Env
+from python_motion_planning.utils import Env, Grid
 
 
 class GBFS(AStar):
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    """
+    Class for Greedy Best First Search.
+
+    Parameters:
+        start (tuple): start point coordinate
+        goal (tuple): goal point coordinate
+        env (Grid): environment
+        heuristic_type (str): heuristic function type
+
+    Examples:
+        >>> import python_motion_planning as pmp
+        >>> planner = pmp.GBFS((5, 5), (45, 25), pmp.Grid(51, 31))
+        >>> cost, path, expand = planner.plan()     # planning results only
+        >>> planner.plot.animation(path, str(planner), cost, expand)  # animation
+        >>> planner.run()       # run both planning and animation
+    """
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         super().__init__(start, goal, env, heuristic_type)
     
     def __str__(self) -> str:
@@ -19,20 +35,12 @@ class GBFS(AStar):
 
     def plan(self) -> tuple:
         """
-        Class for Greedy Best First Search.
-
-        Parameters:
-            start (tuple): start point coordinate
-            goal (tuple): goal point coordinate
-            env (Env): environment
-            heuristic_type (str): heuristic function type
+        GBFS motion plan function.
 
-        Examples:
-            >>> import python_motion_planning as pmp
-            >>> planner = pmp.GBFS((5, 5), (45, 25), pmp.Grid(51, 31))
-            >>> cost, path, expand = planner.plan()     # planning results only
-            >>> planner.plot.animation(path, str(planner), cost, expand)  # animation
-            >>> planner.run()       # run both planning and animation
+        Returns:
+            cost (float): path cost
+            path (list): planning path
+            expand (list): all nodes that planner has searched
         """
         # OPEN list (priority queue) and CLOSED list (hash table)
         OPEN = []

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/graph_search.py

@@ -5,7 +5,7 @@
 @update: 2023.1.13
 """
 import math
-from python_motion_planning.utils import Env, Node, Planner
+from python_motion_planning.utils import Env, Node, Planner, Grid
 
 
 class GraphSearcher(Planner):
@@ -15,10 +15,10 @@ class GraphSearcher(Planner):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str="euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str="euclidean") -> None:
         super().__init__(start, goal, env)
         # heuristic type
         self.heuristic_type = heuristic_type

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/jps.py

@@ -7,7 +7,7 @@
 import heapq
 
 from .a_star import AStar
-from python_motion_planning.utils import Env, Node
+from python_motion_planning.utils import Env, Node, Grid
 
 class JPS(AStar):
     """
@@ -16,7 +16,7 @@ class JPS(AStar):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
 
     Examples:
@@ -29,7 +29,7 @@ class JPS(AStar):
     References:
         [1] Online Graph Pruning for Pathfinding On Grid Maps
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         super().__init__(start, goal, env, heuristic_type)
     
     def __str__(self) -> str:

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/lazy_theta_star.py

@@ -7,7 +7,7 @@
 import heapq
 
 from .theta_star import ThetaStar
-from python_motion_planning.utils import Env, Node
+from python_motion_planning.utils import Env, Node, Grid
 
 class LazyThetaStar(ThetaStar):
     """
@@ -16,7 +16,7 @@ class LazyThetaStar(ThetaStar):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
 
     Examples:
@@ -29,7 +29,7 @@ class LazyThetaStar(ThetaStar):
     References:
         [1] Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         super().__init__(start, goal, env, heuristic_type)
 
     def __str__(self) -> str:

{python_motion_planning-1.1 → python_motion_planning-1.1.1}/src/python_motion_planning/global_planner/graph_search/lpa_star.py

@@ -7,7 +7,7 @@
 import heapq
 
 from .graph_search import GraphSearcher
-from python_motion_planning.utils import Env, Node
+from python_motion_planning.utils import Env, Node, Grid
 
 class LNode(Node):
     """
@@ -43,7 +43,7 @@ class LPAStar(GraphSearcher):
     Parameters:
         start (tuple): start point coordinate
         goal (tuple): goal point coordinate
-        env (Env): environment
+        env (Grid): environment
         heuristic_type (str): heuristic function type
 
     Examples:
@@ -56,7 +56,7 @@ class LPAStar(GraphSearcher):
     References:
         [1] Lifelong Planning A*
     """
-    def __init__(self, start: tuple, goal: tuple, env: Env, heuristic_type: str = "euclidean") -> None:
+    def __init__(self, start: tuple, goal: tuple, env: Grid, heuristic_type: str = "euclidean") -> None:
         super().__init__(start, goal, env, heuristic_type)
         # start and goal
         self.start = LNode(start, float('inf'), 0.0, None)