Planification de chemins couvrants
Ce projet visait à développer des planificateurs optimaux de chemins-couvrants. Dans le futur, il est également prévu de développer un planificateur considérant des contraintes …
•
1 min. de lecture
Fast and optimal branch-and-bound planner for the grid-based coverage path planning problem based on an admissible heuristic function
This paper introduces an optimal algorithm for solving the discrete grid-based coverage path planning (CPP) problem. This problem consists in finding a path that covers a given …
Fast and Optimal Planner for the Discrete Grid-Based Coverage Path-Planning Problem
This paper introduces a new algorithm for solving the discrete grid-based coverage path-planning (CPP) problem. This problem consists in finding a path that covers a given region …