Skip to main content

Heuristic-Based Dynamic Route Planning Method for a Homogeneous Multi-robot Team

Buy Article:

$63.00 plus tax (Refund Policy)


Multi-robot systems have recently received a great deal of attention due to the ability to perform an assigned task in a more reliable, faster and cheaper way beyond what is possible with a single robot. However, they may have some drawbacks, such as obstruction among robots during a task. Non-intersecting tours are preferable for the robots to prevent obstruction. Moreover, after an initial plan, the environment (open roads may be closed) and/or task requests (active/deactive) may change dynamically, which may require a fast tour construction for the members of the mobile robot group. In this study, a novel heuristic method is proposed to construct non-intersecting tours for the members of a mobile robot group in dynamic and/or partially unknown environments considering the energy capacities of the robots. It is an aggregate algorithm consisting of the Savings algorithm and the Sweep algorithm, and is applicable to the problems that are modeled using complete, sparse, directed or undirected networks. Simulations are offered to show the effectiveness of the proposed algorithm.


Document Type: Research Article


Affiliations: 1: Computer Engineering Department, Eskisehir Osmangazi University, 26480 Batimeselik, Eskisehir, Turkey 2: Industrial Engineering Department, Eskisehir Osmangazi University, 26030 Bademlik, Eskisehir, Turkey 3: Electrical Engineering Department, Eskisehir Osmangazi University, 26480 Batimeselik, Eskisehir, Turkey

Publication date: 2009-01-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more