한국컴퓨터정보학회논문지 (Journal of the Korea Society of Computer and Information)

  • 제26권3호
  • /
  • Pages.111-117
  • /
  • 2021
  • /
  • 1598-849X(pISSN)
  • /
  • 2383-9945(eISSN)
한국컴퓨터정보학회 (Korean Society of Computer Information)
권호 표지
DOI QR코드

DOI QR Code

Optimal Solution Algorithm for Delivery Problem on Graphs

  • Lee, Kwang-Eui (Dept. of Applied Software Engineering, Dong-eui University)
  • 투고 : 2021.01.14
  • 심사 : 2021.02.09
  • 발행 : 2021.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

그래프에서의 배달문제는 m개의 정점으로 구성된 그래프에서 n개의 서로 다른 속도를 갖는 로봇 에이전트들을 이용하여 배달물을 그래프의 한 노드에서 다른 노드로 배달하는 최소 배달순서를 구하는 문제이다. 본 논문에서는 그래프에서의 배달문제에 대하여 최적해를 계산하는 O(㎥n)과 O(㎥)시간복잡도를 갖는 두 개의 알고리즘을 제안한다. 알고리즘은 그래프의 모든 쌍에 대한 최단경로를 구하는 전처리를 한 후, 최소배달시간이 작은 정점의 순으로 최단배달경로를 구하는 방법으로 개발하였다. 이 문제에서 그래프가 문제를 해결하고자 하는 지형을 반영하고 있다고 하면, 다양한 로봇 에이전트의 배치에 대하여 전처리를 1회만 실행되면 되므로 O(㎥) 알고리즘은 실제로 O(㎡n)의 시간복잡도를 갖는다고 할 수 있다.

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.

키워드

참고문헌

  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. https://doi.org/10.9708/jksci.2013.18.2.117
  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. https://doi.org/10.9708/jksci.2014.19.2.143
  12. R. Neapolitan and K. Naimipour, "Foundations of Algorithms Using C++ Pseudocode, 3rd Ed.," Addison Wesley, 2003.