45 research outputs found

    Optimizing Fuel-Constrained UAV-UGV Routes for Large Scale Coverage: Bilevel Planning in Heterogeneous Multi-Agent Systems

    Full text link
    Fast moving unmanned aerial vehicles (UAVs) are well suited for aerial surveillance, but are limited by their battery capacity. To increase their endurance UAVs can be refueled on slow moving unmanned ground vehicles (UGVs). The cooperative routing of UAV-UGV multi-agent system to survey vast regions within their speed and fuel constraints is a computationally challenging problem, but can be simplified with heuristics. Here we present multiple heuristics to enable feasible and sufficiently optimal solutions to the problem. Using the UAV fuel limits and the minimum set cover algorithm, the UGV refueling stops are determined. These refueling stops enable the allocation of mission points to the UAV and UGV. A standard traveling salesman formulation and a vehicle routing formulation with time windows, dropped visits, and capacity constraints is used to solve for the UGV and UAV route, respectively. Experimental validation on a small-scale testbed (http://tiny.cc/8or8vz) underscores the effectiveness of our multi-agent approach.Comment: The paper is submitted to MRS 202

    Two-Echelon Vehicle and UAV Routing for Post-Disaster Humanitarian Operations with Uncertain Demand

    Full text link
    Humanitarian logistics service providers have two major responsibilities immediately after a disaster: locating trapped people and routing aid to them. These difficult operations are further hindered by failures in the transportation and telecommunications networks, which are often rendered unusable by the disaster at hand. In this work, we propose two-echelon vehicle routing frameworks for performing these operations using aerial uncrewed autonomous vehicles (UAVs or drones) to address the issues associated with these failures. In our proposed frameworks, we assume that ground vehicles cannot reach the trapped population directly, but they can only transport drones from a depot to some intermediate locations. The drones launched from these locations serve to both identify demands for medical and other aids (e.g., epi-pens, medical supplies, dry food, water) and make deliveries to satisfy them. Specifically, we present two decision frameworks, in which the resulting optimization problem is formulated as a two-echelon vehicle routing problem. The first framework addresses the problem in two stages: providing telecommunications capabilities in the first stage and satisfying the resulting demands in the second. To that end, two types of drones are considered. Hotspot drones have the capability of providing cell phone and internet reception, and hence are used to capture demands. Delivery drones are subsequently employed to satisfy the observed demand. The second framework, on the other hand, addresses the problem as a stochastic emergency aid delivery problem, which uses a two-stage robust optimization model to handle demand uncertainty. To solve the resulting models, we propose efficient and novel solution approaches

    The Application of Drones in City Logistics Concepts

    Get PDF
    With the rise of city logistics (CL) problems in the last three decades, various methods, approaches, solutions, and initiatives were analyzed and proposed for making logistics in urban areas more sustainable. The most analyzed and promising solutions are those that take into account cooperation among logistics providers and consolidation of the flow of goods. Furthermore, technological innovations enable the implementation of modern vehicles/equipment in order to make CL solutions sustainable. For several years, drone-based delivery has attracted lots of attention in scientific research, but there is a serious gap in the literature regarding the application of drones in CL concepts. The goal of this paper is to analyze four CL concepts that differ in consolidation type, transformation degree of flow of goods (direct and indirect, multi-echelon flows), and the role of drones. Two of the analyzed concepts are novel, which is the main contribution of the paper. The performances of the analyzed concepts are compared to the performances of the traditional delivery model โ€“ using only trucks without prior flow consolidation. The results indicate that CL concepts which combine different consolidation models and drones in the last phase of the delivery could stand out as a sustainable CL solution

    A Tandem Drone-ground Vehicle for Accessing Isolated Locations for First Aid Emergency Response in Case of Disaster

    Get PDF
    The collapse of infrastructures is very often a complicating factor for the early emergency actuations after a disaster. A proper plan to better cover the needs of the affected people within the disaster area while maintaining life-saving relief operations is mandatory hence. In this paper, we use a drone for flying over a set of difficult-to-access locations for imaging issues to get information to build a risk assessment as the earliest stage of the emergency operations. While the drone provides the flexibility required to visit subsequently a sort of isolated locations, it needs a commando vehicle in ground for (i) monitoring the deployment of operations and (ii) being a recharging station where the drone gets fresh batteries. This work proposes a decision-making process to plan the mission, which is composed by the ground vehicle stopping points and the sequence of locations visited for each drone route. We propose a Genetic Algorithm (GA) which has proven to be helpful in finding good solutions in short computing times. We provide experimental analysis on the factors effecting the performance of the output solutions, around an illustrative test instance. Results show the applicability of these techniques for providing proper solutions to the studied problem

    Towards Autonomous and Safe Last-mile Deliveries with AI-augmented Self-driving Delivery Robots

    Full text link
    In addition to its crucial impact on customer satisfaction, last-mile delivery (LMD) is notorious for being the most time-consuming and costly stage of the shipping process. Pressing environmental concerns combined with the recent surge of e-commerce sales have sparked renewed interest in automation and electrification of last-mile logistics. To address the hurdles faced by existing robotic couriers, this paper introduces a customer-centric and safety-conscious LMD system for small urban communities based on AI-assisted autonomous delivery robots. The presented framework enables end-to-end automation and optimization of the logistic process while catering for real-world imposed operational uncertainties, clients' preferred time schedules, and safety of pedestrians. To this end, the integrated optimization component is modeled as a robust variant of the Cumulative Capacitated Vehicle Routing Problem with Time Windows, where routes are constructed under uncertain travel times with an objective to minimize the total latency of deliveries (i.e., the overall waiting time of customers, which can negatively affect their satisfaction). We demonstrate the proposed LMD system's utility through real-world trials in a university campus with a single robotic courier. Implementation aspects as well as the findings and practical insights gained from the deployment are discussed in detail. Lastly, we round up the contributions with numerical simulations to investigate the scalability of the developed mathematical formulation with respect to the number of robotic vehicles and customers

    ํŠธ๋Ÿญ์„ ์ด๋™ํ˜• ๋“œ๋ก  ๊ธฐ์ง€๋กœ ์‚ฌ์šฉํ•˜๋Š” ํ•œ์ •์šฉ๋Ÿ‰ ํŠธ๋Ÿญ-๋“œ๋ก  ๊ฒฝ๋กœ ๋ฐฐ์ • ๋ฌธ์ œ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(์„์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ๊ฑด์„คํ™˜๊ฒฝ๊ณตํ•™๋ถ€, 2022.2. ๊น€๋™๊ทœ.Drones initially received attention for military purposes as a collective term for unmanned aerial vehicles (UAVs), but recently, efforts to use them in logistics have been actively underway. If drones are put into places where low-weight and high-value items are currently difficult to deliver by existing delivery means, it will have the effect of greatly reducing costs. However, the disadvantages of drones in delivery are also clear. In order to improve the delivery capacity of drones, the size of drones must increase when drones are equipped with large-capacity batteries. This thesis introduced two methods and presented algorithms for each method among VRP-D. First of all, CVP-D is a method in which carriers such as trucks and ships with large capacity and slow speed carry robots and drones with small capacity. Next, in the CVRP-D, the vehicle and the drone move different paths simultaneously, and the drone can visit multiple nodes during one sortie. The two problems are problems in which restrictions are added to the vehicle route problem (VRP), known as the NP-hard problem. The algorithm presented in this study derived drone-truck routes for two problems within a reasonable time. In addition, sensitivity analysis was conducted to observe changes in the appropriate network structure for the introduction of drone delivery and the main parameters of the drone. In addition, the validity of the proposed algorithm was verified through comparison with the data used as a benchmark in previous studies. These research results will contribute to the creation of delivery routes quickly, considering the specification of a drone.๋“œ๋ก ์€ ๋ฌด์ธํ•ญ๊ณต๊ธฐ(UAV)์˜ ํ†ต์นญ์œผ๋กœ ์ดˆ๊ธฐ์—๋Š” ๊ตฐ์‚ฌ์  ๋ชฉ์ ์œผ๋กœ ์ฃผ๋ชฉ์„ ๋ฐ›์•˜์œผ๋‚˜ ์ตœ๊ทผ ๋ฌผ๋ฅ˜์—์„œ ์‚ฌ์šฉํ•˜๋ ค๋Š” ๋…ธ๋ ฅ์ด ์ ๊ทน์ ์œผ๋กœ ์ง„ํ–‰๋˜๊ณ  ์žˆ๋‹ค. ๋“œ๋ก ์ด ์ €์ค‘๋Ÿ‰-๊ณ ๊ฐ€์น˜ ๋ฌผํ’ˆ์„ ๋ฐฐ์†ก์—์„œ ํ˜„์žฌ ๊ธฐ์กด ๋ฐฐ์†ก์ˆ˜๋‹จ์— ์˜ํ•ด ๋ฐฐ์†ก์ด ์–ด๋ ค์šด ๊ณณ์— ํˆฌ์ž…์ด ๋œ๋‹ค๋ฉด ํฐ ๋น„์šฉ์ ˆ๊ฐ์˜ ํšจ๊ณผ๊ฐ€ ์žˆ์„ ๊ฒƒ์ด๋‹ค. ํ•˜์ง€๋งŒ ๋ฐฐ์†ก์— ์žˆ์–ด์„œ ๋“œ๋ก ์˜ ๋‹จ์ ๋„ ๋ช…ํ™•ํ•˜๋‹ค. ๋“œ๋ก ์˜ ๋ฐฐ์†ก๋Šฅ๋ ฅ์„ ํ–ฅ์ƒ์‹œํ‚ค๊ธฐ ์œ„ํ•ด์„œ๋Š” ๋“œ๋ก ์ด ๋Œ€์šฉ๋Ÿ‰ ๋ฐฐํ„ฐ๋ฆฌ๋ฅผ ํƒ‘์žฌํ•˜๋ฉด ๋“œ๋ก  ํฌ๊ธฐ๊ฐ€ ์ฆ๊ฐ€ํ•˜์—ฌ์•ผ ํ•œ๋‹ค. ์ด๋Ÿฌํ•œ ๋‹จ์ ์„ ๊ทน๋ณตํ•˜๊ธฐ ์œ„ํ•ด์„œ ๋“œ๋ก ๊ณผ ํŠธ๋Ÿญ์„ ๊ฒฐํ•ฉํ•˜์—ฌ ์šด์˜ํ•˜๋Š” ๋ฐฉ์‹์ด ์—ฐ๊ตฌ๋˜์–ด์™”๋‹ค. ์ด๋Ÿฌํ•œ ๋ฐฉ์‹ ์ค‘ ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๋‘ ๊ฐ€์ง€ ๋ฐฉ์‹์„ ์†Œ๊ฐœํ•˜๊ณ , ๊ฐ๊ฐ์˜ ๋ฐฉ์‹์— ๋Œ€ํ•œ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์‹œํ•˜์˜€๋‹ค. ๋จผ์ €, CVP-D๋Š” ์šฉ๋Ÿ‰์ด ํฌ๊ณ  ์†๋„๊ฐ€ ๋Š๋ฆฐ ํŠธ๋Ÿญ์ด๋‚˜ ๋ฐฐ ๋“ฑ์˜ ์บ๋ฆฌ์–ด๊ฐ€ ์šฉ๋Ÿ‰์ด ์ž‘์€ ๋กœ๋ด‡, ๋“œ๋ก  ๋“ฑ์„ ์‹ฃ๊ณ  ๋‹ค๋‹ˆ๋ฉด์„œ ๋ฐฐ์†ก์„ ํ•˜๋Š” ๋ฐฉ์‹์ด๋‹ค. ๋‹ค์Œ์œผ๋กœ, CVRP-D๋Š” ์ฐจ๋Ÿ‰๊ณผ ๋“œ๋ก ์ด ๋™์‹œ์— ๊ฐ๊ธฐ ๋‹ค๋ฅธ ๊ฒฝ๋กœ๋ฅผ ์ด๋™ํ•˜๋ฉฐ, ๋“œ๋ก ์€ 1ํšŒ ๋น„ํ–‰(sortie)์‹œ ๋‹ค์ˆ˜์˜ ๋…ธ๋“œ๋ฅผ ๋ฐฉ๋ฌธํ•˜๋Š” ๊ฒƒ์ด ๊ฐ€๋Šฅํ•˜๋‹ค. ๋‘ ๋ฌธ์ œ๋Š” ์ฐจ๋Ÿ‰๊ฒฝ๋กœ๋ฌธ์ œ(VRP)์— ์ œ์•ฝ์ด ๋”ํ•ด์ง„ ๋ฌธ์ œ์ด๋‹ค. VRP๋Š” ๋Œ€ํ‘œ์ ์ธ NP-hard ๋ฌธ์ œ๋กœ ํ•ด๋ฅผ ๊ตฌํ•˜๊ธฐ ์œ„ํ•ด์„œ ํœด๋ฆฌ์Šคํ‹ฑ ์•Œ๊ณ ๋ฆฌ์ฆ˜์ด ์š”๊ตฌ๋œ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ ์ œ์‹œํ•˜๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ ํ•ฉ๋ฆฌ์ ์ธ ์‹œ๊ฐ„ ๋‚ด ๋‘๋ฌธ์ œ์˜ ๋“œ๋ก -ํŠธ๋Ÿญ ๊ฒฝ๋กœ๋ฅผ ๋„์ถœํ•˜์˜€๋‹ค. ๋˜ํ•œ ๋ฏผ๊ฐ๋„ ๋ถ„์„์„ ์‹ค์‹œํ•˜์—ฌ ๋“œ๋ก  ๋ฐฐ์†ก ๋„์ž…์„ ์œ„ํ•œ ์ ์ ˆํ•œ ๋„คํŠธ์›Œํฌ ๊ตฌ์กฐ ๋ฐ ๋“œ๋ก ์˜ ์ฃผ์š” ํŒŒ๋ผ๋ฏธํ„ฐ์— ๋ณ€ํ™”์— ๋”ฐ๋ฅธ ๋ณ€ํ™”๋ฅผ ๊ด€์ฐฐํ•˜์˜€๋‹ค. ์ด๋Š” ์ฐจํ›„ ๋“œ๋ก ์˜ ์„ฑ๋Šฅ์— ๊ด€ํ•œ ์˜์‚ฌ๊ฒฐ์ • ์‹œ ๊ณ ๋ คํ•ด์•ผ ํ•  ์š”์†Œ๋“ค์— ๋Œ€ํ•œ ๊ธฐ์ค€์ด ๋  ์ˆ˜ ์žˆ์„ ๊ฒƒ์œผ๋กœ ๊ธฐ๋Œ€๋œ๋‹ค. ๋˜ํ•œ ์„ ํ–‰์—ฐ๊ตฌ์—์„œ ๋ฒค์น˜๋งˆํฌ๋กœ ์‚ฌ์šฉ๋˜๋Š” ๋ฐ์ดํ„ฐ์™€์˜ ๋น„๊ต๋ฅผ ํ†ตํ•ด ์ œ์•ˆํ•˜๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ํƒ€๋‹น์„ฑ์„ ๊ฒ€์ฆํ•˜์˜€๋‹ค. ๋ณธ ์—ฐ๊ตฌ๋Š” ๋“œ๋ก  ๋„์ž…์ด ๋ฐฐ์†ก์‹œ๊ฐ„์„ ๊ฐ์†Œ์‹œํ‚ค๋ฉฐ, ์šด์˜๋ฐฉ๋ฒ•์— ๋”ฐ๋ผ์„œ ๋ฐฐ์†ก์‹œ๊ฐ„์˜ ์ฐจ์ด๊ฐ€ ๋ฐœ์ƒํ•จ์„ ๋ณด์˜€๋‹ค. ์ด๋Ÿฌํ•œ ์—ฐ๊ตฌ ์„ฑ๊ณผ๋Š” ๋“œ๋ก  ๋ฐฐ์†ก ์‹œ ํ™˜๊ฒฝ๊ณผ ๊ธฐ๊ณ„์  ์„ฑ๋Šฅ์„ ๊ณ ๋ คํ•œ ๋ฐฐ์†ก ๊ฒฝ๋กœ๋ฅผ ๋‹จ์‹œ๊ฐ„๋‚ด ์ƒ์„ฑํ•˜์—ฌ ์ƒ์—…์ ์œผ๋กœ ์ด์šฉ๊ฐ€๋Šฅ ํ•  ๊ฒƒ์ด๋‹ค.Chapter 1. Introduction 1 1.1 Research Background 1 1.2 Research Purpose 3 1.3 Contribution of Research 4 Chapter 2. Literature review 5 2.1 Vehicle Routing Problems with Drone 5 2.2 Carrier Vehicle Problem with Drone(CVP-D) 10 2.3 Capacitated VRP with Drone(CVRP-D) 12 Chapter 3. Mathematical Formulation 14 3.1 Terminology 14 3.2 CVP-D Formulation 15 3.3 CVRP-D Formulation 19 Chapter 4. Proposed Algorithms 23 4.1 Heuristic Algorithm 23 4.1.1 Knapsack Problem 23 4.1.2 Parallel Machine Scheduling (PMS) 25 4.1.3 Set Covering Location Problem (SCLP) 27 4.1.4 Guided Local Search (GLS) Algorithm 28 4.1.5 Genetic Algorithm (GA) 29 4.2 Proposed Heuristic Algorithm : GA-CVPD 30 4.3 Proposed Heuristic Algorithm : GA-CVRPD 33 Chapter 5. Numerical Analysis 36 5.1 Data Description 36 5.2 Numerical experiment 37 5.3 Sensitivity analysis 39 5.3.1 Analysis on GA-CVPD 39 5.3.2 Analysis on GA-CVRPD 42 5.3.3 Result on different Instances 45 Chapter 6. Conclusion 48 Bibliography 50 Abstract in Korean 53 4.1.5 Genetic Algorithm (GA) 29 4.2 Proposed Heuristic Algorithm : GA-CVPD 30 4.3 Proposed Heuristic Algorithm : GA-CVRPD 33 Chapter 5. Numerical Analysis 36 5.1 Data Description 36 5.2 Numerical experiment 37 5.3 Sensitivity analysis 42 5.3.1 Analysis on GA-CVPD 39 5.3.2 Analysis on GA-CVRPD 42 5.3.3 Result on different Instances 45 Chapter 6. Conclusion 48 Bibliography 50 Abstract in Korean 53์„

    Congestion based Truck Drone intermodal delivery optimization

    Get PDF
    Commerce companies have experienced a rise in the number of parcels that need to be delivered each day. The goal of this study is to provide a decision-making procedure to assist carriers in taking a more significant role in selecting cost and risk-efficient truck-drone intermodal delivery routing plan. The congestion-based model is developed to select the method of parcel delivery utilizing a truck and a drone for optimizing cost and time. A study also has been conducted to compare drone-only and truck-only delivery routing plan. The proposed A* Heuristic algorithm and the OSRM application generate the travel path for drone and a truck along with the time of travel. Case studies have been conducted by varying the weight provided to cost and risk variable, studies indicate that there is a significant change in drone delivery travel time and cost with increase of cost weightage
    corecore