A Study on Hamiltonian Cycle-Based Path Planning for Multiple Robot-Single Station Docking Problem
Nowadays, robotic technologies are widely used for logistics by the increase of user demands on fast and accurate delivery Amazon’s logistics management system based on KIVA robot system is one of the most representative and innovative cases for robotic application in logistics.
Like other robotic applications, path planning of KIVA robot system also have been developed based on A*-like algorithm which is one of the most efficient ways for single robot path planning. But, A*-like algorithm is not optimally efficient for the case of KIVA-like multiple robot station
docking problem. Therefore, a novel Hamiltonian cycle-based path planning algorithm has been proposed to solve multiple robot-single station docking problem.
Keywords: Hamiltonian Cycle; Multiple Robot-Single Station Docking; Path Planning
Document Type: Research Article
Affiliations: Department of Computer Science and Engineering, Dongguk University, Seoul, Korea
Publication date: 01 November 2016
- ADVANCED SCIENCE LETTERS is an international peer-reviewed journal with a very wide-ranging coverage, consolidates research activities in all areas of (1) Physical Sciences, (2) Biological Sciences, (3) Mathematical Sciences, (4) Engineering, (5) Computer and Information Sciences, and (6) Geosciences to publish original short communications, full research papers and timely brief (mini) reviews with authors photo and biography encompassing the basic and applied research and current developments in educational aspects of these scientific areas.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content