A comparative study of task assignment and path planning methods for multi-UGV missions
From MaRDI portal
Publication:3589741
Recommendations
- A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
- Minimum Time Multi-UGV Surveillance
- Multitask n-vehicle exploration problem: complexity and algorithm
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
Cites work
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Generalized best-first search strategies and the optimality of A*
- Real-Time Optimal Mission Scheduling and Flight Path Selection
- The Traveling Salesman Problem: A Survey
- The granular tabu search and its application to the vehicle-routing problem
Cited in
(2)
This page was built for publication: A comparative study of task assignment and path planning methods for multi-UGV missions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589741)