Global Trajectory Planning Based on DWMR Dynamics in Circular C-space

This paper proposes an efficient near time-optimal trajectory planning algorithm for differential wheeled mobile robots(DWMRs) in a circular C-space under constraints on robot’s kinematics, dynamics, and motor’s voltage. This problem is considered to be complex if there exist lots of obstacles to pa...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of control, automation, and systems Vol. 17; no. 10; pp. 2624 - 2633
Main Authors Kim, Yunjeong, Kim, Byung Kook
Format Journal Article
LanguageEnglish
Published Bucheon / Seoul Institute of Control, Robotics and Systems and The Korean Institute of Electrical Engineers 01.10.2019
Springer Nature B.V
제어·로봇·시스템학회
Subjects
Online AccessGet full text
ISSN1598-6446
2005-4092
DOI10.1007/s12555-018-0531-x

Cover

More Information
Summary:This paper proposes an efficient near time-optimal trajectory planning algorithm for differential wheeled mobile robots(DWMRs) in a circular C-space under constraints on robot’s kinematics, dynamics, and motor’s voltage. This problem is considered to be complex if there exist lots of obstacles to pass and robot’s dynamics including motor’s dynamics should be considered. A* algorithm is incorporated into the modified TOTP (Time Optimal Trajectory Planning) algorithm [1] to find near minimum time trajectory without any homotopy class by defining a node as an obstacle with direction information. In addition, TOTP algorithm is improved so that the proposed algorithm can be applied to the environment without any assumption about the distance between obstacles. Simulations show that the proposed algorithm is applied in an environment where multiple obstacles exist. An experiment shows that the generated trajectory by the proposed algorithm is well followed by the robot.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
http://link.springer.com/article/10.1007/s12555-018-0531-x
ISSN:1598-6446
2005-4092
DOI:10.1007/s12555-018-0531-x