Dynamical path-planning algorithm of a mobile robot: Local minima problem and nonstationary environments

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 457
  • Download : 63
A dynamical local path-planning algorithm of an autonomous mobile robot available for moving obstacle avoidance as well as stationary obstacle avoidance using artificial pressure and nonlinear friction is described. The dynamical path-planning algorithm is considered to adequately accommodate the mobile robot to a dynamic situation of a path-planning nature. Artificial pressure is just a conceptual idea and a mimicry of the real physical pressure. It can be thought of as a density gradient in the neighborhood of the mobile robot. Together with the previous virtual force field (VFF) method, the path of the mobile robot is a solution of a path-planning equation. Local minima problems in stationary environments are solved by introducing nonlinear friction into the chaotic neuron. Due to the nonlinear friction, the proposed path-planner reveals chaotic dynamics in some parameter regions. This new path-planner is feasible in guiding, on real-time, the mobile robot to avoid stationary obstacles and reach the goal. Computer simulations are presented to show the effectiveness of the proposed algorithm.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1996-02
Language
English
Article Type
Article
Keywords

TIME OBSTACLE AVOIDANCE; CONFIGURATION-SPACE; NAVIGATION

Citation

MECHATRONICS, v.6, no.1, pp.81 - 100

ISSN
0957-4158
URI
http://hdl.handle.net/10203/8265
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0