Team Size Optimization for Multi-robot Exploration

نویسندگان

  • Zhi Yan
  • Luc Fabresse
  • Jannik Laval
  • Noury Bouraqadi
چکیده

This paper analyzes and discusses the problem of optimizing the size of a team of robots for multi-robot exploration. We are concerned with the number of robots for a given exploration task that minimizes both exploration time and cost. Minimizing time means that the exploration should be done as fast as possible. Minimizing cost means that the number of robots and their energy consumption should be as low as possible. To solve this problem, we report in this paper, on a series of exploration simulations based on ROS and MORSE using a cluster of computers. The simulated code is exactly the same as that which would run on the actual robots. Such a simulation infrastructure is crucial to “quickly” execute experiments with different parameters such as the number of robots or their initial positions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autonomous Multi-Robot Exploration in Communication-Limited Environments

Teams of communicating robots are likely to be used for a wide range of applications in the near future, such as robotic search and rescue or robotic exploration of hostile and remote environments. In such scenarios, environments are likely to contain significant interference and multi-robot systems must be able to cope with loss of communication. We propose a novel multi-robot exploration appr...

متن کامل

Multi-robot Decentralized Exploration using a Trade-based Approach

This paper addresses the problem of exploring an unknown environment by a coordinated team of robots. An important question is, which robot should explore which region? In this paper, we present a novel decentralized task allocation approach based on trading rules for multi-robot exploration. In the decentralized system, robots can make their own decisions according to the local information wit...

متن کامل

Discussion of Multi-Robot Exploration in Communication-Limited Environments

Many robotics applications benefit from cooperative exploration by multiple robots. Often the environments that they operate in contain significant communication challenges due to their size or complexity. There has been much work in keeping teams of autonomously exploring robots connected to one another, but in certain environments, distant locations can only be reached if robots relay informa...

متن کامل

Collaborative Multi-Robot Exploration

In this paper we consider the problem of exploring an unknown environment by a team of robots. As in single-robot exploration the goal is to minimize the overall exploration time. The key problem to be solved therefore is to choose appropriate target points for the individual robots so that they simultaneously explore different regions of their environment. We present a probabilistic approach f...

متن کامل

A Distributed Bidding Algorithm for Multi-robot Exploration with Safety Concerns

This paper proposes a totally distributed bidding model for a typical multi-robot application, the exploration of unknown environment. Based on this bidding model, the robot safety concept is introduced. Its impact on the behavior and the efficiency of a multi-robot team is investigated. The algorithm aims to maximize the exploration efficiency and reduce the risk of the exploration. We also in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014