A comparative study of task assignment and path planning methods for multi-UGV missions
DOI10.1007/978-3-540-88063-9_10zbMATH Open1195.93092OpenAlexW195631573MaRDI QIDQ3589741FDOQ3589741
Authors: Johan Thunberg, David Anisi, Petter Ögren 
Publication date: 20 September 2010
Published in: Optimization and Cooperative Control Strategies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88063-9_10
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
mixed integer linear programming (MILP)granular tabu search (GTS)multi traveling salesman problem (M-TSP)unmanned ground vehicles (UGVs)Voronoi partition step (VP)
Combinatorial optimization (90C27) Mixed integer programming (90C11) Decentralized systems (93A14) Automated systems (robots, etc.) in control theory (93C85)
Cites Work
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- Generalized best-first search strategies and the optimality of A*
- The granular tabu search and its application to the vehicle-routing problem
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Title not available (Why is that?)
- The Traveling Salesman Problem: A Survey
- Real-Time Optimal Mission Scheduling and Flight Path Selection
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)
