Home /Research /Real-Time Deadlock-Free Navigation for Multiple Mobile Robots
OTHER

Real-Time Deadlock-Free Navigation for Multiple Mobile Robots

Harunori Gakuhari, Songmin Jia, Kunikatsu Takase, Yoshiro Hada

Year
2007
Citations
5

Abstract

This paper proposes a practicable navigation method for multiple mobile robots in a realistic environment. In the past, many navigation methods have been developed, however, they were often limited to a single robot or sometimes assumed robots with special mobility such as holonomic ones. From the viewpoint of practical applications it is indispensable that the number of robots is arbitrary, general shape and mobility of them are allowed. In this study, a deadlock-free navigation for non-holonomic mobile robots in a practical environment is given. In the proposed scheme, states of the environment and robots are feedback in real-time and global path planning is cyclically executed. It enables an adaptation to a changing environment and a reliable deadlock-free navigation of multiple robots. The real-time online path planning is performed by an efficient A* search in Configuration Spaces representing the robots and environment. The proposed method is tested by several simulations which represent typical complicated navigation situations. As a result, the effectiveness of the methods is verified.

Keywords

Mobile robotRobotDeadlockHolonomicComputer scienceMotion planningPath (computing)Distributed computingScheme (mathematics)Real-time computing

Related papers

Browse all OTHER papers