A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions
From MaRDI portal
Publication:3589741
DOI10.1007/978-3-540-88063-9_10zbMath1195.93092OpenAlexW195631573MaRDI QIDQ3589741
David Anisi, Johan Thunberg, 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
mixed integer linear programming (MILP)granular tabu search (GTS)multi traveling salesman problem (M-TSP)unmanned ground vehicles (UGVs)Voronoi partition step (VP)
Mixed integer programming (90C11) Combinatorial optimization (90C27) Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14)
Cites Work
- Unnamed Item
- 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
- The Granular Tabu Search and Its Application to the 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