Path planning algorithm for a mobile robot*

Kuo-Chin Fan; Po-Chang Lui

doi:10.1117/12.45454

1 March 1991 Path planning algorithm for a mobile robot*

Kuo-Chin Fan, Po-Chang Lui

Proceedings Volume 1468, Applications of Artificial Intelligence IX; (1991) https://doi.org/10.1117/12.45454
Event: Orlando '91, 1991, Orlando, FL, United States

Abstract

The task of path planning in mapped environments is well-known in robotics. Given an object and a set of obstacles located in space, the problem is to find a shortest path for the object from the initial position to the goal position which avoids collisions with obstacles along the way. In this paper, we will present a path planning algorithm to solve the find-path problem. The advantages of this algorithm are that it is quite fast and it finds the shortest path which avoids obstacles generously rather than avoiding them barely.

Citation Download Citation

Kuo-Chin Fan and Po-Chang Lui "Path planning algorithm for a mobile robot*", Proc. SPIE 1468, Applications of Artificial Intelligence IX, (1 March 1991); https://doi.org/10.1117/12.45454

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available