Live
- World Chess Championship: Gukesh back on level terms as Ding Liren loses on time in third game
- Haryana preparing blueprint for 100 sq yard plots for two lakh low-income people: Minister
- Bihar: Over 13,000 residents of Samastipur to get house under PM Awas Yojana
- Champions Trophy 2025 likely to move out of Pak due to political unrest, PCB may agree to hybrid model: Sources
- Return to ballot paper voting: Maharashtra Congress to launch mass signature drive
- Rajasthan: Farmers block Jodhpur-Barmer highway demanding Jawai Dam water share
- Decisions on CM & Cabinet to be cordial, swearing-in likely on Nov 30 or Dec 1: Ajit Pawar
- Union Minister Gajendra Shekhawat inaugurates 4-day International Tourism Mart in Assam's Kaziranga
- Why buy personal accident coverage when you have term insurance?
- Term Insurance: A Comprehensive Guide to Affordable Life Coverage
Drone Delivery!
When delivery companies like FedEx, Amazon and UPS launch drones to deliver packages in the near future, one Kennesaw State computer science professor may be at the crux of solving one of its most complicated problems.
When delivery companies like FedEx, Amazon and UPS launch drones to deliver packages in the near future, one Kennesaw State computer science professor may be at the crux of solving one of its most complicated problems. Donghyun (David) Kim, assistant professor of computer science and an expert in computer algorithm optimization, is designing a fast-running algorithm to tackle simultaneous coordination problems among multiple delivery trucks and the drones launched from them.
Kim’s study involves multiple robotic drone trajectory planning to figure out how best to distribute a given set of packages, by drone and truck, as they move concurrently. These trajectories have to be optimized simultaneously to avoid overlapping the delivery paths of multiple trucks and drones, according to Kim.
The problem becomes extremely complicated when trying to consider which truck should deliver which package by drone, and how that drone will return to a moving vehicle, he added.“A simplified form of this problem can be easily proven to be NP-hard. This means that when the input size of the problem is too big, it is unlikely to find an optimal solution within a practical time even using a state-of-the-art computer,” Kim said.
The development of his approximation algorithm, which is a simplified technical term to describe a sub-optimal fast-running algorithm with a mathematically proven worst-case performance guarantee, will help courier companies coordinate their efforts and save both time and money when operating multiple drone-assisted truck delivery systems.“This research aims to develop a travel plan for multiple drones to perform a given surveillance task with minimum delay,” Kim said. “Drone technology is shaped by computer science in every aspect.”
Kim is using mathematical models within computer science and mathematics to find a solution, an offshoot of the traveling salesman problem, or TSP, a well-known computational issue related to vehicle routing issues. Kim presented his first result of this kind of complex problem with drones at IEEE INFOCOM, the nation’s premier computer communications conference, in 2012.
