<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" xml:lang="en" dtd-version="3.0" article-type="research-article">
  <front>
    <journal-meta><journal-id journal-id-type="publisher">NHESS</journal-id><journal-title-group>
    <journal-title>Natural Hazards and Earth System Sciences</journal-title>
    <abbrev-journal-title abbrev-type="publisher">NHESS</abbrev-journal-title><abbrev-journal-title abbrev-type="nlm-ta">Nat. Hazards Earth Syst. Sci.</abbrev-journal-title>
  </journal-title-group><issn pub-type="epub">1684-9981</issn><publisher>
    <publisher-name>Copernicus Publications</publisher-name>
    <publisher-loc>Göttingen, Germany</publisher-loc>
  </publisher></journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.5194/nhess-21-3449-2021</article-id><title-group><article-title>Urban search and rescue (USAR) simulation system: spatial strategies for agent task allocation under
uncertain conditions</article-title><alt-title>USAR simulation system</alt-title>
      </title-group><?xmltex \runningtitle{USAR simulation system}?><?xmltex \runningauthor{N. Hooshangi et al.}?>
      <contrib-group>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Hooshangi</surname><given-names>Navid</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="yes" rid="aff2">
          <name><surname>Alesheikh</surname><given-names>Ali Asghar</given-names></name>
          <email>alesheikh@kntu.ac.ir</email>
        <ext-link>https://orcid.org/0000-0001-9537-9401</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff3 aff4">
          <name><surname>Panahi</surname><given-names>Mahdi</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="yes" rid="aff4 aff5">
          <name><surname>Lee</surname><given-names>Saro</given-names></name>
          <email>leesaro@kigam.re.kr</email>
        <ext-link>https://orcid.org/0000-0003-0409-8263</ext-link></contrib>
        <aff id="aff1"><label>1</label><institution>Department of Surveying Engineering, Collage of Earth Sciences
Engineering, Arak University of Technology, <?xmltex \hack{\break}?> Arak, 38181-46763, Iran</institution>
        </aff>
        <aff id="aff2"><label>2</label><institution>Faculty of Geodesy and Geomatics Engineering, K.N. Toosi University
of Technology, Tehran, Iran</institution>
        </aff>
        <aff id="aff3"><label>3</label><institution>Division of Smart Regional Innovation, Kangwon National University, 1 Gangwondaehak-gil, Chuncheon-si, Gangwon-do, 24341, Republic of Korea</institution>
        </aff>
        <aff id="aff4"><label>4</label><institution>Geoscience Platform Division, Korea Institute of Geoscience and Mineral Resources (KIGAM), 124 Gwahak-ro, Yuseong-gu, Daejeon, 34132,  Republic of Korea</institution>
        </aff>
        <aff id="aff5"><label>5</label><institution>Department of Geophysical Exploration, Korea University of Science and Technology, 217 Gajeong-ro, Yuseong-gu, Daejeon, 305-350, Republic of Korea</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">Ali Asghar Alesheikh (alesheikh@kntu.ac.ir) and Saro Lee
(leesaro@kigam.re.kr)</corresp></author-notes><pub-date><day>15</day><month>November</month><year>2021</year></pub-date>
      
      <volume>21</volume>
      <issue>11</issue>
      <fpage>3449</fpage><lpage>3463</lpage>
      <history>
        <date date-type="received"><day>22</day><month>August</month><year>2020</year></date>
           <date date-type="rev-request"><day>9</day><month>November</month><year>2020</year></date>
           <date date-type="rev-recd"><day>1</day><month>August</month><year>2021</year></date>
           <date date-type="accepted"><day>26</day><month>September</month><year>2021</year></date>
      </history>
      <permissions>
        <copyright-statement>Copyright: © 2021 </copyright-statement>
        <copyright-year>2021</copyright-year>
      <license license-type="open-access"><license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p></license></permissions><self-uri xlink:href="https://nhess.copernicus.org/articles/.html">This article is available from https://nhess.copernicus.org/articles/.html</self-uri><self-uri xlink:href="https://nhess.copernicus.org/articles/.pdf">The full text article is available as a PDF file from https://nhess.copernicus.org/articles/.pdf</self-uri>
      <abstract><title>Abstract</title>

      <p id="d1e140">Task allocation under uncertain conditions is a key
problem for agents attempting to achieve harmony in disaster environments.
This paper presents an agent-based simulation to investigate task allocation
considering appropriate spatial strategies to manage uncertainty in urban
search and rescue (USAR) operations. The proposed method is based on the
contract net protocol (CNP) and implemented over five phases: ordering
existing tasks considering intrinsic interval uncertainty, finding a
coordinating agent, holding an auction, applying allocation strategies (four
strategies), and implementing and observing the real environment. Applying
allocation strategies is the main innovation of the method. The methodology
was evaluated in Tehran's District 1 for 6.6, 6.9, and 7.2 magnitude
earthquakes. The simulation began by calculating the numbers of injured
individuals, which were 28 856, 73 195, and 111 463 people for each
earthquake, respectively. Simulations were performed for each scenario for a
variety of rescuers (1000, 1500, and 2000 rescuers). In comparison with the
CNP, the standard duration of rescue operations with the proposed approach
exhibited at least 13 % improvement, with a maximal improvement of 21 %.
Interval uncertainty analysis and comparison of the proposed strategies
showed that increased uncertainty led to increased rescue time for the CNP
and strategies 1 to 4. The time increase was less with the uniform
distribution strategy (strategy 4) than with the other strategies. The
consideration of strategies in the task allocation process, especially
spatial strategies, facilitated both optimization and increased flexibility
of the allocation. It also improved conditions for fault tolerance and
agent-based cooperation stability in the USAR simulation system.</p>
  </abstract>
    </article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <label>1</label><title>Introduction</title>
      <p id="d1e152">Preparation to manage an earthquake crisis requires optimal and appropriate
management. Agent-based modeling of search and rescue operations after an
earthquake is a good model for decision-making compared with traditional
computational approaches (Hooshangi and Alesheikh, 2018). Multi-agent
systems consist of several automatic and autonomous agents that coordinate
their activities to achieve a target (Crooks and Wise, 2013; Sabar et
al., 2009). Multi-agent systems are suitable for the modeling and simulation
of complex systems (Mustapha et al., 2013). They allow for the
division of the system into subdivisions (agents) and the modeling of the
relationships among these agents (Uno and Kashiyama, 2008). The
use of multi-agent systems is necessary for disaster management (Hawe et
al., 2015; Grinberger and Felsenstein, 2016). Importantly, multi-agent
systems can<?pagebreak page3450?> be used to implement various scenarios of search and rescue
operations, as well as distributions of facilities, in the crisis area
(Crooks and Wise, 2013).</p>
      <p id="d1e155">Task allocation is one of the main coordination challenges among sets of
agents in a multi-agent system (Liu and Shell, 2012; Nourjou et al.,
2011; Chen and Sun, 2012). Agents fail to reach their ultimate goal without
proper assignment of tasks (Reis and Mamede, 2002). In disaster
environments, urban search and rescue (USAR) and the assignment of tasks are
dynamic processes occurring under uncertain conditions (Hooshangi
and Alesheikh, 2017). Generally, task allocation on a large scale is
influenced by uncertainties and various factors (Cai et al., 2014).
Uncertain conditions have a major impact on the initial planning and results
of rescue operations (Hooshangi and Alesheikh, 2018). Despite various
investigations, an optimal task allocation solution has not been established
(Olteanu et al., 2012).</p>
      <p id="d1e158">In many instances, the initial allocation may result in problems or new
tasks may be added to the worklist; therefore, reallocation is necessary.
Reallocation is an effective reaction to environmental uncertainties and
changes and has important roles in both reducing the wasted time during an
operation and increasing operation profitability (Zhang et al., 2014).
Reallocation after instantaneous disruption is very important, especially in
large-scale distributed systems (e.g., USAR operations) (Olteanu et al.,
2012). An effective task allocation approach in USAR operations should
include strategies for replanning to manage future situations. Because tasks
may not be performed well for various reasons, strategies such as minimum
location displacement should be applied to initial responses to preserve
additional time during reallocation or future task allocation. This approach
to task allocation optimizes planning performance to achieve better
performance time and provides conditions for fault tolerance.</p>
      <p id="d1e161">The present article is the final part of a research project in Iran. This
research project was carried out over three phases. In the first phase,
uncertainty in task allocation among agents was considered, and task
allocation was performed only by considering the proximity (spatial
distance) to the tasks. The developed method was evaluated in a
square-shaped random environment without a sensitivity analysis
(Hooshangi and Alesheikh, 2017). In the second phase, the
feasibility of the developed method was investigated in a simulated
environment using real regional data. In this phase, the operational
environment of a crisis was simulated, and the developed method was examined
in a real environment. In the simulated system, damage for a 6.8 magnitude
earthquake was calculated for District 3 of Tehran, and rescue
operations were modeled (Hooshangi and Alesheikh, 2018). In the third
phase using the concepts of previous articles (Hooshangi and Alesheikh,
2018, 2017), spatial strategies were included in task allocation among
agents and simulated with real-environment data. The present paper is the
output of the third phase of the research project. The main purpose of the
research is to improve task allocation in crisis-ridden conditions for
agent-based groups by considering proper strategies to manage uncertainties.
This paper first develops an agent-based simulation system for USAR
operations, then applies uncertainties in agent decision-making by improving
an interval VIKOR method to perform task allocation, and defines strategies
for conditions under which the initial assignment has encountered a problem
and requires reallocation (i.e., managing availability uncertainty during
implementation). The innovation of the study is the establishment of an
approach to improve conditions during reallocations or future allocations
when initial allocations encounter problems, due either to availability
uncertainties or the addition of a new task. In general, strategies are
selected in such a manner that the final cost of the system will not
increase abnormally if the initial allocations encounter problems. By
applying spatial strategies in the assignment of tasks, it is expected that
the assignment of tasks in conditions of uncertainty will be done optimally
and more quickly.</p>
</sec>
<sec id="Ch1.S2">
  <label>2</label><title>Literature review and background</title>
<sec id="Ch1.S2.SS1">
  <label>2.1</label><title>Agent-based USAR simulation</title>
      <p id="d1e179">An agent-based model is a class of computational models for simulating the
actions and interactions of autonomous agents. Agent-based simulations have
been used in various investigations including crisis/disaster management
(Wang et al., 2012; Hooshangi and Alesheikh, 2018), emergency supply
chains (Ben Othman et al., 2017), tsunamis (Erick et al.,
2012), and collective behavior (Welch et al., 2014).
These simulations can be effective in both planning and policymaking
(Fecht et al., 2014). Simulation of the operating system
involves a simplified real environment, which is used to model a wide range
of agents in complex systems. Various researchers have modeled a portion of
the behavior of agents in simulated environments (Erick et al., 2012;
Wang et al., 2012; Matarić et al., 2003) and demonstrated collaboration
among agents. However, agent cooperation in catastrophic environments has
been less extensively studied, such that uncertainty in collaboration among
agents has generally not been considered. In previous studies, a geospatial
information system platform was used when preparing the environment and
creating a simulation base map (Welch et al., 2014).
Spatial analysis and related tools are used in most research endeavors in
USAR operations after an earthquake.</p>
</sec>
<sec id="Ch1.S2.SS2">
  <label>2.2</label><title>Approaches to applying uncertainties in task allocation</title>
      <?pagebreak page3451?><p id="d1e190">Agents should include environmental uncertainties in their performance with
respect to planning goals. There are four common approaches to considering
uncertainty: probabilistic, fuzzy logic, rough set, and interval set
(Hooshangi and Alesheikh, 2017). Uncertainty in task allocation
has been investigated in various studies that can be categorized as sensor
noise (Liu and Shell, 2011; Bertuccelli et al., 2009; Matarić et al.,
2003), an accidental event during execution (Lee and Al-yafi, 2010; Li
and Cruz, 2005), the occurrence of new tasks (Xiao et al., 2009;
Kayır and Parlaktuna, 2014), the number of groups (Quiñonez et
al., 2011; Dahl et al., 2009), the relationship among agents (Choi et
al., 2009; Su et al., 2016), and decision parameters (Hooshangi
and Alesheikh, 2017).</p>
      <p id="d1e193">The above-mentioned methods have been used in various applications such as multiple
unmanned aerial vehicles (Bertuccelli et al., 2009), supply chains
(Dahl et al., 2009), moving plants (Tan and Barton, 2016), and
disaster environments (Su et al., 2016). There is no dominant approach
to model uncertainty for all phenomena. The appropriate method is determined
based on the characteristics of the phenomenon and the purpose of the study.
In crisis environments, there is uncertainty in all decision parameters. In
the category of uncertainty in decision parameters, which is suitable for
multi-agent systems, uncertainties are associated with the decision
parameters for assigning tasks. Therefore, all information needed for task
allocation is considered uncertain. Various methods such as the contract net
protocol (CNP) (Hooshangi and Alesheikh, 2017), stochastic
scheduling (Tan and Barton, 2016), and genetic algorithms (He et al.,
2014) have been used in these contexts. Here, we present an approach that
includes uncertainties in decision parameters and strategies in the CNP. The
CNP produces local optimal solutions that are abundantly used in multi-agent
systems (Choi et al., 2009). This method is simple and practical and
is popularly used in agent-based modeling. In USAR operations, complete
individual expertise is impossible due to a lack of environmental knowledge;
therefore, determining membership function and the probability distribution
is a complex and time-consuming step. We used interval analysis to manage
these shortcomings and to consider the intervallic nature of available data
within a rescue operation. In the interval set method, due to the
uncertainty in a parameter's value, that parameter is specified as an
interval regardless of the probabilistic distribution (unlike in
probabilistic theory) or membership function (unlike in fuzzy logic)
(Hooshangi and Alesheikh, 2017).</p>
</sec>
<sec id="Ch1.S2.SS3">
  <label>2.3</label><title>Reallocation and reassigning methods</title>
      <p id="d1e204">Distinct algorithms have been proposed for scheduling and task reallocation
in accordance with the tasks and available conditions within an environment
(Gokilavani et al., 2013). Some reallocation methods (e.g., data
envelopment analysis; Barnum and Gleason, 2010) and exact algorithms
(e.g., a branch-and-bound algorithm with column generation) resolve problems
on a smaller scale (e.g., 10 jobs and three vehicles). In such methods, the
process is time-consuming and slow for resolving large-scale problems
(Cai et al., 2014). Therefore, they are not suitable for the allocation
of tasks that should be performed dynamically and instantaneously in
large-scale problems.</p>
      <p id="d1e207">In some research, such as the investigation of gate reassignment problems,
initial assignment tables have been created using heuristic methods in such
a manner that a succession delay is minimized (Cheng, 1997). The
incidence of adverse events may disrupt the original table. Notably, this
method is not suitable for a large number of tasks. Some other task
allocation methods are interdependent with the plan's ongoing tasks, such as
in construction operations (Olteanu et al., 2012). In those mathematical
calculations, when a task fails, all other tasks that were based on its
correct implementation must be replanned.</p>
      <p id="d1e210">An appropriate reallocation method must be applied with respect to the
nature and scale of the problem. In USAR, a rescue process generally occurs
independently of any other rescue processes, and only a portion of the
workflow is ready to be implemented and assigned. Moreover, because of the
large number of rescue groups in USAR operations, as well as the available
uncertainties and dynamic nature of multi-agent systems in disaster
environments, the concept of general planning is uncommon, and appropriate
plans should be produced both locally and cross-sectionally. Most available
methods to resolve the problem of assigning tasks cannot be developed for
uncertain conditions and restrictions such as in critical rescue
environments (e.g., USAR after earthquakes).</p>
      <p id="d1e213">With respect to USAR operations, task allocation methods must include
different strategies for all conditions and be dynamically generated in a
real-time environment. In contrast to previous studies, we define an
approach based on spatial strategies, such that the results of the initial
task allocation are used for future task allocations and are appropriate in
the rescue environment. Time limitations constitute another issue in the
reallocation and reassignment of rescue teams. Therefore, the present study
aims to expand the CNP method for rapid problem resolution.</p>
</sec>
</sec>
<sec id="Ch1.S3">
  <label>3</label><title>Case study and data</title>
      <p id="d1e225">The proposed approach can be implemented in various study areas. This study
used a part of Tehran (District 1 in the capital of Iran) to evaluate the
feasibility of the proposed method on the basis of available data. District 1 is one of 22 central districts of Tehran Province, Iran. District 1 has an
area of 210 km<inline-formula><mml:math id="M1" display="inline"><mml:msup><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:math></inline-formula> and is located in the northernmost part of the city of
Tehran (Fig. 1). Its population is 433 500.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F1" specific-use="star"><?xmltex \currentcnt{1}?><?xmltex \def\figurename{Figure}?><label>Figure 1</label><caption><p id="d1e239">Location of case study: <bold>(a)</bold> peak ground acceleration map of Iran for a return period of 2475 years and approximate location of Tehran and <bold>(b)</bold> location of District 1 and active faults in Tehran. <bold>(c)</bold> Map of District 1 (study area) and active faults, Tehran.</p></caption>
        <?xmltex \igopts{width=341.433071pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f01.png"/>

      </fig>

      <p id="d1e257">The recent Tehran earthquake (5.2 magnitude) in December 2017 attracted the
attention of many urban planning organizations. Tehran is a highly seismic
area because it is surrounded by the Rey, Masha-Fasham, and North Tehran
faults (Fig. 1b). Tehran is located in the southern part of the Alborz
Mountains, where a magnitude 7.3 earthquake occurred in 1990
(Berberian and Yeats, 2016; Hamzehloo et al., 2007).
Seismologists have reported that a severe earthquake may<?pagebreak page3452?> occur in Tehran in
the future (Hosseini et al., 2009). The North Tehran fault is the city's
largest fault and is approximately 175 km long (Kamranzad et al.,
2020). For this purpose, the North Tehran fault scenario, with the capacity
to cause the most destructive potential earthquake in Tehran, was selected
in the present study. Various scenarios have been simulated in seismic
studies in Tehran, such as 6.8 and 6.9 magnitude earthquakes. The method
developed in this research can be implemented for any scenario. In
accordance with the previous earthquakes and suggestions of seismologist
experts, we simulated 6.6, 6.9, and 7.2 magnitude earthquakes. The basic
data used in environment simulation were block maps, population, distance
from the fault, building material, agent location, year of building
construction, and building height.</p>
</sec>
<sec id="Ch1.S4">
  <label>4</label><title>Materials and methods</title>
      <p id="d1e268">In this section, the simulated scenario and proposed method are described.</p>
<sec id="Ch1.S4.SS1">
  <label>4.1</label><title>Scenario of proposed agent-based USAR simulation</title>
      <p id="d1e278">We assume the presence of a disaster environment in which events are
uncertain. In this scenario, the crisis is assumed to be an earthquake. The
injured individuals are trapped under rubble, and the number of such
individuals in each building block is uncertain. Rescuing injured people is
the main goal. Saving each person is a task that must be performed through
the cooperation of rescue agents. After an earthquake, the numbers of
injured and deceased people can be estimated using different formulas by
determining the magnitude and location of the earthquake, as well as the
urban context data of the buildings (Kang and Kim, 2016). Furthermore,
the possible locations of injured individuals can be predicted using
building damage assessment models. Therefore, the simulation inputs are the
injured individuals' locations and their characteristics, which are
available with some uncertainty. The rescue agents are attempting to save
injured individuals by moving toward the task location. Given the results
of previous studies (He et al., 2014; Hooshangi and Alesheikh, 2017;
Sang, 2013; Chen et al., 2012) and in accordance with expert opinion on USAR
operations, the uncertainties include the number of injuries, severity of
the victims' injuries, duration of the operation, infrastructure priorities,
agent energy, route status, task runtime by an agent, and risk level for
each agent. These are important uncertainties in task allocation. All
parameters are specified as intervals during the task allocation process.
After task identification, an agent is assigned a task and pursues it. If an
agent fails to complete an assigned task because of any existing
disruptions, the task is updated with respect to uncertainties and reported
to the central agent, resulting in the reinitiation of the task allocation
process. In this process, task allocation strategies are applied to minimize
the cost of the system.</p>
      <p id="d1e281">In this scenario, there is a central agent, as well as several coordinators,
rescuers, and injured agents in the environment. These independent agents
are rational and can communicate with each other. The agents have the
following roles and characteristics:
<list list-type="bullet"><list-item>
      <p id="d1e286"><italic>Central agent</italic>. This agent is responsible for sorting the tasks,
specifying the coordinators, determining the results, announcing rescuers,
and applying allocation strategies.</p></list-item><list-item>
      <p id="d1e292"><italic>Coordinating agent</italic>. The coordinator is a rescue agent who is
responsible for sending work details to rescuers, receiving their proposals
(bids), holding auctions, and submitting the results and rescuer
prioritization data to the central agent.</p></list-item><list-item>
      <p id="d1e298"><italic>Rescue agent</italic>. This agent identifies and moves to the task location,
searches for injured individuals, sends the task uncertainty to the central
agent, and rescues injured individuals from the debris.</p></list-item><list-item>
      <p id="d1e304"><italic>Injured agent</italic>. This agent exists in the environment and has a
critical condition that changes continuously. This agent has no activity or
communication with other agents.</p></list-item></list></p>
</sec>
<?pagebreak page3453?><sec id="Ch1.S4.SS2">
  <label>4.2</label><title>USAR simulation</title>
      <p id="d1e317">In preparation for the USAR operation simulation, there are three main
parts: (1) calculating the damage rate of the area and people (simulating an
earthquake-damaged environment), (2) defining agents and their
characteristics, and (3) implementing the suggested method for task
allocation between agents.</p>
      <p id="d1e320">To simulate an earthquake-damaged environment, an earthquake risk assessment
model was developed based upon the Japan International Cooperative Agency
(JICA) model. The JICA model is the output of cooperation between the Center
for Earthquake and Environmental Studies of Tehran and the JICA. The results
of this project and its implementation have been presented previously
(Mansouri et al., 2008) and used in various studies (Hooshangi
and Alesheikh, 2018; Vafaeinezhad et al., 2009). This model can calculate
the buildings' level of destruction and the number of injured people based
on the earthquake intensity, earthquake location, building vulnerability,
and the population in these buildings.</p>
      <p id="d1e323">In our scenario, we included four types of agents: injured individual,
rescuer, coordinator, and central agent. The tasks described in the previous
section were implemented for each agent. The initial locations of injured
agents were based on building damage, and the locations of rescue groups were
randomly generated in the environment. The definitions of agents and their
characteristics were described in detail in our previous article
(Hooshangi and Alesheikh, 2018).</p>
</sec>
<sec id="Ch1.S4.SS3">
  <label>4.3</label><title>The proposed method</title>
      <p id="d1e334">The proposed model for task allocation with uncertainties in earthquake USAR
operation is shown in Fig. 2.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F2" specific-use="star"><?xmltex \currentcnt{2}?><?xmltex \def\figurename{Figure}?><label>Figure 2</label><caption><p id="d1e339">Task allocation flowchart in the proposed approach, separated into five steps within an environmental simulation.</p></caption>
          <?xmltex \igopts{width=483.69685pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f02.png"/>

        </fig>

      <p id="d1e348">The five steps of the proposed approach are the ordering of existing work,
specifying the coordinators, holding an auction, applying reassignment
strategies (the innovation of this paper), and implementing and observing
environmental uncertainties (performed by an agent). The proposed method is
presented below.</p>
<sec id="Ch1.S4.SS3.SSS1">
  <label>4.3.1</label><title>Ordering existing tasks</title>
      <p id="d1e359">In crisis-ridden areas, there are varying degrees of urgency (Chen et
al., 2012). Tasks with a higher priority must be performed first. Four
parameters are used to prioritize tasks: the number of victims, severity of
injuries, time required for a rescue operation, and infrastructure
priorities. The initial tasks with their uncertainties in the environment
(four priority parameters) are available to the central agent. Therefore,
for each task feature, an interval such as that expressed in Table 1 is
specified.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T1" specific-use="star"><?xmltex \currentcnt{1}?><label>Table 1</label><caption><p id="d1e365">Task characteristics based on intervals.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="7">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="left"/>
     <oasis:colspec colnum="3" colname="col3" align="left"/>
     <oasis:colspec colnum="4" colname="col4" align="left"/>
     <oasis:colspec colnum="5" colname="col5" align="left"/>
     <oasis:colspec colnum="6" colname="col6" align="left"/>
     <oasis:colspec colnum="7" colname="col7" align="left"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Task</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M2" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M3" display="inline"><mml:mi>Y</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">Infrastructure</oasis:entry>
         <oasis:entry colname="col5">Number of</oasis:entry>
         <oasis:entry colname="col6">Severity of</oasis:entry>
         <oasis:entry colname="col7">Duration of</oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">no.</oasis:entry>
         <oasis:entry colname="col2">coordinate</oasis:entry>
         <oasis:entry colname="col3">coordinate</oasis:entry>
         <oasis:entry colname="col4">priorities</oasis:entry>
         <oasis:entry colname="col5">injuries</oasis:entry>
         <oasis:entry colname="col6">victim injuries</oasis:entry>
         <oasis:entry colname="col7">operation</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">1</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M4" display="inline"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M5" display="inline"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">[<inline-formula><mml:math id="M6" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M7" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col5">[<inline-formula><mml:math id="M8" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M9" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col6">[<inline-formula><mml:math id="M10" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M11" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col7">[<inline-formula><mml:math id="M12" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M13" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">2</oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M14" display="inline"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M15" display="inline"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">[<inline-formula><mml:math id="M16" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M17" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col5">[<inline-formula><mml:math id="M18" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M19" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col6">[<inline-formula><mml:math id="M20" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M21" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col7">[<inline-formula><mml:math id="M22" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M23" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">…</oasis:entry>
         <oasis:entry colname="col2">…</oasis:entry>
         <oasis:entry colname="col3">…</oasis:entry>
         <oasis:entry colname="col4">…</oasis:entry>
         <oasis:entry colname="col5">…</oasis:entry>
         <oasis:entry colname="col6">…</oasis:entry>
         <oasis:entry colname="col7">…</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M24" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M25" display="inline"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M26" display="inline"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">[<inline-formula><mml:math id="M27" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M28" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col5">[<inline-formula><mml:math id="M29" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M30" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col6">[<inline-formula><mml:math id="M31" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M32" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col7">[<inline-formula><mml:math id="M33" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M34" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">…</oasis:entry>
         <oasis:entry colname="col2">…</oasis:entry>
         <oasis:entry colname="col3">…</oasis:entry>
         <oasis:entry colname="col4">…</oasis:entry>
         <oasis:entry colname="col5">…</oasis:entry>
         <oasis:entry colname="col6">…</oasis:entry>
         <oasis:entry colname="col7">…</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1"><inline-formula><mml:math id="M35" display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col2"><inline-formula><mml:math id="M36" display="inline"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3"><inline-formula><mml:math id="M37" display="inline"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">[<inline-formula><mml:math id="M38" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M39" display="inline"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col5">[<inline-formula><mml:math id="M40" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M41" display="inline"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col6">[<inline-formula><mml:math id="M42" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M43" display="inline"><mml:mrow><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
         <oasis:entry colname="col7">[<inline-formula><mml:math id="M44" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>l</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M45" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>u</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>]</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e1135">To manage interval data in the CNP, various multi-criteria decision-making
methods are proposed. The interval-based VIKOR method is used extensively to
coordinate agents in the assignment of tasks with interval data
(Hooshangi and Alesheikh, 2017). The interval-based VIKOR method
has been previously described (Sayadi et al., 2009). Ordering is
performed by the central agent.</p>
</sec>
<sec id="Ch1.S4.SS3.SSS2">
  <label>4.3.2</label><title>Finding the coordinating agent</title>
      <p id="d1e1146">For each task defined by the central agent, the most appropriate agent is
identified as the coordinating agent. The coordinating agent is an agent who
is located near that task and is not currently working. The selection of a
coordinating agent and creating groups to execute any task can be achieved
through different methods and is based on various criteria (Chen and
Sun, 2012; Su et al., 2018). In this study, to simplify the calculations,
only the criterion of proximity (spatial distance) is used to identify the
coordinating agent. Therefore, the nearest agent to the task is selected as
the coordinator and is responsible for the auction. Selection of a
coordinating agent leads to the performance of calculations at a distributed
point. By selecting coordinating agents, the computational overhead of the
central agent is reduced.</p>
</sec>
<sec id="Ch1.S4.SS3.SSS3">
  <label>4.3.3</label><title>Holding an auction</title>
      <p id="d1e1157">Coordinating agents hold auctions after receiving the task characteristics
and the list of agents in the subgroup. In the CNP, agents bid for tasks,
and the agent who offers the highest value for the task is the winner.
During the auction, rescue agents offer intervals (rather than values) for
the route conditions, the time required for the agent to execute the task,
the agent's possible risk level, and their energy. Accordingly, the agent
calculates numbers for each of the four decision-making criteria, such as
variable <inline-formula><mml:math id="M46" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, based on Eq. (1). In Eq. (1), the distance (in meters),
severity of the victims' injuries, and task priority are based on values
declared by the central agent. Based on the rate of uncertainty presumed for
a given environment (for example, 30 %), an interval for this number is
estimated. The first number of this interval is in the range between [<inline-formula><mml:math id="M47" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M48" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M49" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>] and the second number is in the range [<inline-formula><mml:math id="M50" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M51" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M52" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>].
              <disp-formula id="Ch1.Ex1"><mml:math id="M53" display="block"><mml:mrow><?xmltex \hack{\hbox\bgroup\fontsize{8.8}{8.8}\selectfont$\displaystyle}?><mml:mtable class="split" rowspacing="0.2ex" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mtext>Agent energy (energy level, distance, number of people)</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>=</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mtext>energy level</mml:mtext><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>-</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mtext>distance</mml:mtext><mml:mo>/</mml:mo><mml:mn mathvariant="normal">500</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>-</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mtext>number of people rescued</mml:mtext><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mn mathvariant="normal">0.3</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mtext>Task runtime by an agent (distance, number of people, severity)</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>=</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mtext>distance</mml:mtext><mml:mo>/</mml:mo><mml:mn mathvariant="normal">150</mml:mn><mml:mo>+</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mtext>number of people rescued</mml:mtext><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>⋅</mml:mo><mml:mn mathvariant="normal">15</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>+</mml:mo><mml:mtext>severity</mml:mtext><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable><?xmltex \hack{$\egroup}?></mml:mrow></mml:math></disp-formula>
            <?xmltex \hack{\newpage}?>
              <disp-formula id="Ch1.E1" content-type="numbered"><label>1</label><mml:math id="M54" display="block"><mml:mrow><?xmltex \hack{\hbox\bgroup\fontsize{8.8}{8.8}\selectfont$\displaystyle}?><mml:mtable rowspacing="0.2ex" class="split" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mtext>Risk level for an agent (energy level, priority)</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>=</mml:mo><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mtext>priority</mml:mtext><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mo>-</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mtext>energy level</mml:mtext></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mtext>Route status (distance)</mml:mtext><mml:mspace linebreak="nobreak" width="0.125em"/><mml:mo>=</mml:mo><mml:mspace width="0.125em" linebreak="nobreak"/><mml:mtext>distance</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable><?xmltex \hack{$\egroup}?></mml:mrow></mml:math></disp-formula>
            In the real world, each person can introduce intervals according to their
experience and their knowledge of the environment. In this study, we used
the above equations based on expert opinion to simulate the real
environment. The coordinating agent applies the interval-based VIKOR method
to order the agents' bids. The coordinating agent sends the results to the
central agent after ordering the <?pagebreak page3455?>agents. The use of a central agent in this
phase provides the opportunity to make the best decision considering the
task priorities and capacities of other agents.</p>
</sec>
</sec>
<sec id="Ch1.S4.SS4">
  <label>4.4</label><title>Applying allocation strategies</title>
      <p id="d1e1386">In operations where there is uncertainty, the issue of task allocation
cannot be definitively resolved. In this phase, the initial allocation
should be done in such a manner that a potential reallocation would waste
the smallest amount of time. Based on different strategies at this stage,
the central agent begins to assign tasks after obtaining all lists from
coordinating agents. In each strategy, a priority is assigned to specific
tasks. In this section, four different strategy-based approaches are
described, as follows:
<list list-type="bullet"><list-item>
      <p id="d1e1391"><italic>Task allocation according to priority (strategy 1)</italic>. In
this strategy, task allocation begins with the assignment of higher priority
tasks, following establishment of the task order and priorities of the
rescue team in the previous stage (prioritization and auction). Therefore,
the agent with the best performance is selected for high-priority tasks and
is subsequently excluded from the lists of agents with no tasks.
Subsequently, the tasks of lower priority are assigned in the same order.
The limitation of this strategy is that it may cause some agents to not
receive tasks.</p></list-item><list-item>
      <p id="d1e1397"><italic>Assigning tasks to all agents, preferably to specific agents with optimal outcomes (strategy 2)</italic>. This strategy is based on the optimal
use of all rescue teams. In this strategy, all agents are assigned a task.
For this purpose, a task is first assigned to an agent who has applied for
the minimum number of tasks. The agent and task are then eliminated from the
agent and task lists, and the allocation continues with the next agent who
has made few requests. Using this strategy, a task will be assigned to all
agents.</p></list-item><list-item>
      <p id="d1e1403"><italic>Task allocation on a strategic spatial basis (strategy 3)</italic>.  Using this strategy, agents who play important and strategic roles
in the task allocation process are excluded to ensure their availability for
the implementation of tasks if problems are encountered during the task
allocation process. Agents with strategic roles may be defined differently.
Agents who participate in the auctions of more tasks are those with
strategic locations. In such instances, these agents are close to many tasks
(have strategic spatial locations) and can be used when these tasks are not
implemented. Figure 3 shows the difference between the task allocation
results for strategies 2 and 3. In Fig. 3, a rescue agent located
centrally has a strategic position and will try to maintain this position.
Although the total movement may increase, if there are problems in
performing other tasks, this agent can help all other groups.</p></list-item><list-item>
      <p id="d1e1409"><italic>Assigning tasks by creating the best density in the environment (strategy 4)</italic>. This strategy is based on the optimal density of
rescue agents. Using this strategy, task assignments are made in a manner
that ensures the uniform distribution of agents in the environment.
Generally, no exact information is available concerning the conditions of
the tasks; therefore, this strategy aims to ensure a uniform distribution of
rescue teams within the environment if the uncertainty is high. In disaster
environments such as earthquakes, the incident occurs over a wide area, such
that the damage and injured population are uniformly distributed due to the
texture of the area. Therefore, the highest number of injured people is not
accumulated in any one spot. Furthermore, applying this strategy prevents
the convergence of rescue teams. To apply this strategy, the tasks of the
highest priority in the task lists should be given to the available agents
where the environmental density is the highest. The concept of optimal
density can be solved through innovative algorithms. In our study, the
simulated annealing method was used to determine uniform density. The
implementation stages of simulated annealing have been described previously
(Sabar et al., 2009). Figure 4 shows the difference between task
allocation outcomes for strategy 2 and strategy 4.</p></list-item></list></p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F3"><?xmltex \currentcnt{3}?><?xmltex \def\figurename{Figure}?><label>Figure 3</label><caption><p id="d1e1416">Strategic agent illustration. Blue arrows show the final results for strategy 2, and red arrows show the successful rescuers in strategy 3.</p></caption>
          <?xmltex \igopts{width=241.848425pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f03.png"/>

        </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F4"><?xmltex \currentcnt{4}?><?xmltex \def\figurename{Figure}?><label>Figure 4</label><caption><p id="d1e1427">Best density strategy illustration. Blue arrows indicate the successful rescuers in strategy 2, and red arrows indicate the final results for strategy 4.</p></caption>
          <?xmltex \igopts{width=241.848425pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f04.png"/>

        </fig>

<sec id="Ch1.S4.SS4.SSS1">
  <label>4.4.1</label><title>Implementation and observation of real values in the environment</title>
      <p id="d1e1444">During the implementation phase, tasks are implemented by agents in a
dynamic environment where there are always<?pagebreak page3456?> uncertainties during task
execution. The rescuer observes the difference between predicted values and
the actual environment after the work begins. In this study, a random number
in the [<inline-formula><mml:math id="M55" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M56" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M57" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M58" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>] interval was chosen to model the real
environment. In the real world, the difference between the predicted
environment (through building vulnerability estimation models) and the real
environment will determine the agent's performance.</p>
      <p id="d1e1485">If the agent observes a large difference between the auction information and
the real environment, the agent abandons that task. In this instance, the
agent updates the task's values and uncertainties and returns the work to
the central agent. The new uncertainty interval will be 80 % smaller than
the original interval. There are various conditions under which agents will
reallocate a task if the environment differs from the expected scenario. For
example, the agent can abandon the task if three of eight decision-making
parameters are out of range by 5%. Otherwise, the agent finishes the
rescue work by accepting the new conditions. The central agent assigns newly
added tasks within the reallocation framework. When a new task is assigned,
the task allocation is combined with that of both new and incomplete tasks.</p>
</sec>
</sec>
<sec id="Ch1.S4.SS5">
  <label>4.5</label><title>Evaluation method</title>
      <p id="d1e1497">Assessment of a task allocation algorithm is typically performed in the
first phase through modeling and simulation due to the dynamic and
heterogeneous nature of different environments (Olteanu et al., 2012).
Simulation is a suitable approach for the implementation and validation of a
proposed method (Nourjou et al., 2011). In a real test situation, the
situations and conditions of the implementation scenario are difficult to
reproduce. In the present study, we simulated three scenarios for
earthquakes in Tehran's District 1 with magnitudes of 6.6, 6.9, and 7.2. We
also estimated the numbers of deceased and injured individuals who are
distributed in the centers of relevant building blocks and need to be
rescued by 1000, 1500, or 2000 rescue agents. In the uncertainty analysis of
the suggested method, the lower and upper bounds of uncertain values were
also calculated. The proposed method was compared with the traditional CNP.
The intended task allocation was considered efficient if profitability
parameters were maximized. In accordance with several recent studies
(Liu and Shell, 2012; Sang, 2013; Hooshangi and Alesheikh, 2017), three
criteria were used to evaluate the performance of the proposed method: the
number of deceased victims, number of incorrect allocations, and rescue
time.</p>
      <p id="d1e1500">Some of the major problems in reallocation and in the task allocation
environment include scalability, reliability, performance, and dynamic
resource reallocation (Gokilavani et al., 2013). In this study, the
results of two analyses (scalability of the proposed method and interval
uncertainty analysis) are presented.</p>
      <p id="d1e1503">The first analysis focused on the evaluation of the proposed approach at
different scales and for different criteria. Comparison and assessment were
carried out at different scales to measure the effectiveness of the proposed
approaches in USAR operations. Nine scenarios were applied in this study and
compared with the traditional CNP.</p>
      <p id="d1e1506">The second analysis focused on interval uncertainty analysis and studied the
rescue operation duration in the 6.9 magnitude earthquake at different
levels of uncertainty. In this analysis, time changes in rescue operations
were investigated according to different levels of uncertainties. The
duration of a rescue operation in the simulation model depended on two main
components: prioritization of tasks and outputs of each operation in each
phase (Hooshangi and Alesheikh, 2018). Equation (2) defines the final
model for calculating the operation duration based on these two components.</p>
      <p id="d1e1510"><disp-formula id="Ch1.E2" content-type="numbered"><label>2</label><mml:math id="M59" display="block"><mml:mtable rowspacing="0.2ex" class="split" displaystyle="true" columnalign="right left"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mi>T</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">7</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">8</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>=</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:munderover><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">4</mml:mn></mml:msub></mml:mrow></mml:mfenced><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo>=</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>w</mml:mi></mml:msub><mml:mfenced close=")" open="("><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">6</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">7</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">8</mml:mn></mml:msub></mml:mrow></mml:mfenced></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
      <p id="d1e1692">Variables <inline-formula><mml:math id="M60" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> to <inline-formula><mml:math id="M61" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> constitute the number of injuries, severity of injuries,
duration of the operation, infrastructure priorities, energy, route status,
task runtime by agents, and risk level for agents, respectively. <inline-formula><mml:math id="M62" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">α</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the function of task prioritization, and <inline-formula><mml:math id="M63" display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">β</mml:mi><mml:mi>w</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the
function of bidding.</p>
      <p id="d1e1739">To the best of our knowledge, interval uncertainty analysis has rarely been employed.
The method used in this research was adapted from previous literature
(Lan and Peng, 2016). In our analysis, Chebyshev points are used.
Equation (3) depicts a Chebyshev formula for generating <inline-formula><mml:math id="M64" display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> collocation points
in the interval [0, 1] (Lan and Peng, 2016):
            <disp-formula id="Ch1.E3" content-type="numbered"><label>3</label><mml:math id="M65" display="block"><mml:mrow><?xmltex \hack{\hbox\bgroup\fontsize{9.1}{9.1}\selectfont$\displaystyle}?><mml:msub><mml:mi mathvariant="normal">number</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfenced close="}" open="{"><mml:mtable class="array" columnalign="left left"><mml:mtr><mml:mtd><mml:mrow><mml:mn mathvariant="normal">0.5</mml:mn><mml:mo>×</mml:mo><mml:mfenced open="[" close="]"><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>-</mml:mo><mml:mi>cos⁡</mml:mi><mml:mfenced open="(" close=")"><mml:mstyle displaystyle="false"><mml:mstyle displaystyle="false"><mml:mfrac style="text"><mml:mrow><mml:mi mathvariant="italic">π</mml:mi><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:mstyle></mml:mfenced></mml:mrow></mml:mfenced></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi mathvariant="normal">for</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mi mathvariant="normal">if</mml:mi><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn mathvariant="normal">0.5</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mi mathvariant="normal">for</mml:mi><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mi mathvariant="normal">if</mml:mi><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mfenced><mml:mo>.</mml:mo><?xmltex \hack{$\egroup}?></mml:mrow></mml:math></disp-formula>
          Equation (3) was used to create different numbers for the decision-making
parameters. The output of the model was then calculated for various numbers
within the intervals. This technique created different values for the output
of the model.</p>
</sec>
</sec>
<sec id="Ch1.S5">
  <label>5</label><title>Results and discussion</title>
      <p id="d1e1877">Multiple scenarios and experiments were designed to evaluate the proposed
methods and strategies. The results are presented in this section. In
accordance with expert opinion, three probable earthquakes were simulated
with magnitudes of 6.6, 6.9, and 7.2. Figure 5 shows the vulnerabilities of
buildings in these scenarios in the ArcGIS environment.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F5" specific-use="star"><?xmltex \currentcnt{5}?><?xmltex \def\figurename{Figure}?><label>Figure 5</label><caption><p id="d1e1882">Vulnerability maps for District 1, based on earthquakes with
magnitudes of <bold>(a)</bold> 6.6, <bold>(b)</bold> 6.9, and <bold>(c)</bold> 7.2 on the Richter scale.</p></caption>
        <?xmltex \igopts{width=369.885827pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f05.png"/>

      </fig>

      <p id="d1e1900">Based on the level of building destruction, the numbers of injured and
deceased people can be calculated using the JICA model. The numbers of
injured and deceased people in scenarios with 6.6, 6.9, and 7.2 magnitude
earthquakes are listed in Table 2.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T2"><?xmltex \currentcnt{2}?><label>Table 2</label><caption><p id="d1e1907">Results of earthquake simulations.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right"/>
     <oasis:thead>
       <oasis:row>
         <oasis:entry colname="col1">Severity level</oasis:entry>
         <oasis:entry rowsep="1" namest="col2" nameend="col4" align="center">Numbers of affected individuals </oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1"/>
         <oasis:entry colname="col2">6.6 Richter</oasis:entry>
         <oasis:entry colname="col3">6.9 Richter</oasis:entry>
         <oasis:entry colname="col4">7.2 Richter</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Uninjured</oasis:entry>
         <oasis:entry colname="col2">374 295</oasis:entry>
         <oasis:entry colname="col3">270 455</oasis:entry>
         <oasis:entry colname="col4">182 340</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Injured</oasis:entry>
         <oasis:entry colname="col2">28 856</oasis:entry>
         <oasis:entry colname="col3">73 195</oasis:entry>
         <oasis:entry colname="col4">111 463</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Deceased</oasis:entry>
         <oasis:entry colname="col2">30 349</oasis:entry>
         <oasis:entry colname="col3">89 850</oasis:entry>
         <oasis:entry colname="col4">139 697</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <?pagebreak page3457?><p id="d1e1998">The computational scale of the JICA model uses urban blocks. Therefore, the
numbers of deceased and injured individuals in each urban block were
calculated. The locations of injured individuals were presumed to be in the
centers of the respective blocks.</p>
      <p id="d1e2001">The environmental simulation and proposed method were implemented in
AnyLogic software. This software can process geospatial information system
data. To simplify the environment and reduce the calculation volume, each
agent was regarded as a group in the real world. Figure 6 shows the
simulated environment.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F6" specific-use="star"><?xmltex \currentcnt{6}?><?xmltex \def\figurename{Figure}?><label>Figure 6</label><caption><p id="d1e2006">Overview of the USAR simulator.</p></caption>
        <?xmltex \igopts{width=369.885827pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f06.png"/>

      </fig>

      <p id="d1e2015">There are many injuries in the environment. The central agent first sorts
the tasks according to their priorities. After the coordinating agent has
been determined, the central agent sends the task properties to the
coordinating agent. The coordinator holds an auction. Rescue agents bid in
accordance with their environmental and working conditions. Rescuers are in
a ready state at the start of the operation. Each successful rescue agent
moves to the task's location. After reaching the task position, the rescue
agent begins rescuing the injured agents. During the execution of their
assigned work, the agents may find considerable differences between the
real-world information and the information expressed in the auction. In such
instances, the agents may stop performing their tasks and report the
discrepancies to the central agent.</p>
      <p id="d1e2019">Table 3 shows the durations of USAR operations as estimated using
scalability analysis with the proposed method. In creating this table, an
uncertainty of 30 % was considered. For this purpose, the range of task
characteristics used the intervals [<inline-formula><mml:math id="M66" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M67" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M68" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>] and [<inline-formula><mml:math id="M69" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M70" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>,
<inline-formula><mml:math id="M71" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>]. At each stage, a given agent participated in the auction. For that
agent's decision-making parameters, the numbers were randomly converted into
an interval. The average range of agent tasks and decision-making was used
for implementation of the CNP, rather than interval values.</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T3" specific-use="star"><?xmltex \currentcnt{3}?><label>Table 3</label><caption><p id="d1e2078">Comparison of operation duration in hours between the proposed
method and the CNP (based on 30 % uncertainty).</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="10">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="right"/>
     <oasis:colspec colnum="3" colname="col3" align="right"/>
     <oasis:colspec colnum="4" colname="col4" align="right" colsep="1"/>
     <oasis:colspec colnum="5" colname="col5" align="right"/>
     <oasis:colspec colnum="6" colname="col6" align="right"/>
     <oasis:colspec colnum="7" colname="col7" align="right" colsep="1"/>
     <oasis:colspec colnum="8" colname="col8" align="right"/>
     <oasis:colspec colnum="9" colname="col9" align="right"/>
     <oasis:colspec colnum="10" colname="col10" align="right"/>
     <oasis:thead>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">No. of agents</oasis:entry>
         <oasis:entry namest="col2" nameend="col4" align="center" colsep="1">1000 </oasis:entry>
         <oasis:entry namest="col5" nameend="col7" align="center" colsep="1">1500 </oasis:entry>
         <oasis:entry namest="col8" nameend="col10" align="center">2000 </oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>
         <oasis:entry colname="col1">Simulated earthquake magnitude</oasis:entry>
         <oasis:entry colname="col2">6.6 <inline-formula><mml:math id="M72" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col3">6.9 <inline-formula><mml:math id="M73" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col4">7.2 <inline-formula><mml:math id="M74" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col5">6.6 <inline-formula><mml:math id="M75" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col6">6.9 <inline-formula><mml:math id="M76" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col7">7.2 <inline-formula><mml:math id="M77" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col8">6.6 <inline-formula><mml:math id="M78" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col9">6.9 <inline-formula><mml:math id="M79" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
         <oasis:entry colname="col10">7.2 <inline-formula><mml:math id="M80" display="inline"><mml:mi>R</mml:mi></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">
         <oasis:entry colname="col1">No. of tasks</oasis:entry>
         <oasis:entry colname="col2">28 856</oasis:entry>
         <oasis:entry colname="col3">73 195</oasis:entry>
         <oasis:entry colname="col4">111 463</oasis:entry>
         <oasis:entry colname="col5">28 856</oasis:entry>
         <oasis:entry colname="col6">73 195</oasis:entry>
         <oasis:entry colname="col7">111 463</oasis:entry>
         <oasis:entry colname="col8">28 856</oasis:entry>
         <oasis:entry colname="col9">73 195</oasis:entry>
         <oasis:entry colname="col10">111 463</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">CNP</oasis:entry>
         <oasis:entry colname="col2">53.16</oasis:entry>
         <oasis:entry colname="col3">169.03</oasis:entry>
         <oasis:entry colname="col4">282.76</oasis:entry>
         <oasis:entry colname="col5">32.83</oasis:entry>
         <oasis:entry colname="col6">94.24</oasis:entry>
         <oasis:entry colname="col7">174.19</oasis:entry>
         <oasis:entry colname="col8">22.6</oasis:entry>
         <oasis:entry colname="col9">68.95</oasis:entry>
         <oasis:entry colname="col10">127.47</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Strategy 1</oasis:entry>
         <oasis:entry colname="col2">45.37</oasis:entry>
         <oasis:entry colname="col3">142.47</oasis:entry>
         <oasis:entry colname="col4">241.81</oasis:entry>
         <oasis:entry colname="col5">25.22</oasis:entry>
         <oasis:entry colname="col6">74.91</oasis:entry>
         <oasis:entry colname="col7">135.75</oasis:entry>
         <oasis:entry colname="col8">19.643</oasis:entry>
         <oasis:entry colname="col9">59.36</oasis:entry>
         <oasis:entry colname="col10">108.56</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Strategy 2</oasis:entry>
         <oasis:entry colname="col2">44.87</oasis:entry>
         <oasis:entry colname="col3">137.30</oasis:entry>
         <oasis:entry colname="col4">234.92</oasis:entry>
         <oasis:entry colname="col5">26.02</oasis:entry>
         <oasis:entry colname="col6">76.41</oasis:entry>
         <oasis:entry colname="col7">138.52</oasis:entry>
         <oasis:entry colname="col8">19.097</oasis:entry>
         <oasis:entry colname="col9">58.21</oasis:entry>
         <oasis:entry colname="col10">105.58</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Strategy 3</oasis:entry>
         <oasis:entry colname="col2">43.75</oasis:entry>
         <oasis:entry colname="col3">133.76</oasis:entry>
         <oasis:entry colname="col4">230.12</oasis:entry>
         <oasis:entry colname="col5">25.75</oasis:entry>
         <oasis:entry colname="col6">74.33</oasis:entry>
         <oasis:entry colname="col7">132.75</oasis:entry>
         <oasis:entry colname="col8">18.332</oasis:entry>
         <oasis:entry colname="col9">56.33</oasis:entry>
         <oasis:entry colname="col10">101.77</oasis:entry>
       </oasis:row>
       <oasis:row>
         <oasis:entry colname="col1">Strategy 4</oasis:entry>
         <oasis:entry colname="col2">41.63</oasis:entry>
         <oasis:entry colname="col3">130.41</oasis:entry>
         <oasis:entry colname="col4">222.18</oasis:entry>
         <oasis:entry colname="col5">23.89</oasis:entry>
         <oasis:entry colname="col6">71.14</oasis:entry>
         <oasis:entry colname="col7">127.87</oasis:entry>
         <oasis:entry colname="col8">17.013</oasis:entry>
         <oasis:entry colname="col9">53.91</oasis:entry>
         <oasis:entry colname="col10">97.73</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p id="d1e2422">The operational time decreased when the number of agents in rescue
operations increased, with the number of tasks remaining fixed. The reduction
rate ranged from 54 % to 60 % when the number of agents was doubled. The
duration of a USAR operation increased when the number of tasks increased
for a given number of agents. Therefore, the<?pagebreak page3458?> duration of the rescue
operation was related to the number of rescue agents and the number of
available tasks in a scenario. There was an inverse relationship between the
duration of the USAR operation and the number of rescue agents and a direct
relationship between the duration of the operation and the number of tasks.</p>
      <p id="d1e2425">The inclusion of uncertainty in any allocation strategy provided better
results compared with the CNP method. Using the proposed strategies, the
smallest improvement in results with uncertainty was 2.9 h (13 %) for a
scenario with 2000 agents and 28 856 tasks (6.6 magnitude earthquake). The
maximum improvement was 60.6 h (21 %) for 1000 agents and 111 463
tasks.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F7" specific-use="star"><?xmltex \currentcnt{7}?><?xmltex \def\figurename{Figure}?><label>Figure 7</label><caption><p id="d1e2430">Numbers of deceased people with <bold>(a)</bold> 1000, <bold>(b)</bold> 1500, and <bold>(c)</bold> 2000
rescue agents.</p></caption>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f07.png"/>

      </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F8" specific-use="star"><?xmltex \currentcnt{8}?><?xmltex \def\figurename{Figure}?><label>Figure 8</label><caption><p id="d1e2451">Numbers of incorrect allocations with <bold>(a)</bold> 1000, <bold>(b)</bold> 1500, and <bold>(c)</bold> 2000 rescue agents.</p></caption>
        <?xmltex \igopts{width=398.338583pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f08.png"/>

      </fig>

      <p id="d1e2469">Among the task allocation strategies in this study, strategy 1 produced the
worst response. At each scale for the discussed scenarios, strategy 1
resulted in USAR operations with the longest durations compared with other
strategies. Strategies 1 and 2 provided similar results at different scales,
although strategy 2 achieved better results. Strategy 4, which involved
spatial information in task allocation, produced better results at all
scales, including improvements of 21 %, 24 %, and 23 % with 1000 agents
for a 6.6 magnitude earthquake, 1500 agents for a 6.9 magnitude earthquake,
and 2000 agents for a 7.2 magnitude earthquake, respectively, compared with
the CNP. The average improvement for strategy 4 was 26.6 h in rescue
operations. The use of strategies 3 and 4 is more suitable in a larger
environment with high numbers of both injured people and rescue agents
because controlling agent distribution with respect to expansion of the
environment and the uncertain environmental conditions can<?pagebreak page3459?> be effective in
future task allocations. In a real-world crisis-ridden environment, the
overall environment is damaged, and the injured people are well distributed.
Therefore, the spatial distribution of agents is an important parameter to
control in USAR operations.</p>
      <p id="d1e2472">The simulation results in terms of deceased people for 1000, 1500, and 2000
agents with different numbers of tasks are shown in Fig. 7. In these
figures, for each of the four priority parameters and decision parameters
associated with agents, a 30 % uncertainty level was considered.</p>
      <p id="d1e2475">Figure 7 illustrates the numbers of deceased people in the rescue process
with different numbers of agents and tasks. Based on Fig. 7, an increased
number of tasks led to an increased number of deceased people, but an
increased number of rescue agents led to a decreased number of deceased
people. Regarding the numbers of deceased people at all three scales, the
CNP method produced the worst response. An average of 7253 people were
deceased in the CNP model with 1000 agents. Conversely, 5853 people were
deceased in the model employing strategy 1 with 1000 agents. Overall, when
all strategies were considered, strategies 4 and 1 resulted in the best and
worst responses, respectively. As illustrated in Fig. 7, the numbers of
deceased people were approximately equivalent in strategies 1 and 2.</p>
      <p id="d1e2478">Figure 8 illustrates the simulation results for the incorrect allocation of
1000, 1500, and 2000 agents with several different tasks.</p>
      <p id="d1e2481">The overall trend in each chart was approximately similar if all charts were
considered simultaneously. Any incorrect allocation was unrelated to the
number of rescue agents because there were no changes when the number of
agents was increased. The number of incorrect allocations changed with the
number of tasks, such that it increased with an increasing number of tasks.
This increase is evident in all panels in Fig. 8. Incorrect allocations
usually occurred at a nearly fixed rate.</p>
      <p id="d1e2485">Based on the results, the traditional CNP model produced the worst response.
The total incorrect allocations in the CNP model with 1000 agents and 28 856
tasks, 1500 agents and 73 195 tasks, and 2000 agents and 111 463 tasks were
3780, 10 027, and 14 604 tasks, respectively. The numbers of incorrect
allocations assigned by strategy 1 were 3174, 8014, and 12 455 tasks,
respectively. Furthermore, the evaluation criteria showed the advantages of
including uncertainty in task allocation. Therefore, the proposed approaches
for all three evaluation parameters resulted in better performance compared
with the traditional CNP method. The results indicate that the reallocation
of tasks through the proposed approaches and strategies offered a better
response, based on the scale of the event, because their differences from
the CNP model increased at a larger scale.</p>
      <p id="d1e2488">The results of interval uncertainty analysis were achieved with 1000
randomized runs of each scenario (Fig. 9).</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F9" specific-use="star"><?xmltex \currentcnt{9}?><?xmltex \def\figurename{Figure}?><label>Figure 9</label><caption><p id="d1e2493">Uncertainty analysis of the proposed method for USAR operations,
for nine simulated scenarios.</p></caption>
        <?xmltex \igopts{width=341.433071pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f09.png"/>

      </fig>

      <p id="d1e2502">As shown in Fig. 9, there is a direct relationship between interval length
and operational time. According to Eq. (2), assigning fewer tasks leads
to less operating time and causes less uncertainty in the simulated
environment.</p>
      <?pagebreak page3460?><p id="d1e2505">As mentioned in Sect. 4.3.3, the rescuers use [<inline-formula><mml:math id="M81" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M82" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M83" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>] and [<inline-formula><mml:math id="M84" display="inline"><mml:mrow><mml:mi>X</mml:mi><mml:mo>-</mml:mo><mml:mn mathvariant="normal">30</mml:mn></mml:mrow></mml:math></inline-formula> %<inline-formula><mml:math id="M85" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math id="M86" display="inline"><mml:mi>X</mml:mi></mml:math></inline-formula>] to determine the intervals. Another analysis was performed
for values other than 30 % in the estimations. The results are shown in
Fig. 10. An average event scale (1500 agents and 73 195 tasks) was used,
and different levels of uncertainty (uncertainty between 5 % and 55 % at
five-unit intervals) were randomly generated, investigated, and evaluated.
This realistic test aimed to assess the proposed scenarios for each
uncertainty value.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F10" specific-use="star"><?xmltex \currentcnt{10}?><?xmltex \def\figurename{Figure}?><label>Figure 10</label><caption><p id="d1e2564">Uncertainty analysis when different values were used in determining intervals.</p></caption>
        <?xmltex \igopts{width=341.433071pt}?><graphic xlink:href="https://nhess.copernicus.org/articles/21/3449/2021/nhess-21-3449-2021-f10.png"/>

      </fig>

      <p id="d1e2573">Figure 10 indicates a relationship between increased in uncertainty (from
5 % to 55 %) and an increased rescue time. The increases differed among
strategies. The increase was 67.7 h for the CNP (from 66.8 to 134.4 h),
whereas increases of 63.4, 63.2, 61.7, and 56.5 h were obtained for
strategies 1–4, respectively. Based on the evaluation results, the proposed
methods are more efficient and present better responses in the presence of
various uncertainties. Therefore, increased in uncertainty leads to a delay
in USAR operations and possible task elimination. Accordingly, delaying
rescue operations or removing tasks from the rescue list will increase USAR
time.</p>
</sec>
<sec id="Ch1.S6" sec-type="conclusions">
  <label>6</label><title>Conclusion</title>
      <p id="d1e2584">Providing a suitable method for assigning tasks under uncertain conditions
is important, according to the results of simulated USAR operations. This
study presented a task allocation approach that aimed to better assign
initial tasks, thus ensuring better conditions for potential reallocations
of tasks and wasting the least time possible for rescue teams if problems
were encountered during the initial allocations or a new task emerges. Some
of the characteristics and advantages of the study include the focus on the
necessity of task reallocation in disaster environments, the provision of an
innovative approach for managing uncertainties that cause non-performance of
tasks in the CNP method (the most widely used task allocation method in
multi-agent systems), and the definition of spatial strategies for better
task reallocation. The proposed approach can be used in combination with a
wide range of algorithms for assigning tasks in accordance with the
structure of the system.</p>
      <p id="d1e2587">The results obtained from simulations with the proposed approach revealed
that the duration of rescue operations when the proposed strategies were
implemented was always shorter than the time required using the CNP method.
The worst improvement was identified for 2000 agents with 28 856 tasks
(13 %) and the best for 1000 agents with 111 463 tasks (21 %).
Furthermore, the results at different scales showed that the application of
uncertainty in task allocation could improve the duration of USAR
operations. There is a relationship between an increase in uncertainty and
increased rescue operation duration. Furthermore, the results revealed a
significant decrease in the numbers of deceased people and wrong allocations
due to uncertainties, which<?pagebreak page3461?> demonstrated the importance of uncertainty
inclusion in task allocation. The implemented method can be used for
cooperation among agents. In an earthquake-stricken environment, rescuers
can use assistant agents (devices such as mobile phones and tablets) to
implement this methodology.</p>
      <p id="d1e2590">However, regarding comparisons of the proposed strategies, it is
insufficient to consider only uncertainty in initial decision-making
concerning task allocation because the working environment is quite dynamic,
and the assigned tasks may encounter various problems. An effective
assignment approach should consider both uncertainties in decision-making
and strategies for reallocation to waste the least time during system
disruptions. This optimizes planning to achieve better implementation time
and allows for fault tolerance. The strategies for applying uncertainty during
the implementation of task allocation improve the efficiency, performance,
and stability of agent-based cooperation. Task allocation strategies lead to
flexibility in decision-making and decrease the system's overall costs.
Furthermore, spatial task allocation strategies can propose a specific
arrangement of the rescue team within an environment to prevent time-wasting
in the event of environmental uncertainties or task reallocation.</p>
      <p id="d1e2593">Additional research is recommended to provide new strategies and combine the
proposed task allocation strategies of the present study with a
coalition-forming method to select an appropriate coordinating agent in our
proposed approach. Future studies should also consider other groups and
other uncertainties within a range of dynamic simulations.</p>
</sec>

      
      </body>
    <back><notes notes-type="codedataavailability"><title>Code and data availability</title>

      <p id="d1e2600">District 1 data were purchased online and cannot be published. Codes are
available upon request.</p>
  </notes><notes notes-type="authorcontribution"><title>Author contributions</title>

      <p id="d1e2606">NH collected the data, performed most of the result analyses, and
wrote the draft. AAA has advised on implementation and helped
interpret the results and also helped revise the manuscript. MP supported
the writing and editing of the paper. SL provided critical proofreading
with valuable suggestions. All the authors were involved in the editing of
the manuscript.</p>
  </notes><notes notes-type="competinginterests"><title>Competing interests</title>

      <p id="d1e2612">The authors declare that they have no conflict of interest.</p>
  </notes><notes notes-type="disclaimer"><title>Disclaimer</title>

      <p id="d1e2618">Publisher’s note: Copernicus Publications remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.</p>
  </notes><ack><title>Acknowledgements</title><p id="d1e2624">The authors highly appreciate the anonymous reviewers and the editor for their
constructive comments that helped us to improve the paper.</p></ack><notes notes-type="financialsupport"><title>Financial support</title>

      <p id="d1e2629">This research has been supported by the Basic Research Project of the Korea Institute of Geoscience and Mineral Resources (KIGAM) and the Project of Environmental Business Big Data Platform and Center Construction, funded by the Ministry of Science and ICT. Furthermore, this work has been supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education (grant no. 2019R1A6A1A03033167).</p>
  </notes><notes notes-type="reviewstatement"><title>Review statement</title>

      <p id="d1e2635">This paper was edited by Paolo Tarolli and reviewed by three anonymous referees.</p>
  </notes><ref-list>
    <title>References</title>

      <ref id="bib1.bib1"><label>1</label><?label 1?><mixed-citation>
Barnum, D. T. and Gleason, J. M.: DEA efficiency analysis involving
multiple production processes, Appl. Econ. Lett., 17, 627–632, 2010.</mixed-citation></ref>
      <ref id="bib1.bib2"><label>2</label><?label 1?><mixed-citation>Ben Othman, S., Zgaya, H., Dotoli, M., and Hammadi, S.: An agent-based
Decision Support System for resources' scheduling in Emergency Supply
Chains, Control Eng. Pract., 59, 27–43, <ext-link xlink:href="https://doi.org/10.1016/j.conengprac.2016.11.014" ext-link-type="DOI">10.1016/j.conengprac.2016.11.014</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib3"><label>3</label><?label 1?><mixed-citation>Berberian, M. and Yeats, R.: Tehran: An Earthquake Time Bomb, in: Tectonic
Evolution, Collision, and Seismicity of Southwest Asia: In Honor of Manuel
Berberian's Forty-Five Years of Research Contributions, The Geological Society of America, USA, 84,
<ext-link xlink:href="https://doi.org/10.1130/2016.2525(04)" ext-link-type="DOI">10.1130/2016.2525(04)</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bib4"><label>4</label><?label 1?><mixed-citation>
Bertuccelli, L. F., Choi, H.-L., Cho, P., and How, J. P.: Real-time
multi-UAV task assignment in dynamic and uncertai<?pagebreak page3462?>n environments, presentado
al AIAA Guidance, Navigation, and Control Conference, Chicago, Illinois, 2009.</mixed-citation></ref>
      <ref id="bib1.bib5"><label>5</label><?label 1?><mixed-citation>
Cai, B., Huang, S., Liu, D., and Dissanayake, G.: Rescheduling policies for
large-scale task allocation of autonomous straddle carriers under
uncertainty at automated container terminals, Robot. Auton.
Syst., 62, 506–514, 2014.</mixed-citation></ref>
      <ref id="bib1.bib6"><label>6</label><?label 1?><mixed-citation>
Chen, A. Y., Peña-Mora, F., Plans, A. P., Mehta, S. J., and Aziz, Z.:
Supporting Urban Search and Rescue with digital assessments of structures
and requests of response resources, Adv. Eng. Inform., 26,
833–845, 2012.</mixed-citation></ref>
      <ref id="bib1.bib7"><label>7</label><?label 1?><mixed-citation>
Chen, J. and Sun, D.: Coalition-based approach to task allocation of
multiple robots with resource constraints, IEEE T. Autom.
Sci. Eng., 9, 516–528, 2012.</mixed-citation></ref>
      <ref id="bib1.bib8"><label>8</label><?label 1?><mixed-citation>
Cheng, Y.: A knowledge-based airport gate assignment system integrated with
mathematical programming, Comput. Ind. Eng., 32,
837–852, 1997.</mixed-citation></ref>
      <ref id="bib1.bib9"><label>9</label><?label 1?><mixed-citation>
Choi, H.-L., Brunet, L., and How, J. P.: Consensus-based decentralized
auctions for robust task allocation, IEEE T. Robotics, 25,
912–926, 2009.</mixed-citation></ref>
      <ref id="bib1.bib10"><label>10</label><?label 1?><mixed-citation>Crooks, A. T. and Wise, S.: GIS and agent-based models for humanitarian
assistance, Computers, Environment and Urban Systems, 41, 100–111,
<ext-link xlink:href="https://doi.org/10.1016/j.compenvurbsys.2013.05.003" ext-link-type="DOI">10.1016/j.compenvurbsys.2013.05.003</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bib11"><label>11</label><?label 1?><mixed-citation>
Dahl, T. S., Matarić, M., and Sukhatme, G. S.: Multi-robot task
allocation through vacancy chain scheduling, Robotics and Autonomous
Systems, 57, 674–687, 2009.</mixed-citation></ref>
      <ref id="bib1.bib12"><label>12</label><?label 1?><mixed-citation>
Erick, M., Anawat, S., Fumihiko, I., and Shunichi, K.: Agent-based
Simulation of the 2011 Great East Japan Earthquake/Tsunami Evacuation: An
Integrated Model of Tsunami Inundation and Evacuation, Journal of Natural
Disaster Science, 34, 41–57, 2012.</mixed-citation></ref>
      <ref id="bib1.bib13"><label>13</label><?label 1?><mixed-citation>Fecht, D., Beale, L., and Briggs, D.: A GIS-based urban simulation model for
environmental health analysis, Environ. Modell. Softw., 58,
1–11, <ext-link xlink:href="https://doi.org/10.1016/j.envsoft.2014.03.013" ext-link-type="DOI">10.1016/j.envsoft.2014.03.013</ext-link>, 2014.</mixed-citation></ref>
      <ref id="bib1.bib14"><label>14</label><?label 1?><mixed-citation>
Gokilavani, M., Selvi, S., and Udhayakumar, C.: A survey on resource
allocation and task scheduling algorithms in cloud environment, ISO 9001:
2008 Certified International Journal of Engineering and Innovative
Technology (IJEIT), International Journal of Engineering and Innovative Technology (IJEIT), India, Vol. 3, 2013.</mixed-citation></ref>
      <ref id="bib1.bib15"><label>15</label><?label 1?><mixed-citation>Grinberger, A. Y. and Felsenstein, D.: Dynamic agent based simulation of
welfare effects of urban disasters, Comput. Environ. Urban, 59, 129–141, <ext-link xlink:href="https://doi.org/10.1016/j.compenvurbsys.2016.06.005" ext-link-type="DOI">10.1016/j.compenvurbsys.2016.06.005</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bib16"><label>16</label><?label 1?><mixed-citation>Hamzehloo, H., Vaccari, F., and Panza, G. F.: Towards a reliable seismic
microzonation in Tehran, Iran, Eng. Geol., 93, 1–16, <ext-link xlink:href="https://doi.org/10.1016/j.enggeo.2007.05.001" ext-link-type="DOI">10.1016/j.enggeo.2007.05.001</ext-link>, 2007.</mixed-citation></ref>
      <ref id="bib1.bib17"><label>17</label><?label 1?><mixed-citation>Hawe, G. I., Coates, G., Wilson, D. T., and Crouch, R. S.: Agent-based
simulation of emergency response to plan the allocation of resources for a
hypothetical two-site major incident, Eng. Appl. Artif.
Intel., 46, 336–345, <ext-link xlink:href="https://doi.org/10.1016/j.engappai.2015.06.023" ext-link-type="DOI">10.1016/j.engappai.2015.06.023</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bib18"><label>18</label><?label 1?><mixed-citation>
He, Y. H., Pan, M. C., Xu, W., and Zou, Y. B.: Research of Allocation for
Uncertain Task Based on Genetic Algorithm, Adv. Mater. Res.,
324–329, 2014.</mixed-citation></ref>
      <ref id="bib1.bib19"><label>19</label><?label 1?><mixed-citation>Hooshangi, N. and Alesheikh, A. A.: Agent-based task allocation under
uncertainties in disaster environments: An approach to interval uncertainty,
Int. J. Disast. Risk Re., 24, 160–171, <ext-link xlink:href="https://doi.org/10.1016/j.ijdrr.2017.06.010" ext-link-type="DOI">10.1016/j.ijdrr.2017.06.010</ext-link>, 2017.</mixed-citation></ref>
      <ref id="bib1.bib20"><label>20</label><?label 1?><mixed-citation>Hooshangi, N. and Alesheikh, A. A.: Developing an Agent-Based Simulation
System for Post-Earthquake Operations in Uncertainty Conditions: A Proposed
Method for Collaboration among Agents, ISPRS Int.
Geo-Inf., 7, 1–22, <ext-link xlink:href="https://doi.org/10.3390/ijgi7010027" ext-link-type="DOI">10.3390/ijgi7010027</ext-link>, 2018.</mixed-citation></ref>
      <ref id="bib1.bib21"><label>21</label><?label 1?><mixed-citation>
Hosseini, K. A., Hosseini, M., Jafari, M. K., and Hosseinioon, S.:
Recognition of vulnerable urban fabrics in earthquake zones: a case study of
the Tehran metropolitan area, Journal of Seismology and earthquake
Engineering, 10, 175–187, 2009.</mixed-citation></ref>
      <ref id="bib1.bib22"><label>22</label><?label 1?><mixed-citation>Kamranzad, F., Memarian, H., and Zare, M.: Earthquake Risk Assessment for
Tehran, Iran, ISPRS Int.  Geo-Inf., 9, 430,
<ext-link xlink:href="https://doi.org/10.3390/ijgi9070430" ext-link-type="DOI">10.3390/ijgi9070430</ext-link>, 2020.</mixed-citation></ref>
      <ref id="bib1.bib23"><label>23</label><?label 1?><mixed-citation>
Kang, H.-S. and Kim, Y.-T.: The physical vulnerability of different types of
building structure to debris flow events, Nat. Hazards, 80, 1475–1493,
2016.</mixed-citation></ref>
      <ref id="bib1.bib24"><label>24</label><?label 1?><mixed-citation>
Kayır, H. H. E. and Parlaktuna, O.: Strategy-planned Q-learning approach
for multi-robot task allocation, Informatics in Control, 2014 11th International Conference on Automation and
Robotics (ICINCO), Vienna, Austria, 410–416, IEEE, USA, 2014.</mixed-citation></ref>
      <ref id="bib1.bib25"><label>25</label><?label 1?><mixed-citation>Lan, J. and Peng, Z.: Interval Uncertainty Analysis Using CANDECOMP/PARAFAC
Decomposition, in: Model Validation and Uncertainty Quantification, Volume
3: Proceedings of the 34th IMAC, A Conference and Exposition on Structural
Dynamics 2016, edited by: Atamturktur, S., Schoenherr, T., Moaveni, B., and
Papadimitriou, C., Springer International Publishing, Cham, 73–81,
<ext-link xlink:href="https://doi.org/10.1007/978-3-319-29754-5_7" ext-link-type="DOI">10.1007/978-3-319-29754-5_7</ext-link>, 2016.</mixed-citation></ref>
      <ref id="bib1.bib26"><label>26</label><?label 1?><mixed-citation>Lee, H. and Al-yafi, K.: Centralized versus Market-based Task Allocation in
the Presence of Uncertainty, EKC2009 Symposium Information, EU-Korea, Springer, Berlin Heidelberg, <ext-link xlink:href="https://doi.org/10.1007/978-3-642-13624-5" ext-link-type="DOI">10.1007/978-3-642-13624-5</ext-link>, 2010.</mixed-citation></ref>
      <ref id="bib1.bib27"><label>27</label><?label 1?><mixed-citation>
Li, D. and Cruz Jr., J. B.: A robust hierarchical approach to multi-stage
task allocation under uncertainty, 44th IEEE Conference on Decision and Control, 2005 and 2005
European Control Conference, CDC-ECC'05, 3375–3380, 2005.</mixed-citation></ref>
      <ref id="bib1.bib28"><label>28</label><?label 1?><mixed-citation>
Liu, L. and Shell, D. A.: Assessing optimal assignment under uncertainty: An
interval-based algorithm,  Int. J. Robot. Res.,
30, 936–953, 2011.</mixed-citation></ref>
      <ref id="bib1.bib29"><label>29</label><?label 1?><mixed-citation>Liu, L. and Shell, D. A.: Tackling task allocation uncertainty via a
combinatorial method, Safety, 2012
IEEE International Symposium on Security, and Rescue Robotics (SSRR), College Station, TX, USA, IEEE, 1–6, <ext-link xlink:href="https://doi.org/10.1109/SSRR.2012.6523871" ext-link-type="DOI">10.1109/SSRR.2012.6523871</ext-link>, 2012.</mixed-citation></ref>
      <ref id="bib1.bib30"><label>30</label><?label 1?><mixed-citation>
Mansouri, B., Hosseini,  A. K., and Nourjou, R.: SEISMIC HUMAN LOSS ESTIMATION
IN TEHRAN USING GIS, 14th World Conference on Earthquake Engineering, October 2008, Beijing, 2008.</mixed-citation></ref>
      <ref id="bib1.bib31"><label>31</label><?label 1?><mixed-citation>
Matarić, M. J., Sukhatme, G. S., and Østergaard, E. H.: Multi-robot
task allocation in uncertain environments, Auton. Robot., 14, 255–263,
2003.</mixed-citation></ref>
      <ref id="bib1.bib32"><label>32</label><?label 1?><mixed-citation>Mustapha, K., McHeick, H., and Mellouli, S.: Modeling and Simulation
Agent-based of Natural Disaster Complex Systems, Procedia Comput. Sci.,
21, 148–155, <ext-link xlink:href="https://doi.org/10.1016/j.procs.2013.09.021" ext-link-type="DOI">10.1016/j.procs.2013.09.021</ext-link>,
2013.</mixed-citation></ref>
      <?pagebreak page3463?><ref id="bib1.bib33"><label>33</label><?label 1?><mixed-citation>Nourjou, R., Hatayama, M., and Tatano, H.: Introduction to spatially
distributed intelligent assistant agents for coordination of human-agent
teams' actions, 2011 IEEE
International Symposium on Safety, Security, and Rescue Robotics (SSRR), Kyoto, Japan, IEEE, 251–258, <ext-link xlink:href="https://doi.org/10.1109/SSRR.2011.6106748" ext-link-type="DOI">10.1109/SSRR.2011.6106748</ext-link>, 2011.</mixed-citation></ref>
      <ref id="bib1.bib34"><label>34</label><?label 1?><mixed-citation>
Olteanu, A., Pop, F., Dobre, C., and Cristea, V.: A dynamic rescheduling
algorithm for resource management in large scale dependable distributed
systems, Comput. Math. Appl., 63, 1409–1423, 2012.</mixed-citation></ref>
      <ref id="bib1.bib35"><label>35</label><?label 1?><mixed-citation>
Quiñonez, Y., Maravall, D., and de Lope, J.: Stochastic learning
automata for self-coordination in heterogeneous multi-tasks selection in
multi-robot systems, Mexican International Conference on Artificial
Intelligence, 443–453, Springer, Berlin Heidelberg, 2011.</mixed-citation></ref>
      <ref id="bib1.bib36"><label>36</label><?label 1?><mixed-citation>
Reis, J. and Mamede, N.: Multi-Agent Dynamic Scheduling and Re-Scheduling
with Global Temporal Constraints, in: Enterprise Information Systems III, Vol. 3,
117–123, Springer, Berlin Heidelberg, 2002.</mixed-citation></ref>
      <ref id="bib1.bib37"><label>37</label><?label 1?><mixed-citation>
Sabar, M., Montreuil, B., and Frayret, J.-M.: An Agent-based Algorithm for
Personnel Scheduling and Rescheduling in Assembly Centers, IFAC Proceedings
Volumes, 42, 1977–1982, 2009.</mixed-citation></ref>
      <ref id="bib1.bib38"><label>38</label><?label 1?><mixed-citation>
Sang, T. X.: Multi-criteria decision making and task allocation in
multi-agent based rescue simulation, Japan Graduate School of Science and
Engineering, Saga University, Japan, 2013.</mixed-citation></ref>
      <ref id="bib1.bib39"><label>39</label><?label 1?><mixed-citation>
Sayadi, M. K., Heydari, M., and Shahanaghi, K.: Extension of VIKOR method
for decision making problem with interval numbers, Appl. Math.
Modell., 33, 2257–2262, 2009.</mixed-citation></ref>
      <ref id="bib1.bib40"><label>40</label><?label 1?><mixed-citation>
Su, X., Zhang, M., and Bai, Q.: Coordination for dynamic weighted task
allocation in disaster environments with time, space and communication
constraints, J. Parallel Distr. Com., 97, 47–56, 2016.</mixed-citation></ref>
      <ref id="bib1.bib41"><label>41</label><?label 1?><mixed-citation>Su, X., Wang, Y., Jia, X., Guo, L., and Ding, Z.: Two Innovative Coalition
Formation Models for Dynamic Task Allocation in Disaster Rescues, J.
Syst. Sci. Syst. Eng., 27, 215–230,
<ext-link xlink:href="https://doi.org/10.1007/s11518-018-5365-9" ext-link-type="DOI">10.1007/s11518-018-5365-9</ext-link>, 2018.
</mixed-citation></ref><?xmltex \hack{\newpage}?>
      <ref id="bib1.bib42"><label>42</label><?label 1?><mixed-citation>
Tan, S. H. and Barton, P. I.: Optimal dynamic allocation of mobile plants to
monetize associated or stranded natural gas, part II: Dealing with
uncertainty, Energy, 96, 461–467, 2016.</mixed-citation></ref>
      <ref id="bib1.bib43"><label>43</label><?label 1?><mixed-citation>Uno, K. and Kashiyama, K.: Development of Simulation System for the Disaster
Evacuation Based on Multi-Agent Model Using GIS, Tsinghua Science &amp;
Technology, 13,  348–353, <ext-link xlink:href="https://doi.org/10.1016/S1007-0214(08)70173-1" ext-link-type="DOI">10.1016/S1007-0214(08)70173-1</ext-link>, 2008.</mixed-citation></ref>
      <ref id="bib1.bib44"><label>44</label><?label 1?><mixed-citation>Vafaeinezhad, A., Alesheikh, A., Hamrah, M., Nourjou, R., and Shad, R.:
Using GIS to Develop an Efficient Spatio-temporal Task Allocation Algorithm
to Human Groups in an Entirely Dynamic Environment Case Study: Earthquake
Rescue Teams, 66–78, <ext-link xlink:href="https://doi.org/10.1007/978-3-642-02454-2_5" ext-link-type="DOI">10.1007/978-3-642-02454-2_5</ext-link>, 2009.</mixed-citation></ref>
      <ref id="bib1.bib45"><label>45</label><?label 1?><mixed-citation>Wang, Y., Luangkesorn, K. L., and Shuman, L.: Modeling emergency medical
response to a mass casualty incident using agent based simulation,
Socio-Econ. Plan. Sci., 46, 281–290, <ext-link xlink:href="https://doi.org/10.1016/j.seps.2012.07.002" ext-link-type="DOI">10.1016/j.seps.2012.07.002</ext-link>, 2012.</mixed-citation></ref>
      <ref id="bib1.bib46"><label>46</label><?label 1?><mixed-citation>Welch, M. C., Kwan, P. W., and Sajeev, A. S. M.: Applying GIS and high
performance agent-based simulation for managing an Old World Screwworm fly
invasion of Australia, Acta Trop., 138,  S82–S93, <ext-link xlink:href="https://doi.org/10.1016/j.actatropica.2014.03.021" ext-link-type="DOI">10.1016/j.actatropica.2014.03.021</ext-link>, 2014.</mixed-citation></ref>
      <ref id="bib1.bib47"><label>47</label><?label 1?><mixed-citation>Xiao, Z., Ma, S., and Zhang, S.: Learning Task Allocation for Multiple Flows
in Multi-Agent Systems,
International Conference on Communication Software and Networks, ICCSN'09, Chengdu, China, IEEE, 153–157, <ext-link xlink:href="https://doi.org/10.1109/ICCSN.2009.28" ext-link-type="DOI">10.1109/ICCSN.2009.28</ext-link>, 2009.</mixed-citation></ref>
      <ref id="bib1.bib48"><label>48</label><?label 1?><mixed-citation>
Zhang, J., Qin, W., Wu, L., and Zhai, W.: Fuzzy neural network-based
rescheduling decision mechanism for semiconductor manufacturing, Comput.
Ind., 65, 1115–1125, 2014.</mixed-citation></ref>

  </ref-list></back>
    <!--<article-title-html>Urban search and rescue (USAR) simulation system: spatial strategies for agent task allocation under uncertain conditions</article-title-html>
<abstract-html/>
<ref-html id="bib1.bib1"><label>1</label><mixed-citation>
Barnum, D. T. and Gleason, J. M.: DEA efficiency analysis involving
multiple production processes, Appl. Econ. Lett., 17, 627–632, 2010.
</mixed-citation></ref-html>
<ref-html id="bib1.bib2"><label>2</label><mixed-citation>
Ben Othman, S., Zgaya, H., Dotoli, M., and Hammadi, S.: An agent-based
Decision Support System for resources' scheduling in Emergency Supply
Chains, Control Eng. Pract., 59, 27–43, <a href="https://doi.org/10.1016/j.conengprac.2016.11.014" target="_blank">https://doi.org/10.1016/j.conengprac.2016.11.014</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib3"><label>3</label><mixed-citation>
Berberian, M. and Yeats, R.: Tehran: An Earthquake Time Bomb, in: Tectonic
Evolution, Collision, and Seismicity of Southwest Asia: In Honor of Manuel
Berberian's Forty-Five Years of Research Contributions, The Geological Society of America, USA, 84,
<a href="https://doi.org/10.1130/2016.2525(04)" target="_blank">https://doi.org/10.1130/2016.2525(04)</a>, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib4"><label>4</label><mixed-citation>
Bertuccelli, L. F., Choi, H.-L., Cho, P., and How, J. P.: Real-time
multi-UAV task assignment in dynamic and uncertain environments, presentado
al AIAA Guidance, Navigation, and Control Conference, Chicago, Illinois, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib5"><label>5</label><mixed-citation>
Cai, B., Huang, S., Liu, D., and Dissanayake, G.: Rescheduling policies for
large-scale task allocation of autonomous straddle carriers under
uncertainty at automated container terminals, Robot. Auton.
Syst., 62, 506–514, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib6"><label>6</label><mixed-citation>
Chen, A. Y., Peña-Mora, F., Plans, A. P., Mehta, S. J., and Aziz, Z.:
Supporting Urban Search and Rescue with digital assessments of structures
and requests of response resources, Adv. Eng. Inform., 26,
833–845, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib7"><label>7</label><mixed-citation>
Chen, J. and Sun, D.: Coalition-based approach to task allocation of
multiple robots with resource constraints, IEEE T. Autom.
Sci. Eng., 9, 516–528, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib8"><label>8</label><mixed-citation>
Cheng, Y.: A knowledge-based airport gate assignment system integrated with
mathematical programming, Comput. Ind. Eng., 32,
837–852, 1997.
</mixed-citation></ref-html>
<ref-html id="bib1.bib9"><label>9</label><mixed-citation>
Choi, H.-L., Brunet, L., and How, J. P.: Consensus-based decentralized
auctions for robust task allocation, IEEE T. Robotics, 25,
912–926, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib10"><label>10</label><mixed-citation>
Crooks, A. T. and Wise, S.: GIS and agent-based models for humanitarian
assistance, Computers, Environment and Urban Systems, 41, 100–111,
<a href="https://doi.org/10.1016/j.compenvurbsys.2013.05.003" target="_blank">https://doi.org/10.1016/j.compenvurbsys.2013.05.003</a>, 2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib11"><label>11</label><mixed-citation>
Dahl, T. S., Matarić, M., and Sukhatme, G. S.: Multi-robot task
allocation through vacancy chain scheduling, Robotics and Autonomous
Systems, 57, 674–687, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib12"><label>12</label><mixed-citation>
Erick, M., Anawat, S., Fumihiko, I., and Shunichi, K.: Agent-based
Simulation of the 2011 Great East Japan Earthquake/Tsunami Evacuation: An
Integrated Model of Tsunami Inundation and Evacuation, Journal of Natural
Disaster Science, 34, 41–57, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib13"><label>13</label><mixed-citation>
Fecht, D., Beale, L., and Briggs, D.: A GIS-based urban simulation model for
environmental health analysis, Environ. Modell. Softw., 58,
1–11, <a href="https://doi.org/10.1016/j.envsoft.2014.03.013" target="_blank">https://doi.org/10.1016/j.envsoft.2014.03.013</a>, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib14"><label>14</label><mixed-citation>
Gokilavani, M., Selvi, S., and Udhayakumar, C.: A survey on resource
allocation and task scheduling algorithms in cloud environment, ISO 9001:
2008 Certified International Journal of Engineering and Innovative
Technology (IJEIT), International Journal of Engineering and Innovative Technology (IJEIT), India, Vol. 3, 2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib15"><label>15</label><mixed-citation>
Grinberger, A. Y. and Felsenstein, D.: Dynamic agent based simulation of
welfare effects of urban disasters, Comput. Environ. Urban, 59, 129–141, <a href="https://doi.org/10.1016/j.compenvurbsys.2016.06.005" target="_blank">https://doi.org/10.1016/j.compenvurbsys.2016.06.005</a>, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib16"><label>16</label><mixed-citation>
Hamzehloo, H., Vaccari, F., and Panza, G. F.: Towards a reliable seismic
microzonation in Tehran, Iran, Eng. Geol., 93, 1–16, <a href="https://doi.org/10.1016/j.enggeo.2007.05.001" target="_blank">https://doi.org/10.1016/j.enggeo.2007.05.001</a>, 2007.
</mixed-citation></ref-html>
<ref-html id="bib1.bib17"><label>17</label><mixed-citation>
Hawe, G. I., Coates, G., Wilson, D. T., and Crouch, R. S.: Agent-based
simulation of emergency response to plan the allocation of resources for a
hypothetical two-site major incident, Eng. Appl. Artif.
Intel., 46, 336–345, <a href="https://doi.org/10.1016/j.engappai.2015.06.023" target="_blank">https://doi.org/10.1016/j.engappai.2015.06.023</a>, 2015.
</mixed-citation></ref-html>
<ref-html id="bib1.bib18"><label>18</label><mixed-citation>
He, Y. H., Pan, M. C., Xu, W., and Zou, Y. B.: Research of Allocation for
Uncertain Task Based on Genetic Algorithm, Adv. Mater. Res.,
324–329, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib19"><label>19</label><mixed-citation>
Hooshangi, N. and Alesheikh, A. A.: Agent-based task allocation under
uncertainties in disaster environments: An approach to interval uncertainty,
Int. J. Disast. Risk Re., 24, 160–171, <a href="https://doi.org/10.1016/j.ijdrr.2017.06.010" target="_blank">https://doi.org/10.1016/j.ijdrr.2017.06.010</a>, 2017.
</mixed-citation></ref-html>
<ref-html id="bib1.bib20"><label>20</label><mixed-citation>
Hooshangi, N. and Alesheikh, A. A.: Developing an Agent-Based Simulation
System for Post-Earthquake Operations in Uncertainty Conditions: A Proposed
Method for Collaboration among Agents, ISPRS Int.
Geo-Inf., 7, 1–22, <a href="https://doi.org/10.3390/ijgi7010027" target="_blank">https://doi.org/10.3390/ijgi7010027</a>, 2018.
</mixed-citation></ref-html>
<ref-html id="bib1.bib21"><label>21</label><mixed-citation>
Hosseini, K. A., Hosseini, M., Jafari, M. K., and Hosseinioon, S.:
Recognition of vulnerable urban fabrics in earthquake zones: a case study of
the Tehran metropolitan area, Journal of Seismology and earthquake
Engineering, 10, 175–187, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib22"><label>22</label><mixed-citation>
Kamranzad, F., Memarian, H., and Zare, M.: Earthquake Risk Assessment for
Tehran, Iran, ISPRS Int.  Geo-Inf., 9, 430,
<a href="https://doi.org/10.3390/ijgi9070430" target="_blank">https://doi.org/10.3390/ijgi9070430</a>, 2020.
</mixed-citation></ref-html>
<ref-html id="bib1.bib23"><label>23</label><mixed-citation>
Kang, H.-S. and Kim, Y.-T.: The physical vulnerability of different types of
building structure to debris flow events, Nat. Hazards, 80, 1475–1493,
2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib24"><label>24</label><mixed-citation>
Kayır, H. H. E. and Parlaktuna, O.: Strategy-planned Q-learning approach
for multi-robot task allocation, Informatics in Control, 2014 11th International Conference on Automation and
Robotics (ICINCO), Vienna, Austria, 410–416, IEEE, USA, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib25"><label>25</label><mixed-citation>
Lan, J. and Peng, Z.: Interval Uncertainty Analysis Using CANDECOMP/PARAFAC
Decomposition, in: Model Validation and Uncertainty Quantification, Volume
3: Proceedings of the 34th IMAC, A Conference and Exposition on Structural
Dynamics 2016, edited by: Atamturktur, S., Schoenherr, T., Moaveni, B., and
Papadimitriou, C., Springer International Publishing, Cham, 73–81,
<a href="https://doi.org/10.1007/978-3-319-29754-5_7" target="_blank">https://doi.org/10.1007/978-3-319-29754-5_7</a>, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib26"><label>26</label><mixed-citation>
Lee, H. and Al-yafi, K.: Centralized versus Market-based Task Allocation in
the Presence of Uncertainty, EKC2009 Symposium Information, EU-Korea, Springer, Berlin Heidelberg, <a href="https://doi.org/10.1007/978-3-642-13624-5" target="_blank">https://doi.org/10.1007/978-3-642-13624-5</a>, 2010.
</mixed-citation></ref-html>
<ref-html id="bib1.bib27"><label>27</label><mixed-citation>
Li, D. and Cruz Jr., J. B.: A robust hierarchical approach to multi-stage
task allocation under uncertainty, 44th IEEE Conference on Decision and Control, 2005 and 2005
European Control Conference, CDC-ECC'05, 3375–3380, 2005.
</mixed-citation></ref-html>
<ref-html id="bib1.bib28"><label>28</label><mixed-citation>
Liu, L. and Shell, D. A.: Assessing optimal assignment under uncertainty: An
interval-based algorithm,  Int. J. Robot. Res.,
30, 936–953, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib29"><label>29</label><mixed-citation>
Liu, L. and Shell, D. A.: Tackling task allocation uncertainty via a
combinatorial method, Safety, 2012
IEEE International Symposium on Security, and Rescue Robotics (SSRR), College Station, TX, USA, IEEE, 1–6, <a href="https://doi.org/10.1109/SSRR.2012.6523871" target="_blank">https://doi.org/10.1109/SSRR.2012.6523871</a>, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib30"><label>30</label><mixed-citation>
Mansouri, B., Hosseini,  A. K., and Nourjou, R.: SEISMIC HUMAN LOSS ESTIMATION
IN TEHRAN USING GIS, 14th World Conference on Earthquake Engineering, October 2008, Beijing, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib31"><label>31</label><mixed-citation>
Matarić, M. J., Sukhatme, G. S., and Østergaard, E. H.: Multi-robot
task allocation in uncertain environments, Auton. Robot., 14, 255–263,
2003.
</mixed-citation></ref-html>
<ref-html id="bib1.bib32"><label>32</label><mixed-citation>
Mustapha, K., McHeick, H., and Mellouli, S.: Modeling and Simulation
Agent-based of Natural Disaster Complex Systems, Procedia Comput. Sci.,
21, 148–155, <a href="https://doi.org/10.1016/j.procs.2013.09.021" target="_blank">https://doi.org/10.1016/j.procs.2013.09.021</a>,
2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib33"><label>33</label><mixed-citation>
Nourjou, R., Hatayama, M., and Tatano, H.: Introduction to spatially
distributed intelligent assistant agents for coordination of human-agent
teams' actions, 2011 IEEE
International Symposium on Safety, Security, and Rescue Robotics (SSRR), Kyoto, Japan, IEEE, 251–258, <a href="https://doi.org/10.1109/SSRR.2011.6106748" target="_blank">https://doi.org/10.1109/SSRR.2011.6106748</a>, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib34"><label>34</label><mixed-citation>
Olteanu, A., Pop, F., Dobre, C., and Cristea, V.: A dynamic rescheduling
algorithm for resource management in large scale dependable distributed
systems, Comput. Math. Appl., 63, 1409–1423, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib35"><label>35</label><mixed-citation>
Quiñonez, Y., Maravall, D., and de Lope, J.: Stochastic learning
automata for self-coordination in heterogeneous multi-tasks selection in
multi-robot systems, Mexican International Conference on Artificial
Intelligence, 443–453, Springer, Berlin Heidelberg, 2011.
</mixed-citation></ref-html>
<ref-html id="bib1.bib36"><label>36</label><mixed-citation>
Reis, J. and Mamede, N.: Multi-Agent Dynamic Scheduling and Re-Scheduling
with Global Temporal Constraints, in: Enterprise Information Systems III, Vol. 3,
117–123, Springer, Berlin Heidelberg, 2002.
</mixed-citation></ref-html>
<ref-html id="bib1.bib37"><label>37</label><mixed-citation>
Sabar, M., Montreuil, B., and Frayret, J.-M.: An Agent-based Algorithm for
Personnel Scheduling and Rescheduling in Assembly Centers, IFAC Proceedings
Volumes, 42, 1977–1982, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib38"><label>38</label><mixed-citation>
Sang, T. X.: Multi-criteria decision making and task allocation in
multi-agent based rescue simulation, Japan Graduate School of Science and
Engineering, Saga University, Japan, 2013.
</mixed-citation></ref-html>
<ref-html id="bib1.bib39"><label>39</label><mixed-citation>
Sayadi, M. K., Heydari, M., and Shahanaghi, K.: Extension of VIKOR method
for decision making problem with interval numbers, Appl. Math.
Modell., 33, 2257–2262, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib40"><label>40</label><mixed-citation>
Su, X., Zhang, M., and Bai, Q.: Coordination for dynamic weighted task
allocation in disaster environments with time, space and communication
constraints, J. Parallel Distr. Com., 97, 47–56, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib41"><label>41</label><mixed-citation>
Su, X., Wang, Y., Jia, X., Guo, L., and Ding, Z.: Two Innovative Coalition
Formation Models for Dynamic Task Allocation in Disaster Rescues, J.
Syst. Sci. Syst. Eng., 27, 215–230,
<a href="https://doi.org/10.1007/s11518-018-5365-9" target="_blank">https://doi.org/10.1007/s11518-018-5365-9</a>, 2018.

</mixed-citation></ref-html>
<ref-html id="bib1.bib42"><label>42</label><mixed-citation>
Tan, S. H. and Barton, P. I.: Optimal dynamic allocation of mobile plants to
monetize associated or stranded natural gas, part II: Dealing with
uncertainty, Energy, 96, 461–467, 2016.
</mixed-citation></ref-html>
<ref-html id="bib1.bib43"><label>43</label><mixed-citation>
Uno, K. and Kashiyama, K.: Development of Simulation System for the Disaster
Evacuation Based on Multi-Agent Model Using GIS, Tsinghua Science &amp;
Technology, 13,  348–353, <a href="https://doi.org/10.1016/S1007-0214(08)70173-1" target="_blank">https://doi.org/10.1016/S1007-0214(08)70173-1</a>, 2008.
</mixed-citation></ref-html>
<ref-html id="bib1.bib44"><label>44</label><mixed-citation>
Vafaeinezhad, A., Alesheikh, A., Hamrah, M., Nourjou, R., and Shad, R.:
Using GIS to Develop an Efficient Spatio-temporal Task Allocation Algorithm
to Human Groups in an Entirely Dynamic Environment Case Study: Earthquake
Rescue Teams, 66–78, <a href="https://doi.org/10.1007/978-3-642-02454-2_5" target="_blank">https://doi.org/10.1007/978-3-642-02454-2_5</a>, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib45"><label>45</label><mixed-citation>
Wang, Y., Luangkesorn, K. L., and Shuman, L.: Modeling emergency medical
response to a mass casualty incident using agent based simulation,
Socio-Econ. Plan. Sci., 46, 281–290, <a href="https://doi.org/10.1016/j.seps.2012.07.002" target="_blank">https://doi.org/10.1016/j.seps.2012.07.002</a>, 2012.
</mixed-citation></ref-html>
<ref-html id="bib1.bib46"><label>46</label><mixed-citation>
Welch, M. C., Kwan, P. W., and Sajeev, A. S. M.: Applying GIS and high
performance agent-based simulation for managing an Old World Screwworm fly
invasion of Australia, Acta Trop., 138,  S82–S93, <a href="https://doi.org/10.1016/j.actatropica.2014.03.021" target="_blank">https://doi.org/10.1016/j.actatropica.2014.03.021</a>, 2014.
</mixed-citation></ref-html>
<ref-html id="bib1.bib47"><label>47</label><mixed-citation>
Xiao, Z., Ma, S., and Zhang, S.: Learning Task Allocation for Multiple Flows
in Multi-Agent Systems,
International Conference on Communication Software and Networks, ICCSN'09, Chengdu, China, IEEE, 153–157, <a href="https://doi.org/10.1109/ICCSN.2009.28" target="_blank">https://doi.org/10.1109/ICCSN.2009.28</a>, 2009.
</mixed-citation></ref-html>
<ref-html id="bib1.bib48"><label>48</label><mixed-citation>
Zhang, J., Qin, W., Wu, L., and Zhai, W.: Fuzzy neural network-based
rescheduling decision mechanism for semiconductor manufacturing, Comput.
Ind., 65, 1115–1125, 2014.
</mixed-citation></ref-html>--></article>
