Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Methods
Experiments and Results
Datasets
Discussion
References
All Topics
Engineering
Control and Systems Engineering

Multi-Robot Routing Problem with Min–Max Objective

Profile image of Thorsteinn RögnvaldssonThorsteinn Rögnvaldsson

Robotics

https://doi.org/10.3390/ROBOTICS10040122
visibility

…

description

21 pages

link

1 file

Abstract

In this paper, we study the “Multi-Robot Routing problem” with min–max objective (MRR-MM) in detail. It involves the assignment of sequentially ordered tasks to robots such that the maximum cost of the slowest robot is minimized. The problem description, the different types of formulations, and the methods used across various research communities are discussed in this paper. We propose a new problem formulation by treating this problem as a bipartite graph with a permutation matrix to solve it. A comparative study is done between three methods: Stochastic simulated annealing, deterministic mean-field annealing, and a heuristic-based graph search method. Each method is investigated in detail with several data sets (simulation and real-world), and the results are analysed and compared with respect to scalability, computational complexity, optimality, and its application to real-world scenarios. The paper shows that the heuristic method produces results very quickly with good scalabili...

Related papers

Cooperative Simulated Annealing for Path Planning in Multi-robot Systems
Juan Frausto Solis, Raul Monroy

2000

This paper presents some preliminary results on the application of a Cooperative Simulated Annealing algorithm (COSA) for solving the problem of path planning in Multi-Robot systems. The main idea is to generate paths for each robot in the system without taking care of the other robots, and then coordinate the paths for all the robots. Paths are generated using a variation of the probabilistic roadmaps (PRM), and the coordination of the paths is achieved with a Cooperative Simulated Annealing (COSA). To evaluate the system, several experiments for environments constituted by two planar robots with up to five dof and various convex obstacles were run. The results obtained aim to continue working on this line.

View PDFchevron_right
Guaranteed-performance multi-robot routing under limited communication range
Michail G Lagoudakis

Distributed Autonomous …, 2009

A common assumption made in multi-robot research is that robots operate in a fully networked environment, where any two robots can communicate reliably at any time. However, in real-world missions over large geographical areas robots have a limited communication range and signal propagation conditions may be unpredictable due to obstacles or interferences. In such cases, communication limitations must be taken explicitly into account. In this paper, we present a multirobot routing algorithm for dense environments under limited communication range. We focus on the aspect of careful mission planning in order to guarantee continuous connectivity and mission completeness, while offering a guarantee on performance under a variety of team objectives. The proposed algorithms are demonstrated in a large-scale domain using realistic simulations on the Player/Stage platform.

View PDFchevron_right
A Distributed Market-based Algorithm for the Multi-robot Assignment Problem
Hachemi Bennaceur

Procedia Computer Science, 2014

Assigning tasks to a set of robots is a fundamental problem in robotics. It consists in finding the best task assignment to the available robots. In this paper, we present two distributed market-based algorithms to solve the assignment problem where n robots compete for n tasks with the assumption that each robot can be assigned to only one task. The first algorithm, called DMB, represents a Distributed Market-Based algorithm where each robot bids for every task. The second algorithm is an extension of the DMB. It consists in swapping tasks between robots in order to improve the efficiency of the whole assignment. We conducted both real-world experimental testing, and MATLAB simulations to evaluate performance of the proposed algorithms and compare them against the centralized Hungarian algorithm in terms of traveled distance. Simulation results show that the IDMB algorithm produces near optimal solutions and in several cases it gives the optimal solution. In addition, we demonstrated the feasibility of our algorithms through real-world experimentation on robots.

View PDFchevron_right
Solving permutational routing problems by population-based metaheuristics
Mieczysław Wodecki

Computers & Industrial Engineering, 2009

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: http://www.elsevier.com/copyright

View PDFchevron_right
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
osman Ibrahimi

Annals of Operations Research, 1993

The vehicle routing problem (VRP) under capacity and distance restrictions involves the design of a set of minimum cost delivery routes, originating and terminating at a central depot, which services a set of customers. Each customer must be supplied exactly once by one vehicle route. The total demand of any vehicle must not exceed the vehicle capacity. The total length of any route must not exceed a pre-speeified bound. Approximate methods based on descent, hybrid simulated annealing/tabu search, and tabu search algorithms are developed and different search strategies are investigated. A special data structure for the tabu search algorithm is implemented which has reduced notably the computational time by more than 50%. An estimate for the tabu list size is statistically derived. Computational results are reported on a sample of seventeen bench-mark test problems from the literature and nine randomly generated problems. The new methods improve significantly both the number of vehicles used and the total distances ~avelled on all results reported in the literature.

View PDFchevron_right
A Routing and Task-Allocation Algorithm for Robotic Groups in Warehouse Environments
Minas Dasygenis

Information

In recent years, the need for robotic fleets in large warehouse environments has constantly increased. The customers require faster services concerning the delivery of their products, making the use of systems such as robots and order-management software more than essential. Numerous researchers have studied the problem of robot routing in a warehouse environment, aiming to suggest an efficient model concerning the robotic fleet’s management. In this research work, a methodology is proposed, providing feasible solutions for optimal pathfinding. A novel algorithm is proposed, which combines Dijkstra’s and Kuhn–Munkers algorithms efficiently. The proposed system considers the factor of energy consumption and chooses the optimal route. Moreover, the algorithm decides when a robot must head to a charging station. Finally, a software tool to visualize the movements of the robotic fleet and the real-time updates of the warehouse environment was developed.

View PDFchevron_right
Solving the truck and trailer routing problem based on a simulated annealing heuristic
Vincent Yu

Computers & Operations Research, 2009

In this study, we consider the application of a simulated annealing (SA) heuristic to the truck and trailer routing problem (TTRP), a variant of the vehicle routing problem (VRP). In the TTRP, some customers can be serviced by either a complete vehicle (that is, a truck pulling a trailer) or a single truck, while others can only be serviced by a single truck for various reasons. SA has seen widespread applications to various combinatorial optimization problems, including the VRP. However, to our best knowledge, it has not been applied to the TTRP. So far, all the best known results for benchmark TTRP instances were obtained using tabu search (TS). We applied SA to the TTRP and obtained 17 best solutions to the 21 benchmark TTRP benchmark problems, including 11 new best solutions. Moreover, the computational time required by the proposed SA heuristic is less than those reported in prior studies. The results suggest that SA is competitive with TS on solving the TTRP.

View PDFchevron_right
A SIMULATED ANNEALING ALGORITHM FOR THE VEHICLE ROUTING AND SCHEDULING PROBLEM
Oriana Cendales, Rubby Casallas, Gonzalo Mejía

This paper studies the problem of determining the schedule of n trucks that visit m warehouses within the cities aiming to minimize the vehicular congestion and to improve the productivity of both the truck and warehouse companies. This problem is modeled as a Flexible Open Shop Scheduling Problem (FOSSP) where trucks represent jobs and warehouses represent workstations with identical parallel machines. Each machine corresponds to a loading/unloading dock. The travel times between warehouses and from/to the depot are also considered. The objective is minimizing total flow time. The problem is formulated as a Mixed Integer Program. Due to the NP-Hard nature of the FOSSP, a Simulated Annealing algorithm is proposed and tested. The results are compared against several lower bounds. The results show very good solutions in short computational times for the studied instances.

View PDFchevron_right
A Simulated Annealing-based parallel multi-objective approach to vehicle routing problems with time windows
Antonio Dimas Fernandez

Expert Systems with Applications, 2013

The Capacitated Vehicle Routing Problem with Time Windows (VRPTW) consists in determining the routes of a given number of vehicles with identical capacity stationed at a central depot which are used to supply the demands of a set of customers within certain time windows. This is a complex multiconstrained problem with industrial, economic, and environmental implications that has been widely analyzed in the past. This paper deals with a multi-objective variant of the VRPTW that simultaneously minimizes the travelled distance and the imbalance of the routes. This imbalance is analyzed from two perspectives: the imbalance in the distances travelled by the vehicles, and the imbalance in the loads delivered by them. A multi-objective procedure based on Simulated Annealing, the Multiple Temperature Pareto Simulated Annealing (MT-PSA), is proposed in this paper to cope with these multi-objective formulations of the VRPTW. The procedure MT-PSA and an island-based parallel version of MT-PSA have been evaluated and compared with, respectively, sequential and island-based parallel implementations of SPEA2. Computational results obtained on Solomon's benchmark problems show that the island-based parallelization produces Pareto-fronts of higher quality that those obtained by the sequential versions without increasing the computational cost, while also producing significant reduction in the runtimes while maintaining solution quality. More specifically, for the most part, our procedure MT-PSA outperforms SPEA2 in the benchmarks here considered, with respect to the solution quality and execution time.

View PDFchevron_right
Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery
Vincent Yu

Applied Soft Computing, 2014

The location routing problem with simultaneous pickup and delivery (LRPSPD) is a new variant of the location routing problem (LRP). The objective of LRPSPD is to minimize the total cost of a distribution system including vehicle traveling cost, depot opening cost, and vehicle fixed cost by locating the depots and determining the vehicle routes to simultaneously satisfy the pickup and the delivery demands of each customer. LRPSPD is NP-hard since its special case, LRP, is NP-hard. Thus, this study proposes a multi-start simulated annealing (MSA) algorithm for solving LRPSPD which incorporates multi-start hill climbing strategy into simulated annealing framework. The MSA algorithm is tested on 360 benchmark instances to verify its performance. Results indicate that the multi-start strategy can significantly enhance the performance of traditional single-start simulated annealing algorithm. Our MSA algorithm is very effective in solving LRPSPD compared to existing solution approaches. It obtained 206 best solutions out of the 360 benchmark instances, including 126 new best solutions.

View PDFchevron_right

References (67)

  1. Claes, D.; Oliehoek, F.; Baier, H.; Tuyls, K. Decentralised online planning for multi-robot warehouse commissioning. In Proceed- ings of the 16th Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, São Paulo, Brazil, 8-12 May 2017; pp. 492-500.
  2. Baxter, J.L.; Burke, E.; Garibaldi, J.M.; Norman, M. Multi-robot search and rescue: A potential field based approach. In Autonomous Robots and Agents; Springer: Berlin/Heidelberg, Germany, 2007; pp. 9-16.
  3. Burgard, W.; Moors, M.; Stachniss, C.; Schneider, F.E. Coordinated multi-robot exploration. IEEE Trans. Robot. 2005, 21, 376-386.
  4. Fox, D.; Ko, J.; Konolige, K.; Limketkai, B.; Schulz, D.; Stewart, B. Distributed multirobot exploration and mapping. Proc. IEEE 2006, 94, 1325-1339. [CrossRef]
  5. Groth, C.; Henrich, D. Single-shot learning and scheduled execution of behaviors for a robotic manipulator. In Proceedings of the ISR/Robotik 2014, 41st International Symposium on Robotics, Munich, Germany, 2-3 June 2014; pp. 1-6.
  6. Lemaire, T.; Alami, R.; Lacroix, S. A distributed tasks allocation scheme in multi-UAV context. In Proceedings of the IEEE International Conference on Robotics and Automation, New Orleans, LA, USA, 26 April-1 May 2004; Volume 4, pp. 3622-3627.
  7. Gini, M. Multi-robot allocation of tasks with temporal and ordering constraints. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, CA, USA, 4-9 February 2017.
  8. Zhang, Y.; Parker, L.E. Multi-robot task scheduling. In Proceedings of the 2013 IEEE International Conference on Robotics and Automation, Karlsruhe, Germany, 6-10 May 2013; pp. 2992-2998.
  9. Parker, J.; Nunes, E.; Godoy, J.; Gini, M. Exploiting spatial locality and heterogeneity of agents for search and rescue teamwork. J. Field Robot. 2016, 33, 877-900. [CrossRef]
  10. Bektas, T. The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega 2006, 34, 209-219. [CrossRef]
  11. McIntire, M.; Nunes, E.; Gini, M. Iterated multi-robot auctions for precedence-constrained task scheduling. In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems, Singapore, 9-13 May 2016; pp. 1078-1086.
  12. Sarkar, C.; Paul, H.S.; Pal, A. A scalable multi-robot task allocation algorithm. In Proceedings of the 2018 IEEE International Conference on Robotics and Automation ICRA, Brisbane, QLD, Australia, 21-25 May 2018; pp. 1-9.
  13. Gombolay, M.; Wilcox, R.; Shah, J. Fast Scheduling of Multi-Robot Teams with Temporospatial Constraints. In Proceedings of the Robotics: Science and Systems IX, Berlin, Germany, 24-28 June 2013.
  14. Clausen, J. Branch and Bound Algorithms-Principles and Examples; Department of Computer Science, University of Copenhagen: Copenhagen, Denmark, 1999.
  15. Liu, C.; Kroll, A. A centralized multi-robot task allocation for industrial plant inspection by using a* and genetic algorithms. In Proceedings of the International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland, 29 April-3 May 2012; pp. 466-474.
  16. Wang, J.; Gu, Y.; Li, X. Multi-robot task allocation based on ant colony algorithm. J. Comput. 2012, 7, 2160-2167. [CrossRef]
  17. Li, X.; Ma, H.x. Particle swarm optimization based multi-robot task allocation using wireless sensor network. In Proceedings of the 2008 International Conference on Information and Automation, Changsha, China, 20-23 June 2008; pp. 1300-1303.
  18. Mosteo, A.R.; Montano, L. Simulated annealing for multi-robot hierarchical task allocation with flexible constraints and objective functions. In Proceedings of the Workshop on Network Robot Systems: Toward Intelligent Robotic Systems Integrated with Environments, IROS, Beijing, China, 9-15 October 2006.
  19. Mitiche, H.; Boughaci, D.; Gini, M. Efficient heuristics for a time-extended multi-robot task allocation problem. In Proceedings of the 2015 First International Conference on New Technologies of Information and Communication (NTIC), Mila, Algeria, 8-9 November 2015; pp. 1-6.
  20. Maheswaran, R.T.; Tambe, M.; Bowring, E.; Pearce, J.P.; Varakantham, P. Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, New York, NY, USA, 23-23 July 2004; pp. 310-317.
  21. Lagoudakis, M.G.; Markakis, E.; Kempe, D.; Keskinocak, P.; Kleywegt, A.J.; Koenig, S.; Tovey, C.A.; Meyerson, A.; Jain, S. Auction-Based Multi-Robot Routing. Robot. Sci. Syst. 2005, 5, 343-350
  22. Liu, L.; Shell, D.A.; Michael, N. From selfish auctioning to incentivized marketing. Auton. Robot. 2014, 37, 417-430. [CrossRef]
  23. Ma, H.; Koenig, S. Optimal target assignment and path finding for teams of agents. arXiv 2016, arXiv:1612.05693.
  24. Ng, W.; Mak, K.; Zhang, Y. Scheduling trucks in container terminals using a genetic algorithm. Eng. Optim. 2007, 39, 33-47.
  25. Parker, L.E. L-ALLIANCE: A Mechanism for Adaptive Action Selection in Heterogeneous Multi-Robot Teams; Technical Report; Oak Ridge National Lab.: Oak Ridge, TN, USA, 1995.
  26. Turpin, M.; Michael, N.; Kumar, V. An approximation algorithm for time optimal multi-robot routing. In Algorithmic Foundations of Robotics XI; Springer: Berlin/Heidelberg, Germany, 2015; pp. 627-640.
  27. Franca, P.M.; Gendreau, M.; Laporte, G.; Muller, F.M. The m-Traveling Salesman Problem with Minmax Objective. Transp. Sci. JSTOR 1995, 29, 267-275. [CrossRef]
  28. Kato, S.; Nishiyama, S.; Takeno, J. Coordinating Mobile Robots By Applying Traffic Rules. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, Raleigh, NC, USA, 7-10 July 1992; Volume 3, pp. 1535-1541.
  29. Van Den Berg, J.P.; Overmars, M.H. Prioritized motion planning for multiple robots. In Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems ICRA 2005, Edmonton, AB, Canada, 2-6 August 2005; pp. 430-435.
  30. Liu, M.; Ma, H.; Li, J.; Koenig, S. Task and path planning for multi-agent pickup and delivery. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Montreal, QC, Canada, 13-17 May 2019.
  31. Gerkey, B.P.; Matarić, M.J. A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 2004, 23, 939-954. [CrossRef]
  32. Korsah, G.A.; Stentz, A.; Dias, M.B. A comprehensive taxonomy for multi-robot task allocation. Int. J. Robot. Res. 2013, 32, 1495-1512. [CrossRef]
  33. Nunes, E.; Manner, M.; Mitiche, H.; Gini, M. A taxonomy for task allocation problems with temporal and ordering constraints. Robot. Auton. Syst. 2017, 90, 55-70. [CrossRef]
  34. Gerkey, B.P.; Mataric, M.J. Multi-robot task allocation: Analyzing the complexity and optimality of key architectures. In Proceed- ings of the 2003 IEEE International Conference on Robotics and Automation, Taipei, Taiwan, 14-19 September 2003; Volume 3, pp. 3862-3868.
  35. Brucker, P. Scheduling Algorithms; Springer: Berlin/Heidelberg, Germany, 2004.
  36. Parker, L.E. ALLIANCE: An architecture for fault tolerant multirobot cooperation. IEEE Trans. Robot. Autom. 1998, 14, 220-240.
  37. Garey, M.R.; Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences);
  38. W. H. Freeman: San Francisco, CA, USA, 1979.
  39. Arkin, E.M.; Hassin, R.; Levin, A. Approximations for Minimum and Min-Max Vehicle Routing Problems. J. Algorithms 2006, 59, 1-18. [CrossRef]
  40. Diaby, M. Linear programming formulation of the multi-depot multiple traveling salesman problem with differentiated travel costs. Travel. Salesm. Probl. Theory Appl. 2010, 2010, 257-282.
  41. Oberlin, P.; Rathinam, S.; Darbha, S. A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem. In Proceedings of the 2009 American Control Conference, St. Louis, MO, USA, 10-12 June 2009; pp. 1292-1297.
  42. Naccache, S.; Côté, J.F.; Coelho, L.C. The multi-pickup and delivery problem with time windows. Eur. J. Oper. Res. 2018, 269, 353-362. [CrossRef]
  43. Carlsson, J.; Ge, D.; Subramaniam, A. Solving min-max multi-depot vehicle routing problem. Lect. Glob. Optim. 2009, 55, 31-46.
  44. Bish, E.K.; Chen, F.Y.; Leong, Y.T.; Nelson, B.L.; Ng, J.W.C.; Simchi-Levi, D. Dispatching vehicles in a mega container terminal. In Container Terminals and Cargo Systems; Springer: Berlin/Heidelberg, Germany, 2007; pp. 179-194.
  45. Xu, Z.; Xu, D.; Zhu, W. Approximation results for a min-max location-routing problem. Discret. Appl. Math. 2012, 160, 306-320.
  46. Nace, D.; Pióro, M. Max-min fairness and its applications to routing and load-balancing in communication networks: A tutorial. IEEE Commun. Surv. Tutor. 2008, 10, 5-17. [CrossRef]
  47. Applegate, D.; Cook, W.; Dash, S.; Rohe, A. Solution of a min-max vehicle routing problem. INFORMS J. Comput. 2002, 14, 132-143. [CrossRef]
  48. Pěnička, R.; Faigl, J.; Vá ňa, P.; Saska, M. Dubins orienteering problem. IEEE Robot. Autom. Lett. 2017, 2, 1210-1217. [CrossRef]
  49. Xu, Z.; Rodrigues, B. A 3/2-approximation algorithm for multiple depot multiple traveling salesman problem. In Proceedings of the Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 21-23 June 2010; pp. 127-138.
  50. Even, G.; Garg, N.; Könemann, J.; Ravi, R.; Sinha, A. Min-max tree covers of graphs. Oper. Res. Lett. 2004, 32, 309-315. [CrossRef]
  51. Christofides, N.; Korman, S. Note-A computational survey of methods for the set covering problem. Manag. Sci. 1975, 21, 591-599. [CrossRef]
  52. Fisher, M.L.; Jaikumar, R. A generalized assignment heuristic for vehicle routing. Networks 1981, 11, 109-124. [CrossRef]
  53. Turner, J.S. Approximation algorithms for the shortest common superstring problem. Inf. Comput. 1989, 83, 1-20. [CrossRef]
  54. Cordeau, J.F.; Laporte, G. The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. 2007, 153, 29-46. [CrossRef]
  55. Luo, L.; Chakraborty, N.; Sycara, K. A distributed algorithm for constrained multi-robot task assignment for grouped tasks. J. Contrib. 2018. [CrossRef]
  56. Faigl, J.; Vá ňa, P.; Pěnička, R.; Saska, M. Unsupervised learning-based flexible framework for surveillance planning with aerial vehicles. J. Field Robot. 2019, 36, 270-301. [CrossRef]
  57. Mohamed Bin Zayed International Robotics Challenge (MBZIRC) 2017. Available online: http://www.mbzirc.com (accessed on 9 November 2021).
  58. Kuhn, H.W. The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 1995, 2, 83-97. [CrossRef]
  59. Burkard, R.E.; Cela, E. Linear assignment problems and extensions. In Handbook of Combinatorial Optimization; Springer: Berlin/Heidelberg, Germany, 1999; pp. 75-149.
  60. Hakkinen, J.; Lagerholm, M.; Peterson, C.; Soderberg, B. Local routing algorithms based on Potts neural networks. IEEE Trans. Neural Netw. 2000, 11, 970-977. [CrossRef]
  61. Soderberg, B.; Jonsson, H. Deterministic annealing and nonlinear assignment. arXiv 2001, arXiv:cond-mat/0105321.
  62. Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P. Optimization by simulated annealing. Science 1983, 220, 671-680. [CrossRef] [PubMed]
  63. Ohlsson, M.; Peterson, C.; Söderberg, B. Neural networks for optimization problems with inequality constraints: The knapsack problem. Neural Comput. 1993, 5, 331-339. [CrossRef]
  64. Sinkhorn, R.; Knopp, P. Concerning nonnegative matrices and doubly stochastic matrices. Pac. J. Math. 1967, 21, 343-348.
  65. Grisetti, G.; Stachniss, C.; Burgard, W. Improved techniques for grid mapping with rao-blackwellized particle filters. IEEE Trans. Robot. 2007, 23, 34-46. [CrossRef]
  66. Hart, P.E.; Nilsson, N.J.; Raphael, B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 1968, 4, 100-107. [CrossRef]
  67. Liu, L.; Shell, D.A. An anytime assignment algorithm: From local task swapping to global optimality. Auton. Robot. 2013, 35, 271-286. [CrossRef]

Related papers

A Scalable Multi-Robot Task Allocation Algorithm
Chayan Sarkar

2018 IEEE International Conference on Robotics and Automation (ICRA)

In modern warehouses, robots are being deployed to perform complex tasks such as fetching a set of objects from various locations in a warehouse to a docking station. This requires a careful task allocation along with route planning such that the total distance traveled (cost) is minimized. The number of tasks that can be performed by a robot on a single route depends on the maximum capacity of the robot and the combined weight of the objects it picks on the route. This task allocation problem is an instance of the Capacity-constrained Vehicle Routing Problem (CVRP), which is known to be NPhard. Although, there exist a number of heuristics that provide near-optimal solutions to a CVRP instance, they do not scale well with the task size (number of nodes). In this paper, we present a heuristic, called nearest-neighbor based Clustering And Routing (nCAR), which has better execution time compared to the state-of-the-art heuristics. Also, our heuristic reduces cost of the solutions when there are a large number of nodes. We compare the performance of nCAR with the Google OR-Tools and found a speedup of 6 in runtime when task size is 2000. Though OR-Tools provides a low-cost solution for small number of tasks, it's execution time and number of routes is 1.5 times that of nCAR.

View PDFchevron_right
Multi-robot routing with linear decreasing rewards over time
Pinar Keskinocak

2009 IEEE International Conference on Robotics and Automation, 2009

We study multi-robot routing problems (MR-LDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for the delivery of goods to rescue sites after disasters. The objective of MR-LDR is to find an assignment of targets to robots and a path for each robot that maximizes the surplus, which is defined to be the total reward collected by the team minus its total travel cost. We develop a mixed integer program that solves MR-LDR optimally with a flow-type formulation and can be solved faster than the standard TSP-type formulations but also show that solving MR-LDR optimally is NP-hard. We then develop an auction-based algorithm and demonstrate that it solves MR-LDR in seconds and with a surplus that is comparable to the surplus found by the mixed integer program with a 12 hour time limit.

View PDFchevron_right
Multi-robot routing under limited communication range
Michail G Lagoudakis

… and Automation, 2008. …, 2008

Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A central problem in such domains is multi-robot routing, namely the problem of coordinating a team of robots in terms of the locations they should visit and the routes they should follow in order to accomplish their common mission. A typical assumption made in prior work on multi-robot routing is that robots are able to communicate uninterruptedly at all times independently of their locations. In this paper, we investigate the multi-robot routing problem under communication constraints, reflecting on the fact that real mobile robots have a limited range of communication and the requirement that connectivity must remain intact (even through relaying) during the entire mission. We propose four algorithms for this problem, all based on the same reactive framework, ranging from greedy to deliberative approaches. All algorithms are tested in various scenarios implemented using the Player-Stage robot simulation environment. Our results demonstrate that effective multi-robot routing can be achieved even under limited communication range with moderate loss compared to the case of infinite communication range.

View PDFchevron_right
An Algorithm for Task Allocation and Planning for a Heterogeneous Multi-Robot System to Minimize the Last Task Completion Time
Jung-Yun Bae

Sensors

This paper proposes an algorithm that provides operational strategies for multiple heterogeneous mobile robot systems utilized in many real-world applications, such as deliveries, surveillance, search and rescue, monitoring, and transportation. Specifically, the authors focus on developing an algorithm that solves a min–max multiple depot heterogeneous asymmetric traveling salesperson problem (MDHATSP). The algorithm is designed based on a primal–dual technique to operate given multiple heterogeneous robots located at distinctive depots by finding a tour for each robot such that all the given targets are visited by at least one robot while minimizing the last task completion time. Building on existing work, the newly developed algorithm can solve more generalized problems, including asymmetric cost problems with a min–max objective. Though producing optimal solutions requires high computational loads, the authors aim to find reasonable sub-optimal solutions within a short computatio...

View PDFchevron_right
Multi-robot routing with rewards and disjoint time windows
Craig Tovey

2007

Multiple robots are often faster and more faulttolerant than single robots for applications such as planetary exploration and search and rescue. We study applications where robots move in two-dimensional terrain and have to visit targets of given priorities during given time windows that do not overlap. We analyze the complexity of these coordination tasks and, where possible, use techniques from operations research to develop coordination methods that are efficient and optimize the team performance. We then develop auction-based coordination methods that build on these results and show experimentally that they run in seconds and achieve good team performance for NP-hard coordination tasks.

View PDFchevron_right

Related topics

  • Robotics
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved