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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 102
  • Download : 0
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.
Publisher
INST CONTROL ROBOTICS & SYSTEMS, KOREAN INST ELECTRICAL ENGINEERS
Issue Date
2019-10
Language
English
Article Type
Article
Citation

INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, v.17, no.10, pp.2624 - 2633

ISSN
1598-6446
DOI
10.1007/s12555-018-0531-x
URI
http://hdl.handle.net/10203/268041
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0