Publication | Closed Access

Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments

Mathematical ProgrammingPath PlanningTrajectory PlanningEngineeringRoute PlanningDiscrete OptimizationComputational GeometrySystems EngineeringComputational ComplexityLinear ComplexityLarge-scale Grid EnvironmentsComputer ScienceDiscrete MathematicsRelaxed DijkstraCombinatorial OptimizationRoboticsLinear Programming