Generalized task allocation and route planning for robots with multiple depots in indoor building environments

https://doi.org/10.1016/j.autcon.2020.103359Get rights and content

Highlights

  • Focus of this paper is fixed destination multi-depot multiple traveling salesman (robots) problem for indoor networks.

  • A methodology is proposed to optimize the task allocation and route planning for building service robots.

  • Results are compared with outdoor network based algorithms such as genetic algorithm (GA) and k-means.

  • Results emphasize the need for indoor network based algorithms.

  • Proposed methodology can be generically applied to several building service robotic applications.

Abstract

Recent advancements in sensing and robotic technologies facilitate the use of on-demand building service robots in the built environment. Multi-robot based systems have arguably more advantages when compared to fixed sensor-based and single-robot based systems. These task-oriented building service robots face several challenges, such as task-allocation and route-planning. Previous studies adopted approaches from other domains, such as outdoor logistics, and made application-specific assumptions. This study proposes a new methodology to optimize the task-allocation and route-planning for multiple indoor robots with multiple starts and destination depots where each robot begins and ends at the same depot (referred to as a fixed destination multi-depot multiple traveling salesman problem-fMmTSP). The performance of the proposed algorithm was compared with two existing outdoor-based algorithms. Results show that the proposed algorithm performs better in almost all the cases for the assumed network, which supports the need to develop algorithms specifically for indoor networks.

Introduction

The operation and maintenance (O&M) phase of buildings contributes towards a majority of their total life cycle costs and environmental impacts. This is primarily because buildings are responsible for a significant portion of the total energy consumption across the globe. For example, buildings are responsible for about 80% of the total electrical energy consumption in the United Arab Emirates, 47% of total energy consumption in China, and 40% of the total energy consumption in the United States [[1], [2], [3]]. In addition, the forecasts suggest that these percentage shares are expected to rise in the upcoming years [4]. However, if ideally operated and maintained, the overall lifecycle cost and environmental impacts of buildings can be significantly reduced [5].

Facility managers employ several techniques to optimally maintain and operate the existing built infrastructure [6]. A few examples include real-time data collection for retrofit decision making, generation and calibration of digital models, identification of energy wastage, delivery of goods and services, periodic maintenance checkups, occupant comfort monitoring, and users and occupants feedback collection. Most of the existing tools to achieve these applications mentioned above require dense instrumentation of the physical space with sensor networks, needs repetitive mundane tasks, and involve a significant amount of labor, time, and resources. Previous studies suggested the use of on-demand automation to address these issues and proposed the deployment of semi and fully autonomous multi robotic systems for indoor building environments [7,8]. These are referred to as building service robots (BSR) and are on the rise due to the computing advancements and evolution in robot cognition, manipulation, modeling, and the ability to interact with humans.

For example, Mudrova and Haves [9] suggest that BSRs can assist with time-dependent tasks such as delivering mail, assisting passengers in airports, guiding customers/visitors in museums/offices for visits/meetings. In addition, their study also developed and tested the deployment of multiple robots for safety, care, and security-related applications such as guided navigation for elderly individuals, periodic monitoring of emergency exits for obstructions, creation of 3D maps of specific rooms at scheduled times, monitored the locations of fire extinguishers, and explored for objects on desks during different times of the day. Researchers are also extending the usage of mobile robots for obtaining customer feedback in hospitals [10]. Similar advantages and applications were suggested by Gao et al. [11] and referred to these robots as patrol service robots. Another study conducted by Chen et al. [12] shows that multi-robot based olfaction (i.e., real-time detection of hazardous gas leakage) could potentially save lives and has more advantages when compared to the state-of-the-art stationary sensor network-based methods. This is arguable because the robot-based method is a more active approach, has the potential to precisely locate the leakage, and is less prone to sensing-related errors. Also, a multi-robot based method is preferred over a single-robot system because of the increased success rate and improved search efficiency. Similarly, studies also suggest that multiple robots (known as a swarm of robots) are more advantageous especially in case of exploration and search and rescue operations because of mutual coordination and collective behavior [[13], [14], [15], [16]].

Section snippets

Literature review

There is a strong need to fundamentally understand and explore the potential of BSRs to automate and improve the operational efficiency of the existing built environment. To achieve such autonomy, BSRs should have the capability to perform a) task allocation – ability to optimally divide tasks among themselves and b) route/path planning – identify paths to visit the respective task requirement locations. Unlike path planning, route (or tour) planning requires the path to begin and end at the

Problem statement

Consider that there are ‘n’ tasks that need to be accomplished by ‘m’ robots distributed among ‘D' depots (e.g., charging stations) within an indoor building environment. The objective is to use the available robots to visit the task requirement locations and complete the assigned tasks. That is, determine ‘m’ tours (one for each robot) so the total distance traveled by the robots is minimized, and each of the ‘n’ task locations (or nodes as widely represented in graph theory) is visited at

Methodology

The proposed methodology of fMmTSP for indoor networks is divided into five steps (Fig. 1). Each of these is explained below.

Comparison

The objective of this section is to evaluate the performance (i.e., the total distance traveled by all the robots in the network) of the proposed fMmTSP with other existing algorithms such as GA (for multiple depots), k-means (for multiple depots), and mTSP (for single depots). To achieve this, an arbitrary floor plan which is complex and asymmetric was chosen for the simulation experiments. The graphical node network representation based on a two-dimensional floor plan of a building where

Scenario analysis

This section presents two different scenarios to analyze the feasibility of the proposed fMmTSP algorithm with real-world challenges and constraints such as resources (i.e., robots in the current context) and distance. The former scenario tests the algorithmic effectiveness to determine the optimal number of robots needed, given the requirement of a task or set of tasks. The latter scenario imposes a distance constraint on the most optimal solution to consider the maximum distance a robot can

Scenario 1: Resource constraints

The objective is to determine the most optimal combination of the number of depots and the number of robots per depot, given a fixed number of resources (robots). Table 2 shows the results of this scenario for a total of three, four, and five robots. Consider the case of three robots. There are a total of three combinations - one depot with three robots, two depots with two robots in one and one in the other, and finally three depots with one robot each. All the possible combinations of depots

Summary and conclusions

This work presents a generalized task allocation and route-planning algorithm for multiple robots with multiple depots. An algorithm was developed to solve the fixed destination MmTSP (fMmTSP) problem for networks based on indoor building environments. The pseudocode, along with the python implementation, is made available for academicians and practitioners to use, which is one of the contributions of this study given the meager amount of publicly available resources to implement the fMmTSP,

Declaration of competing interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References (70)

  • C. Jiang et al.

    A new efficient hybrid algorithm for large scale multiple traveling salesman problems

  • A. Kiraly et al.

    Redesign of the supply of mobile mechanics based on a novel genetic optimization algorithm using Google Maps API

    Eng. Appl. Artif. Intell.

    (2015)
  • M. Jin et al.

    Automated mobile sensing: towards high-granularity agile indoor environmental quality monitoring

    Build. Environ.

    (2018)
  • K.P. Lynn et al.

    Reinventing fire: China—the role of energy efficiency in China’s roadmap to 2050

    European Council for an Energy Efficient Economy Summer Study

    (2017)
  • UAE Ministry of Climate Change and Environment (MOCCAE)

    National Climate Change Plan of the United Arab Emirates 2017–2050

  • US DOE/EIA

    Annual Energy Outlook 2014 With Projections to 2040

  • US Energy Information Administration (EIA)

    International Energy Outlook

  • W. Tushar et al.

    Design of cloud-connected IoT system for smart buildings on energy management

  • M. Støre-Valen et al.

    Implementing sustainable facility management: challenges and barriers encountered by Scandinavian FM practitioners

    Facilities

    (2019)
  • B.R.K. Mantha et al.

    Robots in indoor and outdoor environments

  • B.R.K. Mantha et al.

    Ambient data collection in indoor building environments using mobile robots – the International Association for Automation and Robotics in Construction

  • L. Mudrova et al.

    Task scheduling for mobile robots using interval algebra

  • M.J.Y. Chung et al.

    “How was your stay?”: exploring the use of robots for gathering customer feedback in the hospitality industry

  • Y. Gao et al.

    A patrol mobile robot for power transformer substations based on ros

  • F. Aznar et al.

    Energy-efficient swarm behavior for indoor UAV ad-hoc network deployment

    Symmetry

    (2018)
  • K.N. McGuire et al.

    Minimal navigation solution for a swarm of tiny flying robots to explore an unknown environment

    Science Robotics

    (2019)
  • C. Ruiz et al.

    Collaborative localization and navigation in heterogeneous UAV swarms

  • T. Stirling et al.

    Indoor navigation with a swarm of flying robots

  • R. Bellman

    Dynamic programming treatment of the travelling salesman problem

    J. ACM

    (1962)
  • A.R. Mahjoub et al.

    A layered compact formulation for the Multiple Steiner TSP with order constraints

  • D. Sofge et al.

    Evolutionary computational approaches to solving the multiple traveling salesman problem using a neighborhood attractor schema

  • Y. Zhu et al.

    Structure study of multiple traveling salesman problem using genetic algorithm

  • T. Ramadhani et al.

    An Ant Colony Optimization algorithm for solving the fixed destination multi-depot multiple traveling salesman problem with non-random parameters

  • K.L. Du et al.

    Hopfield Networks, Simulated Annealing, and Chaotic Neural Networks

    (2019)
  • A. Singh et al.

    A new grouping genetic algorithm approach to the multiple traveling salesperson problem

    Soft Computing

    (2009)
  • Cited by (19)

    • Robot-based mobile sensing system for high-resolution indoor temperature monitoring

      2022, Automation in Construction
      Citation Excerpt :

      This drawback hampers automatic continuous monitoring in the long term and limits widespread applications in more buildings. Today, with the rapid development of robotic technologies and the proliferation of various service robots in the built environment [44], IEQ mobile sensing can be achieved in a more efficient and automated way. Several studies have begun to explore the potential of using building robots for IEQ monitoring [45–50].

    • A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning

      2021, Computers and Operations Research
      Citation Excerpt :

      SIGPA is capable of solving graph-based multi-objective problems, such as the proposed TRP problem by using a normalized root mean square error as an evaluation criterion of the generated solutions. The proposed mathematical formulation and metaheuristic algorithm can also be extended to robotic route planning with mandatory visits in time windows where there is a need for safe and smooth paths (Mantha et al., 2020). The POIs can play the role of mandatory destinations and the factor of penalized multiple crossovers contribute to the generation of efficient paths without unnecessary loops.

    • Development of BIM-integrated construction robot task planning and simulation system

      2021, Automation in Construction
      Citation Excerpt :

      This study presented a system that generates an input for additive manufacturing of a building from a neutral Industry Foundation Class (IFC) file. Mantha et al. [36] proposed a method to optimize task-allocation and route-planning for multiple indoor building service robots. Similar to other approaches, this study simulated extremely abstract movements and space occupancies of robots and a simple 2D representation of a building was used.

    View all citing articles on Scopus
    View full text