By Topic

Path planner for nonholonomic mobile robot with fast replanning procedure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
L. Podsedkowski ; Inst. of Machine Tools & Production Eng., Tech. Univ. Lodz, Poland

This paper presents a new method of the path planning for robots with nonholonomic constraints in a partially known workspace. The method has been discussed for the car like robot with the three dimensional configuration space. The algorithm of the presented method is based on a A* graph searching with nodes placed in discretised configuration space. The graph generation process is driven by a heuristic cost which is found with the aid of a cost propagation procedure. This accelerates the searching without losing the optimality. The method presented is equipped with procedures of fast path replanning which is especially important for cases with partially known workspaces

Published in:

Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on  (Volume:4 )

Date of Conference:

16-20 May 1998