A Pareto Optimal D* Search Algorithm for Multiobjective Path Planning

@article{Lavin2015APO,
  title={A Pareto Optimal D* Search Algorithm for Multiobjective Path Planning},
  author={Alexander Lavin},
  journal={CoRR},
  year={2015},
  volume={abs/1511.00787}
}
Path planning is one of the most vital elements of mobile robotics, providing the agent with a collision-free route through the workspace. The global path plan can be calculated with a variety of informed search algorithms, most notably the A* search method, guaranteed to deliver a complete and optimal solution that minimizes the path cost. D* is widely used for its dynamic replanning capabilities. Path planning optimization typically looks to minimize the distance traversed from start to goal… CONTINUE READING