<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/13853">
    <title>Repository Community: null</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/13853</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/59962" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/58079" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/57931" />
        <rdf:li rdf:resource="https://scholar.dgist.ac.kr/handle/20.500.11750/57273" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-05T14:17:38Z</dc:date>
  </channel>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/59962">
    <title>Landing-Aware Multi-Drone Routing in Last-Mile Delivery Services</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/59962</link>
    <description>Title: Landing-Aware Multi-Drone Routing in Last-Mile Delivery Services
Author(s): Kwon, JiHyun; Chen, Yi-Ying; Lee, GaHyun; Lin, Chung-Wei; Kim, BaekGyu
Abstract: We propose a framework to compute the optimal routes for multi-drones to minimize the delivery time in the last-mile delivery service. We mainly focus on a notion of the landing exclusion zone that appears during the landing phase; an area around the drop-off site is blocked until a drop-off is completed. Such zones affect the delivery time as other drones need to detour or hover around the site unnecessarily. We formulate the Mixed-Integer Linear Programming (MILP) problem by explicitly modeling the landing phase. Then, we present the heuristic algorithm that iteratively solves a sequence of single-drone delivery problems according to the delivery priorities. A delivery priority is determined according to the spatiotemporal occupancy that quantifies the significance of the size of the landing exclusion zone and its blocking period. We designed the experiment for 48 urban delivery scenarios with varying density and distribution of delivery destinations, departure points, and order quantities. Our experiment results show that the heuristic computes the routes significantly faster than the original MILP, and the delivery time is 5% higher from the optimal solution (lower-bound), and 60% lower from the general requirement of a single package per round-trip (upper-bound).</description>
    <dc:date>2025-10-18T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/58079">
    <title>가상 도로 환경에서 비전기반 자율주행 소프트웨어 테스트를 위한 주변 객체 생성 장치 및 그 동작 방법</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/58079</link>
    <description>Title: 가상 도로 환경에서 비전기반 자율주행 소프트웨어 테스트를 위한 주변 객체 생성 장치 및 그 동작 방법
Author(s): 김백규
Abstract: 본 개시의 일 실시 예에 따른 전자 장치는 명령어들을 저장하는 메모리, 적어도 하나의 프로세서를 포함하고, 상기 적어도 하나의 프로세서는, 테스트 커버리지 기준에 도달할 때까지, 제약 조건에 기반하여 제1 지형의 도로 객체에 대하여 상기 도로 객체 주변에 배치되는 적어도 하나의 주변 객체를 반복 생성하여, 상기 도로 객체 및 복수 개의 주변 객체를 포함하는 가상 도로 환경을 생성하고, 상기 가상 도로 환경을 이용하여 비전 기반 자율주행 소프트웨어의 자율 주행에 관련된 하나 이상의 기능을 테스트할 수 있다.</description>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/57931">
    <title>Preliminary Design of Hybrid Simulation Framework for Workload Analysis in Automotive Edge Computing</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/57931</link>
    <description>Title: Preliminary Design of Hybrid Simulation Framework for Workload Analysis in Automotive Edge Computing
Author(s): Kwon, JiHyun; Park, SangEun; Chwa, Hoon Sung; Kwak, Jeongho; Choi, Ji-Woong; Kim, BaekGyu
Abstract: Many vehicular tasks shall be completed in a timely manner as they move. In automotive edge computing, a vehicle can offload such tasks to an edge server in proximity to process them faster than using the cloud computing model. However, such an edge server has limited communication coverage and relatively smaller computing power compared to the general cloud server, it is important to distribute the offloaded workloads appropriately. One needs to understand such workload patterns and quantitatively analyze them for such workload distribution. We propose a preliminary hybrid simulation framework that generates compute workloads via a combination of the virtual vehicular traffic and the physical edge-server platforms. © 2024 IEEE.</description>
    <dc:date>2024-10-15T15:00:00Z</dc:date>
  </item>
  <item rdf:about="https://scholar.dgist.ac.kr/handle/20.500.11750/57273">
    <title>Landing-Type Aware Multi-Drone Route Generation for Last-Mile Delivery Service</title>
    <link>https://scholar.dgist.ac.kr/handle/20.500.11750/57273</link>
    <description>Title: Landing-Type Aware Multi-Drone Route Generation for Last-Mile Delivery Service
Author(s): Kwon, JiHyun; Kim, BaekGyu; Chen, Yi-Ying; Lin, Chung-Wei
Abstract: We consider the problem of generating delivery routes for multiple drones in the last-mile delivery service. In particular, the landing type - how a parcel is to be dropped off from a drone - is explicitly modeled in terms of the landing area and the landing time, which was not considered in other drone delivery works. A Mixed Integer Linear Programming (MILP) problem is formulated to optimize the delivery route for each drone by minimizing the total delivery completion time. Our preliminary result shows that landing types affect the total delivery completion time significantly, even with a small number of drones. Therefore, it is necessary to explicitly consider the characteristics of landing types for more realistic delivery route generation of a large number of drones. © 2024 IEEE.</description>
    <dc:date>2024-05-12T15:00:00Z</dc:date>
  </item>
</rdf:RDF>

