Skip to main content

Module time_based_path_planning

Module time_based_path_planning 

Source
Expand description

Time-Based Path Planning with dynamic obstacles

Implements Space-Time A* and Safe Interval Path Planning (SIPP) on a 2-D grid where obstacles move over discrete time steps. The module also includes a priority-based multi-agent planner that sequences single-agent plans to avoid inter-agent collisions.

References:

  • Silver (2005), “Cooperative Pathfinding”
  • Phillips & Likhachev (2011), “SIPP: Safe Interval Path Planning for Dynamic Environments”, ICRA 2011

Structs§

AgentTask
Start and goal for a single agent.
Grid
A 2-D grid with a time dimension that records obstacle occupancy.
Interval
A closed time interval [start, end].
Node
A search node in the space-time graph.
NodePath
A planned path as a sequence of nodes with position-at-time lookup.
Position
A discrete 2-D grid position.
PriorityBasedPlanner
Priority-based multi-agent planner.
SafeIntervalPlanner
Safe Interval Path Planner (SIPP).
SpaceTimeAStar
Space-Time A* planner for a single agent on a grid with dynamic obstacles.

Enums§

ObstacleArrangement
Describes how obstacles are arranged in the grid.
SingleAgentAlgorithm
Which single-agent algorithm to use inside the multi-agent planner.