Browse > Article
http://dx.doi.org/10.9708/jksci.2021.26.03.111

Optimal Solution Algorithm for Delivery Problem on Graphs  

Lee, Kwang-Eui (Dept. of Applied Software Engineering, Dong-eui University)
Publication Information
Journal of the Korea Society of Computer and Information / v.26, no.3, 2021 , pp. 111-117 More about this Journal
Abstract
The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with m vertices using n various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of O(㎥n) and O(㎥). After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our O(㎥) algorithm actually has a time complexity of O(㎡n) as only one preprocessing is required for the various deployment of n robot agents.
Keywords
Delivery problem; Path planning; Graph; Robot agent; handover;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 KwangEui Lee and JiHong Kim, "Genetic Algorithm for Delivery Problem," IJCSNS, V9, N2, pp. 248-251, February 2009.
2 Motion planning, http://en.wikipedia.org/wiki/Motion_planning.
3 S. M. Lavalle, "Planning Algorithms," Cambridge University Press, 2006.
4 Hyungil Kim, "Path Planning for Cleaning Robots Using Virtual Map," Journal of The Korea Society of Computer and Information, V14, N11, pp. 31-40, November 2009.
5 D.K. Liu, D. Wang, G. Dissanayake, "A force field method based multi-robot collaboration," Proc. IEEE Int. Conf. on Robotics, Automation and Mechatronics, Bangkok, Thailand, pp. 662-667, June 2006.
6 Y. Guo, L.E. Parker, "A distributed and optimal motion planning approach for multiple mobile robots," IEEE Int. Conf. on Robotics Automation, pp. 2612-2619, May 2002.
7 K. Azarm and G. Schmidt, "Conflict-Free Motion of Multiple Mobile Robots Based on Decentralized Motion Planning and Negotiation," IEEE Int. Conf. on Robotics and Automation, pp 3526-3533, vol. 4, April 1997.
8 Kyeonah Yu and Su-Jin Cho, "Path-Planning for Group Movement in Dynamic Environments," Journal of The Korea Society of Computer and Information, V18, N2, pp. 117-126, February 2013.   DOI
9 K. Rajchandara, Dr. R. Baskaranb, Mr. K. Padmanabhan Panchuc, "Multiple Robot Path Planning Algorithms for Static Environment and Dynamic Environment: A Review," International Journal of Pure and Applied Mathematics, V119, N10, pp. 1273-1290, 2018.
10 KwangEui Lee, "Near Optimal Algorithm for Delivery Problem," IJCSNS, V11, N12, pp. 25-28, December 2011.
11 KwangEui Lee, "Optimal Solution Algorithm for Delivery Problem on trees," Journal of The Korea Society of Computer and Information, Vol. 19, No. 2, pp 143-150, Feb. 2014.   DOI
12 R. Neapolitan and K. Naimipour, "Foundations of Algorithms Using C++ Pseudocode, 3rd Ed.," Addison Wesley, 2003.