<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Remote Sens.</journal-id>
<journal-title>Frontiers in Remote Sensing</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Remote Sens.</abbrev-journal-title>
<issn pub-type="epub">2673-6187</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1351703</article-id>
<article-id pub-id-type="doi">10.3389/frsen.2024.1351703</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Remote Sensing</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Secure learning-based coordinated UAV&#x2013;UGV framework design for medical waste transportation</article-title>
<alt-title alt-title-type="left-running-head">Sharma and Lin</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/frsen.2024.1351703">10.3389/frsen.2024.1351703</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Sharma</surname>
<given-names>Desh Deepak</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1824821/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Lin</surname>
<given-names>Jeremy</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Department of Electrical Engineering</institution>, <institution>MJP Rphilkhand University</institution>, <addr-line>Bareilly</addr-line>, <country>India</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>John Hopkins University</institution>, <addr-line>Baltimore</addr-line>, <addr-line>MD</addr-line>, <country>United States</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/597227/overview">Salvatore Manfreda</ext-link>, University of Naples Federico II, Italy</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1760076/overview">Tien Anh Tran</ext-link>, Seoul National University, Republic of Korea</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2605408/overview">Deepak Prashar</ext-link>, Lovely Professional University, India</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Desh Deepak Sharma, <email>desh.sharma@mjpru.ac.in</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>15</day>
<month>03</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>5</volume>
<elocation-id>1351703</elocation-id>
<history>
<date date-type="received">
<day>06</day>
<month>12</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>14</day>
<month>02</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2024 Sharma and Lin.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Sharma and Lin</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>A cost-effective solution with less human involvement must be developed for medical waste (MW) transportation. A learning-based coordinated unmanned aerial vehicle&#x2013;unmanned ground vehicle (UAV&#x2013;UGV) (CUU) framework, currently unavoidable use, with a transfer learning algorithm is suggested. A transfer learning algorithm is implemented for collision-free optimal path planning. In the framework, mobile ground robots collect medical waste from waste disposal centers through the pick-and-place technique. Then, networked drones lift the collected medical waste and fly through a predefined optimal trajectory. The framework considers the dynamic behavior of the environment and explores the actions for picking, placing, and dropping medical waste. A deep reinforcement learning mechanism has been incorporated for each successful or unsuccessful action by the framework to provide the rewards. With optimal policies, the coordinated UAV and UGV change their actions in dynamic conditions. An optimal cost of transportation of medical waste by the proposed framework is created by considering the weight of MW packets as the payload capacity of a CUU framework, the cost of steering the UAV and UGV, and the time required to transport the MW. The effectiveness of the CUU framework for MW transportation has been tested using MATLAB. The MW transportation data have been encrypted using an encryption key for security and authenticity.</p>
</abstract>
<kwd-group>
<kwd>medical waste</kwd>
<kwd>reinforcement learning</kwd>
<kwd>transfer learning</kwd>
<kwd>unmanned aerial vehicle</kwd>
<kwd>unmanned ground vehicle</kwd>
</kwd-group>
<contract-sponsor id="cn001">Council of Science and Technology, U.P.<named-content content-type="fundref-id">10.13039/501100008758</named-content>
</contract-sponsor>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Unoccupied Aerial Systems (UASs and UAVs)</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>In recent years, the amount of medical waste has increased due to increased numbers of unmanned aerial vehicle healthcare centers. These centers produce a large amount of medical waste. The congestion in cities creates problems in the transportation of medical waste. Much medical waste is disposed of using ordinary and contemporary methods, including incineration, steam sterilization, microwave, and landfill disposal (<xref ref-type="bibr" rid="B11">Mishra et al., 2020</xref>). The medical wastes include hypodermic needles, hypodermic needles with attached syringes, and needles with attached tubing, blades, broken glass, acupuncture needles, and pipettes, some contaminated with biohazardous or pharmaceutical material. These are generated from most patient care and clinical support areas. The healthcare industry is increasing rapidly, so an effective solution must be developed for the transportation of medical waste to the disposal centers with less human contact. Improved education and standards must be defined for adequate medical waste management (<xref ref-type="bibr" rid="B20">Windfeld and Brooks, 2015</xref>). Much planning and logistics work must be done to manage medical waste efficiently in hospital systems.</p>
<p>A peer-to-peer scheme could be created for hazardous medical waste treatment to avoid illegal usage in medical waste treatment. Inadequate management of medical waste in healthcare centers creates health issues for employers of these centers and draws global attention. Due to storage capacity limitations at medical centers, collection services should occur at regular intervals. A periodic and minimum route scheme must be developed to collect medical waste from dispersed hospitals. The major process of medical waste management is segregation, labeling, and separation (<xref ref-type="bibr" rid="B12">Shareefdeen et al., 2022</xref>).</p>
<p>Medical waste management comprises the process of separation, short-term storage, safe disposal, and transfer of medical waste. Standards for medical waste management must be defined. The cost that may be incurred in medical waste transportation should be defined, and new schemes must be developed to minimize this cost (<xref ref-type="bibr" rid="B8">Ko&#xe7;ak et al., 2016</xref>).</p>
<p>A hybrid decision-making approach comprising interval 2-tuple induced distance operators with similarity to the ideal solution (TOPSIS) has been suggested to tackle the healthcare treatment. A trash system equipped with a camera and quick response (QR) code was created for medical waste management to address the uncertainty and diversity noted in the assessment report (<xref ref-type="bibr" rid="B10">Lu et al., 2016</xref>). In that study, artificial intelligence techniques were implemented in the classification of medical wastes that have different features. The molecular structure of the wastes was to be analyzed with a spectrum analyzer.</p>
<p>Major problems associated with hazardous medical waste management are inadequate and unstandardized supervision. Current methods of detecting hidden dangers in hazardous waste disposal are inefficient. Implementing fifth-generation (5G) wireless communication technology and big data in the medical waste treatment process is challenging. A platform comprising 5G broadband wireless communication technology and a big data approach is developed for an effective point-to-point (P2P) goods information system (<xref ref-type="bibr" rid="B17">Wang and Nai, 2021</xref>).</p>
<p>Radio frequency identification (RFID) technology has been implemented in medical waste management for item collection and transmission without manual intervention. The RFID technology can perform object recognition, multi-object recognition, and object tracking [8]. Existing healthcare waste treatment methods are steam sterilization, microwave, plasma pyrolysis, chemical disinfection, and incineration (<xref ref-type="bibr" rid="B9">Liu et al., 2019</xref>). RFID can be used to detect lost medical waste items and prevent illegal recycling and poor supervision. The RFID technology can be used to establish a tracking and processing system, incineration center subsystems, and effective supervision of medical waste (<xref ref-type="bibr" rid="B13">Sun et al., 2019</xref>; <xref ref-type="bibr" rid="B14">Wang et al., 2021</xref>). The interaction rules are designed for medical waste management. Blockchain-based methods are suggested for medical waste disposal to create trust among different stakeholders (<xref ref-type="bibr" rid="B1">Ahmad et al., 2021</xref>). Multi-criteria decision-making methodology has been implemented. The associated uncertainty present in multi-criterion decision-making is tackled by the Pythagorean fuzzy sets.</p>
<p>The process of medical waste management comprises medical waste generation from hospitals and testing centers, waste collection at waste store rooms, waste transportation, waste segregation and sorting, waste treatment, and waste disposal and recycling (<xref ref-type="bibr" rid="B1">Ahmad et al., 2021</xref>). A blockchain-based process is implemented to trace the medical equipment and corresponding medical waste. The main stockholders in medical waste management are doctors, medical test operators, patients, health workers, and waste collection, transportation, and disposal companies.</p>
<p>A literature review revealed the limited use of drones in the transfer of medical waste. A collection problem could be considered to obtain an optimal trajectory. Manual collection of waste from collection points may cause health problems for employees. A coordinated multi-drone mobile robot framework could collect medical waste and transfer it to disposal centers with minimum human intervention.</p>
<sec id="s1-1">
<title>1.1 Research gap</title>
<p>Identifying research gaps is crucial for advancing knowledge in any field. In the context of medical waste transportation, the following potential research gaps could be explored:<list list-type="simple">
<list-item>
<p>&#x2022; Efficiency and optimization: Explore methods to optimize medical waste transportation routes to minimize costs and reduce environmental impact. Consider factors such as fuel efficiency, vehicle capacity utilization, and scheduling.</p>
</list-item>
<list-item>
<p>&#x2022; Technological innovations: Investigate the integration of emerging technologies (such as IoT, RFID, or GPS tracking) to enhance the efficiency and tracking capabilities of medical waste transportation. Evaluate how these technologies can improve real-time monitoring, route planning, and overall logistics.</p>
</list-item>
</list>
</p>
<p>The article is organized as follows: <xref ref-type="sec" rid="s1">Section 1</xref> provides the introduction. <xref ref-type="sec" rid="s2">Section 2</xref> discusses the occupational and transportation risks in medical waste transportation. <xref ref-type="sec" rid="s3">Section 3</xref> overviews a coordinated unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) framework, and <xref ref-type="sec" rid="s4">Section 4</xref> discusses the application of a UAV and UGV framework in medical waste transportation. <xref ref-type="sec" rid="s5">Section 5</xref> discusses secure medical waste data. <xref ref-type="sec" rid="s6">Section 6</xref> includes problem formulation with a proposed currently unavoidable use (CUU) framework for medical waste transportation. <xref ref-type="sec" rid="s7">Section 7</xref> suggests a transfer learning mechanism for MW transportation. <xref ref-type="sec" rid="s8">Section 8</xref> includes the reinforcement learning mechanism for the framework. Simulation and discussions are covered in <xref ref-type="sec" rid="s9">Section 9</xref>. <xref ref-type="sec" rid="s10">Section 10</xref> provided the conclusion.</p>
</sec>
</sec>
<sec id="s2">
<title>2 Occupational and transportation risks in medical waste</title>
<p>In the context of medical waste management, occupational risk and transportation risk take on specific considerations due to the unique nature of medical waste. Medical waste includes materials generated in healthcare facilities that may threaten human health and the environment if not handled properly. The following sections discuss how occupational and transportation risks relate to medical waste.</p>
<sec id="s2-1">
<title>2.1 Occupational risks in medical waste management</title>
<sec id="s2-1-1">
<title>2.1.1 Exposure to infectious agents</title>
<p>Exposure to infectious agents: Healthcare workers involved in the collection, handling, and disposal of medical waste are at risk of exposure to infectious agents, such as bacteria, viruses, and other pathogens.</p>
</sec>
<sec id="s2-1-2">
<title>2.1.2 Needlestick injuries</title>
<p>Improper disposal of sharps, such as needles and syringes, can lead to needlestick injuries, posing a risk of infection and other health issues.</p>
</sec>
<sec id="s2-1-3">
<title>2.1.3 Chemical exposure</title>
<p>Some medical waste may contain hazardous chemicals or pharmaceuticals, exposing workers to potential health hazards if not managed properly.</p>
</sec>
<sec id="s2-1-4">
<title>2.1.4 Heavy lifting and ergonomic hazards</title>
<p>Workers involved in lifting and moving heavy containers of medical waste may face ergonomic risks, leading to musculoskeletal issues. Occupational safety measures in medical waste management include the use of personal protective equipment (PPE), proper training, safe handling protocols, and the implementation of engineering controls to minimize exposure.</p>
</sec>
</sec>
<sec id="s2-2">
<title>2.2 Transportation risks in medical waste management</title>
<sec id="s2-2-1">
<title>2.2.1 Accidental spills and leaks</title>
<p>During transportation, medical waste containers may be at risk of spills or leaks, especially if not securely sealed. This can lead to contamination and exposure risks for transport personnel and the general public.</p>
</sec>
<sec id="s2-2-2">
<title>2.2.2 Inadequate packaging</title>
<p>Improperly packaging medical waste during transportation can lead to breakage, spillage, or damage to containers, increasing the risk of exposure to infectious agents.</p>
</sec>
<sec id="s2-2-3">
<title>2.2.3 Traffic accidents</title>
<p>Transportation accidents can result in the release of medical waste into the environment, creating potential hazards for first responders and others involved in the cleanup.</p>
</sec>
<sec id="s2-2-4">
<title>2.2.4 Regulatory compliance</title>
<p>Failure to comply with transportation regulations for medical waste can lead to legal consequences and increased risks. Transportation safety measures involve proper packaging, labeling, and securing of medical waste during transit. Compliance with transportation regulations, including those related to hazardous materials, is crucial to mitigating risks.</p>
</sec>
<sec id="s2-2-5">
<title>2.2.5 Integrated approach</title>
<p>Medical facilities and waste management companies must adopt an integrated approach to occupational safety and transportation risk management. Comprehensive training programs for healthcare workers and transport personnel are essential to ensure awareness of risks and proper handling procedures. Regular inspections, maintenance of transport vehicles, and adherence to relevant regulations contribute to minimizing risks associated with the transportation of medical waste. By addressing both occupational and transportation risks in medical waste management, organizations can promote the safety of their workers, protect public health, and prevent environmental contamination.</p>
</sec>
</sec>
</sec>
<sec id="s3">
<title>3 Coordinated UAV and UGV framework: an overview</title>
<p>Coordination between unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) is essential for the successful implementation of various applications, ranging from surveillance and reconnaissance to disaster response and agriculture. Key aspects of UAV&#x2013;UGV coordination are discussed in the sections that follow.</p>
<sec id="s3-1">
<title>3.1 Inter vehicle communication</title>
<p>UAVs and UGVs must be equipped with communication systems to exchange real-time information. This can include data on the environment, mission status, and obstacles.</p>
</sec>
<sec id="s3-2">
<title>3.2 Command and control</title>
<p>A robust command and control (C2) system enables seamless communication between the UAV operator, the UGV operator, and the vehicles themselves. This facilitates coordination in mission planning and execution.</p>
</sec>
<sec id="s3-3">
<title>3.3 Collaborative mission planning</title>
<sec id="s3-3-1">
<title>3.3.1 Shared objectives</title>
<p>UAVs and UGVs must have shared mission objectives. Collaborative planning involves defining roles, tasks, and responsibilities for each vehicle based on its capabilities.</p>
</sec>
<sec id="s3-3-2">
<title>3.3.2 Adaptive planning</title>
<p>Adapting the mission plan in response to changing conditions or unexpected events is crucial. Both vehicles should be capable of receiving and executing updated mission parameters.</p>
</sec>
</sec>
<sec id="s3-4">
<title>3.4 Sensing and perception</title>
<sec id="s3-4-1">
<title>3.4.1 Sensor fusion</title>
<p>Combining data from various sensors on both UAVs and UGVs enhances the overall perception of the environment. This can include visual cameras, lidar, radar, and other sensors.</p>
</sec>
<sec id="s3-4-2">
<title>3.4.2 Obstacle avoidance</title>
<p>Vehicles should be equipped with obstacle detection and avoidance systems to navigate through complex environments without collisions.</p>
</sec>
</sec>
<sec id="s3-5">
<title>3.5 Localization and mapping</title>
<sec id="s3-5-1">
<title>3.5.1 Shared maps</title>
<p>UAVs and UGVs should share a common map of the environment. This allows each vehicle to understand the other&#x2019;s position, helping in collaborative decision-making.</p>
</sec>
<sec id="s3-5-2">
<title>3.5.2 Simultaneous localization and mapping</title>
<p>Advanced localization techniques, such as simultaneous localization and mapping (SLAM), enable the vehicles to map their surroundings in real time and localize themselves within the shared map.</p>
</sec>
<sec id="s3-5-3">
<title>3.5.3 Swarm intelligence</title>
<p>Coordination can benefit from principles of swarm intelligence, where multiple vehicles work together in a decentralized manner. This enables flexibility, scalability, and resilience in dynamic environments.</p>
</sec>
<sec id="s3-5-4">
<title>3.5.4 Dynamic formation control</title>
<p>UAVs and UGVs can coordinate their movements to maintain a specific formation, adapting to changes in the environment or mission requirements.</p>
</sec>
</sec>
<sec id="s3-6">
<title>3.6 Data fusion and sharing</title>
<sec id="s3-6-1">
<title>3.6.1 Data integration</title>
<p>Combining data collected by both UAVs and UGVs enhances overall situational awareness. Integrated data can be valuable for decision-making.</p>
</sec>
<sec id="s3-6-2">
<title>3.6.2 Real-time data sharing</title>
<p>Establishing a reliable data sharing mechanism ensures that information collected by one vehicle is quickly transmitted to others, facilitating coordinated response.</p>
</sec>
<sec id="s3-6-3">
<title>3.6.3 Redundancy and fault tolerance</title>
<sec id="s3-6-3-1">
<title>3.6.3.1 Redundant systems</title>
<p>To enhance reliability, both UAVs and UGVs should have redundant systems. In case of a failure in one vehicle, the others can compensate and continue the mission.</p>
</sec>
</sec>
<sec id="s3-6-4">
<title>3.6.4 Fault tolerance</title>
<p>The coordination system should be designed to handle faults gracefully, allowing the vehicles to adapt and continue functioning even in the presence of failures. Effective UAV&#x2013;UGV coordination enhances the capabilities of autonomous systems, making them more versatile and adaptable to a variety of applications. This coordination is particularly valuable in scenarios where a combination of aerial and ground-based perspectives is required for comprehensive information gathering and mission execution.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<title>4 UAV and UGV in medical waste transportation</title>
<p>Within a healthcare facility, regulated storing and transporting of medical waste strategies must be created. Safe transport and storage facilities ensure health and environmental safety. The medical waste disposal containers are classified based on color: red for biohazardous or sharp waste, yellow for chemotherapy waste and soiled and contaminated linen, black for Resource Conservation and Recovery Act (RCRA)-regulated waste, and blue for non-RCRA-regulated waste. Challenges accompany the handling of medical waste because it has impacts on the environment and risks to public health. <xref ref-type="fig" rid="F1">Figure 1</xref> shows some of these challenges and impacts.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Challenges associated with the transportation of medical waste.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g001.tif"/>
</fig>
<p>Drones are revolutionizing medical waste transportation. A coordinated robot drone framework minimizes the transportation and occupational risks concerning the temporary storage of hazardous wastes at the medical centers, as shown in <xref ref-type="fig" rid="F2">Figure 2</xref>. The framework minimizes the risks associated with the transportation of potentially dangerous microorganisms. The framework collects and transports infectious waste from scattered collection points to disposal centers.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Risks minimization with the CUU framework.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g002.tif"/>
</fig>
<p>The flying operating time of drones is restricted by payload weight and battery capacity. Turbulence is also a hindrance. The latency-guaranteed multi-hop wireless communication system is considered for the flight of a drone moving from the line of sight (LOS) to beyond the line of sight (BLOS) with an obstacle avoidance facility. The obstacles may be trees, buildings, small hills, <italic>etc.</italic> The drone control mechanism comprises a multi-hop link or direct link to obtain the adaptive flying route (<xref ref-type="bibr" rid="B7">Kagawa et al., 2017</xref>).</p>
</sec>
<sec id="s5">
<title>5 Secure medical waste data</title>
<p>Efficient MW management must be developed to avoid dangerous microorganisms that affect public health and the environment. During the treatment and disposal of medical waste, pathogens, and toxins are released. It is mandatory to develop an optimal logistical solution for medical waste transportation to minimize contact with operators and health workers. Relevant data include optimal and secure MW transportation solution suggests the MW data structure as weight of the waste, the time of waste pickup, sensor state data, and order status.</p>
<p>
<italic>Rq</italic>
<sub>
<italic>mw</italic>
</sub>: Medical waste shipment request.</p>
<p>
<italic>T</italic>
<sub>
<italic>p</italic>
</sub>: Waste pickup time.</p>
<p>
<italic>T</italic>
<sub>
<italic>d</italic>
</sub>: Waste disposal time.</p>
<p>
<italic>W</italic>
<sub>
<italic>mw</italic>
</sub>: Weight of the waste.</p>
<p>
<italic>Id</italic>
<sub>
<italic>mw</italic>
</sub>: ID of medical waste (created with Secure Hash Algorithm (SHA)-256).</p>
<p>
<italic>Au</italic>
<sub>
<italic>mw</italic>
</sub>: Medical waste authorization.</p>
<p>
<italic>O</italic>
<sub>
<italic>mw</italic>
</sub>: Location of medical waste.</p>
<p>
<italic>Q</italic>
<sub>
<italic>k</italic>
</sub> &#x3d; { <italic>Rq</italic>
<sub>
<italic>k</italic>,<italic>mw</italic>
</sub>, <italic>T</italic>
<sub>
<italic>k</italic>,<italic>p</italic>
</sub>, <italic>T</italic>
<sub>
<italic>k</italic>,<italic>d</italic>
</sub>, <italic>W</italic>
<sub>
<italic>k</italic>,<italic>mw</italic>
</sub>, <italic>Id</italic>
<sub>
<italic>k</italic>,<italic>mw</italic>
</sub>, <italic>Au</italic>
<sub>
<italic>k</italic>,<italic>mw</italic>
</sub>, <italic>O</italic>
<sub>
<italic>k</italic>,<italic>mw</italic>
</sub>}.</p>
<sec id="s5-1">
<title>5.1 Hash key with SHA-256</title>
<p>In the context of hash functions, a &#x201c;hash key&#x201d; usually refers to the input (or key) provided to a hash function to generate a hash value. A hash function takes an input (or key) and produces a fixed-size string of characters, which is typically a hash code. SHA-256-bit is a cryptographic hash function that belongs to the SHA-2 family of hash functions. It produces a fixed-size output of 256 bits (32 bytes) and is commonly used for various security applications and protocols.</p>
</sec>
<sec id="s5-2">
<title>5.2 Proposed MW shipment process</title>
<p>A medical waste shipment process with the following steps has been suggested:</p>
<p>Input: Medical waste data</p>
<p>Create: Medical waste shipment request</p>
<p>Set: <italic>Rq</italic>
<sub>
<italic>mw</italic>
</sub> &#x3d; 1</p>
<p>Load: Pick up MW packet by CUU framework</p>
<p>Time: Generate the timestamp of MW pickup</p>
<p>Carry: Ship the MW packet to a disposal center</p>
<p>Time: Generate the timestamp of MW disposal</p>
<p>Set: <italic>Au</italic>
<sub>
<italic>mw</italic>
</sub> &#x3d; 1 after authorization</p>
<p>Encrypt: Do encrypt <italic>Q</italic>
<sub>
<italic>k</italic>
</sub> with a secure key</p>
<p>Output: Encrypted <italic>Q</italic>
<sub>
<italic>k</italic>
</sub>.</p>
</sec>
</sec>
<sec id="s6">
<title>6 Proposed CUU framework for medical waste transportation</title>
<p>After it is collected from health centers, medical waste must be transported to the transit points. From transit points, the CUU framework comprising UGVs and multiple UAVs collects the medical wastes and transports them to the disposal centers <xref ref-type="fig" rid="F3">Figure 3</xref>. The whole &#x201c;seek&#x201d; area is divided into subareas. Each subarea is assigned to a different drone. The flight time of each drone is estimated according to the charging of the battery. The control center acquires the drones&#x2019; real-time data, such as battery information, coordinates, and sensor data. The seek area is divided into the <italic>n</italic> unit cube parts with 1-m dimension. The WiFi communication zone comprises <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> parts that are within the control range (<xref ref-type="bibr" rid="B3">Celtek et al., 2018</xref>).</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>CUU framework for medical waste transportation.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g003.tif"/>
</fig>
<sec id="s6-1">
<title>6.1 Problem formulation</title>
<p>An appropriate framework must be designed for the robot drone MW transportation system. One such framework is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>. Generally, drones have limited hovering time because of the battery capacity. The costs associated with the total distances are minimized. In this framework, a MW robot drone accomplishes the assigned tasks of MW transportation. The coordinated UGV&#x2013;UAV MW transport problem is formulated as shown below:<disp-formula id="e1">
<mml:math id="m2">
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>Z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:msubsup>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>C</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">ugv</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>H</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>H</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">uav</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
</mml:math>
<label>(1)</label>
</disp-formula>where <italic>T</italic>
<sub>
<italic>mr</italic>
</sub> and <italic>T</italic>
<sub>
<italic>dr</italic>
</sub> are the time of transportation of medical waste taken by a mobile robot and a drone, respectively. <italic>C</italic>
<sub>
<italic>mr</italic>
</sub> and <italic>C</italic>
<sub>
<italic>dr</italic>
</sub> are the cost per unit weight incurred in transportation of medical waste by a mobile robot and a drone, respectively. <italic>a</italic>
<sub>
<italic>mr</italic>
</sub>, <italic>a</italic>
<sub>
<italic>dr</italic>
</sub>, <italic>a</italic>
<sub>
<italic>L</italic>
</sub>, and <italic>a</italic>
<sub>
<italic>H</italic>
</sub> are the scaling factors. The <inline-formula id="inf2">
<mml:math id="m3">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mspace width="0.3333em"/>
<mml:mspace width="0.3333em"/>
</mml:math>
</inline-formula> and <inline-formula id="inf3">
<mml:math id="m4">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> are weights of the medical waste that are being carried by a mobile robot and a drone, respectively. The maximum waste transportation capacities of a mobile ground robot and an independent drone are <inline-formula id="inf4">
<mml:math id="m5">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mspace width="0.3333em"/>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> and <inline-formula id="inf5">
<mml:math id="m6">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>, respectively. <italic>L</italic>
<sub>
<italic>ugv</italic>
</sub> and <italic>H</italic>
<sub>
<italic>uav</italic>
</sub> are the costs of UGV steering and UAV steering, respectively, and these are defined in the subsequent section.</p>
<p>Let <italic>dc</italic>
<sub>
<italic>mw</italic>
</sub> &#x3d; {<italic>O</italic>
<sub>1,<italic>mw</italic>
</sub>, <italic>O</italic>
<sub>2,<italic>mw</italic>
</sub>, , <italic>O</italic>
<sub>
<italic>m</italic>,<italic>mw</italic>
</sub> } represent the set of all medical waste disposal centers and all the nodes in the network, where <inline-formula id="inf6">
<mml:math id="m7">
<mml:msub>
<mml:mrow>
<mml:mi>O</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, and <inline-formula id="inf7">
<mml:math id="m8">
<mml:msubsup>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> are the distances of medical waste disposal centers <italic>k</italic> from the transit point <italic>p</italic>. <italic>l</italic>
<sub>
<italic>tr</italic>
</sub> &#x3d; { <italic>l</italic>
<sub>
<italic>tr</italic>.1</sub>,&#x2026; <italic>l</italic>
<sub>
<italic>tr</italic>. <italic>p</italic>
</sub> } be the set of transit points (TPs) that are to be visited by a truck for medical waste collection and disposal. Let <inline-formula id="inf8">
<mml:math id="m9">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">{</mml:mo>
<mml:mrow>
<mml:mspace width="0.3333em"/>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mspace width="0.3333em"/>
<mml:mspace width="0.3333em"/>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>.</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mspace width="0.3333em"/>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mspace width="0.3333em"/>
</mml:mrow>
<mml:mo stretchy="false">}</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> be the weight of MW packets, where <inline-formula id="inf9">
<mml:math id="m10">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> represents the weight of the first MW packet to be carried by a drone. The speed of the mobile robot and the independent drone are denoted as <italic>v</italic>
<sub>
<italic>mr</italic>
</sub> and <italic>v</italic>
<sub>
<italic>dr</italic>
</sub>, respectively (<xref ref-type="bibr" rid="B3">Celtek et al., 2018</xref>).</p>
<p>According to battery capacity (state of charge, SoC) and payload capacity W) of the independent drone, the predicted route of UAV is denoted as <inline-formula id="inf10">
<mml:math id="m11">
<mml:mi>R</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, and the predicted route of UGV is denoted as <inline-formula id="inf11">
<mml:math id="m12">
<mml:mi>R</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>.</p>
<p>The predicted routes of the mobile robot and the drone comprise the set of nodes and are defined as shown below:<disp-formula id="e2">
<mml:math id="m13">
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="script">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">n</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
</mml:math>
<label>(2)</label>
</disp-formula>
<disp-formula id="e3">
<mml:math id="m14">
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="script">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">n</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
</mml:math>
<label>(3)</label>
</disp-formula>where <inline-formula id="inf12">
<mml:math id="m15">
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="script">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="bold-italic">n</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> is the set of the cube in the travel space of the CUU framework; <italic>d</italic>
<sub>
<italic>i</italic>&#x2b;1</sub> and <italic>d</italic>
<sub>
<italic>i</italic>
</sub> are the centers of the cube <italic>i</italic> &#x2b; 1 and cube <italic>i</italic> in the ground space and the flying airspace of the CUU framework, respectively. Thus, the total route length of the MW transportation is <italic>R</italic>
<sub>
<italic>mw</italic>
</sub> &#x3d; {<italic>R</italic>
<sub>
<italic>mr</italic>
</sub> &#x2b; <italic>R</italic>
<sub>
<italic>dr</italic>
</sub>}. The times taken by the mobile robot (<italic>T</italic>
<sub>
<italic>mr</italic>
</sub>) and drone (<italic>T</italic>
<sub>
<italic>dr</italic>
</sub>) in medical waste transportation are shown below:<disp-formula id="e4">
<mml:math id="m16">
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:math>
<label>(4)</label>
</disp-formula>
<disp-formula id="e5">
<mml:math id="m17">
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:math>
<label>(5)</label>
</disp-formula>where <italic>v</italic>
<sub>
<italic>dr</italic>
</sub> is the average velocity of drone and <italic>v</italic>
<sub>
<italic>mr</italic>
</sub> is the average velocity of a mobile robot (<xref ref-type="bibr" rid="B15">Wang et al., 2019</xref>).</p>
</sec>
<sec id="s6-2">
<title>6.2 Proposed learning-based coordinated UAV and UGV framework</title>
<p>Drone path planning considers the zones at different altitudes with a total n number of waypoints <inline-formula id="inf13">
<mml:math id="m18">
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf14">
<mml:math id="m19">
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is the set of nodes to be traveled by UGV. Each waypoint and node is defined by the 3D coordinates <italic>d</italic>
<sub>
<italic>i</italic>
</sub> &#x3d; (<italic>x</italic>
<sub>
<italic>i</italic>
</sub>, <italic>y</italic>
<sub>
<italic>i</italic>
</sub>, <italic>z</italic>
<sub>
<italic>i</italic>
</sub>), <italic>i</italic> &#x3d; 1 &#x2026; , <italic>n</italic>. An objective is to decide route lengths <italic>R</italic>
<sub>
<italic>mr</italic>
</sub> <italic>R</italic>
<sub>
<italic>dr</italic>
</sub> comprising a starting point, different nodes/waypoints, and a termination point. The following criteria are considered in path planning. Let another variable <italic>h</italic>
<sub>
<italic>i</italic>
</sub> be defined to represent both <inline-formula id="inf15">
<mml:math id="m20">
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> and <inline-formula id="inf16">
<mml:math id="m21">
<mml:msubsup>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>.</p>
<sec id="s6-2-1">
<title>6.2.1 UGV steering</title>
<p>The cost of steering is defined according to the number of nodes of the path, as the more nodes, the higher the cost of steering. The cost of steering is defined as shown below:<disp-formula id="e6">
<mml:math id="m22">
<mml:msub>
<mml:mrow>
<mml:mi>L</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">ugv</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
</mml:math>
<label>(6)</label>
</disp-formula>where <italic>h</italic>
<sub>
<italic>s</italic>
</sub> and <italic>h</italic>
<sub>
<italic>T</italic>
</sub> are starting and terminating waypoints.</p>
</sec>
<sec id="s6-2-2">
<title>6.2.2 UAV steering</title>
<p>The cost of UAV steering depends on the altitude of the path. The cost will be higher if the altitude of the path is higher. At lower altitudes, the drone may fly with improved efficiency. The cost of UAV steering is defined as follows:<disp-formula id="e7">
<mml:math id="m23">
<mml:msub>
<mml:mrow>
<mml:mi>H</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">uav</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>z</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mo>,</mml:mo>
</mml:math>
<label>(7)</label>
</disp-formula>where <italic>z</italic>
<sub>
<italic>m</italic>
</sub> (<italic>h</italic>
<sub>
<italic>i</italic>
</sub>, <italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>) is the mean flying height at segments (<italic>h</italic>
<sub>
<italic>i</italic>
</sub>, <italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>). <italic>z</italic>
<sub>max</sub> and <italic>z</italic>
<sub>min</sub> are maximum and minimum altitudes, respectively. The following algorithm has been proposed for the coordinated steering of UAV and UGV. The weight of an edge between two waypoints is determined by <italic>Z</italic>
<sub>
<italic>f</italic>
</sub>, as shown in Equation (6.1).</p>
<p>Coordinated UAV and UGV steering algorithm is mentioned below.</p>
<p>Input: A weighted undirected graph <italic>G</italic> &#x3d; (<italic>V</italic>, <italic>E</italic>, <italic>v</italic>)</p>
<p>create 3D coordinates <inline-formula id="inf17">
<mml:math id="m24">
<mml:mi>h</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mo>&#x307;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mspace width="0.3333em"/>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula>, in the steer (<italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>, <italic>h</italic>
<sub>
<italic>i</italic>
</sub>)</p>
<p>
<italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub> &#x2190; <italic>steerUAVandUGV</italic> (<italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>, <italic>h</italic>
<sub>
<italic>i</italic>
</sub>)</p>
<p>Sort the edges between two waypoints in E in decreasing order by weight and check mapping (<italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>)</p>
<p>if path (<italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>, <italic>h</italic>
<sub>
<italic>i</italic>
</sub>) is obstacle free</p>
<p>Check if <italic>Z</italic>
<sub>
<italic>f</italic>
</sub> decreases and <italic>r</italic>(<italic>t</italic>) increases</p>
<p>Return True (<italic>h</italic>
<sub>
<italic>i</italic>&#x2b;1</sub>)</p>
<p>Output: A minimum spanning tree for the UGV&#x2013;UAV route</p>
<p>end</p>
</sec>
</sec>
</sec>
<sec id="s7">
<title>7 Proposed transfer learning mechanism for MW transportation with CUU</title>
<sec id="s7-1">
<title>7.1 Bayes model</title>
<p>The Bayesian linear regression learning model implements the adaptive approach to enhance the performance of the predictive model with new data available along with available posterior data. The Bayesian learning model is described as follows:<disp-formula id="e8">
<mml:math id="m25">
<mml:msub>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:math>
<label>(8)</label>
</disp-formula>where <italic>x</italic>
<sub>
<italic>i</italic>
</sub> &#x3d; [<italic>SoC</italic>
<sub>
<italic>i</italic>
</sub>, <italic>W</italic>
<sub>
<italic>mw</italic>,<italic>i</italic>
</sub>].</p>
<p>The likelihood function of <inline-formula id="inf18">
<mml:math id="m26">
<mml:msup>
<mml:mrow>
<mml:mi>Y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mspace width="0.3333em"/>
<mml:msub>
<mml:mrow>
<mml:mi>h</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> can be obtained:<disp-formula id="e9">
<mml:math id="m27">
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>Y</mml:mi>
<mml:mfenced open="|" close="">
<mml:mrow>
</mml:mrow>
</mml:mfenced>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover accentunder="false" accent="true">
<mml:mrow>
<mml:mo>&#x220f;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:munderover>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:munderover accentunder="false" accent="true">
<mml:mrow>
<mml:mo>&#x220f;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>N</mml:mi>
</mml:mrow>
</mml:munderover>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>e</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mstyle>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>y</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mo>.</mml:mo>
</mml:math>
<label>(9)</label>
</disp-formula>As per the Bayesian theorem, the posterior distribution of the data can be obtained with the following. The predictive model of successful and unsuccessful delivery by drone incorporates the Bayesian inference, which is updated to improve its accuracy. The predictive model considers the new data <italic>Y</italic>
<sub>1</sub> and the previous data set <italic>Y</italic>
<sub>2</sub>. The posterior distribution on model parameter <italic>&#x3b2;</italic> depending on data <italic>Y</italic>
<sub>1</sub> and data <italic>Y</italic>
<sub>2</sub> is formulated with the Bayesian theorem and given below (<xref ref-type="bibr" rid="B21">Xing et al., 2021</xref>):<disp-formula id="e10">
<mml:math id="m28">
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">optimal</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">nonoptimal</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.3333em"/>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
</sec>
<sec id="s7-2">
<title>7.2 Multinomial logistic regression</title>
<p>The multinomial logistic regression represents the logistic regression extension of the class of many systems. The multinomial logistic regression model is developed based on the available data, and this can be used for the predictions based on previous data. The hyperparameter of the multinomial logistic regression must be tuned. The multinomial logit model is defined in terms of original probability <italic>&#x3c0;</italic>
<sub>
<italic>i</italic>
</sub>. The multinomial logit model algorithm for the probabilistic optimal cost of MW transportation is defined below:</p>
<p>Multinomial logit model algorithm:</p>
<p>Initialization: medical waste data</p>
<p>Generate data of transportation costs <italic>C</italic>
<sub>
<italic>T</italic>
</sub> &#x3d; {<italic>C</italic>
<sub>
<italic>mr</italic>
</sub>, <italic>C</italic>
<sub>
<italic>dr</italic>
</sub>}, and route of transportation <italic>R</italic>
<sub>
<italic>T</italic>
</sub> &#x3d; { <italic>R</italic>
<sub>
<italic>mr</italic>
</sub>: <italic>R</italic>
<sub>
<italic>dr</italic>
</sub>} and</p>
<p>Given multi-logit (<italic>Y</italic>
<sub>
<italic>k</italic>
</sub>&#x7c;<italic>&#x3b2;</italic>) obtained for a past class of MW</p>
<p>Let <inline-formula id="inf19">
<mml:math id="m29">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> for the new class of MW</p>
<p>Define prior <inline-formula id="inf20">
<mml:math id="m30">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
<mml:mspace width="0.3333em"/>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
<mml:mspace width="0.3333em"/>
</mml:math>
</inline-formula> for a new class of <inline-formula id="inf21">
<mml:math id="m31">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
<p>Procedure PARTITION (<italic>Z</italic>
<sub>
<italic>f</italic>
</sub>, Y) &#x2192; partition of the data set into training and testing</p>
<p>Update the model using the training data set</p>
<p>Compute <italic>Z</italic>
<sub>
<italic>f</italic>
</sub>
</p>
<p>Compute the maximum likelihood of Y as <inline-formula id="inf22">
<mml:math id="m32">
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>Y</mml:mi>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mspace width="0.3333em"/>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula> for <italic>Z</italic>
<sub>
<italic>f</italic>
</sub>
</p>
<p>Obtain posterior distribution as <inline-formula id="inf23">
<mml:math id="m33">
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mspace width="0.3333em"/>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>Y</mml:mi>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
<p>Randomly generate <italic>n</italic> samples from <inline-formula id="inf24">
<mml:math id="m34">
<mml:mi>f</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mspace width="0.3333em"/>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>
</p>
<p>Update <inline-formula id="inf25">
<mml:math id="m35">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> with the mean of <italic>n</italic> samples</p>
<p>Procedure EVALUATION Evaluating performance using the testing data set</p>
<p>Make a prediction <inline-formula id="inf26">
<mml:math id="m36">
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>M</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>i</mml:mi>
<mml:mspace width="0.3333em"/>
<mml:mi>L</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mi>Y</mml:mi>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
<mml:mspace width="0.3333em"/>
</mml:mrow>
<mml:mo stretchy="false">&#x302;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</sec>
</sec>
<sec id="s8">
<title>8 Reinforcement learning process of the framework</title>
<p>Let S and A represent a discrete set of environment states and a set of actions, respectively. In every state <italic>s</italic> &#x2208; <italic>S</italic>, a framework of multi-drone mobile robots takes feasible actions <italic>a</italic> &#x2208; <italic>A</italic> over the finite learning horizon. The framework transits to the next state <italic>s</italic>
<sup>1</sup> &#x2208; <italic>S</italic>, and the framework receives an immediate reward for performing the desired action. However, the framework is penalized for each undesired action leading to a collision. The goal of the framework is to maximize its total reward. It does this by learning which action is optimal for each state. With available information of <inline-formula id="inf27">
<mml:math id="m37">
<mml:mo>&#x3c;</mml:mo>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3e;</mml:mo>
</mml:math>
</inline-formula>, the Q-learning process is updated according to the following equation:<disp-formula id="e11">
<mml:math id="m38">
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2190;</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#xd7;</mml:mo>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munder>
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>Q</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
</mml:math>
<label>(11)</label>
</disp-formula>where <inline-formula id="inf28">
<mml:math id="m39">
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mspace width="0.3333em"/>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.3333em"/>
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3b1;</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> is the learning rate and <italic>R</italic>
<sub>
<italic>t</italic>&#x2b;1</sub> is the reward observed after performing <italic>a</italic>
<sub>
<italic>t</italic>
</sub> in <italic>s</italic>
<sub>
<italic>t</italic>
</sub>. The learning rate may be the same for all pairs, and the discount factor <italic>&#x3b3;</italic> is such that 0 &#x2264; <italic>&#x3b3;</italic> &#x3c; 1. The Bellman equation that describes the optimal action-value function <italic>Q</italic>&#x2a;(<italic>s</italic>, <italic>a</italic>) is given below:<disp-formula id="e12">
<mml:math id="m40">
<mml:msup>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:munder>
<mml:msup>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mspace width="0.3333em"/>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.3333em"/>
<mml:mo>,</mml:mo>
</mml:math>
<label>(12)</label>
</disp-formula>
</p>
<p>where <italic>s</italic>&#x2032; &#x223c; <italic>P</italic> represents the next state, which is sampled from a distribution <italic>P</italic> (.&#x7c;<italic>s</italic>, <italic>a</italic>). This Bellman function starts the learning approach of approximately <inline-formula id="inf29">
<mml:math id="m41">
<mml:msup>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>.</mml:mo>
<mml:mspace width="0.3333em"/>
</mml:math>
</inline-formula> The set (<italic>s</italic>, <italic>a</italic>, <italic>r</italic>, <italic>s</italic>&#x2032;, <italic>d</italic>) &#x2208; <italic>D</italic> represents the transitions, and <italic>d</italic> tells about the terminal of <italic>s</italic>&#x2032;. To keep <italic>Q</italic>
<sub>
<italic>&#x3a6;</italic>
</sub>(<italic>s</italic>, <italic>a</italic>)</p>
<p>close to the Bellman equation, a mean square Bellman error (MSBE) is defined below:<disp-formula id="e13">
<mml:math id="m42">
<mml:mi>L</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>&#x3a6;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:munder>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3a6;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3a6;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
</mml:math>
<label>(13)</label>
</disp-formula>where <italic>d</italic> equals 1 if <italic>s</italic>&#x2032; is terminal; else, it is 0. In the target networks, the target term is defined below:<disp-formula id="e14">
<mml:math id="m43">
<mml:mi>r</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b3;</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:munder>
<mml:msub>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3a6;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfenced>
<mml:mo>.</mml:mo>
</mml:math>
<label>(14)</label>
</disp-formula>By minimizing the MSBE loss, it is possible to track this target by <inline-formula id="inf30">
<mml:math id="m44">
<mml:msub>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3a6;</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>. An optimal action <italic>a</italic>&#x2a; can be obtained by solving the following equation:<disp-formula id="e15">
<mml:math id="m45">
<mml:msup>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>g</mml:mi>
<mml:munder>
<mml:mrow>
<mml:mi mathvariant="normal">m</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:munder>
<mml:msup>
<mml:mrow>
<mml:mi>Q</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mo>&#x2a;</mml:mo>
</mml:mrow>
</mml:msup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.3333em"/>
<mml:mo>,</mml:mo>
</mml:math>
<label>(15)</label>
</disp-formula>where <inline-formula id="inf31">
<mml:math id="m46">
<mml:mi>a</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">[</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mspace width="0.3333em"/>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mo stretchy="false">]</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>. The reward function for the optimal trajectory of the drone is as follows:<disp-formula id="e16">
<mml:math id="m47">
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b7;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:math>
<label>(16)</label>
</disp-formula>where <inline-formula id="inf32">
<mml:math id="m48">
<mml:msubsup>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>,</inline-formula> <italic>R</italic>
<sub>
<italic>dr</italic>
</sub>(t) is the predicted optimal and actual route length of the drone, and <italic>&#x3b7;</italic>
<sub>
<italic>P</italic>
</sub> is the binary scaling factor.<disp-formula id="e17">
<mml:math id="m49">
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3b7;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="&#x2016;" close="&#x2016;">
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:math>
<label>(17)</label>
</disp-formula>where <inline-formula id="inf33">
<mml:math id="m50">
<mml:msubsup>
<mml:mrow>
<mml:mi>R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:math>
</inline-formula>, <italic>R</italic>
<sub>
<italic>mr</italic>
</sub>(t) is the predicted optimal and actual route length of the mobile robot, and <italic>&#x3b7;</italic>
<sub>
<italic>m</italic>
</sub> is the binary scaling factor.The total reward function is defined below:<disp-formula id="e18">
<mml:math id="m51">
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>r</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>.</mml:mo>
</mml:math>
<label>(18)</label>
</disp-formula>Collecting medical waste manually may cause health problems for the employees of the medical centers. A coordinated multi-drone mobile robot framework can collect medical waste and transfer it to disposal centers with minimum human intervention.</p>
</sec>
<sec id="s9">
<title>9 Simulations and case study</title>
<p>A hospital located in Bareilly, India, is considered for a medical waste transportation study. Currently, medical waste is transported in trucks. This system could expose the people involved in MW transportation to risks. In some situations, unauthorized transportation may occur. The drone possesses a camera and an inertial measurement unit (IMU) to create reference elevation movement, and the robot generates a probabilistic network of paths. The ground robot and aerial drone work collectively to create the multi-level platform. The real-time appearance-based mapping technique is used to localize the robot and map the environment. The IMU estimates the attitude using multinomial logistic regression. Both visual and inertial data are combined to produce odometry estimates. The ground robot with four mecanum wheels is a custom-designed platform. The UAV creates a 3D map with a ground path and altitude information using the IMU and a camera. The ground robot follows the tracks within the 3D map of the environment generated by the UAV. Synergistically, the robot drone platform is equipped with sensors such as a PIR sensor, infrared camera, and Intel RealSense D435 with IMU. The ground robot moves on predefined paths to slow, stop, or reroute its path for collection of medical waste. The UAV is controlled in tandem to collect the packet of medical waste and then steer away for transportation of the packet to the MW disposal centers.</p>
<p>The types of medical waste are classified and represented by colors (red, yellow, blue, and black). The considered medical wastes comprises 110 gauze <inline-formula id="inf34">
<mml:math id="m52">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>0.02</mml:mn>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, 120 gloves<inline-formula id="inf35">
<mml:math id="m53">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>0.002</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.007</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, 140 infusion bags <inline-formula id="inf36">
<mml:math id="m54">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, 135 infusion bottles <inline-formula id="inf37">
<mml:math id="m55">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>3</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>5</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, 132 infusion apparatus<inline-formula id="inf38">
<mml:math id="m56">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>0.001</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.004</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, 125 syringe needles <inline-formula id="inf39">
<mml:math id="m57">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>0.02</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.004</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, 132 tweezers <inline-formula id="inf40">
<mml:math id="m58">
<mml:mrow>
<mml:mo stretchy="false">(</mml:mo>
<mml:mrow>
<mml:mo>&#x223c;</mml:mo>
<mml:mn>0.015</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>0.020</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mi>k</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
<mml:mo stretchy="false">)</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>, and 128 syringe (&#x223c;0.002&#x2013;0.004 kg). The mobile robot helps to form the MW packets with weights <inline-formula id="inf41">
<mml:math id="m59">
<mml:msubsup>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:mspace width="0.3333em"/>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> and <inline-formula id="inf42">
<mml:math id="m60">
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2264;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. Python programming has been used to encrypt medical waste packets. Hash keys for these packets have been obtained and are mentioned below.</p>
<table-wrap id="udT1" position="float">
<table>
<tbody valign="top">
<tr>
<td align="left">Medical waste packet 1</td>
</tr>
<tr>
<td align="left">Color: Red</td>
</tr>
<tr>
<td align="left">
<italic>Rq</italic>
<sub>1,<italic>mw</italic>
</sub> &#x3d; Available</td>
</tr>
<tr>
<td align="left">
<italic>Id</italic>
<sub>1,<italic>mw</italic>
</sub> &#x3d; hash key acd6ae0c2dc3db2b0692</td>
</tr>
<tr>
<td align="left">3cb1567c567add1a0d9d7ae4cabf2427b35ac0d5b4ff</td>
</tr>
<tr>
<td align="left">
<italic>T</italic>
<sub>1,<italic>mw</italic>
</sub> &#x3d; timestamp (2023-02-03 15:45:35.490013)</td>
</tr>
<tr>
<td align="left">
<italic>W</italic>
<sub>1,<italic>mw</italic>
</sub> &#x3d; 2&#xa0;kg</td>
</tr>
<tr>
<td align="left">
<italic>Au</italic>
<sub>1,<italic>mw</italic>
</sub> &#x3d; Authorized</td>
</tr>
<tr>
<td align="left">
<italic>O</italic>
<sub>1,<italic>mw</italic>
</sub> &#x3d; medical disposal center <inline-formula id="inf43">
<mml:math id="m61">
<mml:mspace width="0.3333em"/>
<mml:mn>1</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>2,0,0</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mi>k</mml:mi>
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="udT2" position="float">
<table>
<tbody valign="top">
<tr>
<td align="left">Medical waste packet 2</td>
</tr>
<tr>
<td align="left">Color: yellow</td>
</tr>
<tr>
<td align="left">
<italic>Rq</italic>
<sub>2,<italic>mw</italic>
</sub> &#x3d; Available</td>
</tr>
<tr>
<td align="left">
<italic>Id</italic>
<sub>2,<italic>mw</italic>
</sub> &#x3d; hash key</td>
</tr>
<tr>
<td align="left">4c014d35f0d9ad4b18c</td>
</tr>
<tr>
<td align="left">6b86cc1f9c346f28389fd03e50a97362a406f74ceb6f0</td>
</tr>
<tr>
<td align="left">
<italic>T</italic>
<sub>2,<italic>mw</italic>
</sub> &#x3d; timestamp (2023-02-03 15:45:35.490011)</td>
</tr>
<tr>
<td align="left" style=";">
<italic>W</italic>
<sub>2,<italic>mw</italic>
</sub> &#x3d; 1.5&#xa0;kg</td>
</tr>
<tr>
<td align="left">
<italic>Au</italic>
<sub>2,<italic>mw</italic>
</sub> &#x3d; Authorized</td>
</tr>
<tr>
<td align="left">
<italic>O</italic>
<sub>2,<italic>mw</italic>
</sub> &#x3d; medical disposal center <inline-formula id="inf44">
<mml:math id="m62">
<mml:mspace width="0.3333em"/>
<mml:mn>2</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>4,0,0</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mi>k</mml:mi>
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="udT3" position="float">
<table>
<tbody valign="top">
<tr>
<td align="left">Medical waste packet 3</td>
</tr>
<tr>
<td align="left">Color: Black</td>
</tr>
<tr>
<td align="left">
<italic>Rq</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; Available</td>
</tr>
<tr>
<td align="left">
<italic>Id</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; hash key</td>
</tr>
<tr>
<td align="left">93518f43effceab801431f3610b5</td>
</tr>
<tr>
<td align="left">5f8598a27bee68b282797a3e7a64856c8afe</td>
</tr>
<tr>
<td align="left">
<italic>T</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; timestamp (2023-02-03 15:45:35.491009)</td>
</tr>
<tr>
<td align="left" style=";">
<italic>W</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; 1.2&#xa0;kg</td>
</tr>
<tr>
<td align="left">
<italic>Au</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; Authorized</td>
</tr>
<tr>
<td align="left">
<italic>O</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; medical disposal center <inline-formula id="inf45">
<mml:math id="m63">
<mml:mspace width="0.3333em"/>
<mml:mn>3</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>2.5</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>0,0</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mi>k</mml:mi>
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="udT4" position="float">
<table>
<tbody valign="top">
<tr>
<td align="left">Medical waste packet 4</td>
</tr>
<tr>
<td align="left">Color: Blue</td>
</tr>
<tr>
<td align="left">
<italic>Rq</italic>
<sub>4,<italic>mw</italic>
</sub> &#x3d; Available</td>
</tr>
<tr>
<td align="left">
<italic>Id</italic>
<sub>4,<italic>mw</italic>
</sub> &#x3d; hash key ee5f80befdb1ca0111c</td>
</tr>
<tr>
<td align="left">9b8bb8115bd51844eb8c9dc54532941075197ce145044</td>
</tr>
<tr>
<td align="left">
<italic>T</italic>
<sub>4,<italic>mw</italic>
</sub> &#x3d; timestamp (2023-02-03 15:45:35.492016)</td>
</tr>
<tr>
<td align="left" style=";">
<italic>W</italic>
<sub>4,<italic>mw</italic>
</sub> &#x3d; 1.8&#xa0;kg</td>
</tr>
<tr>
<td align="left">
<italic>Au</italic>
<sub>4,<italic>mw</italic>
</sub> &#x3d; Authorized</td>
</tr>
<tr>
<td align="left">
<italic>O</italic>
<sub>3,<italic>mw</italic>
</sub> &#x3d; medical disposal center <inline-formula id="inf46">
<mml:math id="m64">
<mml:mspace width="0.3333em"/>
<mml:mn>3</mml:mn>
<mml:mspace width="0.3333em"/>
<mml:mfenced open="{" close="}">
<mml:mrow>
<mml:mn>2.5</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>0,0</mml:mn>
</mml:mrow>
</mml:mfenced>
<mml:mi>k</mml:mi>
<mml:mi>m</mml:mi>
</mml:math>
</inline-formula>
</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In a similar fashion, the next subsequent encrypted MW packet data are obtained. Let maximums of <italic>T</italic>
<sub>
<italic>mr</italic>
</sub> and <italic>T</italic>
<sub>
<italic>dr</italic>
</sub> be taken as 10 min and 25 min. The maximum velocities of the robot and drone are chosen as 5&#xa0;km/h and 80&#xa0;km/h, respectively. The various maximum values of transportation costs are taken as <italic>C</italic>
<sub>
<italic>mr</italic>
</sub> &#x3d; 5&#xa0;<italic>Rs</italic>/<italic>kg</italic>, <italic>C</italic>
<sub>
<italic>dr</italic>
</sub> &#x3d; 50&#xa0;<italic>Rs</italic>/<italic>kg</italic>, and <italic>C</italic>
<sub>
<italic>dr</italic>
</sub> &#x3d; 40&#xa0;<italic>Rs</italic>/<italic>kg</italic>. One hundred (100) samples of MW data are generated. After taking the mean velocities of the robot and drone at different time instants, the average velocities of the robot and drone are obtained as 2.48&#xa0;km/h and 47.8&#xa0;km/h, respectively. Next, the prediction error is calculated as 0.4%.</p>
<p>The posterior density was obtained with the transfer learning algorithm, and a predicted route for the mobile robots and drones is generated in a 3D environment <xref ref-type="fig" rid="F4">Figure 4</xref>. Using the data related to the SoC of the battery and the MW weight, the proportional logit model is obtained:<disp-formula id="e19">
<mml:math id="m65">
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">n</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">optimal</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">nonotimal</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
<mml:mspace width="0.3333em"/>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1.47</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>2.54</mml:mn>
<mml:mi>S</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1.24</mml:mn>
<mml:msub>
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mi>w</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:math>
<label>(19)</label>
</disp-formula>
</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Predicted nodes of the drone&#x2019;s route from the transit point to the disposal center.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g004.tif"/>
</fig>
<p>The SoC of the battery of the drone and the weight of the medical waste packet are considered for the prediction of the optimal route length of the framework (18). The SoC of batteries varies from 0.2 to 0.8, and the weight of MW varies from 1&#xa0;kg to 2&#xa0;kg. The optimal predicted velocity of the robot and drone are shown in <xref ref-type="fig" rid="F5">Figures 5</xref> and <xref ref-type="fig" rid="F6">6</xref>, respectively (14)&#x2013;(15). The rewards of actions done by robots and drones are obtained with a Q-learning mechanism using <xref ref-type="disp-formula" rid="e16">(16)</xref>. The accumulative rewards are estimated as per (17) and shown in <xref ref-type="fig" rid="F7">Figure 7</xref>. The coordinated framework has been rewarded for the optimal and successful delivery of medical waste from the collection point to the disposal center through transit points. At various iterations, the rewards vary from 0.7 to 0.9. The limitations of the various UAV&#x2013;UGV coordination algorithms are mentioned in <xref ref-type="table" rid="T1">Table 1</xref>. None of these algorithms is applied in medical waste transportation. The effectiveness of the proposed learning-based UAV&#x2013;UGV coordinated algorithm is shown by obtaining the results, and the features of this algorithm are mentioned in <xref ref-type="table" rid="T2">Table 2</xref>.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Predicted velocity (km/hr) of the mobile robot.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g005.tif"/>
</fig>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Predicted velocity (km/hr) of the drone.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Rewards of the proposed coordinated framework of the robot and drone.</p>
</caption>
<graphic xlink:href="frsen-05-1351703-g007.tif"/>
</fig>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Comparative study on UAV&#x2013;UGV coordination algorithms.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Sr. no.</th>
<th align="left">Algorithm</th>
<th align="left">Limitation</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="4" align="left">1</td>
<td rowspan="4" align="left">Memetic algorithm (<xref ref-type="bibr" rid="B5">Ding et al., 2022</xref>)</td>
<td align="left">1. Parameter sensitivity 2.Computational complexity</td>
</tr>
<tr>
<td align="left">3. Convergence to local optima</td>
</tr>
<tr>
<td align="left">4. Empirical tuning required</td>
</tr>
<tr>
<td align="left">5. Limited scalability to high-dimensional problems</td>
</tr>
<tr>
<td rowspan="3" align="left">2</td>
<td rowspan="3" align="left">A two-stage traveling salesman (<xref ref-type="bibr" rid="B18">Wang et al., 2020</xref>)</td>
<td align="left">1. Increased computational requirements</td>
</tr>
<tr>
<td align="left">2. Increased computational requirements</td>
</tr>
<tr>
<td align="left">3. Dependence on the division into stages</td>
</tr>
<tr>
<td rowspan="3" align="left">3</td>
<td rowspan="3" align="left">Backstepping control (<xref ref-type="bibr" rid="B6">Ha and Lee, 2013</xref>)</td>
<td align="left">1. Complexity in stabilizing the system</td>
</tr>
<tr>
<td align="left">2. Sensitivity to model uncertainties</td>
</tr>
<tr>
<td align="left">3. Lack of robustness</td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">Event-triggered mechanism (<xref ref-type="bibr" rid="B16">Wang, 2021</xref>)</td>
<td align="left">Only considers the supervision and intervention behavior of the UAV to the UGV</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">Symbiotic aerial vehicle-ground vehicle team (<xref ref-type="bibr" rid="B2">Arbanas and Antun, 2018</xref>)</td>
<td align="left">UGV is unable to provide an optimal route for the UAV</td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">Unmanned aerial and ground vehicle teams (<xref ref-type="bibr" rid="B19">Waslander et al., 2013</xref>)</td>
<td align="left">Unable to obtain optimal operating ranges and payload capabilities</td>
</tr>
<tr>
<td align="left">7</td>
<td align="left">Taxonomy for UAV and UGV coordination (<xref ref-type="bibr" rid="B4">Chen et al., 2016</xref>)</td>
<td align="left">No specific application-oriented UAV&#x2013;UGV framework design</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Features of learning-based UGV&#x2013;UAV coordination algorithm.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Sr. no.</th>
<th align="left">Algorithm</th>
<th align="left">Advantage</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="5" align="left">1</td>
<td rowspan="5" align="left">Learning-based UGV&#x2013;UAV coordination</td>
<td align="left">1. Simple to implement in medical waste transportation</td>
</tr>
<tr>
<td align="left">2. Implements a minimum spanning tree for the optimal route</td>
</tr>
<tr>
<td align="left">3. Multi-logit regression with consideration of the state of charge of the UAV&#x2013;UGV and medical waste weight</td>
</tr>
<tr>
<td align="left">4. Rewards with reinforcement learning for optimal path planning</td>
</tr>
<tr>
<td align="left">5. Tasks are encrypted</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec sec-type="conclusion" id="s10">
<title>10 Conclusion</title>
<p>In this paper, a coordinated UAV&#x2013;UGV framework is proposed for medical waste transportation to minimize human involvement. For optimal medical waste transportation, a learning-based mechanism has been implemented to predict the route length followed by the robots and the drone. The time-stamped medical waste packets are encrypted with hash keys. The predicted route length from the transit point to the disposal center has been obtained. The reinforcement learning algorithm has been considered for optimal successful and unsuccessful transportation of medical waste from collection points to disposal centers.</p>
</sec>
<sec id="s11">
<title>11 Future research direction</title>
<p>As the field of medical waste transportation continues to evolve, several potential future research directions can be explored to address emerging challenges and promote sustainable practices. Here are some areas that researchers might consider:<list list-type="simple">
<list-item>
<p>&#x2022; Green technologies and sustainable practices: Examine and create eco-friendly technology for the transportation of medical waste. To lessen the influence of transportation on the environment, this could involve using hybrid or electric cars, renewable energy sources, and other environmentally friendly methods.</p>
</list-item>
<list-item>
<p>&#x2022; Circular economy approaches: Examine medical waste management circular economy models, emphasizing transportation. To reduce total waste generation, investigate how waste materials and by-products can be recycled, repurposed, or reused in a closed-loop system.</p>
</list-item>
<list-item>
<p>&#x2022; Integration of artificial intelligence (AI) and machine learning (ML): Analyze the possibilities for applying AI and ML to forecast transportation requirements, optimize medical waste transit routes, and enhance overall logistics effectiveness. Real-time tracking, predictive analytics, and data-driven decision-making may all be considered.</p>
</list-item>
<list-item>
<p>&#x2022; Blockchain technology for traceability: Examine how blockchain technology can improve the transparency and traceability of the transfer of medical waste. Create safe, decentralized systems to monitor the flow of medical waste, guaranteeing adherence to rules and lowering the possibility of unauthorized disposal.</p>
</list-item>
</list>
</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s12">
<title>Data availability statement</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec id="s13">
<title>Author contributions</title>
<p>DS: conceptualization, methodology, and writing&#x2013;original draft. JL: resources, supervision, and writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s14">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This work was supported by the funded project by the Council of Science and Technology, Lucknow, India (CST/D-3246).</p>
</sec>
<ack>
<p>The authors acknowledge the affiliating institutions of authors and the Council of Science and Technology, Lucknow, India.</p>
</ack>
<sec sec-type="COI-statement" id="s15">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s16">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ahmad</surname>
<given-names>R. W.</given-names>
</name>
<name>
<surname>Salah</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Jayaraman</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Yaqoob</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Omar</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ellahham</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Blockchain-based forward supply chain and waste management for covid-19 medical equipment and supplies</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>44905</fpage>&#x2013;<lpage>44927</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2021.3066503</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Arbanas</surname>
<given-names>I. A. C. M. e. a.</given-names>
</name>
<name>
<surname>Antun</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Car</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Orsag</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Petrovic</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Bogdan</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Decentralized planning and control for uav&#x2013;ugv cooperative teams</article-title>. <source>Auton. Robot.</source> <volume>42</volume>, <fpage>1601</fpage>&#x2013;<lpage>1618</lpage>. <pub-id pub-id-type="doi">10.1007/s10514-018-9712-y</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Celtek</surname>
<given-names>S. A.</given-names>
</name>
<name>
<surname>Durdu</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Kurnaz</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Design and simulation of the hierarchical tree topology based wireless drone networks</article-title>,&#x201d; in <conf-name>International Conference on Artificial Intelligence and Data Processing (IDAP)</conf-name>, <conf-loc>USA</conf-loc>, <conf-date>21-22 Sept. 2019</conf-date> (<publisher-name>IDAP</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>5</lpage>. <pub-id pub-id-type="doi">10.1109/IDAP.2018.8620755</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Xin</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Coordination between unmanned aerial and ground vehicles: a taxonomy and optimization perspective</article-title>. <source>IEEE Trans. Cybern.</source> <volume>46</volume>, <fpage>959</fpage>&#x2013;<lpage>972</lpage>. <pub-id pub-id-type="doi">10.1109/TCYB.2015.2418337</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ding</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xin</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Dou</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>B. M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A memetic algorithm for curvature-constrained path planning of messenger uav in air-ground coordination</article-title>. <source>IEEE Trans. Automation Sci. Eng.</source> <volume>19</volume>, <fpage>3735</fpage>&#x2013;<lpage>3749</lpage>. <pub-id pub-id-type="doi">10.1109/TASE.2021.3135044</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ha</surname>
<given-names>C. S.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2013</year>). &#x201c;<article-title>Preliminary result of vision-based teleoperation of an uav and ugvs team</article-title>,&#x201d; in <conf-name>10th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI)</conf-name>, <conf-loc>China</conf-loc>, <conf-date>Oct. 30 - Nov 02, 2013</conf-date> (<publisher-name>URAI</publisher-name>). <comment>128&#x2013;128</comment>. <pub-id pub-id-type="doi">10.1109/URAI.2013.6677492</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kagawa</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Ono</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Shan</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Takizawa</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Miura</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>H.-B.</given-names>
</name>
<etal/>
</person-group> (<year>2017</year>). &#x201c;<article-title>A study on latency-guaranteed multi-hop wireless communication system for control of robots and drones</article-title>,&#x201d; in <source>2017 20th international symposium on wireless personal multimedia communications</source> (<publisher-loc>New York</publisher-loc>: <publisher-name>WPMC</publisher-name>), <fpage>417</fpage>&#x2013;<lpage>421</lpage>. <pub-id pub-id-type="doi">10.1109/WPMC.2017.8301849</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ko&#xe7;ak</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>Kurtuldu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Akpek</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ko&#xe7;o&#x11f;lu</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ero&#x11f;ul</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>A medical waste management model for public private partnership hospitals</article-title>. <source>Med. Technol. Natl. Congr. (TIPTEKNO)</source>, <fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/TIPTEKNO.2016.7863138</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Multi-attribute group decision making based on intuitionistic uncertain linguistic hamy mean operators with linguistic scale functions and its application to health-care waste treatment technology selection</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>20</fpage>&#x2013;<lpage>46</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2018.2882508</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Xian</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Health-care waste treatment technology selection using the interval 2-tuple induced topsis method</article-title>. <source>Int. J. Environ. Res. Public Health</source> <volume>13</volume>, <fpage>10127</fpage>&#x2013;<lpage>10134</lpage>. <pub-id pub-id-type="doi">10.3389/fnins.2013.12345</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mishra</surname>
<given-names>A. R.</given-names>
</name>
<name>
<surname>Mardani</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Rani</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Zavadskas</surname>
<given-names>E. K.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A novel edas approach on intuitionistic fuzzy set for assessment of health-care waste disposal technology using new parametric divergence measures</article-title>. <source>J. Clean. Prod.</source> <volume>272</volume>, <fpage>122807</fpage>. <pub-id pub-id-type="doi">10.1016/j.jclepro.2020.122807</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Shareefdeen</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Ashoobi</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ilyas</surname>
<given-names>U.</given-names>
</name>
</person-group> (<year>2022</year>). <source>Medical waste management and treatment technologies</source>. <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>. <comment>113&#x2013;133</comment>. <pub-id pub-id-type="doi">10.1007/978-3-030-95262-4_5</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Sun</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Discussion on the application of rfid technology in medical waste management</article-title>,&#x201d; in <conf-name>10th International Conference on Information Technology in Medicine and Education (ITME)</conf-name>, <conf-loc>South Koren</conf-loc>, <conf-date>Aug. 23 2019</conf-date> (<publisher-name>ITME</publisher-name>), <fpage>120</fpage>&#x2013;<lpage>124</lpage>. <pub-id pub-id-type="doi">10.1109/ITME.2019.00037</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ma</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhong</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Iot monitoring system of medical waste based on artificial intelligence</article-title>,&#x201d; in <conf-name>2021 7th Annual International Conference on Network and Information Systems for Computers (ICNISC)</conf-name>, <conf-loc>USA</conf-loc>, <conf-date>23-25 July 2021</conf-date> (<publisher-name>ICNISC</publisher-name>), <fpage>139</fpage>&#x2013;<lpage>143</lpage>. <pub-id pub-id-type="doi">10.1109/ICNISC54316.2021.00034</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Routing and scheduling for hybrid truck-drone collaborative parcel delivery with independent and truck-carried drones</article-title>. <source>IEEE Internet Things J.</source> <volume>6</volume>, <fpage>10483</fpage>&#x2013;<lpage>10495</lpage>. <pub-id pub-id-type="doi">10.1109/JIOT.2019.2939397</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>G. J.</given-names>
</name>
<name>
<surname>Guo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Event-triggered intervention framework for uav-ugv coordination systems</article-title>. <source>Machines</source> <volume>9</volume>, <fpage>371</fpage>. <pub-id pub-id-type="doi">10.3390/machines9120371</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Nai</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>Application of 5g wireless communication technology in hazardous medical waste treatment</article-title>,&#x201d; in <conf-name>IEEE International Conference on Software Engineering and Artificial Intelligence (SEAI)</conf-name>, <conf-loc>China</conf-loc>, <conf-date>10-12 June 2022</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>2021</fpage>. <comment>87&#x2013;90</comment>. <pub-id pub-id-type="doi">10.1109/SEAI52285.2021.9477538</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Su</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Path planning for uav/ugv collaborative systems in intelligent manufacturing</article-title>. <source>IET Intell. Transp. Syst.</source> <volume>14</volume>, <fpage>1475</fpage>&#x2013;<lpage>1483</lpage>. <pub-id pub-id-type="doi">10.1049/iet-its.2019.0688</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Waslander</surname>
<given-names>N. K.</given-names>
</name>
<name>
<surname>Steven</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Kartidjo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Yoon</surname>
<given-names>A.</given-names>
</name>
</person-group>
<collab>Kwang-Joonand Budiyono</collab> (<year>2013</year>). <source>Unmanned aerial and ground vehicle teams: recent work and open problems</source>. <publisher-loc>Japan</publisher-loc>: <publisher-name>Springer</publisher-name>, <fpage>21</fpage>. <pub-id pub-id-type="doi">10.1007/978-4-431-54276-6_2</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Windfeld</surname>
<given-names>E. S.</given-names>
</name>
<name>
<surname>Brooks</surname>
<given-names>M. S.-L.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Medical waste management &#x2013; a review</article-title>. <source>J. Environ. Manag.</source> <volume>163</volume>, <fpage>98</fpage>&#x2013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.1016/j.jenvman.2015.08.013</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xing</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Bakhshi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Chiu</surname>
<given-names>K.-C.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Designing a transferable predictive model for online learning using a bayesian updating approach</article-title>. <source>IEEE Trans. Learn. Technol.</source> <volume>14</volume>, <fpage>474</fpage>&#x2013;<lpage>485</lpage>. <pub-id pub-id-type="doi">10.1109/TLT.2021.3107349</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>